| /prebuilts/gcc/linux-x86/host/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/ceres-solver/docs/ |
| introduction.tex | 16 We welcome contributions to Ceres, whether they are new features, bug fixes or tests. The Ceres mailing list\footnote{\url{http://groups.google.com/group/ceres-solver}} is the best place for all development related discussions. Please consider joining it. If you have ideas on how you would like to contribute to Ceres, it is a good idea to let us know on the mailinglist before you start development. We may have suggestions that will save effort when trying to merge your work into the main branch. If you are looking for ideas, please let us know about your interest and skills and we will be happy to make a suggestion or three.
|
| /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
|
| /external/v8/test/cctest/ |
| log-eq-of-logging-and-traversal.js | 139 // Do a merge-like comparison of entries. At the same address we expect to
|
| /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...] |
| /frameworks/base/core/java/android/widget/ |
| ImageView.java | 440 public void setImageState(int[] state, boolean merge) {
442 mMergeState = merge;
[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
|
| /prebuilts/ndk/5/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
|
| /prebuilts/ndk/6/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
|
| /prebuilts/ndk/7/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
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| algorithmfwd.h | 82 merge
136 * searching, merge, partition, heap, set, minima, maxima, and
363 // merge
667 merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
672 merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
|
| /prebuilts/ndk/8/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
|
| /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...] |
