| /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...] |
| spdy_priority_forest.h | 37 // Return the number of nodes currently in the forest.
40 // Return true if the forest contains a node with the given ID.
43 // Add a new root node to the forest, with the given priority. Returns true
44 // on success, or false if the node_id already exists within the forest.
47 // Add a new node to the forest, with the given parent. Returns true on
52 // Remove an existing node from the forest. Returns true on success, or
93 // no node in the forest is ready to read.
104 // no node in the forest is ready to write.
|
| /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...] |
| visibility_based_preconditioner.cc | 152 // 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. In the CLUSTER_JACOB
[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 | 101 // maximum spanning forest is identified in this graph and the camera
102 // pairs contained in the edges of this forest are added to the
159 void ForestToClusterPairs(const Graph<int>& forest,
|
| visibility_based_preconditioner_test.cc | 331 // // Spanning forest has structure 0-1 2
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 74 // Create spanning tree, Forest contains a special data structure
77 EquivalenceClasses<const T*> Forest;
82 Forest.insert(e.first);
83 Forest.insert(e.second);
91 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) {
92 Forest.unionSets(e.first, e.second);
|
| /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/replicaisland/res/values/ |
| strings.xml | 293 I find myself standing in the middle of a vast beach, with sand dunes stretching great distances down the coastline and the green of tropical forest visible near the horizon. An uninformed man would think this place a paradise. I know better. Still, I cannot help but marvel at the island?s wholly unnatural beauty.
312 I met a group of three adventurers today. I thought that I had the island all to myself, and I was so surprised to hear human voices (with Brooklyn accents, no less!) outside my shelter that I knocked over a bamboo support and almost brought the roof down. The group is independent but they are after The Source, just like me. They were nice but I sensed a little bit of competitive tension in the air. They have been here for a month already and have barely penetrated the forest beyond the beach. I am glad to have met them but they pose no immediate threat to my mission. They are fine folks but my skills are far superior.\n
318 Today marks three consecutive days of rain. Last week was clear--the seas were calm and my carefully constructed shelter proved unnecessary. I am sitting in a small alcove at the base of a hollow tree as the sky dumps golf ball-sized raindrops into the forest around me. The beach is long behind me now and the sound of the ocean is just a memory.\n
320 This is a weird place. The oddities increase as I move closer to the center. Since entering the forest I have seen a few things I cannot explain. No matter, my mission is clear and success is guaranteed. I will sleep here tonight and then venture further towards the island?s center tomorrow.\n
343 I may have found a path into the forest. The grasslands stretch out ahead in what appears to be a small glade, but I think that beyond them the border of the forest will thin. If my calculations are correct, this side of the island should be shady most of the year, so I expect that the almost impenetrable forest vegetation will yield enough to permit traversal.\n
345 The adventuring party I met a few days ago has been here a month and has not yet figured this out. My intellect is truly superior--I can understand why Mr. Rokudou chose me for this mission. Once I find The Source and show him how to use it, he will surely make me his second-in-command, a position from which I shall have incredible influence. Just thinking about it makes me giddy. But I must not to get ahead of myself; the forest looms.\n
366 The adventurers I met are dead. I found them hanging from the trees near a rock formation in the forest. The discovery was startling and sad; though we were both competing for the same goal I felt a certain camaraderie with them. They were, of course, the only other humans on the island.\n
370 I will venture into the forest once more before entering the cave. At the adventurers? base camp I spied batteries and other use (…)
[all...] |
| /external/openfst/src/include/fst/ |
| union-find.h | 36 // Ctor: creates a disjoint set forest for the range [0;max).
|
| dfs-visit.h | 119 // Iterate over trees in DFS forest.
|
| visit.h | 107 // Iterates over trees in visit forest.
|
| equivalent.h | 119 // forest (the union-find algorithm) is used to represent the sets of
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| union-find.h | 33 // Ctor: creates a disjoint set forest for the range [0;max).
|
| dfs-visit.h | 99 // Iterate over trees in DFS forest.
|
| equivalent.h | 103 // forest (the union-find algorithm) is used to represent the sets of
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDFS.h | 34 /// forest of trees with roots at the bottom of the schedule branching upward.
|
| /external/llvm/lib/CodeGen/ |
| StrongPHIElimination.cpp | 24 // forest for this purpose. The dominance forest was shown to be unnecessary,
25 // as it is possible to emulate the creation and traversal of a dominance forest
27 // dominance forest. This technique is explained in:
35 // Careful implementation allows for all of the dominator forest interference
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fuzzer1.test | 129 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');
[all...] |
| /system/core/libutils/ |
| README | 120 AssetManager, which in turn keeps a forest structure of loaded
121 resource.arsc files. Normally, this forest is structured as follows,
|
| /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/icu4c/samples/ufortune/resources/ |
| root.txt | 56 Redwood Forest.",
|
| /external/stlport/stlport/stl/ |
| _rope.c | [all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _rope.c | [all...] |
