| /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...] |
| 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_test.cc | 171 vector<ParameterBlock*> ordering; local
172 ComputeSchurOrdering(program, &ordering);
173 EXPECT_EQ(ordering.back(), parameter_blocks[0]);
|
| cxsparse.cc | 102 // order = 0 for Natural ordering.
129 int* ordering = cs_amd(1, &block_matrix); local
131 copy(ordering, ordering + num_row_blocks, &block_ordering[0]);
132 cs_free(ordering);
192 void CXSparse::ApproximateMinimumDegreeOrdering(cs_di* A, int* ordering) {
194 copy(cs_ordering, cs_ordering + A->m, ordering);
|
| 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/chromium_org/third_party/boringssl/src/ssl/pqueue/ |
| pqueue_test.c | 49 int ordering[NUM_ITEMS] = {9, 6, 3, 4, 0, 2, 7, 1, 8, 5}; local
58 priority[7] = ordering[i];
59 pitem *item = pitem_new(priority, &ordering[i]);
|
| /external/chromium_org/v8/test/mjsunit/es6/ |
| 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/guava/guava/src/com/google/common/collect/ |
| 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...] |
| 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...] |
| MinMaxPriorityQueue.java | 97 return new Builder<Comparable>(Ordering.natural()).create();
106 return new Builder<E>(Ordering.<E>natural()).create(initialContents);
124 return new Builder<Comparable>(Ordering.natural())
136 return new Builder<Comparable>(Ordering.natural())
214 private <T extends B> Ordering<T> ordering() { method in class:MinMaxPriorityQueue.Builder
215 return Ordering.from((Comparator<T>) comparator);
227 Ordering<E> ordering = builder.ordering(); local
488 final Ordering<E> ordering; field in class:MinMaxPriorityQueue.Heap
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/executor/ |
| FifoPriorityThreadPoolExecutor.java | 18 AtomicInteger ordering = new AtomicInteger(); field in class:FifoPriorityThreadPoolExecutor
35 return new FifoPriorityLoadTask<T>(runnable, value, ordering.getAndIncrement());
|
| /external/ceres-solver/examples/ |
| bundle_adjuster.cc | 92 DEFINE_string(ordering, "automatic", "Options are: automatic, user.");
197 // the right ParameterBlock ordering, or by manually specifying a
198 // suitable ordering vector and defining
204 ceres::ParameterBlockOrdering* ordering = local
209 ordering->AddElementToGroup(points + point_block_size * i, 0);
215 ordering->AddElementToGroup(cameras + camera_block_size * i, 1);
217 // second block to the ordering.
219 ordering->AddElementToGroup(cameras + camera_block_size * i + 4, 1);
223 options->linear_solver_ordering.reset(ordering);
|
| /external/chromium_org/third_party/opus/src/silk/ |
| NLSF2A.c | 72 /* This ordering was found to maximize quality. It improves numerical accuracy of
73 silk_NLSF2A_find_poly() compared to "standard" ordering. */
80 const unsigned char *ordering; local
92 ordering = d == 16 ? ordering16 : ordering10;
110 cos_LSF_QA[ordering[k]] = silk_RSHIFT_ROUND( silk_LSHIFT( cos_val, 8 ) + silk_MUL( delta, f_frac ), 20 - QA ); /* QA */
|
| /external/libopus/silk/ |
| NLSF2A.c | 72 /* This ordering was found to maximize quality. It improves numerical accuracy of
73 silk_NLSF2A_find_poly() compared to "standard" ordering. */
80 const unsigned char *ordering; local
92 ordering = d == 16 ? ordering16 : ordering10;
110 cos_LSF_QA[ordering[k]] = silk_RSHIFT_ROUND( silk_LSHIFT( cos_val, 8 ) + silk_MUL( delta, f_frac ), 20 - QA ); /* QA */
|
| /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);
|
| 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...] |
| 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...] |
| /external/chromium_org/chrome/service/cloud_print/ |
| printer_job_queue_handler.cc | 42 bool JobDetails::ordering(const JobDetails& first, const JobDetails& second) { function in class:cloud_print::JobDetails
133 &JobDetails::ordering);
|
| /external/chromium_org/base/memory/ |
| discardable_memory_manager_unittest.cc | 252 const unsigned* ordering() const { return ordering_; } function in class:base::__anon6959::PermutationTestData
265 // Use memory in order specified by ordering parameter.
272 int index = GetParam().ordering()[i];
281 return &allocation_[GetParam().ordering()[position]];
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| bidiconf.cpp | 56 int32_t ordering[1000]; member in class:BiDiConformanceTest
152 ordering[orderingCount++]=(int32_t)value;
438 Field 4: An ordered list of indices showing the resulting visual ordering
443 This field is optional. When it is absent, the visual ordering
660 // with the expected ordering that has them omitted.
675 continue; // BiDi control, omitted from expected ordering.
677 if(visualIndex<orderingCount && logicalIndex!=ordering[visualIndex]) {
678 errln("\nError on line %d: Wrong ordering value at visual index %d; expected %d actual %d",
679 (int)lineNumber, (int)visualIndex, ordering[visualIndex], logicalIndex);
686 // which should match the length of the BidiTest.txt ordering
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| bidiconf.cpp | 56 int32_t ordering[1000]; member in class:BiDiConformanceTest
152 ordering[orderingCount++]=(int32_t)value;
438 Field 4: An ordered list of indices showing the resulting visual ordering
443 This field is optional. When it is absent, the visual ordering
660 // with the expected ordering that has them omitted.
675 continue; // BiDi control, omitted from expected ordering.
677 if(visualIndex<orderingCount && logicalIndex!=ordering[visualIndex]) {
678 errln("\nError on line %d: Wrong ordering value at visual index %d; expected %d actual %d",
679 (int)lineNumber, (int)visualIndex, ordering[visualIndex], logicalIndex);
686 // which should match the length of the BidiTest.txt ordering
[all...] |
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 190 ordering(matrix, ap);
213 ordering(a, ap);
218 void ordering(const MatrixType& a, CholMatrixType& ap);
301 * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<>
390 * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<>
617 void SimplicialCholeskyBase<Derived>::ordering(const MatrixType& a, CholMatrixType& ap) function in class:Eigen::SimplicialCholeskyBase
626 OrderingType ordering; local
627 ordering(C,m_Pinv);
|
| /external/chromium_org/third_party/freetype/src/cff/ |
| cfftypes.h | 271 FT_String* ordering; member in struct:CFF_FontRec_
|
| /external/freetype/src/cff/ |
| cfftypes.h | 271 FT_String* ordering; member in struct:CFF_FontRec_
|
