Home
last modified time | relevance | path

Searched refs:endV (Results 1 – 25 of 60) sorted by relevance

123

/dports/math/R-cran-influenceR/influenceR/src/
H A Dsnap_wrapper.c82 G->endV = (attr_id_t *) R_alloc(2*m, sizeof(attr_id_t)); //calloc in read_graph_from_edgelist()
83 assert(G->endV != NULL); in read_graph_from_edgelist()
85 G->endV[i] = 0; in read_graph_from_edgelist()
120 G->endV[G->numEdges[u]+offset-1] = v; in read_graph_from_edgelist()
125 G->endV[G->numEdges[v]+offset-1] = u; in read_graph_from_edgelist()
H A Dbridging.c80 for (j=G->numEdges[u]; v != G->endV[j] && j<G->numEdges[u+1]; j++); in bridging()
81 for (k=G->numEdges[v]; u != G->endV[k] && k<G->numEdges[v+1]; k++); in bridging()
146 for (j=G->numEdges[u]; v != G->endV[j] && j<G->numEdges[u+1]; j++); in bridging_MPI()
147 for (k=G->numEdges[v]; u != G->endV[k] && k<G->numEdges[v+1]; k++); in bridging_MPI()
388 w = G->endV[j]; in BFS_parallel_frontier_expansion_bridging()
H A Dvertex_betweenness_centrality.c191 v = G->endV[i]; in vertex_betweenness_centrality_parBFS()
312 w = G->endV[j]; in vertex_betweenness_centrality_parBFS()
647 v = G->endV[i]; in vertex_betweenness_centrality_simple()
742 w = G->endV[j]; in vertex_betweenness_centrality_simple()
H A Dgraph_defs.h133 attr_id_t* endV; member
/dports/net-im/tg_owt/tg_owt-d578c76/src/sdk/android/tests/src/org/webrtc/
H A DCodecTestHelper.java42 final int endV = posV + width * height / 4; in wrapI420() local
55 buffer.limit(endV); in wrapI420()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/webrtc/sdk/android/tests/src/org/webrtc/
H A DCodecTestHelper.java42 final int endV = posV + width * height / 4; in wrapI420() local
55 buffer.limit(endV); in wrapI420()
/dports/www/firefox/firefox-99.0/third_party/libwebrtc/sdk/android/tests/src/org/webrtc/
H A DCodecTestHelper.java42 final int endV = posV + width * height / 4; in wrapI420() local
55 buffer.limit(endV); in wrapI420()
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/occ/
H A DPartition_Inter2d.cxx321 TopoDS_Vertex endV; in FindEndVertex() local
332 endV = v; in FindEndVertex()
342 return endV; in FindEndVertex()
358 TopoDS_Vertex endV; in treatClosed() local
359 endV = Partition_Inter2d::FindEndVertex(LV1, f,l, E1, isFirst,minDU); in treatClosed()
372 endV.Orientation(TopAbs_INTERNAL); in treatClosed()
373 B.UpdateVertex(endV,newU,E1,BRep_Tool::Tolerance(endV)); in treatClosed()
/dports/cad/netgen/netgen-6.2.2105/libsrc/occ/
H A DPartition_Inter2d.cxx321 TopoDS_Vertex endV; in FindEndVertex() local
332 endV = v; in FindEndVertex()
342 return endV; in FindEndVertex()
358 TopoDS_Vertex endV; in treatClosed() local
359 endV = Partition_Inter2d::FindEndVertex(LV1, f,l, E1, isFirst,minDU); in treatClosed()
372 endV.Orientation(TopAbs_INTERNAL); in treatClosed()
373 B.UpdateVertex(endV,newU,E1,BRep_Tool::Tolerance(endV)); in treatClosed()
/dports/audio/ncmpcpp/ncmpcpp-0.9.2/src/screens/
H A Dmedia_library.cpp349 std::sort(Albums.beginV(), Albums.endV(), SortAlbumEntries()); in update()
406 std::sort(Tags.beginV(), Tags.endV(), SortPrimaryTags()); in update()
450 std::sort(Albums.beginV(), Albums.endV(), SortAlbumEntries()); in update()
962 std::sort(Albums.beginV(), Albums.endV(), SortAlbumEntries()); in toggleSortMode()
987 std::sort(Tags.beginV(), Tags.endV(), SortPrimaryTags()); in toggleSortMode()
1039 std::sort(Tags.beginV(), Tags.endV(), SortPrimaryTags()); in locateSong()
1083 std::sort(Albums.beginV(), Albums.endV(), SortAlbumEntries()); in locateSong()
1096 auto begin = Songs.beginV(), end = Songs.endV(); in locateSong()
1173 auto begin = tags.beginV(), end = tags.endV(); in MoveToTag()
1202 auto begin = albums.beginV(), end = albums.endV(); in MoveToAlbum()
H A Dplaylist_editor.cpp172 std::sort(Playlists.beginV(), Playlists.endV(), in update()
427 std::copy(Content.beginV(), Content.endV(), std::back_inserter(result)); in getSelectedSongs()
491 auto first = Playlists.beginV(), last = Playlists.endV(); in locatePlaylist()
543 if (locate_song_in_current_playlist(Content.currentV() + 1, Content.endV())) in locateSong()
546 if (locate_song_in_playlists(Playlists.currentV() + 1, Playlists.endV())) in locateSong()
H A Dtag_editor.cpp291 std::sort(Dirs->beginV()+1, Dirs->endV(), in update()
302 std::sort(Tags->beginV(), Tags->endV(), in update()
791 for (auto it = Tags->beginV(); it != Tags->endV(); ++it) in runAction()
818 Mpd.UpdateDirectory(getSharedDirectory(Tags->beginV(), Tags->endV())); in runAction()
1015 for (auto it = m.beginV(); it != m.endV(); ++it) in isAnyModified()
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/include/
H A DobjMeshOrientable.h74 unsigned int endV() { return endV_; } in endV() function
168 return (getGroupHandle->getFace(halfedge.face())).getVertex(halfedge.endV()); } in edgeEndVertex()
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/objMesh/
H A DobjMeshOrientable.h74 unsigned int endV() { return endV_; } in endV() function
168 return (getGroupHandle->getFace(halfedge.face())).getVertex(halfedge.endV()); } in edgeEndVertex()
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/poppler/poppler/
H A DABWOutputDev.cc197 float gap, endV; in getBiggestSeperator() local
237 endV = end[0]; in getBiggestSeperator()
242 …if (((stt[inspect] - endV) - gap) < 0.5){ //FIXME:This is copied almost directly from the previous… in getBiggestSeperator()
244 if (end[inspect] > endV) in getBiggestSeperator()
245 endV = end[inspect]; in getBiggestSeperator()
250 if (gap < (stt[inspect] - endV)){ in getBiggestSeperator()
251 gap = stt[inspect] - endV; in getBiggestSeperator()
252 *C1 = endV; in getBiggestSeperator()
255 endV = end[inspect]; in getBiggestSeperator()
/dports/graphics/alembic/alembic-1.8.3/maya/AbcExport/
H A DMayaNurbsSurfaceWriter.cpp105 double startU, endU, startV, endV; in write() local
106 nurbs.getKnotDomain(startU, endU, startV, endV); in write()
275 double offsetV = startV+endV; in write()
/dports/audio/ncmpcpp/ncmpcpp-0.9.2/src/curses/
H A Dmenu.h458 ValueIterator endV() { return ValueIterator(end()); }
459 ConstValueIterator endV() const { return ConstValueIterator(end()); }
461 ReverseValueIterator rbeginV() { return ReverseValueIterator(endV()); }
462 ConstReverseIterator rbeginV() const { return ConstReverseValueIterator(endV()); }
/dports/graphics/alembic/alembic-1.8.3/maya/AbcImport/
H A DNurbsSurfaceHelper.cpp70 double startU, endU, startV, endV; in trimSurface() local
71 iFnSurface.getKnotDomain(startU, endU, startV, endV); in trimSurface()
72 double offsetV = startV + endV; in trimSurface()
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/
H A DPolygonsSet.java1111 final Vector2D endV = Double.isInfinite(i.getSup()) ? in addContribution() local
1116 final BSPTree<Euclidean2D> endN = selectClosest(endV, splitters); in addContribution()
1119 segments.add(new ConnectableSegment(endV, startV, line.getReverse(), in addContribution()
1122 segments.add(new ConnectableSegment(startV, endV, line, in addContribution()
/dports/emulators/visualboyadvance-m/visualboyadvance-m-VBA-M_Beta_2/src/gb/
H A DgbSGB.cpp416 u8 endV = (*fromAddress++) & 0x1f; in gbSgbAttributeBlock() local
423 x > endH || y > endV) { in gbSgbAttributeBlock()
428 y > startV && y < endV) { in gbSgbAttributeBlock()
/dports/emulators/vba/VisualBoyAdvance-1.7.2/src/gb/
H A DgbSGB.cpp422 u8 endV = (*fromAddress++) & 0x1f; in gbSgbAttributeBlock() local
429 x > endH || y > endV) { in gbSgbAttributeBlock()
434 y > startV && y < endV) { in gbSgbAttributeBlock()
/dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/test/
H A Dcheckindexset.hh364 const VxIterator endV = view.template end< dim >(); in checkIndexSetForCodim() local
365 for( auto itV = view.template begin< dim >(); itV != endV; ++itV ) in checkIndexSetForCodim()
/dports/audio/ncmpcpp/ncmpcpp-0.9.2/src/
H A Dhelpers.cpp88 const auto begin = myPlaylist->main().beginV(), end = myPlaylist->main().endV(); in addSongToPlaylist()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/
H A DRangeImpl.java137 List<Node> endV = new ArrayList<>(); in getCommonAncestorContainer() local
141 endV.add(node); in getCommonAncestorContainer()
144 int e = endV.size()-1; in getCommonAncestorContainer()
147 if (startV.get(s) == endV.get(e)) { in getCommonAncestorContainer()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/
H A DRangeImpl.java137 List<Node> endV = new ArrayList<>(); in getCommonAncestorContainer() local
141 endV.add(node); in getCommonAncestorContainer()
144 int e = endV.size()-1; in getCommonAncestorContainer()
147 if (startV.get(s) == endV.get(e)) { in getCommonAncestorContainer()

123