| /dalvik/libdex/ |
| DexProto.cpp | 6 * You may obtain a copy of the License at
76 * If the given DexStringCache doesn't already point at the given value,
79 * function is intended to be used after making a call that at least
151 char *at = (char*) pCache->value; local
152 *(at++) = '(';
157 strcpy(at, desc);
158 at += strlen(desc);
161 *(at++) = ')';
163 strcpy(at, dexStringByTypeIdx(dexFile, protoId->returnTypeIdx));
196 char *at = (char*) pCache->value local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| SuballocatedIntVector.java | 8 * You may obtain a copy of the License at
37 * Retrieval performance is critical, since this is used at the core
155 // total of m_blocksize squared elements, which at the default
156 // size is 4M integers... and we grow by at least that much each
245 * Inserts the specified node in this vector at the specified index.
253 * @param at Index of where to insert
255 private void insertElementAt(int value, int at)
257 if(at==m_firstFree)
259 else if (at>m_firstFree)
261 int index=at>>>m_SHIFT
330 int at=indexOf(s,0); local
[all...] |
| /external/chromium/third_party/libjingle/source/talk/xmpp/ |
| jid.cc | 61 size_t at = jid_string.find('@'); local
63 if (at < slash && at != std::string::npos) {
64 node_name = jid_string.substr(0, at);
65 domain_begin = at + 1;
473 // can't be right. We should at least be checking that there are no '/'
|
| /external/chromium_org/third_party/flot/ |
| jquery.min.js | 2 (function(e,t){function _(e){var t=M[e]={};return v.each(e.split(y),function(e,n){t[n]=!0}),t}function H(e,n,r){if(r===t&&e.nodeType===1){var i="data-"+n.replace(P,"-$1").toLowerCase();r=e.getAttribute(i);if(typeof r=="string"){try{r=r==="true"?!0:r==="false"?!1:r==="null"?null:+r+""===r?+r:D.test(r)?v.parseJSON(r):r}catch(s){}v.data(e,n,r)}else r=t}return r}function B(e){var t;for(t in e){if(t==="data"&&v.isEmptyObject(e[t]))continue;if(t!=="toJSON")return!1}return!0}function et(){return!1}function tt(){return!0}function ut(e){return!e||!e.parentNode||e.parentNode.nodeType===11}function at(e,t){do e=e[t];while(e&&e.nodeType!==1);return e}function ft(e,t,n){t=t||0;if(v.isFunction(t))return v.grep(e,function(e,r){var i=!!t.call(e,r,e);return i===n});if(t.nodeType)return v.grep(e,function(e,r){return e===t===n});if(typeof t=="string"){var r=v.grep(e,function(e){return e.nodeType===1});if(it.test(t))return v.filter(t,r,!n);t=v.filter(t,r)}return v.grep(e,function(e,r){return v.inArray(e,t)>=0===n})}function lt(e){var t=ct.split("|"),n=e.createDocumentFragment();if(n.createElement)while(t.length)n.createElement(t.pop());return n}function Lt(e,t){return e.getElementsByTagName(t)[0]||e.appendChild(e.ownerDocument.createElement(t))}function At(e,t){if(t.nodeType!==1||!v.hasData(e))return;var n,r,i,s=v._data(e),o=v._data(t,s),u=s.events;if(u (…)
[all...] |
| /external/chromium_org/tools/gyp/tools/emacs/ |
| gyp.el | 30 ;; with greater positions at the top of the stack. PARSE-STATE
32 ;; with most nested section symbol at the front of the list.
104 "A list of section symbols holding at the last parse state point."
112 "Add parse state SECTIONS to the parse history at POINT so that parsing can be
123 the point at the end of the string."
137 (cond ((looking-at-p "['\"]") ; a string
149 ((looking-at-p "{")
153 ((looking-at-p "\\[")
164 (defun gyp-section-at-point ()
193 (setq group (case (gyp-section-at-point
[all...] |
| /external/chromium_org/v8/src/ |
| arguments.h | 59 template <class S> Handle<S> at(int index) { function in class:v8::internal::BASE_EMBEDDED
|
| mksnapshot.cc | 72 fprintf(fp, "%u", static_cast<unsigned char>(at(j)));
75 char at(int i) { return data_[i]; } function in class:PartialSnapshotSink
259 fprintf(stderr, "%s at line %d\n", *message_string, message->GetLineNumber());
356 // If we don't do this then we end up with a stray root pointing at the
|
| unique.h | 53 // in the same "era" of GC or if at least one is a non-movable object.
63 // in different GC eras; we require heap allocation to be disallowed at
299 inline Unique<T> at(int index) const { function in class:v8::internal::V8_FINAL
313 // Grow the size of internal storage to be at least {size} elements.
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
| MixedItemSection.java | 6 * You may obtain a copy of the License at
286 * Places all the items in this instance at particular offsets. This
335 int at = 0; local
347 int writeAt = (at + alignMask) & ~alignMask;
349 if (at != writeAt) {
350 out.writeZeroes(writeAt - at);
351 at = writeAt;
355 at += one.writeSize();
358 if (at != writeSize) {
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/type/ |
| Prototype.java | 6 * You may obtain a copy of the License at
68 int at = 1; local
71 int startAt = at;
72 char c = descriptor.charAt(at);
74 at++;
80 at++;
81 c = descriptor.charAt(at);
86 int endAt = descriptor.indexOf(';', at);
90 at = endAt + 1;
92 at++
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _string.h | 9 * or implied. Any use is at your own risk.
230 const_reference at(size_type __n) const { return _M_non_dbg_impl.at(__n); } function in class:basic_string
231 reference at(size_type __n) { return _M_non_dbg_impl.at(__n); } function in class:basic_string
|
| /external/stlport/stlport/stl/pointers/ |
| _vector.h | 6 * or implied. Any use is at your own risk.
103 reference at(size_type __n) { return cast_traits::to_value_type_ref(_M_impl.at(__n)); } function in class:vector
104 const_reference at(size_type __n) const { return cast_traits::to_value_type_cref(_M_impl.at(__n)); } function in class:vector
|
| /external/stlport/test/unit/ |
| vector_test.cpp | 2 //into account (at least using GCC 4.0.1)
31 CPPUNIT_TEST(at);
54 void at();
313 void VectorTest::at() { function in class:VectorTest
318 CPPUNIT_ASSERT( v.at(0) == 10 );
319 v.at(0) = 20;
320 CPPUNIT_ASSERT( cv.at(0) == 20 );
324 v.at(1) = 20;
|
| /external/v8/src/ |
| mksnapshot.cc | 112 fprintf(fp, "%u", static_cast<unsigned char>(at(j)));
115 char at(int i) { return data_[i]; } function in class:PartialSnapshotSink
313 // If we don't do this then we end up with a stray root pointing at the
|
| /external/yaffs2/yaffs2/ |
| devextras.h | 168 struct list_head *at = head->next; local
173 last->next = at;
174 at->prev = last;
|
| /frameworks/base/core/java/android/os/ |
| UEventObserver.java | 6 * You may obtain a copy of the License at
136 int at = message.indexOf('\0', offset); local
137 if (at < 0) break;
139 if (equals > offset && equals < at) {
142 message.substring(equals + 1, at));
145 offset = at + 1;
|
| /frameworks/compile/mclinker/lib/Fragment/ |
| FragmentGraph.cpp | 58 uint32_t& FragmentGraph::ReachMatrix::at(uint32_t pX, uint32_t pY) function in class:FragmentGraph::ReachMatrix
63 uint32_t FragmentGraph::ReachMatrix::at(uint32_t pX, uint32_t pY) const function in class:FragmentGraph::ReachMatrix
247 if (0 == m_pMatrix->at(from->getIndex(), to->getIndex()))
249 ++m_pMatrix->at(from->getIndex(), to->getIndex());
259 if (0 == m_pMatrix->at(pFrom.getIndex(), to->getIndex()))
261 ++m_pMatrix->at(pFrom.getIndex(), to->getIndex());
377 uint32_t weight = m_pMatrix->at(pNode.getIndex(), node_to.getIndex());
|
| /frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
| AllocationThunker.java | 6 * You may obtain a copy of the License at
187 AllocationThunker at = (AllocationThunker)a; local
189 mN.copyFrom(at.mN);
283 AllocationThunker at = (AllocationThunker)data; local
284 mN.copy1DRangeFrom(off, count, at.mN, dataOff);
322 AllocationThunker at = (AllocationThunker)data; local
323 mN.copy2DRangeFrom(xoff, yoff, w, h, at.mN, dataXoff, dataYoff);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _string.h | 9 * or implied. Any use is at your own risk.
230 const_reference at(size_type __n) const { return _M_non_dbg_impl.at(__n); } function in class:basic_string
231 reference at(size_type __n) { return _M_non_dbg_impl.at(__n); } function in class:basic_string
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _vector.h | 6 * or implied. Any use is at your own risk.
103 reference at(size_type __n) { return cast_traits::to_value_type_ref(_M_impl.at(__n)); } function in class:vector
104 const_reference at(size_type __n) const { return cast_traits::to_value_type_cref(_M_impl.at(__n)); } function in class:vector
|
| /ndk/sources/host-tools/make-3.81/ |
| commands.c | 9 Foundation; either version 2, or (at your option) any later version.
49 char *at, *percent, *star, *less;
61 at = (char *) alloca (p - file->name + 1);
62 bcopy (file->name, at, p - file->name);
63 at[p - file->name] = '\0';
72 at = file->name;
125 less = at;
134 DEFINE_VARIABLE ("@", 1, at);
48 char *at, *percent, *star, *less; local
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/basic_cstring/ |
| basic_cstring.hpp | 3 // (See accompanying file LICENSE_1_0.txt or copy at
78 value_type at( size_type index ) const;
218 basic_cstring<CharT>::at( size_type index ) const function in class:boost::unit_test::basic_cstring
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| vector_test.cpp | 2 //into account (at least using GCC 4.0.1)
31 CPPUNIT_TEST(at);
54 void at();
313 void VectorTest::at() { function in class:VectorTest
318 CPPUNIT_ASSERT( v.at(0) == 10 );
319 v.at(0) = 20;
320 CPPUNIT_ASSERT( cv.at(0) == 20 );
324 v.at(1) = 20;
|
| /ndk/tests/device/test-stlport/unit/ |
| vector_test.cpp | 2 //into account (at least using GCC 4.0.1)
31 CPPUNIT_TEST(at);
54 void at();
313 void VectorTest::at() { function in class:VectorTest
318 CPPUNIT_ASSERT( v.at(0) == 10 );
319 v.at(0) = 20;
320 CPPUNIT_ASSERT( cv.at(0) == 20 );
324 v.at(1) = 20;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_map.h | 9 // Free Software Foundation; either version 3, or (at your option)
464 at(const key_type& __k) function in class:map
468 __throw_out_of_range(__N("map::at"));
473 at(const key_type& __k) const function in class:map
477 __throw_out_of_range(__N("map::at"));
|
