/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.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...] |
/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/third_party/WebKit/Source/devtools/scripts/closure/ |
compiler.jar | |