/dports/mail/crm114/crm114-20100106-BlameMichelson.src/ |
H A D | crm_svm_matrix.h | 410 if (vit) { in vectorit_set_at_beg() 428 vit->nscurr = 0; in vectorit_set_at_beg() 479 if (vit) { in vectorit_set_at_end() 494 vit->nscurr = 0; in vectorit_set_at_end() 577 if (vit.nscurr >= 0 && vit.nscurr < v->dim) { in vectorit_curr_val() 686 if (vit) { in vectorit_prev() 695 vit->nscurr--; in vectorit_prev() 700 vit->ccurr = vit->ccurr->prev; in vectorit_prev() 706 vit->pcurr = vit->pcurr->prev; in vectorit_prev() 746 vit->ccurr = vit->ccurr->next; in vectorit_next() [all …]
|
H A D | crm_svm_matrix.c | 333 VectorIterator vit; in matr_set_col() local 938 vectorit_set_col(vit, vectorit_curr_col(vit, row) in matr_remove_zero_cols_sort() 2404 vitr = &vit; in vector_multiply() 3175 vectorit_set_col(vit, vectorit_curr_col(vit, v) - 1, v); in vector_remove_col() 4171 if (vit.nscurr >= 0 && vit.nscurr < v->dim) { in vectorit_set() 4228 if (vit) { in vectorit_zero_elt() 4432 if (vit) { in vectorit_insert() 4541 if (vit) { in vectorit_find() 4627 if (vit) { in vectorit_insert_before() 4750 if (vit) { in vectorit_insert_after() [all …]
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/objtools/test/objmgr/ |
H A D | test_seqvector_ci.cpp | 141 vit.SetPos(start); in x_TestIterate() 144 start = vit.GetPos(); in x_TestIterate() 153 --vit; --pos; in x_TestIterate() 188 start = vit.GetPos(); in x_TestGetData() 219 start = vit.GetPos(); in x_TestGetBufferPtr() 228 vit.SetPos(start); in x_TestGetBufferPtr() 231 if (vit.GetBufferPtr() + block_size != vit.GetBufferEnd(block_size)) { in x_TestGetBufferPtr() 238 vit += block_size; in x_TestGetBufferPtr() 356 for (vit.SetPos(0); vit; ++vit, ++c) { in Run() 366 for (vit.SetPos(0), c = data; vit; ) { in Run() [all …]
|
/dports/math/graphthing/graphthing-1.3.2/src/ |
H A D | graph2.cc | 59 for (vit = v_begin (); vit != v_end (); ++vit) in is_connected() 104 for (vit = v_begin (); vit != v_end (); ++vit) { in is_strongly_connected() 128 for (vit = v_begin (); vit != v_end (); ++vit) { in eulericity() 147 for (vit = v_begin (); vit != v_end (); ++vit) { in eulericity() 232 for (vit = v_begin (); vit != v_end (); ++vit) in mark_shortest_path() 238 for (vit = v_begin (); vit != v_end (); ++vit) in mark_shortest_path() 245 for (vit = v_begin (); vit != v_end (); ++vit) { in mark_shortest_path() 270 for (vit = v_begin (); vit != v_end (); ++vit) { in mark_shortest_path() 290 for (vit = v_begin (); vit != v_end (); ++vit) { in mark_shortest_path() 423 for (vit = v_begin (); vit != v_end (); ++vit) in bfs() [all …]
|
H A D | exporter.cc | 67 for (vit = g->v_begin (); vit != g->v_end (); ++vit) { in output() 68 Vertex *v = *vit; in output() 149 for (vit = g->v_begin (); vit != g->v_end (); ++vit) { in output() 192 for (vit = g->v_begin (); vit != g->v_end (); ++vit) { in output() 193 if (minx > (*vit)->x) in output() 194 minx = (*vit)->x; in output() 195 if (maxx < (*vit)->x) in output() 196 maxx = (*vit)->x; in output() 197 if (miny > (*vit)->y) in output() 198 miny = (*vit)->y; in output() [all …]
|
H A D | graph.cc | 25 for (vit = v_begin (); vit != v_end (); ++vit) in reindex() 26 Vmap[(*vit)->label] = *vit; in reindex() 45 for (vit = other.v_begin (); vit != other.v_end (); ++vit) { in Graph() 47 (*vit)->map_to = v; in Graph() 79 for (vit = g.v_begin (); vit != g.v_end (); ++vit) in operator <<() 80 o << **vit; in operator <<() 292 for (vit = v_begin (); vit != v_end (); ++vit) { in remove() 294 V.erase (vit); in remove() 470 for (vit = v_begin (); vit != v_end (); ++vit) in subgraph_marked() 498 for (vit = v_begin (); vit != v_end (); ++vit) { in line_graph() [all …]
|
/dports/games/bzflag-server/bzflag-2.4.22/src/bzfs/ |
H A D | EntryZones.cxx | 82 QPairList::iterator vit; in calculateQualifierLists() local 83 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in calculateQualifierLists() 90 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in calculateQualifierLists() 110 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getRandomPoint() 112 total += vit->second; in getRandomPoint() 117 if (vit == qPairList.end()) in getRandomPoint() 140 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getClosePoint() 171 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getZonePoint() 173 total += vit->second; in getZonePoint() 203 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getSafetyPoint() [all …]
|
/dports/games/bzflag/bzflag-2.4.22/src/bzfs/ |
H A D | EntryZones.cxx | 82 QPairList::iterator vit; in calculateQualifierLists() local 83 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in calculateQualifierLists() 90 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in calculateQualifierLists() 110 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getRandomPoint() 112 total += vit->second; in getRandomPoint() 117 if (vit == qPairList.end()) in getRandomPoint() 140 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getClosePoint() 171 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getZonePoint() 173 total += vit->second; in getZonePoint() 203 for (vit = qPairList.begin(); vit != qPairList.end(); ++vit) in getSafetyPoint() [all …]
|
/dports/graphics/dbow2/DBoW2-1.1-free-23-g3924753/src/ |
H A D | FeatureVector.cpp | 33 FeatureVector::iterator vit = this->lower_bound(id); in addFeature() local 35 if(vit != this->end() && vit->first == id) in addFeature() 37 vit->second.push_back(i_feature); in addFeature() 41 vit = this->insert(vit, FeatureVector::value_type(id, in addFeature() 43 vit->second.push_back(i_feature); in addFeature() 54 FeatureVector::const_iterator vit = v.begin(); in operator <<() local 56 const std::vector<unsigned int>* f = &vit->second; in operator <<() 58 out << "<" << vit->first << ": ["; in operator <<() 66 for(++vit; vit != v.end(); ++vit) in operator <<() 68 f = &vit->second; in operator <<() [all …]
|
H A D | BowVector.cpp | 36 BowVector::iterator vit = this->lower_bound(id); in addWeight() local 38 if(vit != this->end() && !(this->key_comp()(id, vit->first))) in addWeight() 40 vit->second += v; in addWeight() 44 this->insert(vit, BowVector::value_type(id, v)); in addWeight() 52 BowVector::iterator vit = this->lower_bound(id); in addIfNotExist() local 54 if(vit == this->end() || (this->key_comp()(id, vit->first))) in addIfNotExist() 56 this->insert(vit, BowVector::value_type(id, v)); in addIfNotExist() 90 BowVector::const_iterator vit; in operator <<() local 93 for(vit = v.begin(); vit != v.end(); ++vit, ++i) in operator <<() 95 out << "<" << vit->first << ", " << vit->second << ">"; in operator <<()
|
/dports/science/openbabel/openbabel-3.1.1/src/formats/ |
H A D | cacaoformat.cpp | 224 vit[1]->_a = &dummy1; in SetHilderbrandt() 225 vit[1]->_b = &dummy2; in SetHilderbrandt() 244 if ((r < sum) && (vit[j]->_a != a2) && (vit[j]->_b != a2)) in SetHilderbrandt() 254 vit[i]->_b = vit[vit[i]->_a->GetIdx()]->_a; in SetHilderbrandt() 258 if (vit[i]->_b && vit[i]->_b->GetIdx()) in SetHilderbrandt() 259 vit[i]->_c = vit[vit[i]->_b->GetIdx()]->_b; in SetHilderbrandt() 269 a = vit[i]->_a; in SetHilderbrandt() 270 b = vit[i]->_b; in SetHilderbrandt() 271 c = vit[i]->_c; in SetHilderbrandt() 280 vit[i]->_dst = (vit[i]->_a->GetVector() - atom->GetVector()).length(); in SetHilderbrandt() [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/HighOrderMeshOptimizer/ |
H A D | HighOrderMeshPeriodicity.cpp | 74 for(vit = vertS2M.begin(); vit != vertS2M.end(); ++vit) { in _relocateMasterVertices() 77 SPoint3 p = _transform(vit->first, tfo); in _relocateMasterVertices() 90 for(vit = pointS2M.begin(); vit != pointS2M.end(); ++vit) { in _relocateMasterVertices() 93 SPoint3 p = _transform(vit->first, tfo); in _relocateMasterVertices() 133 for(vit = vertS2M.begin(); vit != vertS2M.end(); ++vit) { in _relocateMasterVertices() 136 SPoint3 gp = _transform(vit->first, tfo); in _relocateMasterVertices() 142 for(vit = pointS2M.begin(); vit != pointS2M.end(); ++vit) { in _relocateMasterVertices() 198 for(vit = vertS2M.begin(); vit != vertS2M.end(); ++vit) { in _copyBackMasterVertices() 214 for(vit = pointS2M.begin(); vit != pointS2M.end(); ++vit) { in _copyBackMasterVertices() 241 for(vit = vertS2M.begin(); vit != vertS2M.end(); ++vit) { in _copyBackMasterVertices() [all …]
|
/dports/games/cataclysm-dda-tiles/Cataclysm-DDA-0.F/src/ |
H A D | vitamin.cpp | 53 vitamin vit; in load_vitamin() local 55 vit.id_ = vitamin_id( jo.get_string( "id" ) ); in load_vitamin() 56 jo.read( "name", vit.name_ ); in load_vitamin() 57 vit.deficiency_ = efftype_id::NULL_ID(); in load_vitamin() 58 jo.read( "deficiency", vit.deficiency_ ); in load_vitamin() 59 vit.excess_ = efftype_id::NULL_ID(); in load_vitamin() 60 jo.read( "excess", vit.excess_ ); in load_vitamin() 61 vit.min_ = jo.get_int( "min" ); in load_vitamin() 62 vit.max_ = jo.get_int( "max", 0 ); in load_vitamin() 79 vit.flags_.insert( e ); in load_vitamin() [all …]
|
H A D | stomach.cpp | 20 const vitamin_id &vit = vit_pair.first; in min_in_place() local 21 int other = r.get_vitamin( vit ); in min_in_place() 23 vitamins.erase( vit ); in min_in_place() 38 int other = r.get_vitamin( vit ); in max_in_place() 40 int &val = vitamins[vit]; in max_in_place() 48 auto it = vitamins.find( vit ); in get_vitamin() 69 if( get_vitamin( vit ) != r.get_vitamin( vit ) ) { in operator ==() 80 vitamins[vit.first] += vit.second; in operator +=() 89 vitamins[vit.first] -= vit.second; in operator -=() 98 vit.second *= r; in operator *=() [all …]
|
/dports/games/cataclysm-dda/Cataclysm-DDA-0.F/src/ |
H A D | vitamin.cpp | 53 vitamin vit; in load_vitamin() local 55 vit.id_ = vitamin_id( jo.get_string( "id" ) ); in load_vitamin() 56 jo.read( "name", vit.name_ ); in load_vitamin() 57 vit.deficiency_ = efftype_id::NULL_ID(); in load_vitamin() 58 jo.read( "deficiency", vit.deficiency_ ); in load_vitamin() 59 vit.excess_ = efftype_id::NULL_ID(); in load_vitamin() 60 jo.read( "excess", vit.excess_ ); in load_vitamin() 61 vit.min_ = jo.get_int( "min" ); in load_vitamin() 62 vit.max_ = jo.get_int( "max", 0 ); in load_vitamin() 79 vit.flags_.insert( e ); in load_vitamin() [all …]
|
H A D | stomach.cpp | 20 const vitamin_id &vit = vit_pair.first; in min_in_place() local 21 int other = r.get_vitamin( vit ); in min_in_place() 23 vitamins.erase( vit ); in min_in_place() 38 int other = r.get_vitamin( vit ); in max_in_place() 40 int &val = vitamins[vit]; in max_in_place() 48 auto it = vitamins.find( vit ); in get_vitamin() 69 if( get_vitamin( vit ) != r.get_vitamin( vit ) ) { in operator ==() 80 vitamins[vit.first] += vit.second; in operator +=() 89 vitamins[vit.first] -= vit.second; in operator -=() 98 vit.second *= r; in operator *=() [all …]
|
/dports/math/igraph/igraph-0.9.5/examples/simple/ |
H A D | igraph_vs_nonadj.c | 30 igraph_vit_t vit; in main() local 38 igraph_vit_create(&g, vs, &vit); in main() 39 while (!IGRAPH_VIT_END(vit)) { in main() 40 printf("%li ", (long int) IGRAPH_VIT_GET(vit)); in main() 41 IGRAPH_VIT_NEXT(vit); in main() 45 igraph_vit_destroy(&vit); in main() 52 igraph_vit_create(&g, vs, &vit); in main() 53 while (!IGRAPH_VIT_END(vit)) { in main() 54 printf("%li ", (long int) IGRAPH_VIT_GET(vit)); in main() 55 IGRAPH_VIT_NEXT(vit); in main() [all …]
|
H A D | igraph_vs_vector.c | 33 igraph_vit_t vit; in main() local 49 igraph_vit_create(&g, igraph_vss_vector(&v2), &vit); in main() 52 while (!IGRAPH_VIT_END(vit)) { in main() 53 if (IGRAPH_VIT_GET(vit) != VECTOR(v2)[i]) { in main() 56 IGRAPH_VIT_NEXT(vit); in main() 63 igraph_vit_destroy(&vit); in main() 69 igraph_vit_create(&g, vs, &vit); in main() 72 for (; !IGRAPH_VIT_END(vit); IGRAPH_VIT_NEXT(vit)) { in main() 73 printf("%li ", (long int) IGRAPH_VIT_GET(vit)); in main() 77 igraph_vit_destroy(&vit); in main()
|
/dports/audio/rosegarden/rosegarden-21.06.1/src/document/io/ |
H A D | LilyPondSegmentsContext.cpp | 59 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in ~LilyPondSegmentsContext() 105 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 148 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 163 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 204 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 259 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 267 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 295 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 309 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() 322 for (vit = tit->second.begin(); vit != tit->second.end(); ++vit) { in precompute() [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/volm/ |
H A D | volm_osm_objects.cxx | 40 for (auto vit = curr_keys.begin(); (vit != curr_keys.end() && !pier_found); ++vit) { in volm_osm_objects() local 41 if (vit->first == "man_made" && vit->second == "pier") { in volm_osm_objects() 52 for (auto vit = curr_keys.begin(); (vit != curr_keys.end() && !found); ++vit) { in volm_osm_objects() local 69 for (auto vit = curr_keys.begin(); (vit != curr_keys.end() && !pier_found); ++vit) { in volm_osm_objects() local 70 if (vit->first == "man_made" && vit->second == "pier") { in volm_osm_objects() 81 for (auto vit = curr_keys.begin(); (vit != curr_keys.end() && !found); ++vit) { in volm_osm_objects() local 97 for (auto vit = curr_keys.begin(); (vit != curr_keys.end() && !pier_found); ++vit) { in volm_osm_objects() local 98 if (vit->first == "man_made" && vit->second == "pier") { in volm_osm_objects() 108 for (auto vit = curr_keys.begin(); (vit != curr_keys.end() && !found); ++vit) { in volm_osm_objects() local 270 if (vit == pt_ids_.end()) in add_pt() [all …]
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/tools/ |
H A D | compareFiles.cpp | 80 for (Range::iterator vit=nodes.begin(); vit!=nodes.end(); vit++) in main() local 82 vGidHandle[gids[i++]] = *vit; in main() 88 for (Range::iterator vit=edges.begin(); vit!=edges.end(); vit++) in main() local 90 eGidHandle[gids[i++]] = *vit; in main() 96 for (Range::iterator vit=cells.begin(); vit!=cells.end(); vit++) in main() local 98 cGidHandle[gids[i++]] = *vit; in main() 124 for (Range::iterator vit=nodes2.begin(); vit!=nodes2.end(); vit++) in main() local 126 vGidHandle2[gids[i++]] = *vit; in main() 132 for (Range::iterator vit=edges2.begin(); vit!=edges2.end(); vit++) in main() local 134 eGidHandle2[gids[i++]] = *vit; in main() [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bvxm/grid/tests/ |
H A D | test_voxel_storage_mem.cxx | 29 bvxm_voxel_slab<float>::iterator vit; in test_voxel_storage_mem() local 30 for (vit = slab.begin(); vit != slab.end(); vit++, count++) { in test_voxel_storage_mem() 31 if (*vit != init_val) { in test_voxel_storage_mem() 38 *vit = static_cast<float>(count); in test_voxel_storage_mem() 49 bvxm_voxel_slab<float>::iterator vit; in test_voxel_storage_mem() local 50 for (vit = slab.begin(); vit != slab.end(); vit++, count++) { in test_voxel_storage_mem() 51 if (*vit != static_cast<float>(count)) { in test_voxel_storage_mem()
|
H A D | test_voxel_storage_slab_mem.cxx | 31 bvxm_voxel_slab<float>::iterator vit; in test_voxel_storage_slab_mem() local 32 for (vit = slab.begin(); vit != slab.end(); vit++, cnt++) { in test_voxel_storage_slab_mem() 33 if (*vit != init_val) { in test_voxel_storage_slab_mem() 40 *vit = static_cast<float>(cnt); in test_voxel_storage_slab_mem() 51 bvxm_voxel_slab<float>::iterator vit; in test_voxel_storage_slab_mem() local 52 for (vit = slab.begin(); vit != slab.end(); vit++, cnt++) { in test_voxel_storage_slab_mem() 53 if (*vit != static_cast<float>(cnt)) { in test_voxel_storage_slab_mem()
|
/dports/math/igraph/igraph-0.9.5/src/properties/ |
H A D | neighborhood.c | 77 igraph_vit_t vit; in igraph_neighborhood_size() local 99 IGRAPH_FINALLY(igraph_vit_destroy, &vit); in igraph_neighborhood_size() 103 for (i = 0; !IGRAPH_VIT_END(vit); IGRAPH_VIT_NEXT(vit), i++) { in igraph_neighborhood_size() 104 long int node = IGRAPH_VIT_GET(vit); in igraph_neighborhood_size() 152 igraph_vit_destroy(&vit); in igraph_neighborhood_size() 208 igraph_vit_t vit; in igraph_neighborhood() local 236 for (i = 0; !IGRAPH_VIT_END(vit); IGRAPH_VIT_NEXT(vit), i++) { in igraph_neighborhood() 295 igraph_vit_destroy(&vit); in igraph_neighborhood() 355 igraph_vit_t vit; in igraph_neighborhood_graphs() local 383 for (i = 0; !IGRAPH_VIT_END(vit); IGRAPH_VIT_NEXT(vit), i++) { in igraph_neighborhood_graphs() [all …]
|
/dports/math/cgal/CGAL-5.3/demo/Triangulation_3/ |
H A D | Scene.cpp | 55 for(vertices_iterator vit=m_dt.finite_vertices_begin(); in generatePoints() local 56 vit!=m_dt.finite_vertices_end(); ++vit) { in generatePoints() 57 m_vhArray.push_back( vit ); in generatePoints() 117 for(vertices_iterator vit=m_dt.finite_vertices_begin(); in loadPointsOFF() local 118 vit!=m_dt.finite_vertices_end(); ++vit) { in loadPointsOFF() 119 m_vhArray.push_back( vit ); in loadPointsOFF() 148 for(vertices_iterator vit=m_dt.finite_vertices_begin(); in loadPointsXYZ() local 149 vit!=m_dt.finite_vertices_end(); ++vit) { in loadPointsXYZ() 150 m_vhArray.push_back( vit ); in loadPointsXYZ() 184 vit!=m_dt.finite_vertices_end(); ++vit) { in savePointsOFF() [all …]
|