| /external/apache-harmony/auth/src/test/java/common/org/apache/harmony/auth/tests/javax/security/auth/callback/ |
| UnsupportedCallbackExceptionTest.java | 42 UnsupportedCallbackException ce = new UnsupportedCallbackException(nc); local
43 assertEquals(nc, ce.getCallback());
45 throw ce;
47 assertTrue(ce.equals(e));
48 assertEquals(nc, ce.getCallback());
57 UnsupportedCallbackException ce = new UnsupportedCallbackException(nc, "message"); local
58 assertEquals ("message", ce.getMessage());
59 assertEquals(nc, ce.getCallback());
61 throw ce;
63 assertTrue(ce.equals(e))
74 UnsupportedCallbackException ce = new UnsupportedCallbackException(null, null); local
[all...] |
| /external/apache-harmony/sql/src/test/java/org/apache/harmony/sql/tests/javax/sql/ |
| ConnectionEventTest.java | 39 ConnectionEvent ce = new ConnectionEvent(ipc); local
40 assertSame(ipc, ce.getSource());
41 assertNull(ce.getSQLException());
52 ConnectionEvent ce = new ConnectionEvent(ipc, null); local
53 assertSame(ipc, ce.getSource());
54 assertNull(ce.getSQLException());
57 ce = new ConnectionEvent(ipc, e);
58 assertSame(ipc, ce.getSource());
59 assertSame(e, ce.getSQLException());
68 ConnectionEvent ce = new ConnectionEvent(ipc, e) local
86 ConnectionEvent ce = new ConnectionEvent(ipc, sqlException); local
[all...] |
| /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/ |
| BlockCipherFactory.java | 57 for (CipherEntry ce : ciphers)
59 list.add(ce.type);
77 CipherEntry ce = getEntry(type); local
78 Class cc = Class.forName(ce.cipherClass);
109 for (CipherEntry ce : ciphers)
111 if (ce.type.equals(type))
113 return ce;
121 CipherEntry ce = getEntry(type); local
122 return ce.blocksize;
127 CipherEntry ce = getEntry(type) local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.iterators/ |
| cend.pass.cpp | 23 typename S::const_iterator ce = s.cend(); local
24 assert(ce == s.end());
|
| crend.pass.cpp | 23 typename S::const_reverse_iterator ce = s.crend(); local
24 assert(ce == s.rend());
|
| end.pass.cpp | 26 typename S::const_iterator ce = cs.end(); local
30 assert(ce == cs.begin());
33 assert(ce - cs.begin() == cs.size());
|
| rend.pass.cpp | 26 typename S::const_reverse_iterator ce = cs.rend(); local
30 assert(ce == cs.rbegin());
33 assert(ce - cs.rbegin() == cs.size());
|
| /libcore/luni/src/test/java/libcore/javax/sql/ |
| OldConnectionEventTest.java | 32 ConnectionEvent ce = new ConnectionEvent(ipc); local
34 assertSame(ce2.getSource(),ce.getSource());
39 ConnectionEvent ce = new ConnectionEvent(ipc); local
42 assertNull(ce.getSQLException());
43 assertEquals(ce2.getSQLException(), ce.getSQLException());
|
| /external/jmonkeyengine/engine/src/core/com/jme3/cinematic/ |
| Cinematic.java | 100 CinematicEvent ce = cinematicEvents.get(i); local
101 if (ce.getPlayState() == PlayState.Paused) {
102 ce.play();
114 CinematicEvent ce = cinematicEvents.get(i); local
115 ce.stop();
123 CinematicEvent ce = cinematicEvents.get(i); local
124 if (ce.getPlayState() == PlayState.Playing) {
125 ce.pause();
155 CinematicEvent ce = cinematicEvents.get(i); local
156 ce.setSpeed(speed)
201 CinematicEvent ce = cinematicEvents.get(i); local
268 CinematicEvent ce = kf.getCinematicEvents().get(i); local
[all...] |
| /external/opencv/cvaux/src/ |
| cvclique.cpp | 66 int* ce;
197 finder->ce = new int[N+1];
218 finder->ce[0] = N;
238 delete finder->ce;
273 int* ce = finder->ce;
288 if( (!finder->weighted) && (k + ce[k] - ne[k] < finder->best_score) )
301 int minnod = ce[k];
305 for( int i = 0; i < ce[k] && minnod != 0; i++)
312 for (int j = ne[k]; j < ce[k] && (count < minnod); j++)
[all...] |
| /external/icu4c/test/intltest/ |
| colldata.cpp | 105 void CEList::add(uint32_t ce, UErrorCode &status)
130 ces[listSize++] = ce;
251 void put(uint32_t ce, UnicodeString *string, UErrorCode &status);
252 StringList *getStringList(uint32_t ce) const;
255 void putStringList(uint32_t ce, StringList *stringList, UErrorCode &status);
282 void CEToStringsMap::put(uint32_t ce, UnicodeString *string, UErrorCode &status)
284 StringList *strings = getStringList(ce);
294 putStringList(ce, strings, status);
300 StringList *CEToStringsMap::getStringList(uint32_t ce) const
302 return (StringList *) uhash_iget(map, ce);
500 uint32_t ce = ceList->get(offset); local
[all...] |
| colldata.h | 32 * The size of the internal CE buffer in a <code>CEList</code> object
83 * Get a particular CE from the list.
85 * @param index - the index of the CE to return
87 * @return the CE, or <code>0</code> if <code>index</code> is out of range
107 * @return a reference to the given CE in the list
112 void add(uint32_t ce, UErrorCode &status);
232 * of CEs starting with a given CE.
234 * @param ce - the CE
240 const StringList *getStringList(int32_t ce) const
[all...] |
| /external/chromium_org/third_party/pexpect/ |
| screen.py | 105 def fill_region (self, rs,cs, re,ce, ch=SPACE):
110 ce = constrain (ce, 1, self.cols)
113 if cs > ce:
114 cs, ce = ce, cs
116 for c in range (cs, ce + 1):
196 def get_region (self, rs,cs, re,ce):
204 ce = constrain (ce, 1, self.cols
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| ucoleitr.cpp | 48 uint32_t ce; member in struct:RCEI
66 void put(uint32_t ce, int32_t ixLow, int32_t ixHigh);
89 void RCEBuffer::put(uint32_t ce, int32_t ixLow, int32_t ixHigh)
104 buffer[bufferIndex].ce = ce;
122 uint64_t ce; member in struct:PCEI
139 void put(uint64_t ce, int32_t ixLow, int32_t ixHigh);
167 void PCEBuffer::put(uint64_t ce, int32_t ixLow, int32_t ixHigh)
182 buffer[bufferIndex].ce = ce;
448 uint32_t ce = (uint32_t) ucol_getNextCE(coll, &elems->iteratordata_, status); local
546 uint32_t ce; local
[all...] |
| /external/icu4c/i18n/ |
| ucoleitr.cpp | 48 uint32_t ce; member in struct:RCEI
66 void put(uint32_t ce, int32_t ixLow, int32_t ixHigh);
89 void RCEBuffer::put(uint32_t ce, int32_t ixLow, int32_t ixHigh)
104 buffer[bufferIndex].ce = ce;
122 uint64_t ce; member in struct:PCEI
139 void put(uint64_t ce, int32_t ixLow, int32_t ixHigh);
167 void PCEBuffer::put(uint64_t ce, int32_t ixLow, int32_t ixHigh)
182 buffer[bufferIndex].ce = ce;
448 uint32_t ce = (uint32_t) ucol_getNextCE(coll, &elems->iteratordata_, status); local
546 uint32_t ce; local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/audio/ |
| SDL_audiocvt.c | 416 Uint8 *src, *dst, lf, rf, ce; local
425 ce = (lf/2) + (rf/2);
428 dst[2] = lf - ce;
429 dst[3] = rf - ce;
430 dst[4] = ce;
431 dst[5] = ce;
437 Sint8 *src, *dst, lf, rf, ce; local
446 ce = (lf/2) + (rf/2);
449 dst[2] = lf - ce;
450 dst[3] = rf - ce;
459 Uint16 lf, rf, ce, lr, rr; local
518 Sint16 lf, rf, ce, lr, rr; local
593 Uint8 *src, *dst, lf, rf, ce; local
612 Sint8 *src, *dst, lf, rf, ce; local
632 Uint16 lf, rf, ce, lr, rr; local
681 Sint16 lf, rf, ce, lr, rr; local
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm11_asm/ |
| win_asm.bat | 3 set ASM="D:\Program Files\Microsoft Visual Studio 8\VC\ce\bin\x86_arm\armasm"
|
| /dalvik/dx/etc/ |
| jasmin.jar | |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == srr);
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_intersection_comp.pass.cpp | 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
40 assert(base(ce) - ic == sr);
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
44 assert(base(ce) - ic == sr);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_symmetric_difference_comp.pass.cpp | 40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
48 assert(base(ce) - ic == sr);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_union_comp.pass.cpp | 39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
