Searched defs:forest (Results 1 - 5 of 5) sorted by relevance

/external/chromium_org/net/spdy/
H A Dspdy_priority_forest_test.cc13 SpdyPriorityForest<uint32,int16> forest; local
14 EXPECT_EQ(0, forest.num_nodes());
15 EXPECT_FALSE(forest.NodeExists(1));
17 EXPECT_TRUE(forest.AddRootNode(1, 1000));
18 EXPECT_EQ(1, forest.num_nodes());
19 ASSERT_TRUE(forest.NodeExists(1));
20 EXPECT_EQ(1000, forest.GetPriority(1));
21 EXPECT_FALSE(forest.NodeExists(5));
23 EXPECT_TRUE(forest.AddRootNode(5, 50));
24 EXPECT_FALSE(forest
58 SpdyPriorityForest<uint32,int16> forest; local
103 SpdyPriorityForest<uint32,int16> forest; local
158 SpdyPriorityForest<uint32,int16> forest; local
179 SpdyPriorityForest<uint32,int16> forest; local
200 SpdyPriorityForest<uint32,int16> forest; local
241 SpdyPriorityForest<uint32,int16> forest; local
[all...]
/external/ceres-solver/internal/ceres/
H A Dgraph_algorithms.h254 // Compute a degree two constrained Maximum Spanning Tree/forest of
270 // spanning forest, or a collection of linear paths that span the
277 Graph<Vertex>* forest = new Graph<Vertex>(); local
292 forest->AddVertex(vertex1, graph.VertexWeight(vertex1));
313 // Greedily add edges to the spanning tree/forest as long as they do
323 if ((forest->Neighbors(vertex1).size() == 2) ||
324 (forest->Neighbors(vertex2).size() == 2)) {
342 forest->AddEdge(vertex1, vertex2, edge_weight);
343 forest->AddEdge(vertex2, vertex1, edge_weight);
356 return forest;
[all...]
H A Dvisibility_based_preconditioner.cc152 // forest. The set of edges in this forest are the cluster pairs.
163 // maximum spanning forest of this graph.
168 scoped_ptr<Graph<int> > forest(
170 ForestToClusterPairs(*forest, &cluster_pairs_);
215 // spanning forest.
222 // connected by an edge in the degree-2 maximum spanning forest.
224 // Since we have already expanded the forest into a set of camera
353 // the degree-2 forest and that guarantees positive
363 // belong to the edges of the degree-2 forest
471 ForestToClusterPairs( const Graph<int>& forest, HashSet<pair<int, int> >* cluster_pairs) const argument
[all...]
/external/opencv/ml/include/
H A Dml.h916 virtual bool train( CvDTreeTrainData* _train_data, const CvMat* _subsample_idx, CvRTrees* forest );
919 virtual void read( CvFileStorage* fs, CvFileNode* node, CvRTrees* forest, CvDTreeTrainData* _data );
936 CvRTrees* forest; member in class:CvForestTree
942 //Parameters for the forest
1000 // array of the trees of the forest
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...

Completed in 265 milliseconds