/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
next_prior.hpp | 24 BOOST_MPL_AUX_COMMON_NAME_WKND(prior) 38 struct prior struct in namespace:boost::mpl 40 typedef typename T::prior type; 41 BOOST_MPL_AUX_LAMBDA_SUPPORT(1,prior,(T)) 45 BOOST_MPL_AUX_NA_SPEC(1, prior)
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
advance_backward.hpp | 31 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 [all...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
next_prior.hpp | 10 // 13 Dec 2003 Added next(x, n) and prior(x, n) (Daniel Walker) 24 // const std::list<T>::iterator prev = boost::prior(p); 40 inline T prior(T x) { return --x; } function in namespace:boost 43 inline T prior(T x, Distance n) function in namespace:boost
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/vector/aux_/ |
item.hpp | 55 typedef typename prior<typename Base::lower_bound_>::type index_; 73 typedef typename prior<typename Base::upper_bound_>::type index_; 75 typedef typename prior<typename Base::size>::type size; 91 typedef typename prior<typename Base::size>::type size;
|
iterator.hpp | 24 #include <boost/mpl/prior.hpp> 53 typedef v_iter<Vector,prior_> prior; typedef in struct:boost::mpl::v_iter 74 struct prior< v_iter<Vector,n_> > struct in namespace:boost::mpl
|
back.hpp | 34 , prior<typename Vector::size>::type::value
|
/external/llvm/lib/CodeGen/ |
MachineLoopInfo.cpp | 53 MachineBasicBlock *PriorMBB = prior(MachineFunction::iterator(TopMBB)); 57 PriorMBB = prior(MachineFunction::iterator(TopMBB)); 66 if (BotMBB != prior(End)) {
|
LatencyPriorityQueue.cpp | 127 if (Best != prior(Queue.end())) 136 if (I != prior(Queue.end()))
|
/external/ceres-solver/internal/ceres/ |
normal_prior_test.cc | 15 // specific prior written permission. 73 NormalPrior prior(A, b); 74 prior.Evaluate(&x, residuals.data(), &jacobian); 112 NormalPrior prior(A, b); 113 prior.Evaluate(&x, residuals.data(), jacobians); 120 prior.Evaluate(&x, residuals.data(), NULL);
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/ |
integral_wrapper.hpp | 65 typedef AUX_WRAPPER_INST(prior_value) prior; typedef in struct:AUX_WRAPPER_NAME 70 typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (N - 1)) ) prior; typedef in struct:AUX_WRAPPER_NAME 73 typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (value - 1)) ) prior; typedef in struct:AUX_WRAPPER_NAME
|
advance_backward.hpp | 22 # include <boost/mpl/prior.hpp> 122 typedef typename prior<AUX778076_ITER_0>::type AUX778076_ITER_1;
|
/external/chromium_org/content/test/data/dom_storage/ |
sanity_check.js | 27 "getItem('foo') != null prior to addition"); 29 "key(0) != null prior to addition");
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/iterator/ |
reverse_iterator.hpp | 43 typename super_t::reference dereference() const { return *boost::prior(this->base()); }
|
/external/clang/test/SemaTemplate/ |
instantiate-function-1.cpp | 179 prior: 181 prior_label = &&prior; // expected-error{{assigning to 'int'}}
|
/external/chromium_org/third_party/icu/source/common/unicode/ |
icuplug.h | 322 * @param prior pass in 'NULL' to get the first (most recent) plug, 323 * otherwise pass the value returned on a prior call to uplug_nextPlug 328 uplug_nextPlug(UPlugData *prior);
|
/external/icu4c/common/unicode/ |
icuplug.h | 323 * @param prior pass in 'NULL' to get the first (most recent) plug, 324 * otherwise pass the value returned on a prior call to uplug_nextPlug 329 uplug_nextPlug(UPlugData *prior);
|
/external/llvm/lib/Target/ARM/ |
ARMHazardRecognizer.cpp | 60 I = llvm::prior(I);
|
/external/llvm/lib/Target/Hexagon/ |
HexagonFrameLowering.cpp | 147 MachineBasicBlock::iterator MBBI = prior(MBB.end()); 154 MachineBasicBlock::iterator MBBI = prior(MBB.end()); 173 MBB.begin() == MBBI ? MBBI : prior(MBBI); 193 Term == MBB.begin() ? MBB.end() : prior(Term);
|
/external/llvm/lib/Target/R600/ |
R600Packetizer.cpp | 334 if (TII->isSchedulingBoundary(llvm::prior(I), MBB, Fn)) 341 RegionEnd = llvm::prior(RegionEnd); 346 if (I == llvm::prior(RegionEnd)) { 347 RegionEnd = llvm::prior(RegionEnd);
|
/external/chromium_org/third_party/skia/src/core/ |
SkClipStack.cpp | 110 // prior clip. This could be wildly incorrect if the 113 // size of the prior bound (e.g., if the second clip 114 // exactly matched the bottom half of the prior clip). 169 // the prior clip's finite bound 243 // current clip. The prior clip could reduce the size of this 253 void SkClipStack::Element::updateBoundAndGenID(const Element* prior) { 266 (SkRegion::kIntersect_Op == fOp && NULL == prior) || 267 (SkRegion::kIntersect_Op == fOp && prior->fIsIntersectionOfRects && 268 prior->rectRectIntersectAllowed(fRect, fDoAA))) { 302 if (NULL == prior) { [all...] |
/external/skia/src/core/ |
SkClipStack.cpp | 110 // prior clip. This could be wildly incorrect if the 113 // size of the prior bound (e.g., if the second clip 114 // exactly matched the bottom half of the prior clip). 169 // the prior clip's finite bound 243 // current clip. The prior clip could reduce the size of this 253 void SkClipStack::Element::updateBoundAndGenID(const Element* prior) { 266 (SkRegion::kIntersect_Op == fOp && NULL == prior) || 267 (SkRegion::kIntersect_Op == fOp && prior->fIsIntersectionOfRects && 268 prior->rectRectIntersectAllowed(fRect, fDoAA))) { 302 if (NULL == prior) { [all...] |
/external/speex/libspeex/ |
preprocess.c | 19 derived from this software without specific prior written permission. 215 spx_word16_t *prior; /**< A-priori SNR */ member in struct:SpeexPreprocessState_ 458 st->prior = (spx_word16_t*)speex_alloc((N+M)*sizeof(spx_word16_t)); 492 st->prior[i]=SHL16(1, SNR_SHIFT); 545 speex_free(st->prior); 807 st->prior[i] = EXTRACT16(PSHR32(ADD32(MULT16_16(gamma,MAX16(0,st->post[i])), MULT16_16(Q15_ONE-gamma,DIV32_16_Q8(st->old_ps[i],tot_noise))), 15)); 808 st->prior[i]=MIN16(st->prior[i], QCONST16(100.f,SNR_SHIFT)); 814 st->zeta[0] = PSHR32(ADD32(MULT16_16(QCONST16(.7f,15),st->zeta[0]), MULT16_16(QCONST16(.3f,15),st->prior[0])),15); 816 st->zeta[i] = PSHR32(ADD32(ADD32(ADD32(MULT16_16(QCONST16(.7f,15),st->zeta[i]), MULT16_16(QCONST16(.15f,15),st->prior[i])) [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
SortedMapInterfaceTest.java | 86 K prior = iterator.next(); local 91 Comparable comparable = (Comparable) prior; 94 assertTrue(map.comparator().compare(prior, current) < 0); 96 current = prior;
|
/external/chromium_org/chrome_frame/cfinstall/src/stub/ |
inlinedelegate.js | 61 // prior behaviour was beginning...
|
/external/chromium_org/third_party/sqlite/src/contrib/ |
sqlitecon.tcl | 84 set v(prior) {} 118 bind Sqlitecon <Up> {sqlitecon::Prior %W} 119 bind Sqlitecon <Control-p> {sqlitecon::Prior %W} 218 if {$v(prior)==""} { 221 set cmd $v(prior)\n$line 233 set v(prior) {} 236 set v(prior) $cmd 401 proc sqlitecon::Prior w { 581 set prior 0 583 if {$prior} { [all...] |