/dports/net/openldap26-client/openldap-2.6.0/contrib/slapd-modules/variant/ |
H A D | variant.c | 258 *veip = vei; in variant_find_config() 269 *veip = vei; in variant_find_config() 600 rc = variant_build_entry( op, vei, &vei->dn, &e, 0, NULL ); in variant_op_search() 852 if ( !vei ) { in variant_set_dn() 854 vei->ov = ov; in variant_set_dn() 895 if ( !vei ) { in variant_set_regex() 897 vei->ov = ov; in variant_set_regex() 919 if ( regcomp( vei->regex, vei->dn.bv_val, REG_EXTENDED ) ) { in variant_set_regex() 1147 ch_free( vei ); in variant_ldadd_cleanup() 1175 vei->ov = ov; in variant_ldadd() [all …]
|
/dports/net/openldap26-server/openldap-2.6.0/contrib/slapd-modules/variant/ |
H A D | variant.c | 258 *veip = vei; in variant_find_config() 269 *veip = vei; in variant_find_config() 600 rc = variant_build_entry( op, vei, &vei->dn, &e, 0, NULL ); in variant_op_search() 852 if ( !vei ) { in variant_set_dn() 854 vei->ov = ov; in variant_set_dn() 895 if ( !vei ) { in variant_set_regex() 897 vei->ov = ov; in variant_set_regex() 919 if ( regcomp( vei->regex, vei->dn.bv_val, REG_EXTENDED ) ) { in variant_set_regex() 1147 ch_free( vei ); in variant_ldadd_cleanup() 1175 vei->ov = ov; in variant_ldadd() [all …]
|
/dports/net/openldap25-client/openldap-2.5.9/contrib/slapd-modules/variant/ |
H A D | variant.c | 258 *veip = vei; in variant_find_config() 269 *veip = vei; in variant_find_config() 600 rc = variant_build_entry( op, vei, &vei->dn, &e, 0, NULL ); in variant_op_search() 852 if ( !vei ) { in variant_set_dn() 854 vei->ov = ov; in variant_set_dn() 896 if ( !vei ) { in variant_set_regex() 898 vei->ov = ov; in variant_set_regex() 921 if ( regcomp( vei->regex, vei->dn.bv_val, REG_EXTENDED ) ) { in variant_set_regex() 1156 ch_free( vei ); in variant_ldadd_cleanup() 1184 vei->ov = ov; in variant_ldadd() [all …]
|
/dports/net/openldap25-server/openldap-2.5.9/contrib/slapd-modules/variant/ |
H A D | variant.c | 258 *veip = vei; in variant_find_config() 269 *veip = vei; in variant_find_config() 600 rc = variant_build_entry( op, vei, &vei->dn, &e, 0, NULL ); in variant_op_search() 852 if ( !vei ) { in variant_set_dn() 854 vei->ov = ov; in variant_set_dn() 896 if ( !vei ) { in variant_set_regex() 898 vei->ov = ov; in variant_set_regex() 921 if ( regcomp( vei->regex, vei->dn.bv_val, REG_EXTENDED ) ) { in variant_set_regex() 1156 ch_free( vei ); in variant_ldadd_cleanup() 1184 vei->ov = ov; in variant_ldadd() [all …]
|
/dports/devel/vcglib/vcglib-2020.09/vcg/simplex/edge/ |
H A D | topology.h | 59 while(!vei.End()) in VVStarVE() 62 ++vei; in VVStarVE() 71 while(!vei.End()) in VEStarVE() 73 starVec.push_back(vei.E()); in VEStarVE() 74 ++vei; in VEStarVE() 102 for( VEIterator<EdgeType> vei(vz);!vei.End();++vei) in VEDetach() 104 if(vei.E()->VEp(vei.I()) == &e) in VEDetach() 106 vei.e->VEp(vei.z) = e.VEp(z); in VEDetach() 107 vei.e->VEi(vei.z) = e.VEi(z); in VEDetach() 243 while(!vei.End()) in VEDegree() [all …]
|
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/simplex/edge/ |
H A D | topology.h | 64 while(!vei.End()) in VVStarVE() 67 ++vei; in VVStarVE() 76 while(!vei.End()) in VEStarVE() 78 starVec.push_back(vei.E()); in VEStarVE() 79 ++vei; in VEStarVE() 107 for( VEIterator<EdgeType> vei(vz);!vei.End();++vei) in VEDetach() 109 if(vei.E()->VEp(vei.I()) == &e) in VEDetach() 111 vei.e->VEp(vei.z) = e.VEp(z); in VEDetach() 112 vei.e->VEi(vei.z) = e.VEi(z); in VEDetach() 246 while(!vei.End()) in VEDegree() [all …]
|
/dports/multimedia/libv4l/linux-5.13-rc2/net/caif/ |
H A D | cfveil.c | 28 struct cfsrvl *vei = kzalloc(sizeof(struct cfsrvl), GFP_ATOMIC); in cfvei_create() local 29 if (!vei) in cfvei_create() 32 cfsrvl_init(vei, channel_id, dev_info, true); in cfvei_create() 33 vei->layer.receive = cfvei_receive; in cfvei_create() 34 vei->layer.transmit = cfvei_transmit; in cfvei_create() 35 snprintf(vei->layer.name, CAIF_LAYER_NAME_SZ, "vei%d", channel_id); in cfvei_create() 36 return &vei->layer; in cfvei_create()
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/net/caif/ |
H A D | cfveil.c | 28 struct cfsrvl *vei = kzalloc(sizeof(struct cfsrvl), GFP_ATOMIC); in cfvei_create() local 29 if (!vei) in cfvei_create() 32 cfsrvl_init(vei, channel_id, dev_info, true); in cfvei_create() 33 vei->layer.receive = cfvei_receive; in cfvei_create() 34 vei->layer.transmit = cfvei_transmit; in cfvei_create() 35 snprintf(vei->layer.name, CAIF_LAYER_NAME_SZ, "vei%d", channel_id); in cfvei_create() 36 return &vei->layer; in cfvei_create()
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/net/caif/ |
H A D | cfveil.c | 28 struct cfsrvl *vei = kzalloc(sizeof(struct cfsrvl), GFP_ATOMIC); in cfvei_create() local 29 if (!vei) in cfvei_create() 32 cfsrvl_init(vei, channel_id, dev_info, true); in cfvei_create() 33 vei->layer.receive = cfvei_receive; in cfvei_create() 34 vei->layer.transmit = cfvei_transmit; in cfvei_create() 35 snprintf(vei->layer.name, CAIF_LAYER_NAME_SZ, "vei%d", channel_id); in cfvei_create() 36 return &vei->layer; in cfvei_create()
|
/dports/games/simutrans-pak64/simutrans/pak/text/ |
H A D | no.tab | 21 Betong vei bro 151 Asfalt vei 153 By vei 155 Cobblestein vei
|
/dports/games/diaspora/Diaspora_R1_Linux/Diaspora/fs2_open/code/globalincs/ |
H A D | systemvars.h | 72 typedef struct vei { struct 75 } vei; typedef 121 extern vei Viewer_external_info;
|
/dports/games/fs2open/fs2open.github.com-release_21_4_1/code/globalincs/ |
H A D | systemvars.h | 76 typedef struct vei { struct 80 } vei; typedef 126 extern vei Viewer_external_info;
|
/dports/misc/perkeep/perkeep-0.11/cmd/pk/ |
H A D | dp_idx_rebuild.go | 80 for prefix, vei := range prefixes { 81 pmap, ok := vei.(map[string]interface{}) 83 log.Printf("prefix %q value is a %T, not an object", prefix, vei)
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/src/3rdparty/opennurbs/ |
H A D | opennurbs_brep_isvalid.cpp | 44 int i, j, vei, ei; in IsValidVertexTopology() local 45 for ( vei = 0; vei < vertex_edge_count; vei++ ) in IsValidVertexTopology() 47 ei = vertex.m_ei[vei]; in IsValidVertexTopology() 69 text_log->Print("vertex.m_ei[%d] = %d is a deleted edge.\n", vei, ei); in IsValidVertexTopology() 83 vei,ei,ei,edge.m_vi[0],edge.m_vi[1],vertex_index); in IsValidVertexTopology() 89 for ( i = 0; i < vei; i++ ) in IsValidVertexTopology() 101 i,vei,ei,ei,edge.m_vi[0]); in IsValidVertexTopology() 108 for (j = i+1; j < vei; j++ ) in IsValidVertexTopology() 510 int vei; in IsValidEdgeTopology() local 511 for ( vei = 0; vei < vertex_edge_count && !bFoundIt; vei++ ) in IsValidEdgeTopology() [all …]
|
H A D | opennurbs_brep.cpp | 77 for ( vei = 0; vei < ve_count; vei++ ) { in IsValid() 3816 for ( vei = 0; vei < vertex_edge_count; vei++ ) { in IsValidVertex() 5382 for ( vei = 0; vertex.m_ei[vei] != ei && vei < edge_count; vei++) in NextEdge() 5402 for ( vei++; vei < edge_count; vei++ ) { in NextEdge() 5426 for ( vei = 0; vertex.m_ei[vei] != ei && vei < edge_count; vei++) in PrevEdge() 5446 for ( vei++; vei < edge_count; vei++ ) { in PrevEdge() 5516 for ( vei = 0; vei < edge_count; vei++ ) in SetVertices() 5719 for ( vei = 0; vei < vecnt; vei++ ) { in SetTolsFromLegacyValues() 7035 for ( vei = 0; vei < vertex_edge_count; vei++ ) in SetVertexTolerance() 9053 for ( vei = vecnt-1; vei >= 0; vei-- ) { in CullUnusedEdges() [all …]
|
H A D | opennurbs_mesh_tools.cpp | 503 int topv_end, vei, fi, fvi23, fvi; in CollapseEdge() local 509 for ( vei = 0; vei < topv.m_tope_count; vei++ ) in CollapseEdge() 511 topei = topv.m_topei[vei]; in CollapseEdge() 526 for ( vei = 0; vei < topv.m_tope_count; vei++ ) in CollapseEdge() 528 topei = topv.m_topei[vei]; in CollapseEdge()
|
/dports/math/gismo/gismo-21.12.0/external/onurbs/ |
H A D | opennurbs_brep_isvalid.cpp | 44 int i, j, vei, ei; in IsValidVertexTopology() local 45 for ( vei = 0; vei < vertex_edge_count; vei++ ) in IsValidVertexTopology() 47 ei = vertex.m_ei[vei]; in IsValidVertexTopology() 69 text_log->Print("vertex.m_ei[%d] = %d is a deleted edge.\n", vei, ei); in IsValidVertexTopology() 83 vei,ei,ei,edge.m_vi[0],edge.m_vi[1],vertex_index); in IsValidVertexTopology() 89 for ( i = 0; i < vei; i++ ) in IsValidVertexTopology() 101 i,vei,ei,ei,edge.m_vi[0]); in IsValidVertexTopology() 108 for (j = i+1; j < vei; j++ ) in IsValidVertexTopology() 510 int vei; in IsValidEdgeTopology() local 511 for ( vei = 0; vei < vertex_edge_count && !bFoundIt; vei++ ) in IsValidEdgeTopology() [all …]
|
H A D | opennurbs_brep.cpp | 77 for ( vei = 0; vei < ve_count; vei++ ) { in IsValid() 3841 for ( vei = 0; vei < vertex_edge_count; vei++ ) { in IsValidVertex() 5419 for ( vei = 0; vertex.m_ei[vei] != ei && vei < edge_count; vei++) in NextEdge() 5439 for ( vei++; vei < edge_count; vei++ ) { in NextEdge() 5463 for ( vei = 0; vertex.m_ei[vei] != ei && vei < edge_count; vei++) in PrevEdge() 5483 for ( vei++; vei < edge_count; vei++ ) { in PrevEdge() 5553 for ( vei = 0; vei < edge_count; vei++ ) in SetVertices() 5756 for ( vei = 0; vei < vecnt; vei++ ) { in SetTolsFromLegacyValues() 7104 for ( vei = 0; vei < vertex_edge_count; vei++ ) in SetVertexTolerance() 9122 for ( vei = vecnt-1; vei >= 0; vei-- ) { in CullUnusedEdges() [all …]
|
H A D | opennurbs_mesh_tools.cpp | 503 int topv_end, vei, fi, fvi23, fvi; in CollapseEdge() local 509 for ( vei = 0; vei < topv.m_tope_count; vei++ ) in CollapseEdge() 511 topei = topv.m_topei[vei]; in CollapseEdge() 526 for ( vei = 0; vei < topv.m_tope_count; vei++ ) in CollapseEdge() 528 topei = topv.m_topei[vei]; in CollapseEdge()
|
/dports/math/ogdf/OGDF/src/ogdf/simultaneous/ |
H A D | SimDrawCaller.cpp | 107 VariableEmbeddingInserter* vei = new VariableEmbeddingInserter; in callSubgraphPlanarizer() local 108 vei->removeReinsert(RemoveReinsertType::Incremental); in callSubgraphPlanarizer() 109 SP.setInserter(vei); in callSubgraphPlanarizer()
|
/dports/games/megaglest-data/megaglest-data-3.13.0/tutorials/1_very_basic_tutorial/ |
H A D | 1_very_basic_tutorial_romanian.lng | 44 HarvestGoldandStone3=Acum sapă după aur și pietre până vei avea un total de 600 aur și 550 pietre, … 50 …În cazul unui succes, va apare o săgeată galbenă. Acum recolteză lemn până vei avea 550 în depozit… 58 Thirdcommand2=Apăsând-o, vei accesa meniul de construire. Dacă menții cursorul pe una din pictogram… 59 Thirdcommand3=Dacă menții cursorul pe cort, vei vedea că necesită 30 aur, 50 lemn, -10 cazare și de… 71 HarvestGoldandStoneobjective=Obiectiv: Colectează aur și piatră până vei avea un total de 600 aur ș… 72 GetWoodob=Obiectiv: Colectează lemn până vei avea 550.
|
/dports/math/freefem++/FreeFem-sources-4.6/examples/tutorial/ |
H A D | FEComplex.edp | 43 Vh vei = imag(ue); 50 plot(vi,vei,ps="Li.eps",cmm="imag",value=true,wait=1);
|
/dports/misc/perkeep/perkeep-0.11/pkg/serverinit/ |
H A D | serverinit.go | 602 for prefix, vei := range prefixes { 606 pmap, ok := vei.(map[string]interface{}) 627 for prefix, vei := range prefixes { 631 pmap, ok := vei.(map[string]interface{}) 690 for prefix, vei := range prefixes { 700 pmap, ok := vei.(map[string]interface{}) 702 exitFailure("prefix %q value is a %T, not an object", prefix, vei)
|
/dports/misc/p5-Geo-Address-Formatter/Geo-Address-Formatter-1.96/address-formatting/conf/abbreviations/ |
H A D | no.yaml | 11 vei: v
|
/dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
H A D | maximum_weighted_matching.hpp | 186 typename std::vector<std::vector<std::pair<edge_descriptor_t, bool> > >::iterator vei; in weighted_augmenting_path_finder() local 188 …for (boost::tie(vi,vi_end) = vertices(g), vei = critical_edge_vectors.begin(); vi != vi_end; ++vi,… in weighted_augmenting_path_finder() 195 critical_edge_vector.push_back(vertex_to_edge_map_t(vei->begin(), vm)); in weighted_augmenting_path_finder() 754 typename std::vector<std::vector<std::pair<edge_descriptor_t, bool> > >::iterator vei; in init() local 756 …for (boost::tie(vi,vi_end) = vertices(g), vei = critical_edge_vectors.begin(); vi != vi_end; ++vi,… in init() 762 std::fill(vei->begin(), vei->end(), null_edge); in init()
|