/external/chromium_org/net/spdy/ |
spdy_priority_forest_test.cc | 13 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.AddRootNode(5, 500)) 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/ |
graph_algorithms_test.cc | 111 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); 113 const HashSet<int>& vertices = forest->vertices(); 115 EXPECT_EQ(forest->VertexWeight(0), 1.0); 116 EXPECT_EQ(forest->VertexWeight(1), 2.0); 117 EXPECT_EQ(forest->Neighbors(0).size(), 1.0); 118 EXPECT_EQ(forest->EdgeWeight(0, 1), 0.5); 134 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); 135 const HashSet<int>& vertices = forest->vertices(); 139 const HashSet<int>& neighbors = forest->Neighbors(0); 146 const HashSet<int>& neighbors = forest->Neighbors(3) [all...] |
graph_algorithms.h | 254 // 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...] |
visibility_based_preconditioner.h | 102 // maximum spanning forest is identified in this graph and the camera 103 // pairs contained in the edges of this forest are added to the 160 void ForestToClusterPairs(const Graph<int>& forest,
|
visibility_based_preconditioner.cc | 156 // forest. The set of edges in this forest are the cluster pairs. 167 // maximum spanning forest of this graph. 172 scoped_ptr<Graph<int> > forest( 174 ForestToClusterPairs(*forest, &cluster_pairs_); 233 // spanning forest. 240 // connected by an edge in the degree-2 maximum spanning forest. 242 // Since we have already expanded the forest into a set of camera 368 // the degree-2 forest and that guarantees positive 382 // belong to the edges of the degree-2 forest. In the CLUSTER_JACOB [all...] |
/external/opencv/ml/src/ |
mlrtrees.cpp | 45 forest = NULL; 67 forest = _forest; 105 if( forest ) 108 CvRNG* rng = forest->get_rng(); 110 active_var_mask = forest->get_active_var_mask(); 164 forest = _forest;
|
/external/opencv/ml/include/ |
ml.h | 916 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 [all...] |
/external/chromium_org/chrome/browser/resources/sync_internals/ |
sync_node_browser.js | 119 * Creates a new sync node tree. Technically, it's a forest since it each
|
/external/chromium_org/third_party/closure_compiler/compiler/ |
compiler.jar | |