/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 | 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 | parameter_block_ordering.h | 59 vector<ParameterBlock* >* ordering); 65 vector<ParameterBlock* >* ordering); 72 ParameterBlockOrdering* ordering); 83 void OrderingToGroupSizes(const ParameterBlockOrdering* ordering,
|
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()
|
/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 | 215 private <T extends B> Ordering<T> ordering() { in ordering() method in MinMaxPriorityQueue.Builder 228 Ordering<E> ordering = builder.ordering(); in MinMaxPriorityQueue() local 229 this.minHeap = new Heap(ordering); in MinMaxPriorityQueue() 230 this.maxHeap = new Heap(ordering.reverse()); in MinMaxPriorityQueue() 489 final Ordering<E> ordering; field in MinMaxPriorityQueue.Heap 492 Heap(Ordering<E> ordering) { in Heap() argument 493 this.ordering = ordering; in Heap() 497 return ordering.compare(elementData(a), elementData(b)); in compareElements() 557 if (ordering.compare(e, x) <= 0) { in bubbleUpAlternatingLevels() 627 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 | 210 private Vector ordering = new Vector(); field in X509Extensions 272 ordering.addElement(s.getObjectAt(0)); in X509Extensions() 294 Vector ordering, in X509Extensions() argument 299 if (ordering == null) in X509Extensions() 305 e = ordering.elements(); in X509Extensions() 310 this.ordering.addElement(ASN1ObjectIdentifier.getInstance(e.nextElement())); in X509Extensions() 313 e = this.ordering.elements(); in X509Extensions() 339 this.ordering.addElement(e.nextElement()); in X509Extensions() 344 e = this.ordering.elements(); in X509Extensions() 361 return ordering.elements(); in oids() [all …]
|
D | Extensions.java | 20 private Vector ordering = new Vector(); field in Extensions 60 ordering.addElement(ext.getExtnId()); in Extensions() 72 this.ordering.addElement(extension.getExtnId()); in Extensions() 88 this.ordering.addElement(ext.getExtnId()); in Extensions() 98 return ordering.elements(); in oids() 144 Enumeration e = ordering.elements(); in toASN1Primitive() 182 return toOidArray(ordering); in getExtensionOIDs() 199 for (int i = 0; i != ordering.size(); i++) in getExtensionOIDs() 201 Object oid = ordering.elementAt(i); in getExtensionOIDs()
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
D | OrderingTest.java | 211 Ordering<Object> ordering = Ordering.usingToString(); 212 Helpers.testComparator(ordering, 1, 12, 124, 2); 213 assertEquals("Ordering.usingToString()", ordering.toString()); 214 assertSame(ordering, reserialize(ordering)); 378 Ordering<String> ordering = Ordering.natural(); 379 Ordering<Iterable<String>> lexy = ordering.lexicographical(); 390 .addEqualityGroup(lexy, ordering.lexicographical()) 397 Ordering<Integer> ordering = Ordering.natural().nullsFirst(); 398 Helpers.testComparator(ordering, null, Integer.MIN_VALUE, 0, 1); 401 .addEqualityGroup(ordering, Ordering.natural().nullsFirst()) [all …]
|
/external/guava/guava-tests/test/com/google/common/collect/ |
D | OrderingTest.java | 213 Ordering<Object> ordering = Ordering.usingToString(); 214 Helpers.testComparator(ordering, 1, 12, 124, 2); 215 assertEquals("Ordering.usingToString()", ordering.toString()); 216 assertSame(ordering, reserialize(ordering)); 380 Ordering<String> ordering = Ordering.natural(); 381 Ordering<Iterable<String>> lexy = ordering.lexicographical(); 392 .addEqualityGroup(lexy, ordering.lexicographical()) 399 Ordering<Integer> ordering = Ordering.natural().nullsFirst(); 400 Helpers.testComparator(ordering, null, Integer.MIN_VALUE, 0, 1); 403 .addEqualityGroup(ordering, Ordering.natural().nullsFirst()) [all …]
|
/external/jetty/src/java/org/eclipse/jetty/webapp/ |
D | FragmentDescriptor.java | 86 XmlParser.Node ordering = root.get("ordering"); in processOrdering() local 87 if (ordering == null) in processOrdering() 92 processBefores(ordering); in processOrdering() 93 processAfters(ordering); in processOrdering() 97 public void processBefores (XmlParser.Node ordering) in processBefores() argument 100 XmlParser.Node before = ordering.get("before"); in processBefores() 123 public void processAfters (XmlParser.Node ordering) in processAfters() argument 126 XmlParser.Node after = ordering.get("after"); in processAfters()
|
/external/v8/test/mjsunit/es6/ |
D | microtask-delivery.js | 31 var ordering = []; variable 33 ordering = []; 45 assertArrayValues(expected, ordering); 57 ordering.push('p' + id); 65 ordering.push('p' + id + ':' + t++); 81 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/boringssl/src/ssl/pqueue/ |
D | pqueue_test.c | 61 int ordering[NUM_ITEMS] = {9, 6, 3, 4, 0, 2, 7, 1, 8, 5}; in fixed_random() local 74 priority[7] = ordering[i]; in fixed_random() 75 item = pitem_new(priority, &ordering[i]); in fixed_random() 84 priority[7] = ordering[i]; in fixed_random() 85 item = pitem_new(priority, &ordering[i]); in fixed_random()
|
/external/selinux/libselinux/src/ |
D | get_context_list.c | 161 unsigned int *ordering, unsigned int *nordered) in get_context_order() argument 258 if (ordering[i] == nreach) in get_context_order() 259 ordering[i] = (*nordered)++; in get_context_order() 398 unsigned int *ordering = NULL; in get_ordered_context_list() local 427 ordering = malloc(nreach * sizeof(unsigned int)); in get_ordered_context_list() 428 if (!ordering) in get_ordered_context_list() 431 ordering[i] = nreach; in get_ordered_context_list() 443 rc = get_context_order(fp, fromcon, reachable, nreach, ordering, in get_ordered_context_list() 457 rc = get_context_order(fp, fromcon, reachable, nreach, ordering, in get_ordered_context_list() 478 co[i].order = ordering[i]; in get_ordered_context_list() [all …]
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
D | PrettyPrinter.java | 43 private Comparator<String> ordering; field in PrettyPrinter 72 return ordering; in getOrdering() 79 public PrettyPrinter setOrdering(Comparator ordering) { in setOrdering() argument 80 …this.ordering = ordering == null ? CODEPOINT_ORDER : new android.icu.impl.MultiComparator<String>(… in setOrdering() 124 TreeSet<String> orderedStrings = new TreeSet<String>(ordering); in format()
|
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
D | PrettyPrinter.java | 42 private Comparator<String> ordering; field in PrettyPrinter 71 return ordering; in getOrdering() 78 public PrettyPrinter setOrdering(Comparator ordering) { in setOrdering() argument 79 …this.ordering = ordering == null ? CODEPOINT_ORDER : new com.ibm.icu.impl.MultiComparator<String>(… in setOrdering() 123 TreeSet<String> orderedStrings = new TreeSet<String>(ordering); in format()
|