Searched defs:ordering (Results 1 - 25 of 66) sorted by relevance

123

/external/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++);
/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 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 Dparameter_block_ordering_test.cc171 vector<ParameterBlock*> ordering; local
172 ComputeSchurOrdering(program, &ordering);
173 EXPECT_EQ(ordering.back(), parameter_blocks[0]);
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 Dcxsparse.cc102 // 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) { argument
194 copy(cs_ordering, cs_ordering + A->m, ordering);
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 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 Dsolver.cc283 void StringifyOrdering(const vector<int>& ordering, string* report) { argument
284 if (ordering.size() == 0) {
289 for (int i = 0; i < ordering.size() - 1; ++i) {
290 internal::StringAppendF(report, "%d, ", ordering[i]);
292 internal::StringAppendF(report, "%d", ordering.back());
491 "Linear solver ordering %22s %24s\n",
509 "Inner iteration ordering %20s %24s\n",
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...]
/external/boringssl/src/ssl/pqueue/
H A Dpqueue_test.c61 int ordering[NUM_ITEMS] = {9, 6, 3, 4, 0, 2, 7, 1, 8, 5}; local
74 priority[7] = ordering[i];
75 item = pitem_new(priority, &ordering[i]);
84 priority[7] = ordering[i];
85 item = pitem_new(priority, &ordering[i]);
/external/guava/guava/src/com/google/common/collect/
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...]
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...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/
H A DX509Principal.java83 * specific ordering required for encoding or conversion to a string.
88 Vector ordering,
91 super(ordering, attributes);
87 X509Principal( Vector ordering, Hashtable attributes) argument
/external/pdfium/third_party/freetype/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/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
H A DExtensions.java20 private Vector ordering = new Vector(); field in class:Extensions
60 ordering.addElement(ext.getExtnId());
72 this.ordering.addElement(extension.getExtnId());
88 this.ordering.addElement(ext.getExtnId());
98 return ordering.elements();
144 Enumeration e = ordering.elements();
182 return toOidArray(ordering);
199 for (int i = 0; i != ordering.size(); i++)
201 Object oid = ordering.elementAt(i);
H A DX509Extensions.java210 private Vector ordering = new Vector(); field in class:X509Extensions
272 ordering.addElement(s.getObjectAt(0));
288 * Constructor from a table of extensions with ordering.
294 Vector ordering,
299 if (ordering == null)
305 e = ordering.elements();
310 this.ordering.addElement(ASN1ObjectIdentifier.getInstance(e.nextElement()));
313 e = this.ordering.elements();
339 this.ordering.addElement(e.nextElement());
344 e = this.ordering
293 X509Extensions( Vector ordering, Hashtable extensions) argument
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/util/
H A DPKCS12BagAttributeCarrierImpl.java23 PKCS12BagAttributeCarrierImpl(Hashtable attributes, Vector ordering) argument
26 this.pkcs12Ordering = ordering;
39 { // preserve original ordering
/external/guava/guava-tests/benchmark/com/google/common/collect/
H A DSortedCopyBenchmark.java103 int ordering(int reps) { method in class:SortedCopyBenchmark
/external/jetty/src/java/org/eclipse/jetty/webapp/
H A DFragmentDescriptor.java83 //Process a fragment jar's web-fragment.xml<ordering> elements
86 XmlParser.Node ordering = root.get("ordering");
87 if (ordering == null)
88 return; //No ordering for this fragment
92 processBefores(ordering);
93 processAfters(ordering);
97 public void processBefores (XmlParser.Node ordering) argument
100 XmlParser.Node before = ordering.get("before");
123 public void processAfters (XmlParser.Node ordering) argument
[all...]
/external/ceres-solver/examples/
H A Dbundle_adjuster.cc92 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/glide/library/src/main/java/com/bumptech/glide/load/engine/executor/
H A DFifoPriorityThreadPoolExecutor.java18 AtomicInteger ordering = new AtomicInteger(); field in class:FifoPriorityThreadPoolExecutor
37 return new LoadTask<T>(runnable, value, ordering.getAndIncrement());
/external/libopus/silk/
H A DNLSF2A.c72 /* 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 */

Completed in 1019 milliseconds

123