/dports/science/chemps2/CheMPS2-1.8.10/CheMPS2/ |
H A D | SyBookkeeper.cpp | 64 for ( int boundary = 0; boundary <= gL(); boundary++ ){ in SyBookkeeper() local 83 for ( int boundary = 0; boundary <= gL(); boundary++ ){ in allocate_arrays() local 86 TwoSmin[ boundary ] = new int[ Nmax[ boundary ] - Nmin[ boundary ] + 1 ]; in allocate_arrays() 87 TwoSmax[ boundary ] = new int[ Nmax[ boundary ] - Nmin[ boundary ] + 1 ]; in allocate_arrays() 98 for ( int boundary = 0; boundary <= gL(); boundary++ ){ in allocate_arrays() local 115 for ( int boundary = 0; boundary <= gL(); boundary++ ){ in ~SyBookkeeper() local 130 for ( int boundary = 0; boundary <= gL(); boundary++ ){ in ~SyBookkeeper() local 198 for ( int boundary = start; boundary <= stop; boundary++ ){ in fill_fci_dim_right() local 217 for ( int boundary = stop; boundary >= start; boundary-- ){ in fill_fci_dim_left() local 237 for ( int boundary = 0; boundary <= gL(); boundary++ ){ in CopyDim() local [all …]
|
/dports/cad/gdsreader/GDSreader.0.3.2/ |
H A D | GDSboundary.c | 39 if(boundary->points[0].x != boundary->points[1].x) in BoundaryIsRectangle() 41 if(boundary->points[0].y != boundary->points[1].y) in BoundaryIsRectangle() 43 if(boundary->points[0].x != boundary->points[3].x) in BoundaryIsRectangle() 45 if(boundary->points[2].x != boundary->points[1].x) in BoundaryIsRectangle() 47 if(boundary->points[2].y != boundary->points[3].y) in BoundaryIsRectangle() 52 if(boundary->points[0].y != boundary->points[3].y) in BoundaryIsRectangle() 54 if(boundary->points[2].y != boundary->points[1].y) in BoundaryIsRectangle() 56 if(boundary->points[2].x != boundary->points[3].x) in BoundaryIsRectangle() 102 (boundary->points[2].x - boundary->points[0].x) / in BoundaryToHPGL() 104 (boundary->points[2].y - boundary->points[0].y) / in BoundaryToHPGL() [all …]
|
/dports/mail/postfix-current/postfix-3.7-20211107/src/global/ |
H A D | mime_nest.ref | 3 mime_state: PUSH boundary foobar 10 mime_state: PUSH boundary foobar 16 mime_state: PUSH boundary foobar 22 mime_state: PUSH boundary foobar 28 mime_state: PUSH boundary foobar 34 mime_state: PUSH boundary foobar 40 mime_state: PUSH boundary foobar 46 mime_state: PUSH boundary foobar 52 mime_state: PUSH boundary foobar 58 mime_state: PUSH boundary foobar [all …]
|
/dports/games/gracer/gracer-0.1.5/common/ |
H A D | gr_boundary.c | 48 GrBoundary *boundary; in gr_boundary_new() local 69 if (!boundary) in gr_boundary_new() 75 boundary->depth = 0; in gr_boundary_new() 81 return boundary; in gr_boundary_new() 94 if (boundary) in gr_boundary_free() 104 (*boundary->destroy_cb) (boundary->data[i][j]); in gr_boundary_free() 125 p = (p - boundary->lower) / boundary->width; in gr_boundary_check() 167 a = (a - boundary->lower) / boundary->width; in gr_boundary_check_region() 168 b = (b - boundary->lower) / boundary->width; in gr_boundary_check_region() 239 a = (a - boundary->lower) / boundary->width; in gr_boundary_register() [all …]
|
/dports/databases/grass7/grass-7.8.6/lib/vector/rtree/ |
H A D | rect.c | 514 r3->boundary[i] = r2->boundary[i]; in RTreeCombineRect() 521 r3->boundary[i] = r1->boundary[i]; in RTreeCombineRect() 527 r3->boundary[i] = MIN(r1->boundary[i], r2->boundary[i]); in RTreeCombineRect() 529 r3->boundary[j] = MAX(r1->boundary[j], r2->boundary[j]); in RTreeCombineRect() 554 r1->boundary[i] = r2->boundary[i]; in RTreeExpandRect() 559 r1->boundary[j] = r2->boundary[j]; in RTreeExpandRect() 605 if (r->boundary[i] > s->boundary[j] || in RTreeOverlap() 606 s->boundary[i] > r->boundary[j]) { in RTreeOverlap() 633 if (s->boundary[i] < r->boundary[i] || in RTreeContained() 634 s->boundary[j] > r->boundary[j]) in RTreeContained() [all …]
|
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/couple/ |
H A D | hecmw_couple_boundary_info.c | 43 if (boundary->node) { in HECMW_couple_free_boundary_info() 47 if (boundary->elem) { in HECMW_couple_free_boundary_info() 51 if (boundary->surf) { in HECMW_couple_free_boundary_info() 58 HECMW_free(boundary); in HECMW_couple_free_boundary_info() 59 boundary = NULL; in HECMW_couple_free_boundary_info() 72 boundary->node = NULL; in HECMW_couple_alloc_boundary_info() 73 boundary->elem = NULL; in HECMW_couple_alloc_boundary_info() 107 return boundary; in HECMW_couple_alloc_boundary_info() 362 size = sizeof(int) * boundary->elem_node_index[boundary->elem->n]; in set_boundary_node_by_elem() 558 size = sizeof(int) * boundary->elem_node_index[boundary->surf->n]; in set_boundary_node_by_surf() [all …]
|
/dports/databases/fastdb/fastdb/inc/ |
H A D | rectangle.h | 64 boundary[i] = (boundary[i] <= r.boundary[i]) 65 ? boundary[i] : r.boundary[i]; 66 boundary[i+dim] = (boundary[i+dim] >= r.boundary[i+dim]) 77 res.boundary[i] = (boundary[i] <= r.boundary[i]) 78 ? boundary[i] : r.boundary[i]; 79 res.boundary[i+dim] = (boundary[i+dim] >= r.boundary[i+dim]) 91 r.boundary[i] > boundary[i+dim]) 105 if (boundary[i] < r.boundary[i] || 120 if (r.boundary[i] < boundary[i] || 149 if (boundary[i] != r.boundary[i]) { [all …]
|
/dports/databases/gigabase/gigabase/Symbian/Carbide/workspace/GigaBASE/inc/ |
H A D | rectangle.h | 64 boundary[i] = (boundary[i] <= r.boundary[i]) 65 ? boundary[i] : r.boundary[i]; 66 boundary[i+dim] = (boundary[i+dim] >= r.boundary[i+dim]) 77 res.boundary[i] = (boundary[i] <= r.boundary[i]) 78 ? boundary[i] : r.boundary[i]; 79 res.boundary[i+dim] = (boundary[i+dim] >= r.boundary[i+dim]) 91 r.boundary[i] > boundary[i+dim]) 105 if (boundary[i] < r.boundary[i] || 120 if (r.boundary[i] < boundary[i] || 149 if (boundary[i] != r.boundary[i]) { [all …]
|
/dports/databases/gigabase/gigabase/ |
H A D | rectangle.h | 64 boundary[i] = (boundary[i] <= r.boundary[i]) 65 ? boundary[i] : r.boundary[i]; 66 boundary[i+dim] = (boundary[i+dim] >= r.boundary[i+dim]) 77 res.boundary[i] = (boundary[i] <= r.boundary[i]) 78 ? boundary[i] : r.boundary[i]; 79 res.boundary[i+dim] = (boundary[i+dim] >= r.boundary[i+dim]) 91 r.boundary[i] > boundary[i+dim]) 105 if (boundary[i] < r.boundary[i] || 120 if (r.boundary[i] < boundary[i] || 149 if (boundary[i] != r.boundary[i]) { [all …]
|
/dports/graphics/blender/blender-2.91.0/source/blender/editors/sculpt_paint/ |
H A D | sculpt_boundary.c | 143 boundary->vertices[boundary->num_vertices] = new_index; in sculpt_boundary_index_add() 151 if (boundary->num_vertices >= boundary->vertices_capacity) { in sculpt_boundary_index_add() 161 boundary->edges[boundary->num_edges].v1 = v1; in sculpt_boundary_preview_edge_add() 162 boundary->edges[boundary->num_edges].v2 = v2; in sculpt_boundary_preview_edge_add() 165 if (boundary->num_edges >= boundary->edges_capacity) { in sculpt_boundary_preview_edge_add() 167 boundary->edges = MEM_reallocN_id(boundary->edges, in sculpt_boundary_preview_edge_add() 229 SculptBoundary *boundary = data->boundary; in boundary_floodfill_cb() local 271 .boundary = boundary, in sculpt_boundary_indices_init() 327 boundary->edit_info[boundary->vertices[i]].original_vertex = boundary->vertices[i]; in sculpt_boundary_edit_data_init() 328 boundary->edit_info[boundary->vertices[i]].num_propagation_steps = 0; in sculpt_boundary_edit_data_init() [all …]
|
/dports/devel/py-pyicu/PyICU-2.4.3/samples/ |
H A D | break.py | 43 start = boundary.first() 44 for end in boundary: 52 end = boundary.last() 62 def printFirst(boundary): argument 65 end = boundary.next() 70 def printLast(boundary): argument 72 end = boundary.last() 79 def printAt(boundary, pos): argument 114 printFirst(boundary) 117 printLast(boundary) [all …]
|
/dports/devel/icu-lx/icu/source/samples/break/ |
H A D | break.cpp | 65 int32_t end = boundary.last(); in printEachBackward() 78 int32_t end = boundary.next(); in printFirst() 103 BreakIterator* boundary; in main() local 122 printEachForward(*boundary); in main() 124 printEachBackward(*boundary); in main() 125 delete boundary; in main() 133 printEachForward(*boundary); in main() 136 printFirst(*boundary); in main() 139 printLast(*boundary); in main() 142 printAt(*boundary, 10 ); in main() [all …]
|
/dports/devel/icu/icu/source/samples/break/ |
H A D | break.cpp | 65 int32_t end = boundary.last(); in printEachBackward() 78 int32_t end = boundary.next(); in printFirst() 103 BreakIterator* boundary; in main() local 122 printEachForward(*boundary); in main() 124 printEachBackward(*boundary); in main() 125 delete boundary; in main() 133 printEachForward(*boundary); in main() 136 printFirst(*boundary); in main() 139 printLast(*boundary); in main() 142 printAt(*boundary, 10 ); in main() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/icu/source/samples/break/ |
H A D | break.cpp | 65 int32_t end = boundary.last(); in printEachBackward() 78 int32_t end = boundary.next(); in printFirst() 103 BreakIterator* boundary; in main() local 122 printEachForward(*boundary); in main() 124 printEachBackward(*boundary); in main() 125 delete boundary; in main() 133 printEachForward(*boundary); in main() 136 printFirst(*boundary); in main() 139 printLast(*boundary); in main() 142 printAt(*boundary, 10 ); in main() [all …]
|
/dports/lang/v8/v8-9.6.180.12/third_party/icu/source/samples/break/ |
H A D | break.cpp | 65 int32_t end = boundary.last(); in printEachBackward() 78 int32_t end = boundary.next(); in printFirst() 103 BreakIterator* boundary; in main() local 122 printEachForward(*boundary); in main() 124 printEachBackward(*boundary); in main() 125 delete boundary; in main() 133 printEachForward(*boundary); in main() 136 printFirst(*boundary); in main() 139 printLast(*boundary); in main() 142 printAt(*boundary, 10 ); in main() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/icu/source/samples/break/ |
H A D | break.cpp | 65 int32_t end = boundary.last(); in printEachBackward() 78 int32_t end = boundary.next(); in printFirst() 103 BreakIterator* boundary; in main() local 122 printEachForward(*boundary); in main() 124 printEachBackward(*boundary); in main() 125 delete boundary; in main() 133 printEachForward(*boundary); in main() 136 printFirst(*boundary); in main() 139 printLast(*boundary); in main() 142 printAt(*boundary, 10 ); in main() [all …]
|
/dports/astro/py-astropy/astropy-5.0/astropy/convolution/tests/ |
H A D | test_convolve_fft.py | 94 with expected_boundary_warning(boundary=boundary): 96 z = convolve_fft(x, y, boundary=boundary, 113 with expected_boundary_warning(boundary=boundary): 115 z = convolve_fft(x, y, boundary=boundary, 135 z = convolve_fft(x, y, boundary=boundary, 155 z = convolve_fft(x, y, boundary=boundary, 240 z = convolve_fft(x, y, boundary=boundary, 277 z = convolve_fft(x, y, boundary=boundary, 303 z = convolve_fft(x, y, boundary=boundary, 590 z = convolve_fft(x, y, boundary=boundary, [all …]
|
H A D | test_convolve.py | 74 z = convolve(x, y, boundary=boundary, nan_treatment=nan_treatment, 172 z = convfunc(x, y, boundary=boundary) 187 z = convolve(x, y, boundary=boundary) 205 z = convolve(x, y, boundary=boundary, normalize_kernel=False) 426 z = convolve(x, y, boundary=boundary) 445 z = convolve(x, y, boundary=boundary) 504 z = convolve(x, y, boundary=boundary, nan_treatment='fill', 534 z = convolve(x, y, boundary=boundary, nan_treatment='fill', 676 z = convolve(x, y, boundary=boundary) 694 z = convolve(x, y, boundary=boundary) [all …]
|
/dports/databases/grass7/grass-7.8.6/lib/vector/diglib/ |
H A D | spindex.c | 299 rect.boundary[0] = x; in dig_spidx_add_node() 300 rect.boundary[1] = y; in dig_spidx_add_node() 301 rect.boundary[2] = z; in dig_spidx_add_node() 302 rect.boundary[3] = x; in dig_spidx_add_node() 303 rect.boundary[4] = y; in dig_spidx_add_node() 304 rect.boundary[5] = z; in dig_spidx_add_node() 481 rect.boundary[0] = x; in dig_spidx_del_line() 482 rect.boundary[1] = y; in dig_spidx_del_line() 483 rect.boundary[2] = z; in dig_spidx_del_line() 484 rect.boundary[3] = x; in dig_spidx_del_line() [all …]
|
/dports/graphics/graphviz/graphviz-2.44.1/lib/label/ |
H A D | rectangle.c | 24 #define Undefined(x) ((x)->boundary[0] > (x)->boundary[NUMDIMS]) 50 r.boundary[i] = r.boundary[i + NUMDIMS] = 0; in NullRect() 91 (rand() % (data->boundary[j] - data->boundary[i] + 1)) / 2; in SearchRect() 93 + rand() % (data->boundary[j] - data->boundary[i] + 1); in SearchRect() 182 area *= r->boundary[i + NUMDIMS] - r->boundary[i]; 203 new.boundary[i] = MIN(r->boundary[i], rr->boundary[i]); in CombineRect() 205 new.boundary[j] = MAX(r->boundary[j], rr->boundary[j]); in CombineRect() 220 if (r->boundary[i] > s->boundary[j] in Overlap() 221 || s->boundary[i] > r->boundary[j]) in Overlap() 245 result = result && r->boundary[i] >= s->boundary[i] in Contained() [all …]
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/test/geometry/ |
H A D | test_mesh_get_boundary.cpp | 110 HalfEdgeIndices boundary; in TYPED_TEST() local 112 boundary.push_back (findHalfEdge (mesh, vi [ 0], vi [ 1])); in TYPED_TEST() 113 boundary.push_back (findHalfEdge (mesh, vi [ 1], vi [ 2])); in TYPED_TEST() 126 expected_boundary_collection.push_back (boundary); in TYPED_TEST() 127 boundary.clear (); in TYPED_TEST() 135 expected_boundary_collection.push_back (boundary); in TYPED_TEST() 136 boundary.clear (); in TYPED_TEST() 179 expected_boundary_collection.push_back (boundary); in TYPED_TEST() 180 boundary.clear (); in TYPED_TEST() 186 expected_boundary_collection.push_back (boundary); in TYPED_TEST() [all …]
|
/dports/math/gismo/gismo-21.12.0/extensions/gsStructuralAnalysis/examples/ |
H A D | gsThinShell_Static.cpp | 656 bc.addCondition(boundary::north, condition_type::neumann, &neuData ); in main() 770 bc.addCondition(boundary::north, condition_type::neumann, &neuData ); in main() 836 bc.addCondition(boundary::east, condition_type::collapsed, 0, 0 ,false,0); in main() 865 bc.addCondition(boundary::east, condition_type::clamped, 0, 0 ,false,2); in main() 866 bc.addCondition(boundary::west, condition_type::clamped, 0, 0 ,false,2); in main() 893 bc.addCondition(boundary::west, condition_type::clamped, 0, 0 ,false,2); in main() 900 bc.addCondition(boundary::east, condition_type::neumann, &neuData ); in main() 929 bc.addCondition(boundary::east, condition_type::clamped, 0, 0 ,false,2); in main() 962 bc.addCondition(boundary::east, condition_type::collapsed, 0, 0 ,false,0); in main() 991 bc.addCondition(boundary::east, condition_type::collapsed, 0, 0 ,false,0); in main() [all …]
|
/dports/devel/p5-Devel-Declare/Devel-Declare-0.006022/t/ |
H A D | block_size.t | 28 # mindless comment lines to pad out the test program to the next block boundary 29 # mindless comment lines to pad out the test program to the next block boundary 30 # mindless comment lines to pad out the test program to the next block boundary 31 # mindless comment lines to pad out the test program to the next block boundary 32 # mindless comment lines to pad out the test program to the next block boundary 33 # mindless comment lines to pad out the test program to the next block boundary 34 # mindless comment lines to pad out the test program to the next block boundary 35 # mindless comment lines to pad out the test program to the next block boundary 36 # mindless comment lines to pad out the test program to the next block boundary 37 # mindless comment lines to pad out the test program to the next block boundary [all …]
|
/dports/print/scribus-devel/scribus-1.5.7/scribus/third_party/lib2geom/ |
H A D | convex-cover.cpp | 101 if(boundary[i] <= boundary[pivot]) in find_pivot() 104 std::swap(boundary[0], boundary[pivot]); in find_pivot() 111 std::sort(boundary.begin()+1, boundary.end(), angle_cmp(boundary[0])); in angle_sort() 132 boundary[stac++] = boundary[i]; in graham_scan() 325 a.boundary[it][Y] > a.boundary[it-1][Y]) in find_bottom_right() 343 (a.boundary[al+1][Y] > b.boundary[bl][Y])) { in sweepline_intersection() 347 (b.boundary[bl+1][Y] > a.boundary[al][Y])) { in sweepline_intersection() 388 if(a.boundary[0][1] > b.boundary[0][1]) goto start_b; in merge() 412 if(b.boundary[0] <= a.boundary[0]) in graham_merge() 415 result.boundary = a.boundary; in graham_merge() [all …]
|
/dports/databases/sfcgal/SFCGAL-815d5097f684dbc48b22041bf2047beab36df0a1/test/unit/SFCGAL/algorithm/ |
H A D | BoundaryTest.cpp | 46 std::unique_ptr< Geometry > boundary( g.boundary() ); in BOOST_AUTO_TEST_CASE() local 49 BOOST_CHECK( boundary->isEmpty() ); in BOOST_AUTO_TEST_CASE() 54 std::unique_ptr< Geometry > boundary( g.boundary() ); in BOOST_AUTO_TEST_CASE() local 57 BOOST_CHECK( boundary->isEmpty() ); in BOOST_AUTO_TEST_CASE() 65 std::unique_ptr< Geometry > boundary( g.boundary() ); in BOOST_AUTO_TEST_CASE() local 68 BOOST_CHECK( boundary->isEmpty() ); in BOOST_AUTO_TEST_CASE() 78 std::unique_ptr< Geometry > boundary( g.boundary() ); in BOOST_AUTO_TEST_CASE() local 92 std::unique_ptr< Geometry > boundary( g.boundary() ); in BOOST_AUTO_TEST_CASE() local 108 std::unique_ptr< Geometry > boundary( g.boundary() ); in BOOST_AUTO_TEST_CASE() local 126 std::unique_ptr< Geometry > boundary( g.boundary() ); in BOOST_AUTO_TEST_CASE() local [all …]
|