Home
last modified time | relevance | path

Searched refs:lower_edge (Results 1 – 23 of 23) sorted by relevance

/dports/biology/lamarc/lamarc-2.1.8/src/tree/
H A Dfc_status.cpp112 FC_Grid::iterator lower_edge(m_fc_grid.lower_bound(range_lower_index)); in Adjust_FC_Counts() local
117 if(lower_edge == m_fc_grid.end()) in Adjust_FC_Counts()
120lower_edge = m_fc_grid.insert(lower_edge, pair<const long int, long int>(range_lower_index, 0L)); in Adjust_FC_Counts()
148 else if(lower_edge->first == range_lower_index) in Adjust_FC_Counts()
177 branch_count = (--lower_edge)->second; in Adjust_FC_Counts()
178 ++lower_edge; // Reset iterator to value outside this conditional. in Adjust_FC_Counts()
183lower_edge = m_fc_grid.insert(lower_edge, pair<const long, long>(range_lower_index, branch_count)); in Adjust_FC_Counts()
311 for(FC_Grid::iterator node_iter(lower_edge); node_iter != upper_edge; ++node_iter) in Adjust_FC_Counts()
/dports/cad/tochnog/Sources/test/
H A Dexamp3.dat30 lower_edge geometry_line 1
43 lower_edge 5. 0. 10. 0. 0.01
46 all_edges -hole_edge -lower_edge -upper_edge -left_edge
48 bounda_unknown 0 -lower_edge -vely
H A Dexamp7.dat14 lower_edge geometry_polynomial 0
29 lower_edge -10.0 -10.0 +1.0 -100. +100. 0.01
33 all_edges -lower_edge -top_edge -left_edge -right_edge
H A Dtria6.dat18 lower_edge geometry_line 1
24 lower_edge 0. 0. 1. 0. 1.e-5
31 bounda_unknown 0 -lower_edge -velx -vely
H A Dtet10.dat22 lower_edge geometry_quadrilateral 1
28 lower_edge 0. 0. 0. 1. 0. 0. 0. 1. 0. 1. 1. 0. 1.e-5
35 bounda_unknown 0 -lower_edge -velx -vely -velz
H A Dho_mech3.dat16 lower_edge geometry_line 2
26 lower_edge -100 0 200 0 1.e-0
32 bounda_unknown 2 -lower_edge -velx -vely
H A Dho_mech2.dat16 lower_edge geometry_line 2
26 lower_edge 0 0 1 0 1.e-5
30 bounda_unknown 1 -lower_edge -vely
H A Ddiprisc1.dat38 lower_edge geometry_line 1
48 lower_edge 0. 0. 1. 0. 1.e-5
62 bounda_unknown 1 -lower_edge -vely
H A Dsilo1.dat17 lower_edge geometry_quadrilateral 0
30 lower_edge -10.0 -10.0 0.0 10. -10.0 0.0 -10.0 10. 0.0 10.0 10. 0.0 1.e-3
44 bounda_unknown 0 -lower_edge -velx -vely -velz
H A Dhypo4.dat35 lower_edge geometry_line 1
37 lower_edge 0.00 0.00 1.00 0.00 1.e-5
51 bounda_unknown 2 -lower_edge -vely
H A Dhypo3.dat35 lower_edge geometry_line 1
37 lower_edge 0.00 0.00 1.00 0.00 1.e-5
56 bounda_unknown 2 -lower_edge -vely
H A Dhypo2.dat35 lower_edge geometry_line 1
37 lower_edge 0.00 0.00 1.00 0.00 1.e-5
56 bounda_unknown 2 -lower_edge -vely
H A Dexamp22.dat36 lower_edge geometry_line 1
46 lower_edge 0. 0. 1. 0. 1.e-5
52 bounda_unknown 1 -lower_edge -vely
H A Dho_mech4.dat25 lower_edge geometry_quadrilateral 0
37 lower_edge -10.0 -10.0 0.0 10. -10.0 0.0 -10.0 10. 0.0 10.0 10. 0.0 1.e-3
58 bounda_unknown 0 -lower_edge -velx -vely -velz
/dports/games/vultures-eye/vulture-2.3.67/vulture/winclass/
H A Dscrollwin.cpp61 int lower_edge = 0; in get_scrollheight() local
68 lower_edge = winelem->y + winelem->h; in get_scrollheight()
69 max_y = (max_y > lower_edge) ? max_y : lower_edge; in get_scrollheight()
/dports/graphics/freeimage/FreeImage/Source/LibRawLite/internal/
H A Dwf_filtering.cpp1319 int lower_edge[4]; in wf_bayer4_igauss_filter() local
1324 lower_edge[i]=height_d2 + radius + padding; in wf_bayer4_igauss_filter()
1439 line_filtered[lower_edge[i]-1-j][i]+=line_filtered[lower_edge[i]+j][i]; in wf_bayer4_igauss_filter()
1580 int right_edge[4], lower_edge[4]; in wf_bayer4_block_filter() local
1849 lower_edge[i]=height_d2 + block_radius[f] + padding; in wf_bayer4_block_filter()
1857 line_block_filtered[lower_edge[i]-1-j][i]+=line_block_filtered[lower_edge[i]+j][i]; in wf_bayer4_block_filter()
/dports/science/py-libpysal/libpysal-4.5.1/libpysal/cg/
H A Dlocators.py653 lower_edge = LineSegment(Point((left, lower)), Point((right, lower)))
671 elif get_segments_intersect(edge, lower_edge):
/dports/lang/rust/rustc-1.58.1-src/library/alloc/src/collections/btree/
H A Dnavigate.rs267 let mut lower_edge = unsafe { Handle::new_edge(ptr::read(&node), lower_edge_idx) }; in find_leaf_edges_spanning_range() localVariable
270 match (lower_edge.force(), upper_edge.force()) { in find_leaf_edges_spanning_range()
273 (lower_edge, lower_child_bound) = in find_leaf_edges_spanning_range()
/dports/sysutils/vector/lucet-d4fc14a03bdb99ac83173d27fddf1aca48412a86/wasmtime/cranelift/codegen/src/machinst/
H A Dlower.rs408 fn lower_edge(&mut self, pred: Block, inst: Inst, succ: Block) -> CodegenResult<()> { in lower_edge() method
712 self.lower_edge(pred, inst, succ)?; in lower()
721 self.lower_edge(pred, inst, succ)?; in lower()
/dports/www/firefox/firefox-99.0/third_party/rust/cranelift-codegen/src/machinst/
H A Dlower.rs523 fn lower_edge(&mut self, pred: Block, inst: Inst, succ: Block) -> CodegenResult<()> { in lower_edge() method
968 self.lower_edge(pred, inst, succ)?; in lower()
978 self.lower_edge(pred, inst, succ)?; in lower()
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/cranelift-codegen/src/machinst/
H A Dlower.rs523 fn lower_edge(&mut self, pred: Block, inst: Inst, succ: Block) -> CodegenResult<()> { in lower_edge() method
968 self.lower_edge(pred, inst, succ)?; in lower()
978 self.lower_edge(pred, inst, succ)?; in lower()
/dports/lang/rust/rustc-1.58.1-src/vendor/cranelift-codegen/src/machinst/
H A Dlower.rs525 fn lower_edge(&mut self, pred: Block, inst: Inst, succ: Block) -> CodegenResult<()> { in lower_edge() method
974 self.lower_edge(pred, inst, succ)?; in lower()
984 self.lower_edge(pred, inst, succ)?; in lower()
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/cranelift-codegen/src/machinst/
H A Dlower.rs523 fn lower_edge(&mut self, pred: Block, inst: Inst, succ: Block) -> CodegenResult<()> { in lower_edge() method
968 self.lower_edge(pred, inst, succ)?; in lower()
978 self.lower_edge(pred, inst, succ)?; in lower()