Home
last modified time | relevance | path

Searched refs:best_cell (Results 1 – 15 of 15) sorted by relevance

/dports/cad/alliance/alliance/src/boog/src/
H A Dbog_map_prepare.c95 best_cell=cell; in cell_prepare()
100 best_cell=cell; in cell_prepare()
107 if (!best_cell || (ABL_ATOM(best_cell->ABL) && !ABL_ATOM(expr))) return NULL; in cell_prepare()
110 return best_cell; in cell_prepare()
154 best_cell=cell; in cell_prepare_bus()
159 best_cell=cell; in cell_prepare_bus()
164 if (best_cell) { in cell_prepare_bus()
166 return best_cell; in cell_prepare_bus()
223 best_cell=cell; in cell_prepare_reg()
233 if (best_cell) { in cell_prepare_reg()
[all …]
H A Dbog_map_pattern.c514 best_cell=cell; in cell_pattern()
520 if (!best_cell || (ABL_ATOM(best_cell->ABL) && !ABL_ATOM(expr)) in cell_pattern()
544 best_cell->DELAY=best_delay; in cell_pattern()
545 return best_cell; in cell_pattern()
659 best_cell=cell; in cell_pattern_bus()
666 if (!best_cell) { in cell_pattern_bus()
691 best_cell->DELAY=best_delay; in cell_pattern_bus()
692 return best_cell; in cell_pattern_bus()
808 best_cell=cell; in cell_pattern_reg()
814 if (!best_cell) { in cell_pattern_reg()
[all …]
/dports/devel/py-shapely/Shapely-1.8.0/shapely/algorithms/
H A Dpolylabel.py101 best_cell = Cell(x, y, 0, polygon)
105 if bbox_cell.distance > best_cell.distance:
106 best_cell = bbox_cell
122 if cell.distance > best_cell.distance:
123 best_cell = cell
127 if cell.max_distance - best_cell.distance <= tolerance:
137 return best_cell.centroid
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/source/rbase/
H A Dbuild_rbase.hpp105 int best_cell = -1; in choose_branch_cell() local
114 best_cell = branch_cell; in choose_branch_cell()
120 return best_cell; in choose_branch_cell()
151 int best_cell = -1; in choose_branch_cell() local
160 best_cell = branch_cell; in choose_branch_cell()
166 return best_cell; in choose_branch_cell()
170 int best_cell = -1; in choose_branch_cell() local
182 best_cell = branch_cell; in choose_branch_cell()
196 return best_cell; in choose_branch_cell()
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/polylabel-2.2.0/src/
H A Dlib.rs185 let mut best_cell = Qcell::new( in polylabel() localVariable
206 if bbox_cell.distance > best_cell.distance { in polylabel()
207 best_cell = bbox_cell; in polylabel()
233 if cell.distance > best_cell.distance { in polylabel()
234 best_cell.centroid = Point::new(cell.centroid.x(), cell.centroid.y()); in polylabel()
235 best_cell.extent = cell.extent; in polylabel()
236 best_cell.distance = cell.distance; in polylabel()
237 best_cell.max_distance = cell.max_distance; in polylabel()
240 if cell.max_distance - best_cell.distance <= *tolerance { in polylabel()
248 Ok(Point::new(best_cell.centroid.x(), best_cell.centroid.y())) in polylabel()
/dports/cad/yosys/yosys-yosys-0.12/passes/techmap/
H A Ddfflibmap.cc120 LibertyAst *best_cell = nullptr; in find_cell() local
211 if (best_cell != nullptr && num_pins == best_cell_pins && area > best_cell_area) in find_cell()
214 best_cell = cell; in find_cell()
222 if (best_cell != nullptr) { in find_cell()
224best_cell->args[0].c_str(), best_cell_noninv ? "non" : "", best_cell_pins, best_cell_area, cell_ty… in find_cell()
225 cell_mappings[cell_type].cell_name = RTLIL::escape_id(best_cell->args[0]); in find_cell()
232 LibertyAst *best_cell = nullptr; in find_cell_sr() local
319 if (best_cell != nullptr && num_pins == best_cell_pins && area > best_cell_area) in find_cell_sr()
322 best_cell = cell; in find_cell_sr()
330 if (best_cell != nullptr) { in find_cell_sr()
[all …]
/dports/math/igraph/igraph-0.9.5/src/isomorphism/bliss/
H A Dgraph.cc2891 return best_cell; in sh_first()
2916 return best_cell; in sh_first_smallest()
2941 return best_cell; in sh_first_largest()
3009 return best_cell; in sh_first_max_neighbours()
3083 return best_cell; in sh_first_smallest_max_neighbours()
3157 return best_cell; in sh_first_largest_max_neighbours()
4457 return best_cell; in sh_first()
4481 return best_cell; in sh_first_smallest()
4505 return best_cell; in sh_first_largest()
4553 return best_cell; in sh_first_max_neighbours()
[all …]
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/bliss-0.73/
H A Dgraph.cc3144 return best_cell; in sh_first()
3169 return best_cell; in sh_first_smallest()
3194 return best_cell; in sh_first_largest()
3262 return best_cell; in sh_first_max_neighbours()
3336 return best_cell; in sh_first_smallest_max_neighbours()
3410 return best_cell; in sh_first_largest_max_neighbours()
4983 return best_cell; in sh_first()
5007 return best_cell; in sh_first_smallest()
5031 return best_cell; in sh_first_largest()
5079 return best_cell; in sh_first_max_neighbours()
[all …]
/dports/math/R-cran-igraph/igraph/src/bliss/
H A Dgraph.cc3182 return best_cell; in sh_first()
3207 return best_cell; in sh_first_smallest()
3232 return best_cell; in sh_first_largest()
3300 return best_cell; in sh_first_max_neighbours()
3374 return best_cell; in sh_first_smallest_max_neighbours()
3448 return best_cell; in sh_first_largest_max_neighbours()
5016 return best_cell; in sh_first()
5040 return best_cell; in sh_first_smallest()
5064 return best_cell; in sh_first_largest()
5112 return best_cell; in sh_first_max_neighbours()
[all …]
/dports/math/bliss/bliss-0.73/
H A Dgraph.cc3187 return best_cell; in sh_first()
3212 return best_cell; in sh_first_smallest()
3237 return best_cell; in sh_first_largest()
3305 return best_cell; in sh_first_max_neighbours()
3379 return best_cell; in sh_first_smallest_max_neighbours()
3453 return best_cell; in sh_first_largest_max_neighbours()
5032 return best_cell; in sh_first()
5056 return best_cell; in sh_first_smallest()
5080 return best_cell; in sh_first_largest()
5128 return best_cell; in sh_first_max_neighbours()
[all …]
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/source/constraints/
H A Dedgecolouredgraph.hpp188 int best_cell = -1; in advise_branch() local
209 best_cell = i; in advise_branch()
216 return best_cell; in advise_branch()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/grid/
H A Dgrid_tools_dof_handlers.cc455 std::pair<active_cell_iterator, Point<dim>> best_cell; in find_active_cell_around_point() local
512 best_cell = std::make_pair(*cell, p_cell); in find_active_cell_around_point()
557 AssertThrow(best_cell.first.state() == IteratorState::valid, in find_active_cell_around_point()
560 return best_cell; in find_active_cell_around_point()
1281 std::pair<cell_iterator, Point<dim>> best_cell; in find_active_cell_around_point() local
1288 best_cell = find_active_cell_around_point( in find_active_cell_around_point()
1354 best_cell = std::make_pair(*cell, p_cell); in find_active_cell_around_point()
1391 AssertThrow(best_cell.first.state() == IteratorState::valid, in find_active_cell_around_point()
1394 return best_cell; in find_active_cell_around_point()
/dports/math/conauto/conauto-2.03/src/
H A Dseqpart.c89 uint16_t c, best_cell; in best_individualized_cell() local
101 best_cell = 0; in best_individualized_cell()
119 best_cell = c; in best_individualized_cell()
124 best_cell = c; in best_individualized_cell()
131 best_cell = c; in best_individualized_cell()
138 best_cell = c; in best_individualized_cell()
144 return best_cell; in best_individualized_cell()
/dports/russian/xruskb/xruskb-1.15.4/
H A Dxrus.c744 int best_cell=-1; in AddToWindowCache() local
754 if(best_cell==-1 || best_time>window_cache[i].time || window_cache[i].win==0) in AddToWindowCache()
756 best_cell=i; in AddToWindowCache()
760 window_cache[best_cell].time=t; in AddToWindowCache()
761 window_cache[best_cell].win=w; in AddToWindowCache()
/dports/cad/openroad/OpenROAD-2.0/src/rsz/src/
H A DResizer.cc1480 LibertyCell *best_cell = cell; in resizeToTargetSlew() local
1518 best_cell = target_cell; in resizeToTargetSlew()
1525 if (best_cell != cell) { in resizeToTargetSlew()
1529 best_cell->name()); in resizeToTargetSlew()
1530 if (replaceCell(inst, best_cell, true) in resizeToTargetSlew()