| /external/ceres-solver/internal/ceres/ |
| ordered_groups_test.cc | 42 ParameterBlockOrdering ordering; local
43 EXPECT_EQ(ordering.NumGroups(), 0);
44 EXPECT_EQ(ordering.NumElements(), 0);
45 EXPECT_EQ(ordering.GroupSize(1), 0);
47 EXPECT_EQ(ordering.GroupId(&x), -1);
48 EXPECT_FALSE(ordering.Remove(&x));
52 ParameterBlockOrdering ordering; local
54 ordering.AddElementToGroup(x, 1);
55 ordering.AddElementToGroup(x + 1, 1);
56 ordering.AddElementToGroup(x + 2, 1)
79 ParameterBlockOrdering ordering; local
107 ParameterBlockOrdering ordering; local
137 ParameterBlockOrdering ordering; local
163 ParameterBlockOrdering ordering; local
181 ParameterBlockOrdering ordering; local
199 ParameterBlockOrdering ordering; local
[all...] |
| parameter_block_ordering.h | 45 // Uses an approximate independent set ordering to order the parameter
47 // complement based solvers. The output variable ordering contains an
48 // ordering of the parameter blocks and the return value is size of
53 // The ordering vector has the structure
55 // ordering = [independent set,
59 vector<ParameterBlock* >* ordering);
62 // ordering are resolved in favour of the order in which the parameter
65 vector<ParameterBlock* >* ordering);
67 // Use an approximate independent set ordering to decompose the
69 // sets. The ordering covers all the non-constant parameter blocks i
[all...] |
| graph_algorithms_test.cc | 58 vector<int> ordering; local
59 int independent_set_size = IndependentSetOrdering(graph, &ordering);
61 sort(ordering.begin(), ordering.begin() + 3);
62 sort(ordering.begin() + 3, ordering.end());
65 EXPECT_EQ(ordering.size(), 5);
66 EXPECT_EQ(ordering[0], 0);
67 EXPECT_EQ(ordering[1], 2);
68 EXPECT_EQ(ordering[2], 4)
92 vector<int> ordering; local
219 vector<int> ordering; local
231 vector<int> ordering; local
[all...] |
| parameter_block_ordering.cc | 46 vector<ParameterBlock*>* ordering) {
47 CHECK_NOTNULL(ordering)->clear();
54 ordering->push_back(parameter_blocks[i]);
58 int independent_set_size = StableIndependentSetOrdering(*graph, ordering);
60 // Add the excluded blocks to back of the ordering vector.
64 ordering->push_back(parameter_block);
72 vector<ParameterBlock*>* ordering) {
73 CHECK_NOTNULL(ordering)->clear();
76 int independent_set_size = IndependentSetOrdering(*graph, ordering);
79 // Add the excluded blocks to back of the ordering vector
[all...] |
| graph_algorithms.h | 91 // degree. The output vector ordering contains elements of S in
97 vector<Vertex>* ordering) {
101 CHECK_NOTNULL(ordering);
102 ordering->clear();
103 ordering->reserve(num_vertices);
132 ordering->push_back(vertex);
142 int independent_set_size = ordering->size();
145 // ordering. At this stage there should only be black or grey
153 ordering->push_back(vertex);
157 CHECK_EQ(ordering->size(), num_vertices)
[all...] |
| coordinate_descent_minimizer.h | 50 // ordering. The independent set structure allows for all parameter
61 const ParameterBlockOrdering& ordering,
70 // Verify that each group in the ordering forms an independent set.
72 const ParameterBlockOrdering& ordering,
|
| reorder_program.cc | 79 int* ordering) {
89 // No CAMD or the user did not supply a useful ordering, then just
93 ss.ApproximateMinimumDegreeOrdering(block_jacobian_transpose, &ordering[0]);
103 ordering);
112 int* ordering) {
119 // ordering.
131 cxsparse.ApproximateMinimumDegreeOrdering(block_hessian, ordering);
139 const ParameterBlockOrdering& ordering,
143 if (ordering.NumElements() != num_parameter_blocks) {
144 *error = StringPrintf("User specified ordering does not have the same
[all...] |
| suitesparse.cc | 129 // Cholmod can try multiple re-ordering strategies to find a fill
130 // reducing ordering. Here we just tell it use AMD with automatic
134 cc_.method[0].ordering = CHOLMOD_AMD;
156 vector<int> ordering; local
157 if (!BlockAMDOrdering(A, row_blocks, col_blocks, &ordering)) {
160 return AnalyzeCholeskyWithUserOrdering(A, ordering, message);
165 const vector<int>& ordering,
167 CHECK_EQ(ordering.size(), A->nrow);
170 cc_.method[0].ordering = CHOLMOD_GIVEN;
173 cholmod_analyze_p(A, const_cast<int*>(&ordering[0]), NULL, 0, &cc_)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| NullsFirstOrdering.java | 25 /** An ordering that treats {@code null} as less than all other values. */
27 final class NullsFirstOrdering<T> extends Ordering<T> implements Serializable {
28 final Ordering<? super T> ordering; field in class:NullsFirstOrdering
30 NullsFirstOrdering(Ordering<? super T> ordering) {
31 this.ordering = ordering;
44 return ordering.compare(left, right);
47 @Override public <S extends T> Ordering<S> reverse()
[all...] |
| NullsLastOrdering.java | 25 /** An ordering that treats {@code null} as greater than all other values. */
27 final class NullsLastOrdering<T> extends Ordering<T> implements Serializable {
28 final Ordering<? super T> ordering; field in class:NullsLastOrdering
30 NullsLastOrdering(Ordering<? super T> ordering) {
31 this.ordering = ordering;
44 return ordering.compare(left, right);
47 @Override public <S extends T> Ordering<S> reverse()
[all...] |
| ByFunctionOrdering.java | 30 * An ordering that orders elements by applying an order to the result of a
35 extends Ordering<F> implements Serializable {
37 final Ordering<T> ordering; field in class:ByFunctionOrdering
40 Function<F, ? extends T> function, Ordering<T> ordering) {
42 this.ordering = checkNotNull(ordering);
46 return ordering.compare(function.apply(left), function.apply(right));
56 && this.ordering.equals(that.ordering)
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/com/android/internal/view/menu/ |
| MenuBuilder_Delegate.java | 34 int categoryOrder, int ordering, CharSequence title, int defaultShowAsAction) {
35 return new BridgeMenuItemImpl(thisMenu, group, id, categoryOrder, ordering, title,
|
| BridgeMenuItemImpl.java | 41 BridgeMenuItemImpl(MenuBuilder menu, int group, int id, int categoryOrder, int ordering,
43 super(menu, group, id, categoryOrder, ordering, title, showAsAction);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| Extensions.java | 20 private Vector ordering = new Vector(); field in class:Extensions
59 ordering.addElement(ext.getExtnId());
71 this.ordering.addElement(extension.getExtnId());
87 this.ordering.addElement(ext.getExtnId());
97 return ordering.elements();
143 Enumeration e = ordering.elements();
181 return toOidArray(ordering);
198 for (int i = 0; i != ordering.size(); i++)
200 Object oid = ordering.elementAt(i);
|
| X509Extensions.java | 211 private Vector ordering = new Vector(); field in class:X509Extensions
273 ordering.addElement(s.getObjectAt(0));
289 * Constructor from a table of extensions with ordering.
295 Vector ordering,
300 if (ordering == null)
306 e = ordering.elements();
311 this.ordering.addElement(ASN1ObjectIdentifier.getInstance(e.nextElement()));
314 e = this.ordering.elements();
340 this.ordering.addElement(e.nextElement());
345 e = this.ordering.elements()
[all...] |
| X509Name.java | 353 private Vector ordering = new Vector(); field in class:X509Name
425 ordering.addElement(ASN1ObjectIdentifier.getInstance(s.getObjectAt(0)));
466 * following a specific ordering, you should use the constructor
467 * with the ordering specified below.
468 * @deprecated use an ordered constructor! The hashtable ordering is rarely correct
477 * Constructor from a table of attributes with ordering.
481 * construction process. The ordering vector should contain the OIDs
485 Vector ordering,
488 this(ordering, attributes, new X509DefaultEntryConverter());
492 * Constructor from a table of attributes with ordering
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/unittest/test/ |
| test_runner.py | 73 ordering = []
77 ordering.append('setUp')
82 ordering.append('test')
85 ordering.append('tearDown')
90 ordering.append('cleanup1')
92 ordering.append('cleanup2')
98 ordering.append('success')
104 self.assertEqual(ordering, ['setUp', 'test', 'tearDown',
108 ordering = []
112 self.assertEqual(ordering, ['setUp', 'cleanup1']
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/unittest/test/ |
| test_runner.py | 73 ordering = []
77 ordering.append('setUp')
82 ordering.append('test')
85 ordering.append('tearDown')
90 ordering.append('cleanup1')
92 ordering.append('cleanup2')
98 ordering.append('success')
104 self.assertEqual(ordering, ['setUp', 'test', 'tearDown',
108 ordering = []
112 self.assertEqual(ordering, ['setUp', 'cleanup1']
[all...] |
| /external/chromium_org/third_party/freetype/include/freetype/ |
| ftcid.h | 58 * Retrieve the Registry/Ordering/Supplement triple (also known as the
69 * ordering ::
70 * The ordering, as a C~string, owned by the face.
88 const char* *ordering,
|
| /external/freetype/include/ |
| ftcid.h | 58 * Retrieve the Registry/Ordering/Supplement triple (also known as the
69 * ordering ::
70 * The ordering, as a C~string, owned by the face.
88 const char* *ordering,
|
| /external/pdfium/core/include/thirdparties/freetype/freetype/ |
| ftcid.h | 58 * Retrieve the Registry/Ordering/Supplement triple (also known as the
69 * ordering ::
70 * The ordering, as a C~string, owned by the face.
88 const char* *ordering,
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/ |
| ftcid.h | 58 * Retrieve the Registry/Ordering/Supplement triple (also known as the
69 * ordering ::
70 * The ordering, as a C~string, owned by the face.
88 const char* *ordering,
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cid/ |
| cidriver.c | 106 const char* *ordering,
115 if ( ordering )
116 *ordering = cid->ordering;
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/ |
| ftcid.c | 29 const char* *ordering,
54 if ( ordering )
55 *ordering = o;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| OrderingTest.java | 29 import com.google.common.collect.Ordering.ArbitraryOrdering;
30 import com.google.common.collect.Ordering.IncomparableValueException;
48 * Unit tests for {@code Ordering}.
56 private final Ordering<Number> numberOrdering = new NumberOrdering();
59 Ordering<Integer> comparator = Ordering.natural();
75 assertEquals("Ordering.natural()", comparator.toString());
79 Ordering<String> caseInsensitiveOrdering
80 = Ordering.from(String.CASE_INSENSITIVE_ORDER);
86 Ordering<String> orderingFromOrdering
[all...] |
