Searched refs:ordering (Results 1 - 25 of 98) sorted by relevance

1234

/external/ceres-solver/internal/ceres/
H A Dordered_groups_test.cc42 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
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...]
H A Dparameter_block_ordering.h45 // 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 cover
[all...]
H A Dgraph_algorithms_test.cc58 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[
92 vector<int> ordering; local
219 vector<int> ordering; local
231 vector<int> ordering; local
[all...]
H A Dparameter_block_ordering.cc46 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 vecto
45 ComputeStableSchurOrdering(const Program& program, vector<ParameterBlock*>* ordering) argument
71 ComputeSchurOrdering(const Program& program, vector<ParameterBlock*>* ordering) argument
90 ComputeRecursiveIndependentSetOrdering(const Program& program, ParameterBlockOrdering* ordering) argument
147 OrderingToGroupSizes(const ParameterBlockOrdering* ordering, vector<int>* group_sizes) argument
[all...]
H A Dsuitesparse.cc129 // 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[
163 AnalyzeCholeskyWithUserOrdering( cholmod_sparse* A, const vector<int>& ordering, string* message) argument
206 BlockAMDOrdering(const cholmod_sparse* A, const vector<int>& row_blocks, const vector<int>& col_blocks, vector<int>* ordering) argument
323 ApproximateMinimumDegreeOrdering(cholmod_sparse* matrix, int* ordering) argument
328 ConstrainedApproximateMinimumDegreeOrdering( cholmod_sparse* matrix, int* constraints, int* ordering) argument
[all...]
H A Dgraph_algorithms.h91 // 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
96 IndependentSetOrdering(const Graph<Vertex>& graph, vector<Vertex>* ordering) argument
172 StableIndependentSetOrdering(const Graph<Vertex>& graph, vector<Vertex>* ordering) argument
[all...]
H A Dcoordinate_descent_minimizer.h50 // 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,
H A Dreorder_program.cc79 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 doe
75 OrderingForSparseNormalCholeskyUsingSuiteSparse( const TripletSparseMatrix& tsm_block_jacobian_transpose, const vector<ParameterBlock*>& parameter_blocks, const ParameterBlockOrdering& parameter_block_ordering, int* ordering) argument
110 OrderingForSparseNormalCholeskyUsingCXSparse( const TripletSparseMatrix& tsm_block_jacobian_transpose, int* ordering) argument
138 ApplyOrdering(const ProblemImpl::ParameterMap& parameter_map, const ParameterBlockOrdering& ordering, Program* program, string* error) argument
[all...]
H A Dcoordinate_descent_minimizer.cc62 const ParameterBlockOrdering& ordering,
71 map<int, set<double*> > group_to_elements = ordering.group_to_elements();
86 // The ordering does not have to contain all parameter blocks, so
91 if (!ordering.IsMember(parameter_blocks[i]->mutable_user_state())) {
238 const ParameterBlockOrdering& ordering,
241 ordering.group_to_elements();
263 scoped_ptr<ParameterBlockOrdering> ordering(new ParameterBlockOrdering);
264 ComputeRecursiveIndependentSetOrdering(program, ordering.get());
265 ordering->Reverse();
266 return ordering
59 Init( const Program& program, const ProblemImpl::ParameterMap& parameter_map, const ParameterBlockOrdering& ordering, string* error) argument
236 IsOrderingValid( const Program& program, const ParameterBlockOrdering& ordering, string* message) argument
[all...]
H A Dreorder_program.h45 // Reorder the parameter blocks in program using the ordering
47 const ParameterBlockOrdering& ordering,
64 // first elimination group, otherwise the user's ordering is used.
67 // constrained fill-reducing ordering is available in the sparse
72 // Upon return, ordering contains the parameter block ordering that
89 // fill-reducing ordering is available in the sparse linear algebra
91 // ordering will take it into account, otherwise it will be ignored.
/external/guava/guava/src/com/google/common/collect/
H A DNullsFirstOrdering.java25 /** An ordering that treats {@code null} as less than all other values. */
28 final Ordering<? super T> ordering; field in class:NullsFirstOrdering
30 NullsFirstOrdering(Ordering<? super T> ordering) { argument
31 this.ordering = ordering;
44 return ordering.compare(left, right);
48 // ordering.reverse() might be optimized, so let it do its thing
49 return ordering.reverse().nullsLast();
58 return ordering.nullsLast();
67 return this.ordering
[all...]
H A DNullsLastOrdering.java25 /** An ordering that treats {@code null} as greater than all other values. */
28 final Ordering<? super T> ordering; field in class:NullsLastOrdering
30 NullsLastOrdering(Ordering<? super T> ordering) { argument
31 this.ordering = ordering;
44 return ordering.compare(left, right);
48 // ordering.reverse() might be optimized, so let it do its thing
49 return ordering.reverse().nullsFirst();
53 return ordering.nullsFirst();
67 return this.ordering
[all...]
H A DByFunctionOrdering.java30 * An ordering that orders elements by applying an order to the result of a
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);
62 return Objects.hashCode(function, ordering);
66 return ordering
39 ByFunctionOrdering( Function<F, ? extends T> function, Ordering<T> ordering) argument
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
H A DExtensions.java20 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);
H A DX509Extensions.java211 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
294 X509Extensions( Vector ordering, Hashtable extensions) argument
[all...]
H A DX509Name.java353 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
484 X509Name( Vector ordering, Hashtable attributes) argument
503 X509Name( Vector ordering, Hashtable attributes, X509NameEntryConverter converter) argument
[all...]
/external/chromium_org/v8/test/mjsunit/es6/
H A Dmicrotask-delivery.js30 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/chromium_org/third_party/freetype/include/freetype/
H A Dftcid.h69 * ordering ::
70 * The ordering, as a C~string, owned by the face.
88 const char* *ordering,
/external/freetype/include/
H A Dftcid.h69 * ordering ::
70 * The ordering, as a C~string, owned by the face.
88 const char* *ordering,
/external/pdfium/core/include/thirdparties/freetype/freetype/
H A Dftcid.h69 * 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/
H A Dftcid.h69 * 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/
H A Dcidriver.c106 const char* *ordering,
115 if ( ordering )
116 *ordering = cid->ordering;
104 cid_get_ros( CID_Face face, const char* *registry, const char* *ordering, FT_Int *supplement ) argument
/external/chromium_org/third_party/boringssl/src/ssl/pqueue/
H A Dpqueue_test.c49 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/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftcid.c29 const char* *ordering,
54 if ( ordering )
55 *ordering = o;
/external/guava/guava-tests/test/com/google/common/collect/
H A DOrderingTest.java196 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
683 testExhaustively( Ordering<? super T> ordering, List<T> list) argument
709 final Ordering<T> ordering; field in class:OrderingTest.Scenario
712 Scenario(Ordering<T> ordering, List<T> strictlyOrderedList) argument
[all...]

Completed in 652 milliseconds

1234