/dports/science/nest/nest-simulator-3.1/doc/userdoc/ |
H A D | download.rst | 63 <a href="https://nest-simulator.org/downloads/gplreleases/lubuntu-18.04_nest- 69 …ive Media 2.20.0 <https://nest-simulator.org/downloads/gplreleases/lubuntu-18.04_nest-2.20.0.ova>`_ 77 `NEST Live Media 2.18.0 <https://nest-simulator.org/downloads/gplreleases/lubuntu-18.04_nest-2.18.0… 79 `Checksum 2.18.0 <https://nest-simulator.org/downloads/gplreleases/lubuntu-18.04_nest-2.18.0.ova.sh… 81 `NEST Live Media 2.16.0 <https://nest-simulator.org/downloads/gplreleases/lubuntu-18.04_nest-2.16.0… 83 `Checksum 2.16.0 <https://nest-simulator.org/downloads/gplreleases/lubuntu-18.04_nest-2.16.0.ova.sh…
|
/dports/devel/p5-Filesys-Notify-KQueue/Filesys-Notify-KQueue-0.11/ |
H A D | MANIFEST | 11 t/02_nest.t
|
H A D | Changes | 29 - add test "02_nest.t"
|
/dports/devel/p5-Test-TCP/Test-TCP-2.22/ |
H A D | MANIFEST | 16 t/06_nest.t
|
/dports/devel/p5-Test-SharedFork/Test-SharedFork-0.35/ |
H A D | MANIFEST | 18 t/05_nest.t
|
/dports/www/p5-HTML-TagParser/HTML-TagParser-0.20/ |
H A D | MANIFEST | 15 t/08_nest.t
|
/dports/devel/py-pydocstyle/pydocstyle-6.1.1/src/pydocstyle/ |
H A D | parser.py | 152 _nest = staticmethod(lambda s: {'def': Function, 'class': Class}[s]) variable in Module 201 _nest = staticmethod( variable in Function 283 _nest = staticmethod(lambda s: {'def': Method, 'class': NestedClass}[s]) variable in Class 543 yield self.parse_definition(class_._nest(self.current.value))
|
/dports/textproc/p5-XML-Compile/XML-Compile-1.63/lib/XML/Compile/ |
H A D | Translate.pm | 242 delete $self->{_nest}; # reset recursion administration 631 if(exists $self->{_nest}{$nodeid}) 632 { my $outer = \$self->{_nest}{$nodeid}; 641 $self->{_nest}{$nodeid} = undef; 768 $self->{_nest}{$nodeid} = $do; 769 delete $self->{_nest}{$nodeid}; # clean the outer definition
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 315 outer_ilt->_nest = loop->_nest; in create_outer_strip_mined_loop() 318 loop->_nest++; in create_outer_strip_mined_loop() 319 assert(loop->_nest <= SHRT_MAX, "sanity"); in create_outer_strip_mined_loop() 1788 while( l->_nest > _nest ) l = l->_parent; in is_member() 1796 _nest = depth; in set_nest() 2060 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 2507 for (uint i=0; i<_nest; i++) in dump_head() 4253 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 4393 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post() 4636 for( uint x = 0; x < loop->_nest; x++ ) in dump() [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 315 outer_ilt->_nest = loop->_nest; in create_outer_strip_mined_loop() 318 loop->_nest++; in create_outer_strip_mined_loop() 319 assert(loop->_nest <= SHRT_MAX, "sanity"); in create_outer_strip_mined_loop() 1788 while( l->_nest > _nest ) l = l->_parent; in is_member() 1796 _nest = depth; in set_nest() 2060 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 2507 for (uint i=0; i<_nest; i++) in dump_head() 4253 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 4393 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post() 4636 for( uint x = 0; x < loop->_nest; x++ ) in dump() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 307 outer_ilt->_nest = loop->_nest; in create_outer_strip_mined_loop() 310 loop->_nest++; in create_outer_strip_mined_loop() 1741 while( l->_nest > _nest ) l = l->_parent; in is_member() 1748 _nest = depth; in set_nest() 2012 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 2511 for (uint i = 0; i < _nest; i++) { in dump_head() 4219 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 4358 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post_work() 4536 for( uint x = 0; x < loop->_nest; x++ ) in dump() 4568 for( uint j = 0; j < loop->_nest; j++ ) in dump()
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 311 outer_ilt->_nest = loop->_nest; in create_outer_strip_mined_loop() 314 loop->_nest++; in create_outer_strip_mined_loop() 1740 while( l->_nest > _nest ) l = l->_parent; in is_member() 1747 _nest = depth; in set_nest() 2011 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 2450 for (uint i=0; i<_nest; i++) in dump_head() 4160 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 4301 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post_work() 4479 for( uint x = 0; x < loop->_nest; x++ ) in dump() 4511 for( uint j = 0; j < loop->_nest; j++ ) in dump()
|
H A D | loopnode.hpp | 473 uint8_t _nest; // Nesting depth member in IdealLoopTree 488 _nest(0), _irreducible(0), _has_call(0), _has_sfpt(0), _rce_candidate(0), in IdealLoopTree()
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 281 outer_ilt->_nest = loop->_nest; in insert_outer_loop() 284 loop->_nest++; in insert_outer_loop() 1876 while( l->_nest > _nest ) l = l->_parent; in is_member() 1883 _nest = depth; in set_nest() 2147 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 2679 tty->sp(2 * _nest); in dump_head() 4426 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 4562 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post_work() 4741 tty->sp(2 * loop->_nest); in dump() 4772 tty->sp(2 * loop->_nest + 1); in dump()
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 307 outer_ilt->_nest = loop->_nest; in create_outer_strip_mined_loop() 310 loop->_nest++; in create_outer_strip_mined_loop() 1741 while( l->_nest > _nest ) l = l->_parent; in is_member() 1748 _nest = depth; in set_nest() 2012 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 2536 tty->sp(2 * _nest); in dump_head() 4239 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 4375 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post_work() 4554 tty->sp(2 * loop->_nest); in dump() 4585 tty->sp(2 * loop->_nest + 1); in dump()
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/d/dmd/ |
H A D | template.h | 274 …unsigned short _nest; // for recursive pretty printing detection, 3 MSBs reserved f…
|
H A D | dtemplate.d | 5811 semantictiargsdone = 1u << (_nest.sizeof * 8 - 1), // MSB of _nest 5819 ushort nest() const { return _nest & Flag.available; } in nest() 5820 void nestUp() { assert(nest() < Flag.available); ++_nest; } in nestUp() 5821 void nestDown() { assert(nest() > 0); --_nest; } in nestDown() 5826 if (x) _nest |= Flag.semantictiargsdone; in semantictiargsdone() 5827 else _nest &= ~Flag.semantictiargsdone; in semantictiargsdone() 5833 if (x) _nest |= Flag.havetempdecl; in havetempdecl() 5834 else _nest &= ~Flag.havetempdecl; in havetempdecl() 5837 bool gagged() const { return (_nest & Flag.gagged) != 0; } in gagged() 5840 if (x) _nest |= Flag.gagged; in gagged() [all …]
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/ |
H A D | loopnode.cpp | 1192 while( l->_nest > _nest ) l = l->_parent; in is_member() 1199 _nest = depth; in set_nest() 1462 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 1905 for (uint i=0; i<_nest; i++) in dump_head() 3626 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post() 3781 for( uint x = 0; x < loop->_nest; x++ ) in dump() 3813 for( uint j = 0; j < loop->_nest; j++ ) in dump()
|
H A D | loopnode.hpp | 353 uint8 _nest; // Nesting depth member in IdealLoopTree 370 _nest(0), _irreducible(0), _has_call(0), _has_sfpt(0), _rce_candidate(0) in IdealLoopTree()
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/ |
H A D | loopnode.cpp | 1192 while( l->_nest > _nest ) l = l->_parent; in is_member() 1199 _nest = depth; in set_nest() 1462 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 1905 for (uint i=0; i<_nest; i++) in dump_head() 3626 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post() 3781 for( uint x = 0; x < loop->_nest; x++ ) in dump() 3813 for( uint j = 0; j < loop->_nest; j++ ) in dump()
|
H A D | loopnode.hpp | 353 uint8 _nest; // Nesting depth member in IdealLoopTree 370 _nest(0), _irreducible(0), _has_call(0), _has_sfpt(0), _rce_candidate(0) in IdealLoopTree()
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 290 outer_ilt->_nest = loop->_nest; in insert_outer_loop() 293 loop->_nest++; in insert_outer_loop() 294 assert(loop->_nest <= SHRT_MAX, "sanity"); in insert_outer_loop() 2611 while( l->_nest > _nest ) l = l->_parent; in is_member() 2619 _nest = depth; in set_nest() 2883 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 3420 tty->sp(2 * _nest); in dump_head() 5202 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 5338 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post_work() 5581 tty->sp(2 * loop->_nest); in dump() [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/opto/ |
H A D | loopnode.cpp | 290 outer_ilt->_nest = loop->_nest; in insert_outer_loop() 293 loop->_nest++; in insert_outer_loop() 294 assert(loop->_nest <= SHRT_MAX, "sanity"); in insert_outer_loop() 2599 while( l->_nest > _nest ) l = l->_parent; in is_member() 2607 _nest = depth; in set_nest() 2871 ilt->_nest = _nest; // Same nesting depth (for now) in merge_many_backedges() 3408 tty->sp(2 * _nest); in dump_head() 5213 if (get_loop(least)->_nest == 0) { in verify_strip_mined_scheduling() 5349 if( get_loop(legal)->_nest < get_loop(least)->_nest ) in build_loop_late_post_work() 5592 tty->sp(2 * loop->_nest); in dump() [all …]
|
/dports/science/healpix/Healpix_3.50/src/healpy/healpy/ |
H A D | zoomtool.py | 350 self._nest = nest 544 nest=self._nest,
|
/dports/science/healpix/Healpix_3.50/doc/html/ |
H A D | sub_images.tex | 94 \item[\htmlref{dist2holes\_nest}{sub:dist2holes_nest}] angular distance to 96 \item[\htmlref{fill\_holes\_nest}{sub:fill_holes_nest}] turn to {\em valid} all 98 \item[\htmlref{maskborder\_nest}{sub:maskborder_nest}] identify inner 100 \item[\htmlref{size\_holes\_nest}{sub:size_holes_nest}] returns size (in
|