OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:edges_
(Results
1 - 6
of
6
) sorted by null
/external/ceres-solver/internal/ceres/
graph.h
58
edges_
[vertex] = HashSet<Vertex>();
76
const HashSet<Vertex>& sinks =
edges_
[vertex];
84
edges_
[*it].erase(vertex);
87
edges_
.erase(vertex);
101
if (
edges_
[vertex1].insert(vertex2).second) {
102
edges_
[vertex2].insert(vertex1);
138
return FindOrDie(
edges_
, vertex);
152
HashMap<Vertex, HashSet<Vertex> >
edges_
;
member in class:ceres::internal::Graph
/external/opencv3/modules/stitching/include/opencv2/stitching/detail/
util.hpp
139
void create(int num_vertices) {
edges_
.assign(num_vertices, std::list<GraphEdge>()); }
140
int numVertices() const { return static_cast<int>(
edges_
.size()); }
146
std::vector< std::list<GraphEdge> >
edges_
;
member in class:cv::detail::Graph
motion_estimators.hpp
194
std::vector<std::pair<int,int> >
edges_
;
member in class:cv::detail::BundleAdjusterBase
seam_finders.hpp
223
std::set<std::pair<int, int> >
edges_
;
member in class:cv::detail::DpSeamFinder
/external/compiler-rt/lib/sanitizer_common/
sanitizer_deadlock_detector.h
163
if (recycled_nodes_.getBit(
edges_
[i].from) ||
164
recycled_nodes_.getBit(
edges_
[i].to)) {
165
Swap(
edges_
[i],
edges_
[n_edges_ - 1]);
252
if (n_edges_ < ARRAY_SIZE(
edges_
)) {
256
edges_
[n_edges_++] = e;
269
if (
edges_
[i].from == from_idx &&
edges_
[i].to == to_idx) {
270
*stk_from =
edges_
[i].stk_from;
271
*stk_to =
edges_
[i].stk_to
410
Edge
edges_
[BV::kSize * 32];
member in class:__sanitizer::DeadlockDetector
[
all
...]
/external/v8/src/profiler/
heap-snapshot-generator.h
164
List<HeapGraphEdge>& edges() { return
edges_
; }
193
List<HeapGraphEdge>
edges_
;
member in class:v8::internal::HeapSnapshot
Completed in 391 milliseconds