HomeSort by relevance Sort by last modified time
    Searched refs:Combine (Results 1 - 25 of 25) sorted by null

  /external/webrtc/src/system_wrappers/source/
data_log_unittest.cc 118 ASSERT_EQ(DataLog::AddTable(DataLog::Combine("a proper table", 1)), 0);
121 ASSERT_LT(DataLog::AddTable(DataLog::Combine("table failure", 1)), 0);
126 DataLog::Combine("a proper table", 1));
131 DataLog::AddTable(DataLog::Combine("table", 1));
132 DataLog::AddColumn(DataLog::Combine("table", 1), "arrival", 1);
133 DataLog::AddColumn(DataLog::Combine("table", 1), "timestamp", 1);
134 DataLog::AddColumn(DataLog::Combine("table", 1), "size", 5);
137 DataLog::InsertCell(DataLog::Combine("table", 1), "arrival",
139 DataLog::InsertCell(DataLog::Combine("table", 1), "timestamp",
141 DataLog::InsertCell(DataLog::Combine("table", 1), "size", sizes, 5)
    [all...]
data_log_no_op.cc 24 std::string DataLog::Combine(const std::string& table_name, int table_id) {
data_log_unittest_disabled.cc 39 std::string table_name = DataLog::Combine("table", 1);
49 // Don't use the table name we would get from Combine on a disabled DataLog.
data_log_c.cc 32 std::string combined = webrtc::DataLog::Combine(table_name, table_id);
data_log.cc 284 std::string DataLog::Combine(const std::string& table_name, int table_id) {
  /external/webrtc/src/system_wrappers/interface/
data_log.h 58 static std::string Combine(const std::string& table_name, int table_id);
  /external/chromium/testing/gtest/samples/
sample8_unittest.cc 33 // Combine() helps with generating all possible combinations of such flags,
86 using ::testing::Combine;
153 // Here, we instantiate our tests with a list of parameters. We must combine
157 // PrecalcPrimeTable instance and some inside it (10). Combine will produce all
161 Combine(Bool(), Values(1, 10)));
165 // Google Test may not support Combine() with some compilers. If we
  /external/gtest/samples/
sample8_unittest.cc 33 // Combine() helps with generating all possible combinations of such flags,
86 using ::testing::Combine;
153 // Here, we instantiate our tests with a list of parameters. We must combine
157 // PrecalcPrimeTable instance and some inside it (10). Combine will produce all
161 Combine(Bool(), Values(1, 10)));
165 // Google Test may not support Combine() with some compilers. If we
  /external/protobuf/gtest/samples/
sample8_unittest.cc 33 // Combine() helps with generating all possible combinations of such flags,
86 using ::testing::Combine;
153 // Here, we instantiate our tests with a list of parameters. We must combine
157 // PrecalcPrimeTable instance and some inside it (10). Combine will produce all
161 Combine(Bool(), Values(1, 10)));
165 // Google Test doesn't support Combine() on some platforms and compilers,
  /external/chromium/testing/gtest/test/
gtest-param-test_test.cc 66 using ::testing::Combine;
462 // Tests that Combine() with two parameters generates the expected sequence.
467 Combine(Values(foo, bar), Values(3, 4));
475 // Tests that Combine() with three parameters generates the expected sequence.
477 const ParamGenerator<tuple<int, int, int> > gen = Combine(Values(0, 1),
488 // Tests that the Combine() with the first parameter generating a single value
492 const ParamGenerator<tuple<int, int> > gen = Combine(Values(42),
499 // Tests that the Combine() with the second parameter generating a single value
503 const ParamGenerator<tuple<int, int> > gen = Combine(Values(0, 1),
511 // Combine() produces an empty sequence, too
    [all...]
  /external/gtest/test/
gtest-param-test_test.cc 66 using ::testing::Combine;
462 // Tests that Combine() with two parameters generates the expected sequence.
467 Combine(Values(foo, bar), Values(3, 4));
475 // Tests that Combine() with three parameters generates the expected sequence.
477 const ParamGenerator<tuple<int, int, int> > gen = Combine(Values(0, 1),
488 // Tests that the Combine() with the first parameter generating a single value
492 const ParamGenerator<tuple<int, int> > gen = Combine(Values(42),
499 // Tests that the Combine() with the second parameter generating a single value
503 const ParamGenerator<tuple<int, int> > gen = Combine(Values(0, 1),
511 // Combine() produces an empty sequence, too
    [all...]
  /external/protobuf/gtest/test/
gtest-param-test_test.cc 64 using ::testing::Combine;
430 // Tests that Combine() with two parameters generates the expected sequence.
435 Combine(Values(foo, bar), Values(3, 4));
443 // Tests that Combine() with three parameters generates the expected sequence.
445 const ParamGenerator<tuple<int, int, int> > gen = Combine(Values(0, 1),
456 // Tests that the Combine() with the first parameter generating a single value
460 const ParamGenerator<tuple<int, int> > gen = Combine(Values(42),
467 // Tests that the Combine() with the second parameter generating a single value
471 const ParamGenerator<tuple<int, int> > gen = Combine(Values(0, 1),
479 // Combine() produces an empty sequence, too
    [all...]
  /external/v8/src/
type-info.h 97 static TypeInfo Combine(TypeInfo a, TypeInfo b) {
hydrogen-instructions.h 352 HType Combine(HType other) {
361 return Combine(other).Equals(other);
    [all...]
hydrogen-instructions.cc     [all...]
  /external/chromium/testing/gtest/include/gtest/
gtest-param-test.h 93 // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product
    [all...]
  /external/gtest/include/gtest/
gtest-param-test.h 93 // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product
    [all...]
  /external/llvm/utils/unittest/googletest/include/gtest/
gtest-param-test.h 93 // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product
    [all...]
  /external/protobuf/gtest/include/gtest/
gtest-param-test.h 89 // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGISel.cpp 156 "dag combine pass"));
166 "dag combine pass"));
168 ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
170 " dag combine pass"));
568 CurDAG->Combine(BeforeLegalizeTypes, *AA, OptLevel);
590 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
596 CurDAG->Combine(AfterLegalizeTypes, *AA, OptLevel);
615 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
621 CurDAG->Combine(AfterLegalizeVectorOps, *AA, OptLevel);
643 CurDAG->Combine(AfterLegalizeDAG, *AA, OptLevel)
    [all...]
DAGCombiner.cpp 160 /// combine - call the node-specific routine that knows how to fold each
163 SDValue combine(SDNode *N);
621 "Cannot combine value to value of different type!"));
1164 SDValue DAGCombiner::combine(SDNode *N) { function in class:DAGCombiner
    [all...]
  /external/llvm/include/llvm/CodeGen/
SelectionDAG.h 310 /// Combine - This iterates over the nodes in the SelectionDAG, folding
312 /// Level argument controls whether Combine is allowed to produce nodes and
314 void Combine(CombineLevel Level, AliasAnalysis &AA,
    [all...]
  /external/mesa3d/src/mesa/main/
mtypes.h     [all...]
  /external/libvpx/vp8/common/ppc/
loopfilter_filters_altivec.asm 847 vperm \U, \New, \U, \Umask ;# Combine new pels with siblings
    [all...]
  /cts/suite/pts/hostTests/browser/browserlauncher/assets/octane/
box2d.js 55 T}m=Math.min(m,J);if(f>m)return false}b.fraction=f;return true};B.prototype.TestOverlap=function(b){var e=b.lowerBound.y-this.upperBound.y,f=this.lowerBound.y-b.upperBound.y;if(b.lowerBound.x-this.upperBound.x>0||e>0)return false;if(this.lowerBound.x-b.upperBound.x>0||f>0)return false;return true};B.Combine=function(b,e){var f=new B;f.Combine(b,e);return f};B.prototype.Combine=function(b,e){this.lowerBound.x=Math.min(b.lowerBound.x,e.lowerBound.x);this.lowerBound.y=Math.min(b.lowerBound.y,e.lowerBound.y);
84 2-e.y)<Math.abs((f.aabb.lowerBound.x+f.aabb.upperBound.x)/2-e.x)+Math.abs((f.aabb.lowerBound.y+f.aabb.upperBound.y)/2-e.y)?m:f}while(f.IsLeaf()==false)}e=f.parent;m=this.AllocateNode();m.parent=e;m.userData=null;m.aabb.Combine(b.aabb,f.aabb);if(e){if(f.parent.child1==f)e.child1=m;else e.child2=m;m.child1=f;m.child2=b;f.parent=m;b.parent=m;do{if(e.aabb.Contains(m.aabb))break;e.aabb.Combine(e.child1.aabb,e.child2.aabb);m=e;e=e.pa (…)
    [all...]

Completed in 872 milliseconds