Searched defs:set (Results 301 - 325 of 843) sorted by relevance

<<11121314151617181920>>

/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
H A DArrayFieldVector.java119 * set to <code>false</code. This will prevent the copying and improve
150 * set to <code>false</code. This will prevent the copying and improve
719 set(index, (ArrayFieldVector<T>) v);
742 * Set a set of consecutive elements.
744 * @param index index of first element to be set.
745 * @param v vector containing the values to set.
749 public void set(int index, ArrayFieldVector<T> v) method in class:ArrayFieldVector
755 public void set(T value) { method in class:ArrayFieldVector
H A DSparseFieldVector.java101 * @param values The set of values to create from
462 public void set(T value) { method in class:SparseFieldVector
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/
H A DFastFourierTransformer.java39 * We require the length of data set to be power of 2, this greatly simplifies
64 * Transform the given real data set.
101 * Transform the given complex data set.
117 * Transform the given real data set.
158 * Transform the given complex data set.
176 * Inversely transform the given real data set.
217 * Inversely transform the given complex data set.
235 * Inversely transform the given real data set.
276 * Inversely transform the given complex data set.
489 * Verifies that the data set ha
688 public Complex set(Complex magnitude, int... vector) method in class:FastFourierTransformer.MultiDimensionalComplexMatrix
[all...]
/external/apache-xml/src/main/java/org/apache/xml/serializer/
H A DCharInfo.java97 /** Array of values is faster access than a set of bits
104 /** Array of values is faster access than a set of bits
111 /** An array of bits to record if the character is in the set.
131 * set.
140 * the integers in the set. It is the index of the first element
164 // Not set here, but in a constructor that uses this one
321 * two arrays we will change by adding a tab to the set of
570 * @param i the integer that might be in the set of integers
578 * For a given integer in the set it returns the single bit
580 * the integer is in the set o
605 private final void set(int i) { method in class:CharInfo
[all...]
/external/boringssl/src/crypto/x509/
H A Dx_name.c225 entry->set = i;
274 int set = -1; local
280 if(entry->set != set) {
286 set = entry->set;
337 int set = -1, ret = 0; local
357 if(entry->set != set)
367 set
[all...]
/external/chromium-trace/trace-viewer/tracing/third_party/components/webcomponentsjs/
H A DHTMLImports.js5 * The complete set of authors may be found at http://polymer.github.io/AUTHORS.txt
6 * The complete set of contributors may be found at http://polymer.github.io/CONTRIBUTORS.txt
19 set: function(key, value) {
H A Dwebcomponents-lite.min.js5 * The complete set of authors may be found at http://polymer.github.io/AUTHORS.txt
6 * The complete set of contributors may be found at http://polymer.github.io/CONTRIBUTORS.txt
11 window.WebComponents=window.WebComponents||{},function(e){var t=e.flags||{},n="webcomponents.js",o=document.querySelector('script[src*="'+n+'"]');if(!t.noOpts){if(location.search.slice(1).split("&").forEach(function(e){e=e.split("="),e[0]&&(t[e[0]]=e[1]||!0)}),o)for(var r,i=0;r=o.attributes[i];i++)"src"!==r.name&&(t[r.name]=r.value||!0);if(t.log){var a=t.log.split(",");t.log={},a.forEach(function(e){t.log[e]=!0})}else t.log={}}t.shadow=t.shadow||t.shadowdom||t.polyfill,t.shadow="native"===t.shadow?!1:t.shadow||!HTMLElement.prototype.createShadowRoot,t.register&&(window.CustomElements=window.CustomElements||{flags:{}},window.CustomElements.flags.register=t.register),e.flags=t}(WebComponents),function(e){function t(e){_.push(e),w||(w=!0,h(o))}function n(e){return window.ShadowDOMPolyfill&&window.ShadowDOMPolyfill.wrapIfNeeded(e)||e}function o(){w=!1;var e=_;_=[],e.sort(function(e,t){return e.uid_-t.uid_});var t=!1;e.forEach(function(e){var n=e.takeRecords();r(e),n.length&&(e.callback_(n,e),t=!0)}),t&&o()}function r(e){e.nodes_.forEach(function(t){var n=v.get(t);n&&n.forEach(function(t){t.observer===e&&t.removeTransientObservers()})})}function i(e,t){for(var n=e;n;n=n.parentNode){var o=v.get(n);if(o)for(var r=0;r<o.length;r++){var i=o[r],a=i.options;if(n===e||a.subtree){var s=t(a);s&&i.enqueue(s)}}}}function a(e){this.callback_=e,this.nodes_=[],this.records_=[],this.uid_=++E}function s(e,t){this.type=e,this.target=t,this.addedNodes=[],this.removedNodes=[],this.previousSibling=null,this.nextSibling=null,this.attributeName=null,this.attributeNamespace=null,this.oldValue=null}function d(e){var t=new s(e.type,e.target);return t.addedNodes=e.addedNodes.slice(),t.removedNodes=e.removedNodes.slice(),t.previousSibling=e.previousSibling,t.nextSibling=e.nextSibling,t.attributeName=e.attributeName,t.attributeNamespace=e.attributeNamespace,t.oldValue=e.oldValue,t}function c(e,t){return y=new s(e,t)}function u(e){return L?L:(L=d(y),L.oldValue=e,L)}function l(){y=L=void 0}function f(e){return e===L||e===y}function m(e,t){return e===t?e:L&&f(e)?L:null}function p(e,t,n){this.observer=e,this.target=t,this.options=n,this.transientObservedNodes=[]}var h,v=new WeakMap;if(/Trident|Edge/.test(navigator.userAgent))h=setTimeout;else if(window.setImmediate)h=window.setImmediate;else{var g=[],b=String(Math.random());window.addEventListener("message",function(e){if(e.data===b){var t=g;g=[],t.forEach(function(e){e()})}}),h=function(e){g.push(e),window.postMessage(b,"*")}}var w=!1,_=[],E=0;a.prototype={observe:function(e,t){if(e=n(e),!t.childList&&!t.attributes&&!t.characterData||t.attributeOldValue&&!t.attributes||t.attributeFilter&&t.attributeFilter.length&&!t.attributes||t.characterDataOldValue&&!t.characterData)throw new SyntaxError;var o=v.get(e);o||v.set(e,o=[]);for(var r,i=0;i<o.length;i++)if(o[i].observer===this){r=o[i],r.removeListeners(),r.options=t;break}r||(r=new p(this,e,t),o.push(r),this.nodes_.push(e)),r.addListeners()},disconnect:function(){this.nodes_.forEach(function(e){for(var t=v.get(e),n=0;n<t.length;n++){var o=t[n];if(o.observer===this){o.removeListeners(),t.splice(n,1);break}}},this),this.records_=[]},takeRecords:function(){var e=this.records_;return this.records_=[],e}};var y,L;p.prototype={enqueue:function(e){var n=this.observer.records_,o=n.length;if(n.length>0){var r=n[o-1],i=m(r,e);if(i)return void(n[o-1]=i)}else t(this.observer);n[o]=e},addListeners:function(){this.addListeners_(this.target)},addListeners_:function(e){var t=this.options;t.attributes&&e.addEventListener("DOMAttrModified",this,!0),t.characterData&&e.addEventListener("DOMCharacterDataModified",this,!0),t.childList&&e.addEventListener("DOMNodeInserted",this,!0),(t.childList||t.subtree)&&e.addEventListener("DOMNodeRemoved",this,!0)},removeListeners:function(){this.removeListeners_(this.target)},removeListeners_:function(e){var t=this.options;t.attributes&&e.removeEventListener("DOMAttrModified",this,!0),t.characterData&&e.removeEventListener("DOMCharacterDataModified",this,!0),t.childList&&e.removeEventListener("DOMNodeInserted",this,!0),(t.childList||t.subtree)&&e.removeEventListener("DOMNodeRemoved",this,!0)},addTransientObserver:function(e){if(e!==this.target){this.addListeners_(e),this.transientObservedNodes.push(e);var t=v.get(e);t||v.set(e,t=[]),t.push(this)}},removeTransientObservers:function(){var e=this.transientObservedNodes;this.transientObservedNodes=[],e.forEach(function(e){this.removeListeners_(e);for(var t=v.get(e),n=0;n<t.length;n++)if(t[n]===this){t.splice(n,1);break}},this)},handleEvent:function(e){switch(e.stopImmediatePropagation(),e.type){case"DOMAttrModified":var t=e.attrName,n=e.relatedNode.namespaceURI,o=e.target,r=new c("attributes",o);r.attributeName=t,r.attributeNamespace=n;var a=e.attrChange===MutationEvent.ADDITION?null:e.prevValue;i(o,function(e){return!e.attributes||e.attributeFilter&&e.attributeFilter.length&&-1===e.attributeFilter.indexOf(t)&&-1===e.attributeFilter.indexOf(n)?void 0:e.attributeOldValue?u(a):r});break;case"DOMCharacterDataModified":var o=e.target,r=c("characterData",o),a=e.prevValue;i(o,function(e){return e.characterData?e.characterDataOldValue?u(a):r:void 0});break;case"DOMNodeRemoved":this.addTransientObserver(e.target);case"DOMNodeInserted":var s,d,f=e.target;"DOMNodeInserted"===e.type?(s=[f],d=[]):(s=[],d=[f]);var m=f.previousSibling,p=f.nextSibling,r=c("childList",e.target.parentNode);r.addedNodes=s,r.removedNodes=d,r.previousSibling=m,r.nextSibling=p,i(e.relatedNode,function(e){return e.childList?r:void 0})}l()}},e.JsMutationObserver=a,e.MutationObserver||(e.MutationObserver=a)}(this),"undefined"==typeof WeakMap&&!function(){var e=Object.defineProperty,t=Date.now()%1e9,n=function(){this.name="__st"+(1e9*Math.random()>>>0)+(t++ +"__")};n.prototype={set:function(t,n){var o=t[this.name];return o&&o[0]===t?o[1]=n:e(t,this.name,{value:[t,n],writable:!0} (…)
/external/chromium-trace/trace-viewer/tracing/third_party/gl-matrix/src/gl-matrix/
H A Dvec2.js89 vec2.set = function(out, x, y) {
H A Dvec4.js101 vec4.set = function(out, x, y, z, w) {
/external/clang/include/clang/Basic/
H A DObjCRuntime.h66 void set(Kind kind, VersionTuple version) { function in class:clang::ObjCRuntime
74 /// \brief Does this runtime follow the set of implied behaviors for a
88 /// The inverse of isNonFragile(): does this runtime follow the set of
/external/clang/include/clang/Sema/
H A DTemplateDeduction.h98 /// \brief Add a new diagnostic to the set of diagnostics
106 /// \brief Iterator over the set of suppressed diagnostics.
233 void set(Decl *Spec, DeductionFailureInfo Info) { function in struct:clang::TemplateSpecCandidate
242 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
274 /// to the overload set.
/external/clang/test/CXX/class.access/
H A Dp6.cpp60 template <class T> static void set(T &t, typename T::type v) { function in class:test2::A
78 A::set(b, 0);
/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl_thread.cc178 static void ReportIgnoresEnabled(ThreadContext *tctx, IgnoreSet *set) { argument
188 for (uptr i = 0; i < set->Size(); i++) {
190 PrintStack(SymbolizeStackId(set->At(i)));
/external/deqp/framework/delibs/decpp/
H A DdeCommandLine.cpp26 #include <set>
50 using std::set;
82 throw std::out_of_range("Value not set");
85 void TypedFieldMap::set (const std::type_info* key, const Entry& value) function in class:de::cmdline::detail::TypedFieldMap
117 typedef set<const OptInfo*> OptSet;
/external/dexmaker/src/dx/java/com/android/dx/rop/code/
H A DRegisterSpec.java67 theInterningItem.set(reg, type, local);
624 public void set(int reg, TypeBearer type, LocalItem local) { method in class:RegisterSpec.ForComparison
/external/dexmaker/src/dx/java/com/android/dx/rop/type/
H A DStdTypeList.java172 result.set(0, type);
185 result.set(0, type0);
186 result.set(1, type1);
200 result.set(0, type0);
201 result.set(1, type1);
202 result.set(2, type2);
218 result.set(0, type0);
219 result.set(1, type1);
220 result.set(2, type2);
221 result.set(
384 public void set(int n, Type type) { method in class:StdTypeList
[all...]
/external/dnsmasq/src/
H A Dlog.c109 /* NOTE: umask is set to 022 by the time this gets called */
397 void set_log_writer(fd_set *set, int *maxfdp) argument
401 FD_SET(log_fd, set);
406 void check_log_writer(fd_set *set) argument
408 if (log_fd != -1 && (!set || FD_ISSET(log_fd, set)))
/external/e2fsprogs/ext2ed/
H A Dgeneral_com.c189 device_handle=NULL; /* Notice that our device is still not set up */
229 wprintw (command_win,"Error - No type set\n");refresh_command_win ();
304 wprintw (command_win, "Variable %s set to %s\n",
339 wprintw (command_win, "Variable %s set to %s\n",
352 wprintw (command_win, "Variable %s set to %s\n",
357 void set (char *command_line) function
410 "set: unhandled type %d\n",
519 wprintw (command_win,"Structure type set to %s\n",buffer);refresh_command_win ();
/external/e2fsprogs/misc/
H A Dchattr.c61 static int set; variable
176 set = 1;
210 if (set) {
212 printf (_("Flags of %s set as "), name);
224 printf(_("Flags of %s set as "), name);
241 printf (_("Version of %s set as %lu\n"), name, version);
305 if (set && (add || rem)) {
310 fputs("Can't both set and unset same flag.\n", stderr);
313 if (!(add || rem || set || set_version)) {
/external/fonttools/Lib/fontTools/
H A Dmerge.py100 allKeys = set.union(set(), *(vars(table).keys() for table in lst))
174 6: lambda bit: 0, # Always set to zero
178 15: lambda bit: 0, # Always set to zero
236 # unset bit 1 (no embedding permitted) if either bit 2 or 3 is set
239 # set bit 2 (allow previewing) if bit 3 is set (allow editing)
242 # set bits 2 and 3 if everything is allowed
247 # unset bits 2 and 3 if bit 1 is set (some font is "no embedding")
282 # bits 8 and 9 are reserved and should be set t
633 def set(self, **kwargs): member in class:Options
[all...]
/external/fonttools/Tools/fontTools/
H A Dmerge.py100 allKeys = set.union(set(), *(vars(table).keys() for table in lst))
174 6: lambda bit: 0, # Always set to zero
178 15: lambda bit: 0, # Always set to zero
236 # unset bit 1 (no embedding permitted) if either bit 2 or 3 is set
239 # set bit 2 (allow previewing) if bit 3 is set (allow editing)
242 # set bits 2 and 3 if everything is allowed
247 # unset bits 2 and 3 if bit 1 is set (some font is "no embedding")
282 # bits 8 and 9 are reserved and should be set t
633 def set(self, **kwargs): member in class:Options
[all...]
/external/google-breakpad/src/client/windows/common/
H A Dipc_protocol.h76 void set(const wchar_t* name_arg, const wchar_t* value_arg) { function in struct:google_breakpad::CustomInfoEntry
/external/google-breakpad/src/processor/
H A Drange_map_unittest.cc97 // The number of tests in the set
269 static bool RetrieveIndexTest(TestMap *range_map, int set) { argument
278 fprintf(stderr, "FAILED: RetrieveRangeAtIndex set %d index %d, "
280 set, object_index);
285 fprintf(stderr, "FAILED: RetrieveRangeAtIndex set %d index %d, "
287 set, object_index);
296 fprintf(stderr, "FAILED: RetrieveRangeAtIndex set %d index %d, "
298 set, object_index, object->id());
304 fprintf(stderr, "FAILED: RetrieveRangeAtIndex set %d index %d, "
306 set, object_inde
[all...]
H A Dstatic_range_map_unittest.cc72 // The number of tests in the set
76 // These tests will be run sequentially. The first set of tests exercises
146 // Similar to the previous test set, but with a couple of ranges closer
191 void RetrieveIndexTest(const TestMap* range_map, int set);
312 void TestStaticRangeMap::RetrieveIndexTest(const TestMap* range_map, int set) { argument
323 << "FAILED: RetrieveRangeAtIndex set " << set
326 ASSERT_TRUE(entry) << "FAILED: RetrieveRangeAtIndex set " << set
333 EXPECT_NE(*entry, *last_entry) << "FAILED: RetrieveRangeAtIndex set "
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DConstraints.java116 * Returns a constrained view of the specified set, using the specified
117 * constraint. Any operations that add new elements to the set will call the
121 * <p>The returned set is not serializable.
123 * @param set the set to constrain
125 * @return a constrained view of the set
128 Set<E> set, Constraint<? super E> constraint) {
129 return new ConstrainedSet<E>(set, constraint);
154 * Returns a constrained view of the specified sorted set, using the specified
155 * constraint. Any operations that add new elements to the sorted set wil
127 constrainedSet( Set<E> set, Constraint<? super E> constraint) argument
257 @Override public E set(int index, E element) { method in class:Constraints.ConstrainedList
308 @Override public void set(E element) { method in class:Constraints.ConstrainedListIterator
[all...]

Completed in 616 milliseconds

<<11121314151617181920>>