/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | igraph_recent_degree_aging_game.out | 3 vcount: 0 8 vcount: 5 13 vcount: 5 26 vcount: 7
|
H A D | igraph_from_prufer.out | 2 vcount: 6 11 vcount: 8 22 vcount: 2
|
/dports/math/R-cran-igraph/igraph/tests/testthat/ |
H A D | test_correlated.R | 40 g2 <- graph.full(vcount(g), directed=is.directed(g)) 50 expect_that(vcount(g3), equals(10)) 58 expect_that(vcount(gg3), equals(10)) 68 perm <- sample(vcount(g)) 74 perm <- sample(vcount(g))
|
H A D | test_degree.R | 12 expect_that(degree(g) / (vcount(g)-1), equals(degree(g, normalized=TRUE))) 21 expect_that(degree(g2, mode="in") / (vcount(g2)-1), 23 expect_that(degree(g2, mode="out") / (vcount(g2)-1), 25 expect_that(degree(g2, mode="all") / (vcount(g2)-1),
|
H A D | test_indexing2.R | 56 V(g)$name <- letters[1:vcount(g)] 57 rownames(A) <- colnames(A) <- letters[1:vcount(g)] 75 V(g)$name <- letters[1:vcount(g)] 76 rownames(A) <- colnames(A) <- letters[1:vcount(g)] 94 V(g)$name <- letters[1:vcount(g)] 95 rownames(A) <- colnames(A) <- letters[1:vcount(g)]
|
H A D | test_edge.betweenness.R | 21 bet2 <- sapply(1:vcount(kite), function(x) { 23 (sum(ebet[ae])-vcount(kite)+1) / 2 34 bet2 <- sapply(1:vcount(kite), function(x) { 36 (sum(ebet[ae])-vcount(kite)+1) / 2
|
/dports/audio/guidoar/guidoar-cf5681a/src/lang/values/ |
H A D | guidoMixValue.cpp | 69 unsigned int vcount = getArg1()->voices(); in top() local 70 return (vnum > vcount) ? create(getArg1(), getArg2()->top(vnum - vcount)) : getArg1()->top(vnum); in top() 75 unsigned int vcount = getArg1()->voices(); in bottom() local 76 …return (vnum < vcount) ? create(getArg1()->bottom(vnum), getArg2()) : getArg2()->bottom(vnum - vco… in bottom()
|
/dports/cad/libredwg/libredwg-0.12.4/src/ |
H A D | free.c | 212 for (vcount = 0; vcount < (BITCODE_BL) (size); vcount++) \ 226 for (vcount = 0; vcount < (BITCODE_BL)size; vcount++) \ 228 FIELD_HANDLE_N (name[vcount], vcount, code, dxf); \ 240 for (vcount = 0; vcount < (BITCODE_BL)_obj->o.sizefield; vcount++) \ 249 for (vcount = 0; vcount < (BITCODE_BL) (_obj->o.sizefield); vcount++) \ 260 for (vcount = 0; vcount < obj->tio.object->num_reactors; vcount++) \ 268 for (vcount = 0; vcount < ent->num_reactors; vcount++) \ 399 BITCODE_BL vcount; in dwg_free_common_entity_data() local 427 BITCODE_BL vcount; in dwg_free_common_object_data() local 1202 BITCODE_RL vcount; in dwg_free_filedeplist() local [all …]
|
H A D | out_geojson.c | 214 #define FIELD_HANDLE_N(name, vcount, handle_code, dxf) argument 328 for (vcount = 0; vcount < (BITCODE_BL)size; vcount++) \ 331 _obj->name[vcount], \ 332 vcount == (BITCODE_BL)size - 1 ? "" : ","); \ 340 for (vcount = 0; vcount < (BITCODE_BL)_obj->size; vcount++) \ 343 _obj->name[vcount], \ 344 vcount == (BITCODE_BL)_obj->size - 1 ? "" : ","); \ 349 for (vcount = 0; vcount < (BITCODE_BL)_obj->size; vcount++) \ 350 FIELD_TEXT_TU (name, _obj->name[vcount]); \ 362 for (vcount = 0; vcount < (BITCODE_BL)_obj->size; vcount++) \ [all …]
|
/dports/math/igraph/igraph-0.9.5/src/properties/ |
H A D | trees.c | 250 igraph_integer_t vcount, ecount; in igraph_is_tree() local 252 vcount = igraph_vcount(graph); in igraph_is_tree() 257 if (ecount != vcount - 1) { in igraph_is_tree() 263 if (vcount == 1) { in igraph_is_tree() 309 for (i = 0; i < vcount; ++i) in igraph_is_tree() 315 if (i == vcount) { in igraph_is_tree() 333 *res = visited_count == vcount; in igraph_is_tree()
|
/dports/games/libretro-gpsp/gpsp-300d0c0/ |
H A D | main.c | 149 u32 vcount = io_registers[REG_VCOUNT]; in update_gba() local 185 vcount++; in update_gba() 187 if(vcount == 160) in update_gba() 215 if(vcount == 228) in update_gba() 237 vcount = 0; in update_gba() 240 if(vcount == (dispstat >> 8)) in update_gba() 252 io_registers[REG_VCOUNT] = vcount; in update_gba()
|
/dports/emulators/mednafen/mednafen/src/nes/boards/ |
H A D | fme7.cpp | 41 static int32 vcount[3]; variable 161 vcount[x]++; in DoAYSQHQ() 162 if(vcount[x] >= period) in DoAYSQHQ() 165 vcount[x] = 0; in DoAYSQHQ() 213 SFPTR32(vcount, 3), in StateAction() 254 memset(vcount,0,sizeof(vcount)); in Mapper69_ESI()
|
/dports/devel/boost-docs/boost_1_72_0/libs/geometry/index/test/rtree/ |
H A D | rtree_non_cartesian.cpp | 53 size_t vcount = 1; // x < 180 ? 1 : 2; in test_rtree() local 54 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 57 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree() 69 size_t vcount = 0; // x < 180 ? 1 : 0; in test_rtree() local 70 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 73 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/geometry/index/test/rtree/ |
H A D | rtree_non_cartesian.cpp | 53 size_t vcount = 1; // x < 180 ? 1 : 2; in test_rtree() local 54 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 57 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree() 69 size_t vcount = 0; // x < 180 ? 1 : 0; in test_rtree() local 70 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 73 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree()
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/libs/geometry/index/test/rtree/ |
H A D | rtree_non_cartesian.cpp | 53 size_t vcount = 1; // x < 180 ? 1 : 2; in test_rtree() local 54 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 57 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree() 69 size_t vcount = 0; // x < 180 ? 1 : 0; in test_rtree() local 70 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 73 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree()
|
/dports/devel/boost-libs/boost_1_72_0/libs/geometry/index/test/rtree/ |
H A D | rtree_non_cartesian.cpp | 53 size_t vcount = 1; // x < 180 ? 1 : 2; in test_rtree() local 54 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 57 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree() 69 size_t vcount = 0; // x < 180 ? 1 : 0; in test_rtree() local 70 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 73 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree()
|
/dports/devel/hyperscan/boost_1_75_0/libs/geometry/index/test/rtree/ |
H A D | rtree_non_cartesian.cpp | 53 size_t vcount = 1; // x < 180 ? 1 : 2; in test_rtree() local 54 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 57 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree() 69 size_t vcount = 0; // x < 180 ? 1 : 0; in test_rtree() local 70 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree() 73 BOOST_CHECK_EQUAL(res.size(), vcount); in test_rtree()
|
/dports/devel/bullet/bullet3-3.21/Extras/ConvexDecomposition/ |
H A D | bestfitobb.cpp | 47 void computeOBB(unsigned int vcount, const float *points, unsigned int pstride, float *sides, const… in computeOBB() argument 54 for (unsigned int i = 0; i < vcount; i++) in computeOBB() 85 void computeBestFitOBB(unsigned int vcount, const float *points, unsigned int pstride, float *sides… in computeBestFitOBB() argument 90 fm_getAABB(vcount, points, pstride, bmin, bmax); in computeBestFitOBB() 130 computeOBB(vcount, points, pstride, psides, pmatrix); in computeBestFitOBB()
|
H A D | cd_hull.h | 81 unsigned int vcount, in HullDesc() argument 86 mVcount = vcount; in HullDesc() 135 …void BringOutYourDead(const float *verts, unsigned int vcount, float *overts, unsigned int &ocount… 140 unsigned int &vcount, // output number of vertices
|
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/gimpact/ConvexDecomposition/ |
H A D | bestfitobb.cpp | 47 void computeOBB(unsigned int vcount,const float *points,unsigned int pstride,float *sides,const flo… in computeOBB() argument 54 for (unsigned int i=0; i<vcount; i++) in computeOBB() 87 void computeBestFitOBB(unsigned int vcount,const float *points,unsigned int pstride,float *sides,fl… in computeBestFitOBB() argument 93 fm_getAABB(vcount,points,pstride,bmin,bmax); in computeBestFitOBB() 134 computeOBB( vcount, points, pstride, psides, pmatrix ); in computeBestFitOBB()
|
H A D | cd_hull.h | 83 unsigned int vcount, in HullDesc() argument 88 mVcount = vcount; in HullDesc() 139 …void BringOutYourDead(const float *verts,unsigned int vcount, float *overts,unsigned int &ocount,u… 144 unsigned int &vcount, // output number of vertices
|
/dports/finance/py-backtrader/backtrader-1.9.74.123/samples/relative-volume/ |
H A D | relvolbybar.py | 56 self.vcount = collections.defaultdict(int) 79 self.vcount[tm] += 1 89 self.vcount[tm] += 1 95 if self.vcount[tm] == self.days: 99 self.vcount[tm] = self.days
|
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/Extras/ConvexDecomposition/ |
H A D | bestfitobb.cpp | 47 void computeOBB(unsigned int vcount,const float *points,unsigned int pstride,float *sides,const flo… in computeOBB() argument 54 for (unsigned int i=0; i<vcount; i++) in computeOBB() 87 void computeBestFitOBB(unsigned int vcount,const float *points,unsigned int pstride,float *sides,fl… in computeBestFitOBB() argument 93 fm_getAABB(vcount,points,pstride,bmin,bmax); in computeBestFitOBB() 134 computeOBB( vcount, points, pstride, psides, pmatrix ); in computeBestFitOBB()
|
/dports/devel/py-bullet3/bullet3-3.21/Extras/ConvexDecomposition/ |
H A D | bestfitobb.cpp | 47 void computeOBB(unsigned int vcount, const float *points, unsigned int pstride, float *sides, const… in computeOBB() argument 54 for (unsigned int i = 0; i < vcount; i++) in computeOBB() 85 void computeBestFitOBB(unsigned int vcount, const float *points, unsigned int pstride, float *sides… in computeBestFitOBB() argument 90 fm_getAABB(vcount, points, pstride, bmin, bmax); in computeBestFitOBB() 130 computeOBB(vcount, points, pstride, psides, pmatrix); in computeBestFitOBB()
|
/dports/mail/neomutt/neomutt-20211029/pattern/ |
H A D | pattern.c | 206 m->vcount = 0; in mutt_limit_current_thread() 225 e->vnum = m->vcount; in mutt_limit_current_thread() 227 m->v2r[m->vcount] = i; in mutt_limit_current_thread() 228 m->vcount++; in mutt_limit_current_thread() 399 m->vcount = 0; in mutt_pattern_func() 419 e->vnum = m->vcount; in mutt_pattern_func() 421 m->v2r[m->vcount] = i; in mutt_pattern_func() 422 m->vcount++; in mutt_pattern_func() 464 if (m->msg_count && !m->vcount) in mutt_pattern_func() 577 if (i > m->vcount - 1) in mutt_search_command() [all …]
|