Searched refs:GroupSize (Results 1 – 7 of 7) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | ordered_groups_test.cc | 45 EXPECT_EQ(ordering.GroupSize(1), 0); in TEST()
61 EXPECT_EQ(ordering.GroupSize(1), 3); in TEST()
62 EXPECT_EQ(ordering.GroupSize(0), 0); in TEST()
70 EXPECT_EQ(ordering.GroupSize(1), 2); in TEST()
71 EXPECT_EQ(ordering.GroupSize(0), 0); in TEST()
88 EXPECT_EQ(ordering.GroupSize(1), 3); in TEST()
89 EXPECT_EQ(ordering.GroupSize(0), 0); in TEST()
97 EXPECT_EQ(ordering.GroupSize(1), 2); in TEST()
98 EXPECT_EQ(ordering.GroupSize(5), 1); in TEST()
99 EXPECT_EQ(ordering.GroupSize(0), 0); in TEST()
[all …]
|
| D | solver_impl.cc | 707 linear_solver_ordering->GroupSize(min_group_id) == 0) { in CreateReducedProgram()
|
| /external/ceres-solver/include/ceres/ |
| D | ordered_groups.h | 160 int GroupSize(const int group) const { in GroupSize() function
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 992 const unsigned GroupSize = 8; in addThroughConstraints() local
993 SpillPlacement::BlockConstraint BCS[GroupSize]; in addThroughConstraints()
994 unsigned TBS[GroupSize]; in addThroughConstraints()
1002 assert(T < GroupSize && "Array overflow"); in addThroughConstraints()
1004 if (++T == GroupSize) { in addThroughConstraints()
1011 assert(B < GroupSize && "Array overflow"); in addThroughConstraints()
1026 if (++B == GroupSize) { in addThroughConstraints()
|
| /external/protobuf/src/google/protobuf/ |
| D | wire_format_lite.h | 482 static inline int GroupSize (const MessageLite& value);
|
| D | wire_format_lite_inl.h | 831 inline int WireFormatLite::GroupSize(const MessageLite& value) { in GroupSize() function
|
| /external/ceres-solver/docs/source/ |
| D | solving.rst | 1597 .. function:: int ParameterBlockOrdering::GroupSize(const int group) const
|