/dports/www/firefox-esr/firefox-91.8.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/net-im/tg_owt/tg_owt-d578c76/src/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/multimedia/libvpx/libvpx-1.11.0/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/www/firefox/firefox-99.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_partition_models.h | 246 #define NODES 16 macro 304 NODES, 373 NODES, 384 #undef NODES 460 NODES, 473 #undef NODES 779 NODES, 829 NODES, 879 NODES, 929 NODES, [all …]
|
/dports/net-mgmt/phpweathermap/weathermap/random-bits/ |
H A D | suite-2.conf | 124 NODES Centre:N North:S 128 NODES Centre:E East:W 132 NODES Centre:S South:N 136 NODES Centre:W West:E 140 NODES Centre:NW NorthWest:SE 163 NODES NorthWest node20 169 NODES East:N East:S 184 NODES South:SW West:SW 191 NODES node100:W node101:W 196 NODES node100:E node101:E [all …]
|
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo5sec/tc-graph-color/dznFolder/ |
H A D | tcgc2.mzn | 25 set of int: NODES = 1..nbV; 28 array [EDGES] of NODES: heads; 29 array [EDGES] of NODES: tails; 31 array [NODES] of int: init; 32 array [NODES] of int: end; 41 predicate valid_coloring(array [NODES] of var COLORS: coloring, array [EDGES] of NODES: xs, array [… 45 array [STEPS,NODES] of var COLORS: a; 46 constraint forall(n in NODES) (a[1,n] = init[n]); 47 constraint forall(n in NODES) (a[s,n] = end[n]); 57 int_search([a[s,n] | s in STEPS, n in NODES],input_order,indomain_min,complete) [all …]
|
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo30sec/tc-graph-color/dznFolder/ |
H A D | tcgc2.mzn | 25 set of int: NODES = 1..nbV; 28 array [EDGES] of NODES: heads; 29 array [EDGES] of NODES: tails; 31 array [NODES] of int: init; 32 array [NODES] of int: end; 41 predicate valid_coloring(array [NODES] of var COLORS: coloring, array [EDGES] of NODES: xs, array [… 45 array [STEPS,NODES] of var COLORS: a; 46 constraint forall(n in NODES) (a[1,n] = init[n]); 47 constraint forall(n in NODES) (a[s,n] = end[n]); 57 int_search([a[s,n] | s in STEPS, n in NODES],input_order,indomain_min,complete) [all …]
|
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo5min/tc-graph-color/dznFolder/ |
H A D | tcgc2.mzn | 25 set of int: NODES = 1..nbV; 28 array [EDGES] of NODES: heads; 29 array [EDGES] of NODES: tails; 31 array [NODES] of int: init; 32 array [NODES] of int: end; 41 predicate valid_coloring(array [NODES] of var COLORS: coloring, array [EDGES] of NODES: xs, array [… 45 array [STEPS,NODES] of var COLORS: a; 46 constraint forall(n in NODES) (a[1,n] = init[n]); 47 constraint forall(n in NODES) (a[s,n] = end[n]); 57 int_search([a[s,n] | s in STEPS, n in NODES],input_order,indomain_min,complete) [all …]
|
/dports/math/jacop/jacop-4.8.0/src/test/fz/above10min/tc-graph-color/dznFolder/ |
H A D | tcgc2.mzn | 25 set of int: NODES = 1..nbV; 28 array [EDGES] of NODES: heads; 29 array [EDGES] of NODES: tails; 31 array [NODES] of int: init; 32 array [NODES] of int: end; 41 predicate valid_coloring(array [NODES] of var COLORS: coloring, array [EDGES] of NODES: xs, array [… 45 array [STEPS,NODES] of var COLORS: a; 46 constraint forall(n in NODES) (a[1,n] = init[n]); 47 constraint forall(n in NODES) (a[s,n] = end[n]); 57 int_search([a[s,n] | s in STEPS, n in NODES],input_order,indomain_min,complete) [all …]
|
/dports/math/py-or-tools/or-tools-9.2/examples/contrib/ |
H A D | max_flow_taha.cs | 47 IEnumerable<int> NODES = Enumerable.Range(0, n); in Solve() 58 foreach (int i in NODES) in Solve() 60 foreach (int j in NODES) in Solve() 79 foreach (int i in NODES) in Solve() 95 foreach (int i in NODES) in Solve() 103 var s1 = (from i in NODES where c[i, start] > 0 select x[i, start]); in Solve() 109 var s2 = (from j in NODES where c[end, j] > 0 select x[end, j]); in Solve() 131 foreach (int i in NODES) in Solve() 136 foreach (int i in NODES) in Solve() 141 foreach (int i in NODES) in Solve() [all …]
|
/dports/science/fasthenry/fasthenry-3.0wr/src/fasthenry/ |
H A D | induct.h | 225 } NODES; typedef 261 NODES *node[2]; 277 NODES *node; 459 NODES *original; 470 NODES *node; 479 NODES *node; 548 NODES *getrealnode(); 549 NODES *getothernode(); 578 NODES *find_nearest_node(); 591 NODES *getnode(); [all …]
|
H A D | findpaths.c | 57 NODES *node; in getrealnode() 78 NODES *node; in getothernode() 142 NODES *node; in is_normal() 181 NODES *node; in is_gp_node() 201 NODES *node; in is_node_in_list() 216 NODES *node; in is_orignode_in_list() 231 NODES *node; in add_node_to_list() 445 NODES *node; 529 NODES *node; in find_next_external() 545 NODES *node; in add_to_connected_segs() [all …]
|
/dports/databases/redis-devel/redis-0e5b813/tests/cluster/tests/ |
H A D | 23-multiple-slot-operations.tcl | 38 assert_match "* 0-3276*" [$master1 CLUSTER NODES] 39 assert_match "* 3277-6552*" [$master2 CLUSTER NODES] 40 assert_match "* 6553-9828*" [$master3 CLUSTER NODES] 41 assert_match "* 9829-13104*" [$master4 CLUSTER NODES] 42 assert_match "* 13105-16383*" [$master5 CLUSTER NODES] 50 assert_match "* 0-3000 3051-3276*" [$master1 CLUSTER NODES] 54 assert_match "* 3277-5000 5501-6552*" [$master2 CLUSTER NODES] 58 assert_match "* 6553-7000 7101-8000 8501-9828*" [$master3 CLUSTER NODES] 62 assert_match "* 9829-11000 12001-12100 12201-13104*" [$master4 CLUSTER NODES] 66 assert_match "* 13105-13500 14001-15000 16001-16383*" [$master5 CLUSTER NODES]
|
H A D | 19-cluster-nodes-slots.tcl | 38 assert_match "* 0-8191*" [$master1 CLUSTER NODES] 39 assert_match "* 8192-16383*" [$master2 CLUSTER NODES] 44 assert_match "* 0-4095 4097-8191*" [$master1 CLUSTER NODES] 49 assert_match "* 8192-12287 12289-16383*" [$master2 CLUSTER NODES] 56 assert_match "* 0-4091 4093 4095 4097-8191*" [$master1 CLUSTER NODES] 59 assert_match "* 8192-12283 12285 12287 12289-16383*" [$master2 CLUSTER NODES] 64 assert_match "* 1 3-4091 4093 4095 4097-8191*" [$master1 CLUSTER NODES] 69 assert_match "* 8192-12283 12285 12287 12289-16379 16381*" [$master2 CLUSTER NODES]
|
/dports/sysutils/slurm-wlm/slurm-20.02.7/src/common/ |
H A D | mapping.c | 272 #define NODES 200 281 for (i = 0; i < NODES; i++) { 304 for (i = 0; i < NODES; i++) { 326 for (i = 0; i < NODES; i++) { 386 uint16_t tasks[NODES] = { 0 }; 391 for (i = 0; i< NODES; i++) { 399 check(NODES,tnum, tasks, tids); 402 check(NODES,tnum, tasks, tids); 405 check(NODES,tnum, tasks, tids); 408 check(NODES,tnum, tasks, tids); [all …]
|
/dports/graphics/p5-GraphViz/GraphViz-2.24/lib/ |
H A D | GraphViz.pm | 416 $self->{NODES} = {}; 635 if ( exists $self->{NODES}->{ $node->{name} } 670 $self->{NODES}->{ $node->{name} } = $node; 1150 my $node = $self->{NODES}->{$name}; 1181 if ( exists $self->{NODES}->{$from} 1183 && exists $self->{NODES}->{$to} 1184 && exists $self->{NODES}->{$to}->{cluster} 1185 && $self->{NODES}->{$from}->{cluster} eq 1186 $self->{NODES}->{$to}->{cluster} ) 1225 . $self->{NODES}->{$_}->{_code} [all …]
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/gfortran.dg/ |
H A D | array_2.f90 | 16 SUBROUTINE EOS(NODES, DENS, PRES, CS, CGAMMA) argument 18 INTEGER NODES local 20 REAL, DIMENSION(NODES) :: DENS, PRES, CS 22 CS(:NODES) = SQRT(CGAMMA*PRES(:NODES)/DENS(:NODES))
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/ |
H A D | array_2.f90 | 16 SUBROUTINE EOS(NODES, DENS, PRES, CS, CGAMMA) argument 18 INTEGER NODES local 20 REAL, DIMENSION(NODES) :: DENS, PRES, CS 22 CS(:NODES) = SQRT(CGAMMA*PRES(:NODES)/DENS(:NODES))
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gfortran.dg/ |
H A D | array_2.f90 | 16 SUBROUTINE EOS(NODES, DENS, PRES, CS, CGAMMA) argument 18 INTEGER NODES local 20 REAL, DIMENSION(NODES) :: DENS, PRES, CS 22 CS(:NODES) = SQRT(CGAMMA*PRES(:NODES)/DENS(:NODES))
|
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gfortran.dg/ |
H A D | array_2.f90 | 16 SUBROUTINE EOS(NODES, DENS, PRES, CS, CGAMMA) argument 18 INTEGER NODES local 20 REAL, DIMENSION(NODES) :: DENS, PRES, CS 22 CS(:NODES) = SQRT(CGAMMA*PRES(:NODES)/DENS(:NODES))
|