/dports/biology/bedtools/bedtools2-2.30.0/test/closest/ |
H A D | test-closest.sh | 31 $BT closest -a a.bed -b b.bed -d > obs 41 $BT closest -a b.bed -b a.bed -d > obs 51 $BT closest -a a.bed -b b-one-bp-closer.bed -d > obs 72 $BT closest -a a.names.bed -b b.names.bed -d > obs 121 $BT closest -a close-a.bed -b close-b.bed > obs 252 $BT closest -a mq1.bed -b mdb1.bed -s> obs 262 $BT closest -a mq1.bed -b mdb1.bed -S> obs 558 $BT closest -a a2.bed -b b2.bed > obs 568 $BT closest -a a2.bed -b b2.bed -s > obs 578 $BT closest -a a2.bed -b b2.bed -S > obs [all …]
|
/dports/biology/bedtools/bedtools2-2.30.0/test/closest/kclosest/ |
H A D | test-kclosest.sh | 34 $BT closest -a q1.bed -b d1.bed -k 3 > obs 46 $BT closest -a q1.bed -b d1.bed -k 5 > obs 59 $BT closest -a q1.bed -b d1.bed -k 6 > obs 73 $BT closest -a q1.bed -b d1.bed -k 7 > obs 84 $BT closest -a q1.bed -b d1.bed -k 4 -t first > obs 95 $BT closest -a q1.bed -b d1.bed -k 4 -t last > obs 106 $BT closest -a q1.bed -b d2.bed -k 4 > obs 116 $BT closest -a q1.bed -b d2.bed -k 4 -t first > obs 140 $BT closest -a q1.bed -b d2.bed -k 7 > obs 151 $BT closest -a q1.bed -b d2.bed -k 7 -t first > obs [all …]
|
/dports/devel/hadoop/hadoop-1.2.1/src/test/org/apache/hadoop/io/ |
H A D | TestMapFile.java | 60 Text closest = (Text)reader.getClosest(key, value); in testGetClosest() local 62 assertEquals(new Text("60"), closest); in testGetClosest() 65 assertEquals(new Text("50"), closest); in testGetClosest() 68 closest = (Text)reader.getClosest(TWENTY, value); in testGetClosest() 69 assertEquals(TWENTY, closest); in testGetClosest() 71 assertEquals(TWENTY, closest); in testGetClosest() 75 closest = (Text)reader.getClosest(key, value); in testGetClosest() 81 assertNull(closest); in testGetClosest() 85 closest = (Text)reader.getClosest(key, value); in testGetClosest() 86 assertNull(closest); in testGetClosest() [all …]
|
/dports/biology/bedtools/bedtools2-2.30.0/test/closest/sortAndNaming/ |
H A D | test-sort-and-naming.sh | 31 $BT closest -a sq1.bed -b sdb1.bed 2>&1 > /dev/null | cat - > obs 116 $BT closest -a q1_gls.bed -b q1_gls.bed > obs 131 $BT closest -a alpha_all.bed -b alpha_all.bed > obs 146 $BT closest -a alpha_all.bed -b alpha_missing.bed > obs 158 $BT closest -a alpha_all.bed -b num_all.bed 2>&1 > /dev/null | cat - > obs 182 $BT closest -a alpha_missing.bed -b alpha_all.bed > obs 195 $BT closest -a alpha_missing.bed -b alpha_missing.bed > obs 232 $BT closest -a num_all.bed -b alpha_all.bed 2>&1 > /dev/null | cat - > obs 260 $BT closest -a num_all.bed -b num_all.bed > obs 272 $BT closest -a num_all.bed -b num_missing.bed 2>&1 > /dev/null | cat - > obs [all …]
|
/dports/net/mpich/mpich-3.4.3/src/pm/hydra2/libhydra/topo/hwloc/hwloc/tests/hwloc/ |
H A D | hwloc_get_closest_objs.c | 31 hwloc_obj_t *closest; in main() local 54 closest = malloc(numprocs * sizeof(*closest)); in main() 55 assert(closest); in main() 58 found = hwloc_get_closest_objs (topology, last, closest, numprocs); in main() 63 …assert(closest[0] == hwloc_get_obj_by_depth(topology, depth-1, numprocs-5 /* arity is 5 on last le… in main() 65 …assert(closest[found-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5-1 /* last of first ha… in main() 66 …assert(closest[found/2-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5-1 /* last of … in main() 67 …assert(closest[found/2/3-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5+3*5-1 /* la… in main() 70 ancestor = hwloc_get_common_ancestor_obj(topology, last, closest[found-1]); in main() 72 assert(hwloc_obj_is_in_subtree(topology, closest[found-1], ancestor)); in main() [all …]
|
/dports/net/mpich/mpich-3.4.3/modules/hwloc/tests/hwloc/ |
H A D | hwloc_get_closest_objs.c | 31 hwloc_obj_t *closest; in main() local 54 closest = malloc(numprocs * sizeof(*closest)); in main() 55 assert(closest); in main() 58 found = hwloc_get_closest_objs (topology, last, closest, numprocs); in main() 63 …assert(closest[0] == hwloc_get_obj_by_depth(topology, depth-1, numprocs-5 /* arity is 5 on last le… in main() 65 …assert(closest[found-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5-1 /* last of first ha… in main() 66 …assert(closest[found/2-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5-1 /* last of … in main() 67 …assert(closest[found/2/3-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5+3*5-1 /* la… in main() 70 ancestor = hwloc_get_common_ancestor_obj(topology, last, closest[found-1]); in main() 72 assert(hwloc_obj_is_in_subtree(topology, closest[found-1], ancestor)); in main() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/pm/hydra/tools/topo/hwloc/hwloc/tests/hwloc/ |
H A D | hwloc_get_closest_objs.c | 31 hwloc_obj_t *closest; in main() local 54 closest = malloc(numprocs * sizeof(*closest)); in main() 55 assert(closest); in main() 58 found = hwloc_get_closest_objs (topology, last, closest, numprocs); in main() 63 …assert(closest[0] == hwloc_get_obj_by_depth(topology, depth-1, numprocs-5 /* arity is 5 on last le… in main() 65 …assert(closest[found-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5-1 /* last of first ha… in main() 66 …assert(closest[found/2-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5-1 /* last of … in main() 67 …assert(closest[found/2/3-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5+3*5-1 /* la… in main() 70 ancestor = hwloc_get_common_ancestor_obj(topology, last, closest[found-1]); in main() 72 assert(hwloc_obj_is_in_subtree(topology, closest[found-1], ancestor)); in main() [all …]
|
/dports/net/mpich2/mpich2-1.5/src/pm/hydra/tools/topo/hwloc/hwloc/tests/ |
H A D | hwloc_get_closest_objs.c | 31 hwloc_obj_t *closest; in main() local 54 closest = malloc(numprocs * sizeof(*closest)); in main() 55 assert(closest); in main() 58 found = hwloc_get_closest_objs (topology, last, closest, numprocs); in main() 63 …assert(closest[0] == hwloc_get_obj_by_depth(topology, depth-1, numprocs-5 /* arity is 5 on last le… in main() 65 …assert(closest[found-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5-1 /* last of first ha… in main() 66 …assert(closest[found/2-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5-1 /* last of … in main() 67 …assert(closest[found/2/3-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5+3*5-1 /* la… in main() 70 ancestor = hwloc_get_common_ancestor_obj(topology, last, closest[found-1]); in main() 72 assert(hwloc_obj_is_in_subtree(topology, closest[found-1], ancestor)); in main() [all …]
|
/dports/devel/hwloc/hwloc-1.11.13/tests/ |
H A D | hwloc_get_closest_objs.c | 31 hwloc_obj_t *closest; in main() local 54 closest = malloc(numprocs * sizeof(*closest)); in main() 55 assert(closest); in main() 58 found = hwloc_get_closest_objs (topology, last, closest, numprocs); in main() 63 …assert(closest[0] == hwloc_get_obj_by_depth(topology, depth-1, numprocs-5 /* arity is 5 on last le… in main() 65 …assert(closest[found-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5-1 /* last of first ha… in main() 66 …assert(closest[found/2-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5-1 /* last of … in main() 67 …assert(closest[found/2/3-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5+3*5-1 /* la… in main() 70 ancestor = hwloc_get_common_ancestor_obj(topology, last, closest[found-1]); in main() 72 assert(hwloc_obj_is_in_subtree(topology, closest[found-1], ancestor)); in main() [all …]
|
/dports/devel/hwloc2/hwloc-2.5.0/tests/hwloc/ |
H A D | hwloc_get_closest_objs.c | 31 hwloc_obj_t *closest; in main() local 54 closest = malloc(numprocs * sizeof(*closest)); in main() 55 assert(closest); in main() 58 found = hwloc_get_closest_objs (topology, last, closest, numprocs); in main() 63 …assert(closest[0] == hwloc_get_obj_by_depth(topology, depth-1, numprocs-5 /* arity is 5 on last le… in main() 65 …assert(closest[found-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5-1 /* last of first ha… in main() 66 …assert(closest[found/2-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5-1 /* last of … in main() 67 …assert(closest[found/2/3-1] == hwloc_get_obj_by_depth(topology, depth-1, 1*3*4*5+2*4*5+3*5-1 /* la… in main() 70 ancestor = hwloc_get_common_ancestor_obj(topology, last, closest[found-1]); in main() 72 assert(hwloc_obj_is_in_subtree(topology, closest[found-1], ancestor)); in main() [all …]
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/unit/ |
H A D | GeomPrimTest.cpp | 116 p = line.closest( p2 ); in test_line_closest_to_point() 120 p = line.closest( p3 ); in test_line_closest_to_point() 359 Vector3D closest, normal; in test_sphere_closest_to_point() local 360 closest = sphere.closest( xpt ); in test_sphere_closest_to_point() 362 closest = Vector3D(0,0,0); in test_sphere_closest_to_point() 363 CPPUNIT_ASSERT( sphere.closest( xpt, closest, normal ) ); in test_sphere_closest_to_point() 367 closest = sphere.closest( ypt ); in test_sphere_closest_to_point() 369 closest = Vector3D(0,0,0); in test_sphere_closest_to_point() 370 CPPUNIT_ASSERT( sphere.closest( ypt, closest, normal ) ); in test_sphere_closest_to_point() 374 closest = sphere.closest( zpt ); in test_sphere_closest_to_point() [all …]
|
/dports/x11-wm/durden/durden-0.6.1/durden/ |
H A D | icon.lua | 144 local closest = 0; 151 closest = k; 164 if closest == 0 then 169 local vid = ent.widths[closest]; 170 if not ent.widths[closest] then 171 if type(ent[closest]) == "string" then 173 ent.widths[closest] = load_image(fn); 179 image_tracetag(ent.widths[closest], 183 elseif type(ent[closest]) == "function" then 184 ent.widths[closest] = ent[closest](); [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/testing/web-platform/meta/css/css-shapes/shape-outside/values/ |
H A D | shape-outside-ellipse-005.html.ini | 5 [test unit: cm - ellipse(25cm closest-side) - inline] 11 [test unit: mm - ellipse(25mm closest-side) - inline] 17 [test unit: in - ellipse(25in closest-side) - inline] 23 [test unit: pt - ellipse(25pt closest-side) - inline] 29 [test unit: pc - ellipse(25pc closest-side) - inline] 35 [test unit: em - ellipse(25em closest-side) - inline] 41 [test unit: ex - ellipse(25ex closest-side) - inline] 47 [test unit: ch - ellipse(25ch closest-side) - inline] 53 [test unit: rem - ellipse(25rem closest-side) - inline] 59 [test unit: vw - ellipse(25vw closest-side) - inline] [all …]
|
H A D | shape-outside-ellipse-001.html.ini | 8 [ellipse(closest-side) - inline] 14 [ellipse(25% closest-side) - inline] 17 [ellipse(25px closest-side) - inline] 20 [ellipse(farthest-side closest-side) - inline] 32 [ellipse(closest-side) - computed] 38 [ellipse(25% closest-side) - computed] 41 [ellipse(25px closest-side) - computed] 44 [ellipse(closest-side closest-side) - computed] 47 [ellipse(farthest-side closest-side) - computed]
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/FSUDace/ |
H A D | fsu_quality.C | 111 int *closest; in chi_measure() local 152 h[closest[0]] = d_max ( h[closest[0]], dist ); in chi_measure() 166 delete [] closest; in chi_measure() 255 int *closest; in d_measure() local 316 hit[closest[0]] = hit[closest[0]] + 1; in d_measure() 320 centroid[i+closest[0]*ndim] = centroid[i+closest[0]*ndim] + x[i]; in d_measure() 401 delete [] closest; in d_measure() 481 int *closest; in h_measure() local 521 delete [] closest; in h_measure() 694 int *closest; in tau_measure() local [all …]
|
/dports/graphics/gegl/gegl-0.4.34/opencl/ |
H A D | noise-cell.cl | 48 search_box (float *closest, 84 for (j = 0 ; j < rank && d > closest[j] ; j += 1); 90 closest[k] = closest[k - 1]; 93 closest[j] = d; 114 float c, d, n, closest[MAX_RANK], *d_0 = &closest[MAX_RANK - 1]; 134 d_0 = &closest[rank - 1]; 149 search_box (closest, &feature, s - 1, t, x, y, 158 search_box (closest, &feature, s, t - 1, x, y, 162 search_box (closest, &feature, s, t + 1, x, y, 180 * the closest feature point, otherwise return the closest [all …]
|
/dports/biology/bedtools/bedtools2-2.30.0/docs/content/tools/ |
H A D | closest.rst | 4 *closest* 10 is the closest gene to a significant GWAS polymorphism. Note that `closest` will report an 48 bedtools closest [OPTIONS] -a <FILE> \ 131 $ bedtools closest -a a.bed -b b.bed 146 $ bedtools closest -a a.bed -b b.bed 160 $ bedtools closest -a a.bed -b b.bed 167 As of version, 2.22.0, the `closest` tool allows one to find the closest 189 # which the closest interval came. 261 $ bedtools closest -a a.bed -b b.bed 332 $ bedtools closest -a a.bed -b b.bed [all …]
|
/dports/graphics/Coin/coin-Coin-4.0.0/src/base/ |
H A D | SbBox3s.cpp | 268 SbVec3f closest = pt; in getClosestPoint() local 271 float devx = closest[0] - center[0]; in getClosestPoint() 272 float devy = closest[1] - center[1]; in getClosestPoint() 273 float devz = closest[2] - center[2]; in getClosestPoint() 280 closest[0] = center[0] + halfwidth * ((devx < 0.0f) ? -1.0f : 1.0f); in getClosestPoint() 282 closest[1] = center[1] + halfheight * ((devy < 0.0f) ? -1.0f : 1.0f); in getClosestPoint() 284 closest[2] = center[2] + halfdepth * ((devz < 0.0f) ? -1.0f : 1.0f); in getClosestPoint() 287 closest[0] = SbMin(SbMax(closest[0], float(minpt[0])), float(maxpt[0])); in getClosestPoint() 288 closest[1] = SbMin(SbMax(closest[1], float(minpt[1])), float(maxpt[1])); in getClosestPoint() 289 closest[2] = SbMin(SbMax(closest[2], float(minpt[2])), float(maxpt[2])); in getClosestPoint() [all …]
|
/dports/multimedia/dvdstyler/DVDStyler-3.1/src/ |
H A D | Palette3D.cpp | 61 int closest = 0; in Apply() local 67 closest = i; in Apply() 70 if (c1 != m_colours1[closest] || c2 != m_colours2[closest] || c3 != m_colours3[closest]) { in Apply() 72 param->normalColour = Int2Colour(m_colours1[closest]); in Apply() 73 param->highlightedColour = Int2Colour(m_colours2[closest]); in Apply() 74 param->selectedColour = Int2Colour(m_colours3[closest]); in Apply() 82 int closest = 0; in ReduceColours() local 91 closest = j; in ReduceColours() 94 m_colours1.RemoveAt(closest); in ReduceColours() 95 m_colours2.RemoveAt(closest); in ReduceColours() [all …]
|
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
H A D | vtkIncrementalOctreeNode.cxx | 570 closest[0] = point[0]; in GetDistance2ToBoundary() 580 closest[1] = point[1]; in GetDistance2ToBoundary() 600 closest[0] = point[0]; in GetDistance2ToBoundary() 601 closest[1] = point[1]; in GetDistance2ToBoundary() 609 closest[2] = point[2]; in GetDistance2ToBoundary() 628 closest[0] = point[0]; in GetDistance2ToBoundary() 629 closest[2] = point[2]; in GetDistance2ToBoundary() 647 closest[1] = point[1]; in GetDistance2ToBoundary() 648 closest[2] = point[2]; in GetDistance2ToBoundary() 726 closest[0] = point[0]; in GetDistance2ToBoundary() [all …]
|
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
H A D | vtkIncrementalOctreeNode.cxx | 571 closest[0] = point[0]; in GetDistance2ToBoundary() 581 closest[1] = point[1]; in GetDistance2ToBoundary() 601 closest[0] = point[0]; in GetDistance2ToBoundary() 602 closest[1] = point[1]; in GetDistance2ToBoundary() 610 closest[2] = point[2]; in GetDistance2ToBoundary() 629 closest[0] = point[0]; in GetDistance2ToBoundary() 630 closest[2] = point[2]; in GetDistance2ToBoundary() 648 closest[1] = point[1]; in GetDistance2ToBoundary() 649 closest[2] = point[2]; in GetDistance2ToBoundary() 727 closest[0] = point[0]; in GetDistance2ToBoundary() [all …]
|
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
H A D | vtkIncrementalOctreeNode.cxx | 570 closest[0] = point[0]; in GetDistance2ToBoundary() 580 closest[1] = point[1]; in GetDistance2ToBoundary() 600 closest[0] = point[0]; in GetDistance2ToBoundary() 601 closest[1] = point[1]; in GetDistance2ToBoundary() 609 closest[2] = point[2]; in GetDistance2ToBoundary() 628 closest[0] = point[0]; in GetDistance2ToBoundary() 629 closest[2] = point[2]; in GetDistance2ToBoundary() 647 closest[1] = point[1]; in GetDistance2ToBoundary() 648 closest[2] = point[2]; in GetDistance2ToBoundary() 726 closest[0] = point[0]; in GetDistance2ToBoundary() [all …]
|
/dports/www/webtrees20/webtrees-2.0.19/webtrees/vendor/fisharebest/algorithm/src/ |
H A D | Dijkstra.php | 58 $closest = array_search(min($this->queue), $this->queue); 59 if (!empty($this->graph[$closest]) && !in_array($closest, $exclude)) { 60 foreach ($this->graph[$closest] as $neighbor => $cost) { 62 if ($this->distance[$closest] + $cost < $this->distance[$neighbor]) { 64 $this->distance[$neighbor] = $this->distance[$closest] + $cost; 65 $this->previous[$neighbor] = array($closest); 67 } elseif ($this->distance[$closest] + $cost === $this->distance[$neighbor]) { 69 $this->previous[$neighbor][] = $closest; 75 unset($this->queue[$closest]);
|
/dports/www/webtrees/webtrees-1.7.18/webtrees/vendor/fisharebest/algorithm/src/ |
H A D | Dijkstra.php | 58 $closest = array_search(min($this->queue), $this->queue); 59 if (!empty($this->graph[$closest]) && !in_array($closest, $exclude)) { 60 foreach ($this->graph[$closest] as $neighbor => $cost) { 62 if ($this->distance[$closest] + $cost < $this->distance[$neighbor]) { 64 $this->distance[$neighbor] = $this->distance[$closest] + $cost; 65 $this->previous[$neighbor] = array($closest); 67 } elseif ($this->distance[$closest] + $cost === $this->distance[$neighbor]) { 69 $this->previous[$neighbor][] = $closest; 75 unset($this->queue[$closest]);
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/Misc/ |
H A D | MeshDomain1D.cpp | 63 Vector3D& closest, in closest_point() argument 67 closest = geom(); in closest_point() 103 Vector3D& closest, in closest_point() argument 107 closest = geom().point(geom().closest( position )); in closest_point() 124 double p1 = mGeom.closest( position1 ); in arc_length() 125 double p2 = mGeom.closest( position2 ); in arc_length() 134 const double param = mGeom.closest( from_here ); in position_from_length() 140 { coordinate = geom().closest( coordinate ); } in snap_to() 168 Vector3D& closest, in closest_point() argument 173 if (!geom().closest(position, closest, normal)) { // at center? in closest_point() [all …]
|