Home
last modified time | relevance | path

Searched refs:forest (Results 1 – 12 of 12) sorted by relevance

/external/chromium_org/net/spdy/
Dspdy_priority_forest_test.cc13 SpdyPriorityForest<uint32,int16> forest; in TEST() local
14 EXPECT_EQ(0, forest.num_nodes()); in TEST()
15 EXPECT_FALSE(forest.NodeExists(1)); in TEST()
17 EXPECT_TRUE(forest.AddRootNode(1, 1000)); in TEST()
18 EXPECT_EQ(1, forest.num_nodes()); in TEST()
19 ASSERT_TRUE(forest.NodeExists(1)); in TEST()
20 EXPECT_EQ(1000, forest.GetPriority(1)); in TEST()
21 EXPECT_FALSE(forest.NodeExists(5)); in TEST()
23 EXPECT_TRUE(forest.AddRootNode(5, 50)); in TEST()
24 EXPECT_FALSE(forest.AddRootNode(5, 500)); in TEST()
[all …]
/external/ceres-solver/internal/ceres/
Dgraph_algorithms_test.cc111 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST() local
113 const HashSet<int>& vertices = forest->vertices(); in TEST()
115 EXPECT_EQ(forest->VertexWeight(0), 1.0); in TEST()
116 EXPECT_EQ(forest->VertexWeight(1), 2.0); in TEST()
117 EXPECT_EQ(forest->Neighbors(0).size(), 1.0); in TEST()
118 EXPECT_EQ(forest->EdgeWeight(0, 1), 0.5); in TEST()
134 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST() local
135 const HashSet<int>& vertices = forest->vertices(); in TEST()
139 const HashSet<int>& neighbors = forest->Neighbors(0); in TEST()
146 const HashSet<int>& neighbors = forest->Neighbors(3); in TEST()
[all …]
Dgraph_algorithms.h277 Graph<Vertex>* forest = new Graph<Vertex>(); in Degree2MaximumSpanningForest() local
292 forest->AddVertex(vertex1, graph.VertexWeight(vertex1)); in Degree2MaximumSpanningForest()
323 if ((forest->Neighbors(vertex1).size() == 2) || in Degree2MaximumSpanningForest()
324 (forest->Neighbors(vertex2).size() == 2)) { in Degree2MaximumSpanningForest()
342 forest->AddEdge(vertex1, vertex2, edge_weight); in Degree2MaximumSpanningForest()
343 forest->AddEdge(vertex2, vertex1, edge_weight); in Degree2MaximumSpanningForest()
356 return forest; in Degree2MaximumSpanningForest()
Dvisibility_based_preconditioner.cc172 scoped_ptr<Graph<int> > forest( in ComputeClusterTridiagonalSparsity() local
174 ForestToClusterPairs(*forest, &cluster_pairs_); in ComputeClusterTridiagonalSparsity()
501 const Graph<int>& forest, in ForestToClusterPairs() argument
504 const HashSet<int>& vertices = forest.vertices(); in ForestToClusterPairs()
514 const HashSet<int>& neighbors = forest.Neighbors(cluster1); in ForestToClusterPairs()
Dvisibility_based_preconditioner.h160 void ForestToClusterPairs(const Graph<int>& forest,
/external/opencv/ml/src/
Dmlrtrees.cpp45 forest = NULL; in CvForestTree()
67 forest = _forest; in train()
105 if( forest ) in find_best_split()
108 CvRNG* rng = forest->get_rng(); in find_best_split()
110 active_var_mask = forest->get_active_var_mask(); in find_best_split()
164 forest = _forest; in read()
/external/chromium_org/third_party/WebKit/PerformanceTests/
DSkipped61 Bindings/gc-forest.html
/external/chromium_org/third_party/sqlite/src/test/
Dfuzzer1.test129 INSERT INTO streetname VALUES('acorn forest');
184 INSERT INTO streetname VALUES('avalon forest');
201 INSERT INTO streetname VALUES('barefoot forest');
552 INSERT INTO streetname VALUES('forest grove');
553 INSERT INTO streetname VALUES('forest path');
649 INSERT INTO streetname VALUES('harburn forest');
797 INSERT INTO streetname VALUES('larkmead forest');
828 INSERT INTO streetname VALUES('long forest');
842 INSERT INTO streetname VALUES('mallard forest');
Dfts1porter.test8385 forest forest
8388 forester forest
8389 foresters forest
8390 forests forest
/external/opencv/ml/include/
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; variable
/external/srec/config/en.us/dictionary/
Dlarge.ok10786 forest f{r6st
/external/chromium_org/third_party/WebKit/PerformanceTests/Parser/resources/
Dfinal-url-en31347 http://www.ces.ncsu.edu/nreos/forest/woodland/won-20.html
31348 http://www.ces.ncsu.edu/nreos/forest/xmas/growing/ag95-IV.htm
42907 http://www.forest.nsw.gov.au/publication/forest_facts/forest_types/default.asp
52747 http://www.landcareresearch.co.nz/research/biodiversity/forest/waitutu/index.asp