| /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
[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]);
|
| schur_ordering_test.cc | 171 vector<ParameterBlock*> ordering; local
172 ComputeSchurOrdering(program, &ordering);
173 EXPECT_EQ(ordering.back(), parameter_blocks[0]);
|
| cxsparse.cc | 99 // order = 0 for Natural ordering.
126 int* ordering = cs_amd(1, &block_matrix); local
128 copy(ordering, ordering + num_row_blocks, &block_ordering[0]);
129 cs_free(ordering);
189 void CXSparse::ApproximateMinimumDegreeOrdering(cs_di* A, int* ordering) {
191 copy(cs_ordering, cs_ordering + A->m, ordering);
|
| suitesparse.cc | 124 // Cholmod can try multiple re-ordering strategies to find a fill
125 // reducing ordering. Here we just tell it use AMD with automatic
129 cc_.method[0].ordering = CHOLMOD_AMD;
148 vector<int> ordering; local
149 if (!BlockAMDOrdering(A, row_blocks, col_blocks, &ordering)) {
152 return AnalyzeCholeskyWithUserOrdering(A, ordering);
157 const vector<int>& ordering) {
158 CHECK_EQ(ordering.size(), A->nrow);
161 cc_.method[0].ordering = CHOLMOD_GIVEN;
164 cholmod_analyze_p(A, const_cast<int*>(&ordering[0]), NULL, 0, &cc_)
[all...] |
| solver_impl_test.cc | 91 ParameterBlockOrdering ordering; local
92 ordering.AddElementToGroup(&x, 0);
93 ordering.AddElementToGroup(&y, 0);
94 ordering.AddElementToGroup(&z, 0);
98 &ordering,
103 EXPECT_EQ(ordering.NumElements(), 3);
115 ParameterBlockOrdering ordering; local
116 ordering.AddElementToGroup(&x, 0);
121 &ordering,
126 EXPECT_EQ(ordering.NumElements(), 0)
139 ParameterBlockOrdering ordering; local
166 ParameterBlockOrdering ordering; local
201 ParameterBlockOrdering ordering; local
233 ParameterBlockOrdering ordering; local
281 ParameterBlockOrdering* ordering = new ParameterBlockOrdering; local
343 ParameterBlockOrdering* ordering = new ParameterBlockOrdering; local
412 ParameterBlockOrdering* ordering = new ParameterBlockOrdering; local
456 ParameterBlockOrdering ordering; local
478 ParameterBlockOrdering ordering; local
[all...] |
| /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...] |
| /external/ceres-solver/examples/ |
| bundle_adjuster.cc | 89 DEFINE_string(ordering, "automatic", "Options are: automatic, user.");
193 // the right ParameterBlock ordering, or by manually specifying a
194 // suitable ordering vector and defining
200 ceres::ParameterBlockOrdering* ordering = local
205 ordering->AddElementToGroup(points + point_block_size * i, 0);
211 ordering->AddElementToGroup(cameras + camera_block_size * i, 1);
213 // second block to the ordering.
215 ordering->AddElementToGroup(cameras + camera_block_size * i + 4, 1);
219 options->linear_solver_ordering = 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/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...] |
| /external/chromium_org/base/memory/ |
| discardable_memory_provider_unittest.cc | 214 const unsigned* ordering() const { return ordering_; } function in class:base::PermutationTestData
227 // Use discardable memory in order specified by ordering parameter.
236 int index = GetParam().ordering()[i];
245 return discardables_[GetParam().ordering()[position]].get();
|
| /external/chromium_org/chrome/service/cloud_print/ |
| printer_job_queue_handler.cc | 41 bool JobDetails::ordering(const JobDetails& first, const JobDetails& second) { function in class:cloud_print::JobDetails
131 &JobDetails::ordering);
|
| /libcore/luni/src/main/java/org/apache/harmony/security/x509/tsp/ |
| TSTInfo.java | 52 * ordering BOOLEAN DEFAULT FALSE,
78 private final Boolean ordering; field in class:TSTInfo
88 Boolean ordering, BigInteger nonce, GeneralName tsa,
96 this.ordering = ordering;
121 res.append(ordering);
168 * @return Returns the ordering.
171 return ordering;
253 ASN1Boolean.getInstance(), // ordering
293 values[6] = info.ordering;
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| bidiconf.cpp | 56 int32_t ordering[1000]; member in class:BiDiConformanceTest
149 ordering[orderingCount++]=(int32_t)value;
432 // with the expected ordering that has them omitted.
447 continue; // BiDi control, omitted from expected ordering.
449 if(visualIndex<orderingCount && logicalIndex!=ordering[visualIndex]) {
450 errln("Wrong ordering value at visual index %d; expected %d actual %d",
451 (int)visualIndex, ordering[visualIndex], logicalIndex);
458 // which should match the length of the BidiTest.txt ordering.
460 errln("Wrong number of ordering values; expected %d actual %d",
466 UnicodeString eord("Expected ordering: ")
[all...] |
| /external/grub/lib/ |
| getopt.c | 113 Also, when `ordering' is RETURN_IN_ORDER,
179 the ordering of the two. We describe each non-option ARGV-element
185 of the value of `ordering'. In the case of RETURN_IN_ORDER, only
191 } ordering;
411 /* Determine how to handle the ordering of options and nonoptions. */
415 ordering = RETURN_IN_ORDER;
420 ordering = REQUIRE_ORDER;
424 ordering = REQUIRE_ORDER;
426 ordering = PERMUTE;
560 if (ordering == PERMUTE
190 } ordering; variable in typeref:enum:__anon18398
[all...] |
| /external/icu4c/test/intltest/ |
| bidiconf.cpp | 56 int32_t ordering[1000]; member in class:BiDiConformanceTest
149 ordering[orderingCount++]=(int32_t)value;
432 // with the expected ordering that has them omitted.
447 continue; // BiDi control, omitted from expected ordering.
449 if(visualIndex<orderingCount && logicalIndex!=ordering[visualIndex]) {
450 errln("Wrong ordering value at visual index %d; expected %d actual %d",
451 (int)visualIndex, ordering[visualIndex], logicalIndex);
458 // which should match the length of the BidiTest.txt ordering.
460 errln("Wrong number of ordering values; expected %d actual %d",
466 UnicodeString eord("Expected ordering: ")
[all...] |
| /frameworks/base/core/java/android/animation/ |
| AnimatorInflater.java | 124 int ordering = a.getInt(com.android.internal.R.styleable.AnimatorSet_ordering, local
126 createAnimatorFromXml(c, parser, attrs, (AnimatorSet) anim, ordering);
|
| /frameworks/base/core/java/android/transition/ |
| TransitionInflater.java | 160 int ordering = a.getInt( local
163 ((TransitionSet) transition).setOrdering(ordering);
|
| /ndk/sources/host-tools/make-3.81/ |
| getopt.c | 107 Also, when `ordering' is RETURN_IN_ORDER,
173 the ordering of the two. We describe each non-option ARGV-element
179 of the value of `ordering'. In the case of RETURN_IN_ORDER, only
185 } ordering; variable in typeref:enum:__anon33224
398 /* Determine how to handle the ordering of options and nonoptions. */
402 ordering = RETURN_IN_ORDER;
407 ordering = REQUIRE_ORDER;
411 ordering = REQUIRE_ORDER;
413 ordering = PERMUTE;
542 if (ordering == PERMUTE
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/X11/extensions/ |
| shapestr.h | 75 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */ member in struct:_ShapeRectangles
219 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */ member in struct:__anon37146
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/X11/extensions/ |
| shapestr.h | 75 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */ member in struct:_ShapeRectangles
219 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */ member in struct:__anon38736
|
