| /external/ceres-solver/internal/ceres/ |
| D | ordered_groups_test.cc | 42 ParameterBlockOrdering ordering; in TEST() local
43 EXPECT_EQ(ordering.NumGroups(), 0); in TEST()
44 EXPECT_EQ(ordering.NumElements(), 0); in TEST()
45 EXPECT_EQ(ordering.GroupSize(1), 0); in TEST()
47 EXPECT_EQ(ordering.GroupId(&x), -1); in TEST()
48 EXPECT_FALSE(ordering.Remove(&x)); in TEST()
52 ParameterBlockOrdering ordering; in TEST() local
54 ordering.AddElementToGroup(x, 1); in TEST()
55 ordering.AddElementToGroup(x + 1, 1); in TEST()
56 ordering.AddElementToGroup(x + 2, 1); in TEST()
[all …]
|
| D | graph_algorithms_test.cc | 58 vector<int> ordering; in TEST() local
59 int independent_set_size = IndependentSetOrdering(graph, &ordering); in TEST()
61 sort(ordering.begin(), ordering.begin() + 3); in TEST()
62 sort(ordering.begin() + 3, ordering.end()); in TEST()
65 EXPECT_EQ(ordering.size(), 5); in TEST()
66 EXPECT_EQ(ordering[0], 0); in TEST()
67 EXPECT_EQ(ordering[1], 2); in TEST()
68 EXPECT_EQ(ordering[2], 4); in TEST()
69 EXPECT_EQ(ordering[3], 1); in TEST()
70 EXPECT_EQ(ordering[4], 3); in TEST()
[all …]
|
| D | parameter_block_ordering.cc | 46 vector<ParameterBlock*>* ordering) { in ComputeStableSchurOrdering() argument
47 CHECK_NOTNULL(ordering)->clear(); in ComputeStableSchurOrdering()
54 ordering->push_back(parameter_blocks[i]); in ComputeStableSchurOrdering()
58 int independent_set_size = StableIndependentSetOrdering(*graph, ordering); in ComputeStableSchurOrdering()
64 ordering->push_back(parameter_block); in ComputeStableSchurOrdering()
72 vector<ParameterBlock*>* ordering) { in ComputeSchurOrdering() argument
73 CHECK_NOTNULL(ordering)->clear(); in ComputeSchurOrdering()
76 int independent_set_size = IndependentSetOrdering(*graph, ordering); in ComputeSchurOrdering()
83 ordering->push_back(parameter_block); in ComputeSchurOrdering()
91 ParameterBlockOrdering* ordering) { in ComputeRecursiveIndependentSetOrdering() argument
[all …]
|
| D | graph_algorithms.h | 97 vector<Vertex>* ordering) { in IndependentSetOrdering() argument
101 CHECK_NOTNULL(ordering); in IndependentSetOrdering()
102 ordering->clear(); in IndependentSetOrdering()
103 ordering->reserve(num_vertices); in IndependentSetOrdering()
132 ordering->push_back(vertex); in IndependentSetOrdering()
142 int independent_set_size = ordering->size(); in IndependentSetOrdering()
153 ordering->push_back(vertex); in IndependentSetOrdering()
157 CHECK_EQ(ordering->size(), num_vertices); in IndependentSetOrdering()
173 vector<Vertex>* ordering) { in StableIndependentSetOrdering() argument
174 CHECK_NOTNULL(ordering); in StableIndependentSetOrdering()
[all …]
|
| D | reorder_program.cc | 79 int* ordering) { in OrderingForSparseNormalCholeskyUsingSuiteSparse() argument
93 ss.ApproximateMinimumDegreeOrdering(block_jacobian_transpose, &ordering[0]); in OrderingForSparseNormalCholeskyUsingSuiteSparse()
103 ordering); in OrderingForSparseNormalCholeskyUsingSuiteSparse()
112 int* ordering) { in OrderingForSparseNormalCholeskyUsingCXSparse() argument
131 cxsparse.ApproximateMinimumDegreeOrdering(block_hessian, ordering); in OrderingForSparseNormalCholeskyUsingCXSparse()
139 const ParameterBlockOrdering& ordering, in ApplyOrdering() argument
143 if (ordering.NumElements() != num_parameter_blocks) { in ApplyOrdering()
148 ordering.NumElements()); in ApplyOrdering()
157 ordering.group_to_elements(); in ApplyOrdering()
296 vector<int> ordering(parameter_blocks.size(), 0); in MaybeReorderSchurComplementColumnsUsingSuiteSparse() local
[all …]
|
| D | suitesparse.cc | 134 cc_.method[0].ordering = CHOLMOD_AMD; in AnalyzeCholesky()
156 vector<int> ordering; in BlockAnalyzeCholesky() local
157 if (!BlockAMDOrdering(A, row_blocks, col_blocks, &ordering)) { in BlockAnalyzeCholesky()
160 return AnalyzeCholeskyWithUserOrdering(A, ordering, message); in BlockAnalyzeCholesky()
165 const vector<int>& ordering, in AnalyzeCholeskyWithUserOrdering() argument
167 CHECK_EQ(ordering.size(), A->nrow); in AnalyzeCholeskyWithUserOrdering()
170 cc_.method[0].ordering = CHOLMOD_GIVEN; in AnalyzeCholeskyWithUserOrdering()
173 cholmod_analyze_p(A, const_cast<int*>(&ordering[0]), NULL, 0, &cc_); in AnalyzeCholeskyWithUserOrdering()
190 cc_.method[0].ordering = CHOLMOD_NATURAL; in AnalyzeCholeskyWithNaturalOrdering()
209 vector<int>* ordering) { in BlockAMDOrdering() argument
[all …]
|
| D | parameter_block_ordering.h | 59 vector<ParameterBlock* >* ordering);
65 vector<ParameterBlock* >* ordering);
72 ParameterBlockOrdering* ordering);
83 void OrderingToGroupSizes(const ParameterBlockOrdering* ordering,
|
| D | coordinate_descent_minimizer.cc | 62 const ParameterBlockOrdering& ordering, in Init() argument
71 map<int, set<double*> > group_to_elements = ordering.group_to_elements(); in Init()
91 if (!ordering.IsMember(parameter_blocks[i]->mutable_user_state())) { in Init()
238 const ParameterBlockOrdering& ordering, in IsOrderingValid() argument
241 ordering.group_to_elements(); in IsOrderingValid()
263 scoped_ptr<ParameterBlockOrdering> ordering(new ParameterBlockOrdering); in CreateOrdering() local
264 ComputeRecursiveIndependentSetOrdering(program, ordering.get()); in CreateOrdering()
265 ordering->Reverse(); in CreateOrdering()
266 return ordering.release(); in CreateOrdering()
|
| D | cxsparse.cc | 129 int* ordering = cs_amd(1, &block_matrix); in BlockAnalyzeCholesky() local
131 copy(ordering, ordering + num_row_blocks, &block_ordering[0]); in BlockAnalyzeCholesky()
132 cs_free(ordering); in BlockAnalyzeCholesky()
192 void CXSparse::ApproximateMinimumDegreeOrdering(cs_di* A, int* ordering) { in ApproximateMinimumDegreeOrdering() argument
194 copy(cs_ordering, cs_ordering + A->m, ordering); in ApproximateMinimumDegreeOrdering()
|
| D | suitesparse.h | 166 const vector<int>& ordering,
220 vector<int>* ordering);
225 bool ApproximateMinimumDegreeOrdering(cholmod_sparse* matrix, int* ordering);
257 int* ordering);
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | NullsLastOrdering.java | 28 final Ordering<? super T> ordering; field in NullsLastOrdering
30 NullsLastOrdering(Ordering<? super T> ordering) { in NullsLastOrdering() argument
31 this.ordering = ordering; in NullsLastOrdering()
44 return ordering.compare(left, right); in compare()
49 return ordering.reverse().nullsFirst(); in reverse()
53 return ordering.nullsFirst(); in nullsFirst()
67 return this.ordering.equals(that.ordering); in equals()
73 return ordering.hashCode() ^ -921210296; // meaningless in hashCode()
77 return ordering + ".nullsLast()"; in toString()
|
| D | NullsFirstOrdering.java | 28 final Ordering<? super T> ordering; field in NullsFirstOrdering
30 NullsFirstOrdering(Ordering<? super T> ordering) { in NullsFirstOrdering() argument
31 this.ordering = ordering; in NullsFirstOrdering()
44 return ordering.compare(left, right); in compare()
49 return ordering.reverse().nullsLast(); in reverse()
58 return ordering.nullsLast(); in nullsLast()
67 return this.ordering.equals(that.ordering); in equals()
73 return ordering.hashCode() ^ 957692532; // meaningless in hashCode()
77 return ordering + ".nullsFirst()"; in toString()
|
| D | ByFunctionOrdering.java | 37 final Ordering<T> ordering; field in ByFunctionOrdering
40 Function<F, ? extends T> function, Ordering<T> ordering) { in ByFunctionOrdering() argument
42 this.ordering = checkNotNull(ordering); in ByFunctionOrdering()
46 return ordering.compare(function.apply(left), function.apply(right)); in compare()
56 && this.ordering.equals(that.ordering); in equals()
62 return Objects.hashCode(function, ordering); in hashCode()
66 return ordering + ".onResultOf(" + function + ")"; in toString()
|
| D | MinMaxPriorityQueue.java | 214 private <T extends B> Ordering<T> ordering() { in ordering() method in MinMaxPriorityQueue.Builder
227 Ordering<E> ordering = builder.ordering(); in MinMaxPriorityQueue() local
228 this.minHeap = new Heap(ordering); in MinMaxPriorityQueue()
229 this.maxHeap = new Heap(ordering.reverse()); in MinMaxPriorityQueue()
488 final Ordering<E> ordering; field in MinMaxPriorityQueue.Heap
491 Heap(Ordering<E> ordering) { in Heap() argument
492 this.ordering = ordering; in Heap()
496 return ordering.compare(elementData(a), elementData(b)); in compareElements()
556 if (ordering.compare(e, x) <= 0) { in bubbleUpAlternatingLevels()
626 if (ordering.compare(uncleElement, parentElement) < 0) { in crossOverUp()
[all …]
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| D | X509Name.java | 353 private Vector ordering = new Vector(); field in X509Name
425 ordering.addElement(ASN1ObjectIdentifier.getInstance(s.getObjectAt(0))); in X509Name()
485 Vector ordering, in X509Name() argument
488 this(ordering, attributes, new X509DefaultEntryConverter()); in X509Name()
504 Vector ordering, in X509Name() argument
510 if (ordering != null) in X509Name()
512 for (int i = 0; i != ordering.size(); i++) in X509Name()
514 this.ordering.addElement(ordering.elementAt(i)); in X509Name()
524 this.ordering.addElement(e.nextElement()); in X509Name()
529 for (int i = 0; i != this.ordering.size(); i++) in X509Name()
[all …]
|
| D | X509Extensions.java | 211 private Vector ordering = new Vector(); field in X509Extensions
273 ordering.addElement(s.getObjectAt(0)); in X509Extensions()
295 Vector ordering, in X509Extensions() argument
300 if (ordering == null) in X509Extensions()
306 e = ordering.elements(); in X509Extensions()
311 this.ordering.addElement(ASN1ObjectIdentifier.getInstance(e.nextElement())); in X509Extensions()
314 e = this.ordering.elements(); in X509Extensions()
340 this.ordering.addElement(e.nextElement()); in X509Extensions()
345 e = this.ordering.elements(); in X509Extensions()
362 return ordering.elements(); in oids()
[all …]
|
| D | Extensions.java | 20 private Vector ordering = new Vector(); field in Extensions
59 ordering.addElement(ext.getExtnId()); in Extensions()
71 this.ordering.addElement(extension.getExtnId()); in Extensions()
87 this.ordering.addElement(ext.getExtnId()); in Extensions()
97 return ordering.elements(); in oids()
143 Enumeration e = ordering.elements(); in toASN1Primitive()
181 return toOidArray(ordering); in getExtensionOIDs()
198 for (int i = 0; i != ordering.size(); i++) in getExtensionOIDs()
200 Object oid = ordering.elementAt(i); in getExtensionOIDs()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | OrderingTest.java | 196 Ordering<Object> ordering = Ordering.usingToString();
197 Helpers.testComparator(ordering, 1, 12, 124, 2);
198 assertEquals("Ordering.usingToString()", ordering.toString());
199 assertSame(ordering, reserialize(ordering));
363 Ordering<String> ordering = Ordering.natural();
364 Ordering<Iterable<String>> lexy = ordering.lexicographical();
376 Ordering<Integer> ordering = Ordering.natural().nullsFirst();
377 Helpers.testComparator(ordering, null, Integer.MIN_VALUE, 0, 1);
381 Ordering<Integer> ordering = Ordering.natural().nullsLast();
382 Helpers.testComparator(ordering, 0, 1, Integer.MAX_VALUE, null);
[all …]
|
| /external/chromium_org/v8/test/mjsunit/es6/ |
| D | microtask-delivery.js | 30 var ordering = []; variable
32 ordering = [];
44 assertArrayValues(expected, ordering);
56 ordering.push('p' + id);
64 ordering.push('p' + id + ':' + t++);
80 ordering.push('o' + id);
|
| /external/eigen/Eigen/ |
| D | OrderingMethods | 13 * It defines various built-in and external ordering methods for sparse matrices.
17 * those ordering methods and applied to the columns of the matrix.
37 * It is possible as well to call directly a particular ordering method for your own purpose,
39 * AMDOrdering<int> ordering;
44 * ordering(A, perm); // Call AMD
54 * // Call the ordering on the pattern of the lower triangular matrix A
55 * ordering(A.selfadjointView<Lower>(), perm);
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cid/ |
| D | cidriver.c | 106 const char* *ordering, in cid_get_ros()
115 if ( ordering ) in cid_get_ros()
116 *ordering = cid->ordering; in cid_get_ros()
|
| /external/chromium_org/third_party/boringssl/src/ssl/pqueue/ |
| D | pqueue_test.c | 49 int ordering[NUM_ITEMS] = {9, 6, 3, 4, 0, 2, 7, 1, 8, 5}; in fixed_random() local
58 priority[7] = ordering[i]; in fixed_random()
59 pitem *item = pitem_new(priority, &ordering[i]); in fixed_random()
|
| /external/ceres-solver/examples/ |
| D | bundle_adjuster.cc | 92 DEFINE_string(ordering, "automatic", "Options are: automatic, user.");
204 ceres::ParameterBlockOrdering* ordering = in SetOrdering() local
209 ordering->AddElementToGroup(points + point_block_size * i, 0); in SetOrdering()
215 ordering->AddElementToGroup(cameras + camera_block_size * i, 1); in SetOrdering()
219 ordering->AddElementToGroup(cameras + camera_block_size * i + 4, 1); in SetOrdering()
223 options->linear_solver_ordering.reset(ordering); in SetOrdering()
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/ |
| D | ftcid.c | 29 const char* *ordering, in FT_Get_CID_Registry_Ordering_Supplement()
54 if ( ordering ) in FT_Get_CID_Registry_Ordering_Supplement()
55 *ordering = o; in FT_Get_CID_Registry_Ordering_Supplement()
|
| /external/lldb/test/unittest2/test/ |
| D | test_case.py | 109 ordering = []
113 ordering.append('setUp')
118 ordering.append('test')
121 ordering.append('tearDown')
126 ordering.append('cleanup1')
128 ordering.append('cleanup2')
134 ordering.append('success')
140 self.assertEqual(ordering, ['setUp', 'test', 'tearDown',
144 ordering = []
148 self.assertEqual(ordering, ['setUp', 'cleanup1'])
[all …]
|