Home
last modified time | relevance | path

Searched full:prior (Results 1 – 25 of 11712) sorted by relevance

12345678910>>...469

/external/grpc-grpc/src/core/lib/promise/detail/
Dseq_state.h61 // CheckResultAndRunNext(T prior, RunNext run_next) - examine the value of
62 // prior, and decide to escape or continue. If escaping, return the final
64 // run_next(std::move(prior)).
68 // game such that the prior state and our current promise are kept in a union,
73 // here. The very first state does not have a prior state, and so that state has
98 GPR_NO_UNIQUE_ADDRESS Running0 prior;
106 Construct(&prior.current_promise, std::forward<P>(p));
107 Construct(&prior.next_factory, std::forward<F0>(f0));
112 Destruct(&prior.current_promise);
119 Destruct(&prior.next_factory);
[all …]
/external/sdv/vsomeip/third_party/boost/multi_index/include/boost/multi_index/detail/
Dhash_index_node.hpp58 * (n and p short for ->next(), ->prior(), bucket nodes have prior pointers
97 /* half-header (only prior() pointer) to use for the bucket array */
116 pointer& prior(){return prior_;} in prior() function
117 pointer prior()const{return prior_;} in prior() function
123 /* full header (prior() and next()) for the nodes */
237 return x->prior()->next()!=base_pointer_from(x); in is_first_of_bucket()
242 return is_last_of_bucket(x)?x->next()->prior():pointer_from(x->next()); in after()
257 if(buc->prior()==pointer(0)){ /* empty bucket */ in link()
258 x->prior()=end->prior(); in link()
259 x->next()=end->prior()->next(); in link()
[all …]
Dseq_index_node.hpp40 pointer& prior(){return prior_;} in prior() function
41 pointer prior()const{return prior_;} in prior() function
48 static void decrement(pointer& x){x=x->prior();} in decrement()
54 x->prior()=header->prior(); in link()
56 x->prior()->next()=x->next()->prior()=x; in link()
61 x->prior()->next()=x->next(); in unlink()
62 x->next()->prior()=x->prior(); in unlink()
68 x->prior()=position->prior(); in relink()
70 x->prior()->next()=x->next()->prior()=x; in relink()
78 pointer z=y->prior(); in relink()
[all …]
/external/rust/crates/grpcio-sys/grpc/src/core/lib/gprpp/
Dref_counted.h70 const Value prior = value_.fetch_add(n, std::memory_order_relaxed);
73 prior, prior + n);
81 const Value prior = value_.fetch_add(n, std::memory_order_relaxed);
84 trace_, this, location.file(), location.line(), prior, prior + n,
98 const Value prior = value_.fetch_add(1, std::memory_order_relaxed); in RefNonZero() local
101 prior, prior + 1); in RefNonZero()
103 assert(prior > 0); in RefNonZero()
110 const Value prior = value_.fetch_add(1, std::memory_order_relaxed); in RefNonZero() local
113 trace_, this, location.file(), location.line(), prior, prior + 1, in RefNonZero()
116 assert(prior > 0); in RefNonZero()
[all …]
/external/grpc-grpc/src/core/lib/gprpp/
Dref_counted.h73 const Value prior = value_.fetch_add(n, std::memory_order_relaxed);
76 prior, prior + n);
84 const Value prior = value_.fetch_add(n, std::memory_order_relaxed);
87 trace_, this, location.file(), location.line(), prior, prior + n,
101 const Value prior = value_.fetch_add(1, std::memory_order_relaxed); in RefNonZero() local
104 prior, prior + 1); in RefNonZero()
106 assert(prior > 0); in RefNonZero()
113 const Value prior = value_.fetch_add(1, std::memory_order_relaxed); in RefNonZero() local
116 trace_, this, location.file(), location.line(), prior, prior + 1, in RefNonZero()
119 assert(prior > 0); in RefNonZero()
[all …]
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/bcc/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/bcc551/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/no_ttp/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/plain/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/gcc/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/no_ctps/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/dmc/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/mwcw/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/msvc70/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/bcc_pre590/
Dadvance_backward.hpp31 typedef typename prior<iter0>::type iter1;
42 typedef typename prior<iter0>::type iter1;
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1;
55 typedef typename prior<iter1>::type iter2;
56 typedef typename prior<iter2>::type iter3;
67 typedef typename prior<iter0>::type iter1;
68 typedef typename prior<iter1>::type iter2;
69 typedef typename prior<iter2>::type iter3;
70 typedef typename prior<iter3>::type iter4;
/external/grpc-grpc/tools/codegen/core/
Dgen_seq.py37 struct { ${state(i-1, n)} } prior;
42 struct { ${state(i-1, n)} } prior;
70 GPR_NO_UNIQUE_ADDRESS Running${i-1} prior;
80 GPR_NO_UNIQUE_ADDRESS Running${n-2} prior;
91 Construct(&${"prior."*(n-1)}current_promise, std::forward<P>(p));
93 Construct(&${"prior."*(n-1-i)}next_factory, std::forward<F${i}>(f${i}));
100 Destruct(&${"prior."*(n-1-i)}current_promise);
109 Destruct(&${"prior."*(n-1-i)}next_factory);
114 Construct(&${"prior."*(n-1-i)}current_promise,
115 other.${"prior."*(n-1-i)}current_promise);
[all …]
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/aux_/preprocessed/msvc60/
Dadvance_backward.hpp38 typedef typename prior<iter0>::type iter1;
56 typedef typename prior<iter0>::type iter1;
57 typedef typename prior<iter1>::type iter2;
75 typedef typename prior<iter0>::type iter1;
76 typedef typename prior<iter1>::type iter2;
77 typedef typename prior<iter2>::type iter3;
95 typedef typename prior<iter0>::type iter1;
96 typedef typename prior<iter1>::type iter2;
97 typedef typename prior<iter2>::type iter3;
98 typedef typename prior<iter3>::type iter4;
/external/mesa3d/docs/relnotes/
D13.0.5.rst80 - i965: automake: include builddir prior to srcdir
81 - i915: automake: include builddir prior to srcdir
82 - egl: automake: include builddir prior to srcdir
83 - clover: automake: include builddir prior to srcdir
84 - st/dri: automake: include builddir prior to srcdir
85 - d3dadapter9: automake: include builddir prior to srcdir
86 - glx: automake: include builddir prior to srcdir
87 - glx/apple: automake: include builddir prior to srcdir
88 - glx/windows: automake: include builddir prior to srcdir
89 - loader: automake: include builddir prior to srcdir
[all …]
/external/rust/crates/grpcio-sys/grpc/src/core/lib/promise/
Dtry_seq.h50 static Poll<Result> CheckResultAndRunNext(T prior, RunNext run_next) { in CheckResultAndRunNext()
51 return run_next(std::move(prior)); in CheckResultAndRunNext()
69 static Poll<Result> CheckResultAndRunNext(absl::StatusOr<T> prior,
71 if (!prior.ok()) return StatusCast<Result>(prior.status());
72 return run_next(std::move(prior));
90 static Poll<Result> CheckResultAndRunNext(T prior, RunNext run_next) {
91 if (!IsStatusOk(prior)) return Result(std::move(prior));
92 return run_next(std::move(prior));
104 static Poll<Result> CheckResultAndRunNext(absl::Status prior,
106 if (!prior.ok()) return StatusCast<Result>(std::move(prior));
[all …]
/external/sdv/vsomeip/third_party/boost/fusion/test/sequence/
Diterator.hpp13 #include <boost/fusion/iterator/prior.hpp>
29 { // Testing deref, next, prior, begin, end in test()
43 BOOST_TEST(*prior(next(next(next(i)))) == 3.3); in test()
44 BOOST_TEST(*prior(prior(next(next(next(i))))) == 'x'); in test()
45 BOOST_TEST(*prior(prior(prior(next(next(next(i)))))) == 1); in test()
49 BOOST_TEST(*prior(end(v)) == s); in test()
72 BOOST_TEST(*prior(end(t)) == s); in test()
104 { // testing deref, next, prior, begin, end in test()
123 BOOST_TEST(*prior(next(next(next(i)))) == 3.3); in test()
124 BOOST_TEST(*prior(prior(next(next(next(i))))) == 'x'); in test()
[all …]
/external/sdv/vsomeip/third_party/boost/iterator/doc/quickbook/
Dalgorithms.qbk87 [section:next_prior Function templates `next()` and `prior()`]
89 …r `operator-()`. This means that non-modifying computation of the next or prior value requires a t…
91 The `next()` and `prior()` functions defined in `boost/next_prior.hpp` provide a simple way around …
109 T prior(T x)
115 T prior(T x, Distance n)
128 const std::list<T>::iterator prev = boost::prior(p);
131 …value. For example, the iterator four iterators prior to the given iterator `p` may be obtained by…
133 …hich serve the same purpose. However, there are advantages to `boost::next()` and `boost::prior()`.
135 First, `boost::next()` and `boost::prior()` are compatible not only with iterators but with any typ…
141 Second, `boost::next()` and `boost::prior()` use [link iterator.concepts.traversal traversal catego…
/external/sdv/vsomeip/third_party/boost/iterator/test/
Dnext_prior_test.cpp1 // Boost test program for next() and prior() utilities.
12 // next() and prior() are replacements for operator+ and operator- for
16 // result. Parallel tests are provided for prior(). The tests call
17 // next() and prior() several times. next() and prior() are very
54 i = i - 1, j = boost::prior(j); in minus_one_test()
64 i = last - n, j = boost::prior(last2, n); in minus_n_test()
71 Iterator i = boost::prior(last, size); in minus_n_unsigned_test()
107 BOOST_TEST(boost::prior(5) == 4); in main()
108 BOOST_TEST(boost::prior(5, 7) == -2); in main()
109 BOOST_TEST(boost::prior(5, 7u) == -2); in main()
/external/skia/src/core/
DSkClipStack.cpp369 // prior clip. This could be wildly incorrect if the in combineBoundsDiff()
372 // size of the prior bound (e.g., if the second clip in combineBoundsDiff()
373 // exactly matched the bottom half of the prior clip). in combineBoundsDiff()
414 void SkClipStack::Element::updateBoundAndGenID(const Element* prior) { in updateBoundAndGenID() argument
428 (SkClipOp::kIntersect == fOp && nullptr == prior) || in updateBoundAndGenID()
429 (SkClipOp::kIntersect == fOp && prior->fIsIntersectionOfRects && in updateBoundAndGenID()
430 prior->rectRectIntersectAllowed(this->getDeviceSpaceRect(), fDoAA))) { in updateBoundAndGenID()
465 if (nullptr == prior) { in updateBoundAndGenID()
466 // no prior clip means the entire plane is writable in updateBoundAndGenID()
470 prevFinite = prior->fFiniteBound; in updateBoundAndGenID()
[all …]
/external/sdv/vsomeip/third_party/boost/multi_index/include/boost/multi_index/
Dhashed_index.hpp247 index_node_type::from_impl(header()->next()->prior())); in begin()
253 index_node_type::from_impl(header()->next()->prior())); in begin()
380 for(node_impl_pointer x=buckets.at(buc)->prior(); in erase()
591 for(node_impl_pointer x=buckets.at(n)->prior(); in bucket_size()
610 node_impl_pointer x=buckets.at(n)->prior(); in begin()
769 node_impl_pointer prev_org=org->prior(), in copy_()
773 cpy->prior()=prev_cpy; in copy_()
779 buc_cpy->prior()=cpy; in copy_()
810 buc_cpy->prior()=next_cpy; in copy_()
811 next_cpy->prior()=cpy; in copy_()
[all …]
/external/llvm/include/llvm-c/
Dlto.h50 * \since prior to LTO_API_VERSION=3
75 * \since prior to LTO_API_VERSION=3
83 * \since prior to LTO_API_VERSION=3
108 * \since prior to LTO_API_VERSION=3
116 * \since prior to LTO_API_VERSION=3
124 * \since prior to LTO_API_VERSION=3
132 * \since prior to LTO_API_VERSION=3
150 * \since prior to LTO_API_VERSION=3
158 * \since prior to LTO_API_VERSION=3
168 * \since prior to LTO_API_VERSION=3
[all …]

12345678910>>...469