| /external/proguard/src/proguard/optimize/peephole/ |
| MethodInliner.java | 556 info.merge(MethodOptimizationInfo.getMethodOptimizationInfo(programMethod));
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| algo.h | 57 #include <parallel/merge.h>
2009 merge(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, function in namespace:std::__parallel
2018 merge(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, function in namespace:std::__parallel
2064 merge(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, function in namespace:std::__parallel
2088 merge(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, function in namespace:std::__parallel
[all...] |
| /external/clang/lib/CodeGen/ |
| TargetInfo.cpp | 817 /// merge - Implement the X86_64 ABI merging algorithm.
819 /// Merge an accumulating classification \arg Accum with a field
823 /// always be either NoClass or the result of a previous merge
826 static Class merge(Class Accum, Class Field);
1013 X86_64ABIInfo::Class X86_64ABIInfo::merge(Class Accum, Class Field) { function in class:X86_64ABIInfo
[all...] |
| /external/stlport/stlport/stl/ |
| _algo.h | 573 // merge, with and without an explicitly supplied comparison function.
576 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
582 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
|
| _list.h | 648 void merge(_Self& __x) function in class:list
672 void merge(_Self& __x, function in class:list
|
| _slist.h | 789 void merge(_Self& __x) { _STLP_PRIV _Slist_merge(*this, __x, less<value_type>()); } function in class:slist
809 void merge(_Self& __x, _StrictWeakOrdering __comp) function in class:slist
|
| _algo.c | 1419 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
1440 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
[all...] |
| /external/webkit/Source/JavaScriptCore/yarr/ |
| YarrPattern.cpp | 259 // Merge two following BeginChars in the vector to reduce the number of character checks.
260 void merge(unsigned size) function in struct:JSC::Yarr::BeginCharHelper
266 // If the current and the next size of value is different we should skip the merge process
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 573 // merge, with and without an explicitly supplied comparison function.
576 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
582 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
|
| _list.h | 648 void merge(_Self& __x) function in class:list
672 void merge(_Self& __x, function in class:list
|
| _slist.h | 789 void merge(_Self& __x) { _STLP_PRIV _Slist_merge(*this, __x, less<value_type>()); } function in class:slist
809 void merge(_Self& __x, _StrictWeakOrdering __comp) function in class:slist
|
| _algo.c | 1419 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
1440 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 573 // merge, with and without an explicitly supplied comparison function.
576 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
582 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
|
| _list.h | 648 void merge(_Self& __x) function in class:list
672 void merge(_Self& __x, function in class:list
|
| _slist.h | 789 void merge(_Self& __x) { _STLP_PRIV _Slist_merge(*this, __x, less<value_type>()); } function in class:slist
809 void merge(_Self& __x, _StrictWeakOrdering __comp) function in class:slist
|
| _algo.c | 1419 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
1440 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 573 // merge, with and without an explicitly supplied comparison function.
576 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
582 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
|
| _list.h | 648 void merge(_Self& __x) function in class:list
672 void merge(_Self& __x, function in class:list
|
| _slist.h | 789 void merge(_Self& __x) { _STLP_PRIV _Slist_merge(*this, __x, less<value_type>()); } function in class:slist
809 void merge(_Self& __x, _StrictWeakOrdering __comp) function in class:slist
|
| _algo.c | 1419 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
1440 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jquery/ |
| jquery-1.4.2.min.js | 22 (d[1]||!b))if(d[1]){f=b?b.ownerDocument||b:s;if(a=Xa.exec(a))if(c.isPlainObject(b)){a=[s.createElement(a[1])];c.fn.attr.call(a,b,true)}else a=[f.createElement(a[1])];else{a=sa([d[1]],[f]);a=(a.cacheable?a.fragment.cloneNode(true):a.fragment).childNodes}return c.merge(this,a)}else{if(b=s.getElementById(d[2])){if(b.id!==d[2])return T.find(a);this.length=1;this[0]=b}this.context=s;this.selector=a;return this}else if(!b&&/^\w+$/.test(a)){this.selector=a;this.context=s;a=s.getElementsByTagName(a);return c.merge(this,
23 a)}else return!b||b.jquery?(b||T).find(a):c(b).find(a);else if(c.isFunction(a))return T.ready(a);if(a.selector!==w){this.selector=a.selector;this.context=a.context}return c.makeArray(a,this)},selector:"",jquery:"1.4.2",length:0,size:function(){return this.length},toArray:function(){return R.call(this,0)},get:function(a){return a==null?this.toArray():a<0?this.slice(a)[0]:this[a]},pushStack:function(a,b,d){var f=c();c.isArray(a)?ba.apply(f,a):c.merge(f,a);f.prevObject=this;f.context=this.context;if(b===
30 d)===false)break}else for(;e<j;){if(b.apply(a[e++],d)===false)break}else if(i)for(f in a){if(b.call(a[f],f,a[f])===false)break}else for(d=a[0];e<j&&b.call(d,e,d)!==false;d=a[++e]);return a},trim:function(a){return(a||"").replace(Wa,"")},makeArray:function(a,b){b=b||[];if(a!=null)a.length==null||typeof a==="string"||c.isFunction(a)||typeof a!=="function"&&a.setInterval?ba.call(b,a):c.merge(b,a);return b},inArray:function(a,b){if(b.indexOf)return b.indexOf(a);for(var d=0,f=b.length;d<f;d++)if(b[d]===
31 a)return d;return-1},merge:function(a,b){var d=a.length,f=0;if(typeof b.length==="number")for(var e=b.length;f<e;f++)a[d++]=b[f];else for(;b[f]!==w;)a[d++]=b[f++];a.length=d;return a},grep:function(a,b,d){for(var f=[],e=0,j=a.length;e<j;e++)!d!==!b(a[e],e)&&f.push(a[e]);return f},map:function(a,b,d){for(var f=[],e,j=0,i=a.length;j<i;j++){e=b(a[j],j,d);if(e!=null)f[f.length]=e}return f.concat.apply([],f)},guid:1,proxy:function(a,b,d){if(arguments.length===2)if(typeof b==="string"){d=a;a=d[b];b=w}else if(b&&
[all...] |
| /external/clang/lib/AST/ |
| Type.cpp | 1946 friend CachedProperties merge(CachedProperties L, CachedProperties R) { function in class:__anon4115::CachedProperties
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
| jquery-1.3.2.js | 393 return this.pushStack( jQuery.unique( jQuery.merge(
946 ret = jQuery.merge( ret, elem );
1095 merge: function( first, second ) {
[all...] |
| /dalvik/dx/src/com/android/dx/io/ |
| DexBuffer.java | 22 import com.android.dx.merge.TypeList;
|
| /external/clang/include/clang/AST/ |
| Decl.h | 253 void merge(LinkageInfo Other) { function in class:clang::NamedDecl::LinkageInfo
257 void merge(std::pair<Linkage,Visibility> LV) { function in class:clang::NamedDecl::LinkageInfo
262 friend LinkageInfo merge(LinkageInfo L, LinkageInfo R) { function in class:clang::NamedDecl::LinkageInfo
263 L.merge(R);
[all...] |
