/dports/cad/gmsh/gmsh-4.9.2-source/Mesh/ |
H A D | BackgroundMeshTools.cpp | 15 static double max_surf_curvature(const GEdge *ge, double u) in max_surf_curvature() 33 for(auto ite = l_edges.begin(); ite != l_edges.end(); ++ite) { in max_edge_curvature() local 76 SMetric3 max_edge_curvature_metric(const GEdge *ge, double u) in max_edge_curvature_metric() 90 static SMetric3 metric_based_on_surface_curvature(const GEdge *ge, double u, in metric_based_on_surface_curvature() 158 double a = (U - range.low()) / (range.high() - range.low()); in LC_MVertex_PNTS() local 172 SVector3 a; in buildMetricTangentToCurve() local 353 for(auto ite = l_edges.begin(); ite != l_edges.end(); ++ite) { in max_edge_curvature_metric() local 381 SMetric3 metric_based_on_surface_curvature(const GFace *gf, double u, double v, in metric_based_on_surface_curvature()
|
H A D | meshGFace.cpp | 50 double a = robustPredicates::orient2d(p1, p2, p); in pointInsideParametricDomain() local 159 double u = 0.; in _subdivide() local 213 double u = 0.; in _subdivide() local 247 auto ite = edges.begin(); in _restore() local 841 auto ite = edges.begin(); in modifyInitialMeshForBoundaryLayers() local 1355 int a = doc.triangles[i].a; in meshGenerator() local 1405 int a = he->v->data; in meshGenerator() local 1604 double u; in meshGenerator() local 1865 double u; in buildConsecutiveListOfVertices() local 2037 double u; in buildConsecutiveListOfVertices() local [all …]
|
H A D | meshGFaceBDS.cpp | 170 auto ite = p->edges.end(); in neighboringModified() local 259 static bool edges_sort(std::pair<double, BDS_Edge *> a, in edges_sort() 276 static bool middlePoint(GFace *gf, BDS_Edge *e, double &u, double &v) in middlePoint() 610 auto ite = (*itp)->edges.end(); in computeNodalSizes() local 672 auto ite = pts[i]->edges.end(); in computeNodalSizes() local
|
H A D | meshGFaceOptimize.cpp | 107 double a[3] = {p1->x() - p2->x(), p1->y() - p2->y(), p1->z() - p2->z()}; in edge_angle() local 117 double a[3] = {p1->x() - p2->x(), p1->y() - p2->y(), p1->z() - p2->z()}; in edge_angle() local 201 auto ite = embedded_edges.begin(); in buildMeshGenerationDataStructures() local 215 auto ite = _edges.begin(); in buildMeshGenerationDataStructures() local 486 double u[4], v[4]; in surfaceFaceUV() local 1008 auto ite = emb_edges.begin(); in _recombineIntoQuads() local 1028 auto ite = _edges.begin(); in _recombineIntoQuads() local
|
/dports/math/minizinc/libminizinc-2.5.5/lib/ |
H A D | eval_par.cpp | 502 ITE* ite = e->cast<ITE>(); in eval_array_lit() local 711 ITE* ite = e->cast<ITE>(); in eval_intset() local 875 ITE* ite = e->cast<ITE>(); in eval_floatset() local 1009 ITE* ite = e->cast<ITE>(); in eval_bool() local 1362 ITE* ite = e->cast<ITE>(); in eval_boolset() local 1503 ITE* ite = e->cast<ITE>(); in eval_int() local 1641 ITE* ite = e->cast<ITE>(); in eval_float() local 1769 ITE* ite = e->cast<ITE>(); in eval_string() local 1968 ITE* ite = e->cast<ITE>(); in eval_par() local 2658 void vITE(const ITE& ite) { in vITE() [all …]
|
/dports/math/yices/yices-2.6.2/src/context/ |
H A D | context.c | 96 eterm_t u; in make_egraph_variable() local 130 eterm_t u; in translate_arithvar_to_eterm() local 147 eterm_t u; in translate_bvvar_to_eterm() local 183 occ_t u; in translate_code_to_eterm() local 268 eterm_t u; in map_apply_to_eterm() local 300 eterm_t u; in skolem_tuple() local 515 eterm_t u; in map_ite_to_eterm() local 2494 occ_t u; in internalize_to_eterm() local 2749 occ_t u; in internalize_to_arith() local 2914 occ_t u; in internalize_to_bv() local [all …]
|
H A D | conditional_definitions.c | 71 static bool harray_is_sorted(harray_t *a) { in harray_is_sorted() 211 void **a; in bool_vars_of_composite() local 654 term_t t, u; in cond_def_explore_or() local 708 static void cond_def_explore_ite(cond_def_collector_t *c, composite_term_t *ite, bool polarity) { in cond_def_explore_ite() 729 term_t x, a; in cond_def_explore() local 860 composite_term_t *ite; in truth_tbl_of_ite() local 1065 static bool arith_lt(term_table_t *tbl, term_t t, term_t u) { in arith_lt() 1089 static void add_le_atom(context_t *ctx, term_t t, term_t u) { in add_le_atom() 1091 term_t a; in add_le_atom() local 1234 term_t a; in make_pseudo_product() local [all …]
|
/dports/print/scribus-devel/scribus-1.5.7/scribus/plugins/import/pdf/ |
H A D | slaoutput.cpp | 35 QPainterPath intersection(QPainterPath const &a, QPainterPath const &b) in intersection() 860 for (int a = 1; a < co; a++) local 1367 for (int a = 0; a < refList.count(); a++) local 1530 PageItem *ite; local 2192 int u, v; local 2311 PageItem *ite; local 2353 PageItem *ite; local 3388 PageItem *ite; local 3444 PageItem *ite; local 3808 Unicode u; local [all …]
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/term/ |
H A D | SuTermVector.cpp | 54 SuTermVector::SuTermVector(const string_t& na, const Unknown* u, Space* sp, in SuTermVector() 164 Vector<real_t>::iterator ite = entries_p->rEntries_p->begin(); in SuTermVector() local 169 Vector<complex_t>::iterator ite = entries_p->cEntries_p->begin(); in SuTermVector() local 205 Vector<real_t>::iterator ite = entries_p->rEntries_p->begin(); in SuTermVector() local 210 Vector<complex_t>::iterator ite = entries_p->cEntries_p->begin(); in SuTermVector() local 885 Vector<real_t>::iterator ite = entries_p->rEntries_p->begin(); in initFromFunction() local 902 Vector<Vector<real_t> >::iterator ite = entries_p->rvEntries_p->begin(); in initFromFunction() local 922 Vector<complex_t>::iterator ite = entries_p->cEntries_p->begin(); in initFromFunction() local 1109 Vector<real_t>::iterator ite = entries_p->rEntries_p->begin(); in SuTermVector() local 1153 Vector<complex_t>::iterator ite = entries_p->cEntries_p->begin(); in SuTermVector() local [all …]
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/ |
H A D | ng_misc_opt.cpp | 92 for (auto it = ordering.rbegin(), ite = ordering.rend(); it != ite; ++it) { in findCandidates() local 107 for (auto u : inv_adjacent_vertices_range(v, g)) { in findCandidates() local 123 for (auto it = ordering.begin(), ite = ordering.end(); it != ite; ++it) { in findCandidates_rev() local 138 for (auto u : adjacent_vertices_range(v, g)) { in findCandidates_rev() local 155 for (auto u : inv_adjacent_vertices_range(v, g)) { in predCRIntersection() local 166 for (auto u : adjacent_vertices_range(v, g)) { in succCRIntersection() local 193 NFAVertex u = *it; in findSustainSet() local 225 NFAVertex u = *it; in findSustainSet_rev() local 627 bool pruneUsingSuccessors(NGHolder &g, PrunePathsInfo &info, NFAVertex u, in pruneUsingSuccessors() 648 [&](NFAVertex a, NFAVertex b) { in pruneUsingSuccessors()
|
H A D | ng_repeat.cpp | 100 auto u = source(e, *g), v = target(e, *g); in operator ()() local 181 for (auto u : inv_adjacent_vertices_range(v, g)) { in roguePredecessor() local 234 NFAVertex u = source(e, g); in hasDifferentTops() local 263 for (auto u : inv_adjacent_vertices_range(v, g)) { in vertexIsBad() local 446 void add(const DistanceSet &a) { in add() 451 void add_incremented(const DistanceSet &a) { in add_incremented() 966 for (auto it = rsi.vertices.begin(), ite = rsi.vertices.end(); it != ite; in peelSubgraph() local 982 for (auto it = rsi.vertices.rbegin(), ite = rsi.vertices.rend(); it != ite; in peelSubgraph() local 1132 NFAVertex u = g.start; in buildTriggerStates() local 1582 const NFAVertex u = rsi.vertices.back(); in leadsOnlyToAccept() local [all …]
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/rose/ |
H A D | rose_build_add_mask.cpp | 334 auto ite = mask.end() - delay; in buildLiteralMask() local 429 for (auto it = lit.rbegin(), ite = lit.rend(); it != ite; ++it) { in maskIsNeeded() local 434 for (auto u : inv_adjacent_vertices_range(v, g)) { in maskIsNeeded() local 448 for (auto u : inv_adjacent_vertices_range(v, g)) { in maskIsNeeded() local 577 NFAVertex u = add_vertex(h); in buildMaskRhs() local 624 RoseInVertex u in doAddMask() local 662 RoseInVertex a = in doAddMask() local 667 RoseInVertex a in doAddMask() local 757 NFAVertex u = g.start; in makeAnchoredGraph() local
|
H A D | rose_build_merge.cpp | 157 const RoseGroup &a = *this; in operator <() local 814 for (auto u : preds) { in checkPredDelays() local 881 for (auto a : verts1) { in mergeableRoseVertices() local 893 for (auto a : verts2) { in mergeableRoseVertices() local 1050 for (auto a : targets_1) { in checkVerticesOkForLeftfixMerge() local 1058 for (auto a : targets_2) { in checkVerticesOkForLeftfixMerge() local 1100 for (RoseVertex u : u_verts) { in goodBlockModeMerge() local 1303 const MergeKey &a = *this; in operator <() local 1718 u32 u = findUnusedTop(tops2); in setDistinctTops() local 2326 for (auto it = begin(nfas), ite = end(nfas); it != ite; ++it) { in chunkedNfaMerge() local [all …]
|
H A D | rose_build_misc.cpp | 110 for (auto u : inv_adjacent_vertices_range(v, g)) { in isRootSuccessor() local 119 for (auto u : inv_adjacent_vertices_range(v, g)) { in isNonRootSuccessor() local 246 size_t maxOverlap(const ue2_literal &a, const ue2_literal &b, u32 b_delay) { in maxOverlap() 280 size_t maxOverlap(const rose_literal_id &a, const rose_literal_id &b) { in maxOverlap() 312 size_t RoseBuildImpl::maxLiteralOverlap(RoseVertex u, RoseVertex v) const { in maxLiteralOverlap() 413 ue2_literal::const_reverse_iterator it = s.rbegin(), ite = s.rend(); in normaliseLiteralMask() local 499 bool operator<(const RoseEdgeProps &a, const RoseEdgeProps &b) { in operator <() 567 const RoseSuffixInfo &a = *this; in operator <() local 923 const auto u = source(e, g); in canEagerlyReportAtEod() local
|
H A D | rose_build_matchers.cpp | 93 for (auto u : inv_adjacent_vertices_range(h.accept, h)) { in maskFromLeftGraph() local 209 RoseVertex u = source(e, g); in maskFromPreds() local 225 ue2_literal::const_iterator it, ite; in maskFromPreds() local 465 bool isNoRunsVertex(const RoseBuildImpl &build, RoseVertex u) { in isNoRunsVertex() 867 void MatcherProto::insert(const MatcherProto &a) { in insert()
|
/dports/math/yices/yices-2.6.2/src/model/ |
H A D | literal_collector.c | 109 term_t u; in lit_collector_find_cached_term() local 349 term_t u; in register_atom() local 642 term_t *a; in lit_collector_visit_distinct() local 818 static term_t lit_collector_visit_ite(lit_collector_t *collect, term_t t, composite_term_t *ite) { in lit_collector_visit_ite() 840 term_t *a; in lit_collector_visit_app() local 866 term_t *a; in lit_collector_visit_update() local 888 term_t *a; in lit_collector_visit_tuple() local 956 term_t *a; in lit_collector_visit_bvarray() local 1175 term_t *a; in lit_collector_visit_pprod() local 1195 term_t *a; in lit_collector_visit_poly() local [all …]
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/geometry/ |
H A D | GeomElement.cpp | 508 std::vector<std::vector<number_t> >::iterator ite; in splitP1() local 841 real_t a=pointDistance(*nodes[0], *nodes[1]), a1=pointDistance(*nodes[2], *nodes[3]); in characteristicSize() local 1080 real_t a=dot(p01,p0)/norm2(p01); in contains() local 1086 Point u=crossProduct(n10,n20); in contains() local 1091 real_t a= dot(crossProduct(p0,n20),u)/ nu; in contains() local 1107 std::vector<MeshElement*>::iterator ite=eltsP1.begin(); in contains() local 1140 std::vector<MeshElement*>::iterator ite=eltsP1.begin(); in projection() local 1174 std::vector<std::vector<number_t> >::iterator ite; in splitP1() local
|
/dports/math/yices/yices-2.6.2/tests/unit/ |
H A D | test_truth_tables.c | 38 static bool array_is_sorted(term_t *a, uint32_t n) { in array_is_sorted() 177 composite_term_t *ite; in truth_tbl_of_ite() local 418 term_t t, u; in ttbl_test_triple() local
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfa/ |
H A D | castlecompile.cpp | 117 bool literalOverlap(const vector<CharReach> &a, const vector<CharReach> &b, in literalOverlap() 357 for (auto it = proto.repeats.begin(), ite = proto.repeats.end(); in buildSubcastles() local 481 for (auto it = proto.repeats.begin(), ite = proto.repeats.end(); in buildCastle() local 834 ite = c1.repeats.end(), in is_equal() local 902 NFAVertex u = g.start; in addToHolder() local
|
/dports/cad/gmsh/gmsh-4.9.2-source/demos/api/ |
H A D | adapt_mesh.cpp | 58 double a = _nodes[0]->distance(*_nodes[1]); in maxEdge() local 134 std::complex<double> a = in operator ()() local 163 double u = e->qu()[i], v = e->qv()[i], w = e->qw()[i]; in computeInterpolationError() local 179 double a = 2.; in computeSizeField() local 194 std::map<std::size_t, myElement *>::const_iterator ite = in computeSizeField() local
|
/dports/multimedia/libxine/xine-lib-1.2.11/src/xine-engine/ |
H A D | xine.c | 740 unsigned int u; in stop_internal() local 870 unsigned int u; in close_internal() local 1235 unsigned int u; in xine_side_dispose_internal() local 2072 unsigned int u; in play_internal() local 2361 xine_list_iterator_t ite = xine_list_find (xine->streams, stream); in xine_dispose_internal() local 2416 unsigned int u; in xine_dispose() local 2455 xine_list_iterator_t ite; in xine_exit() local 2644 xine_list_iterator_t ite; in config_save_cb() local 3098 #define RATIO_LIKE(a, b) ((b) - 1 <= (a) && (a) <= 1 + (b)) in _x_get_current_frame_data() argument 3685 int d, a = 0, e = stream->index.used, m = e >> 1, l; in xine_keyframes_find() local [all …]
|
H A D | load_plugins.c | 112 #define __Max(a,b) ((a) > (b) ? (a) : (b)) argument 185 fat_node_t *a = a_gen, *b = b_gen; in _fat_node_file_cmp() local 199 xine_sarray_t *a, *list; in _build_list_typed_plugins() local 262 xine_list_iterator_t ite = NULL; in _free_string_list() local 587 static int _plugin_node_comparator(void *a, void *b) { in _plugin_node_comparator() 1224 xine_list_iterator_t ite = NULL; in save_plugin_list() local 1467 unsigned int u; in load_plugin_list() member 2833 xine_list_iterator_t ite = NULL; in _display_file_plugin_list() local 3103 xine_list_iterator_t ite = NULL; in GET_PLUGIN_DESC() local 3112 xine_list_iterator_t ite = NULL; in GET_PLUGIN_DESC() local [all …]
|
/dports/math/cvc3/cvc3-2.4.1/src/search/ |
H A D | search_theorem_producer.cpp | 85 Proof u; // proof label for !aLFSCL in proofByContradiction() local 113 Expr a(not_a[0]); in negIntro() local 118 Proof u; // proof label for 'a' in negIntro() local 246 vector<Proof> u; // Vector of proof labels in conflictClause() local 755 Assumptions a; in confAndrAF() local 854 Assumptions a; in confIffr() local 899 Assumptions a; in propIterIte() local 943 Assumptions a; in propIterIfThen() local 986 Assumptions a; in propIterThen() local 1032 Assumptions a; in confIterThenElse() local [all …]
|
/dports/math/yices/yices-2.6.2/src/terms/ |
H A D | term_manager.c | 1209 term_t *a; in mk_bvconst64_ite() local 1233 term_t *a; in mk_bvconst_ite() local 1297 term_t *a; in check_ite_bvconst64() local 1324 term_t *a; in check_ite_bvconst() local 1351 term_t *a; in check_ite_bvarray() local 1460 term_t ite, aux; in mk_bveq_ite() local 1741 term_t ite; in mk_integer_polynomial_ite() local 1807 term_t ite; in mk_offset_ite() local 4799 bvconst64_term_t *u; in term_is_bvzero() local 4931 bvconst64_term_t *u; in term_is_bvashr_invariant() local [all …]
|
/dports/devel/hyperscan/hyperscan-5.4.0/util/ |
H A D | ng_find_matches.cpp | 82 for (auto u : cur) { in gatherSuccessorsByDepth() local 126 for (auto u : inv_adjacent_vertices_range(v, g)) { in gatherPredecessorsByDepth() local 752 bool operator<(const StateSet::State &a, const StateSet::State &b) { in operator <() 760 bool operator==(const StateSet::State &a, const StateSet::State &b) { in operator ==() 913 auto u = state.vertices[cur.idx]; in getAcceptMatches() local 963 auto u = state.vertices[cur.idx]; in step() local 1118 for (auto it = input.begin(), ite = input.end(); it != ite; ++it) { in findMatches() local
|