| /xsrc/external/mit/MesaLib/dist/src/amd/registers/ |
| regdb.py | 37 Simplistic implementation of a union-find data structure that also keeps
41 - union: unify the sets containing the two given elements
55 def union(self, k1, k2): member in class:UnionFind
255 other.chips = sorted(list(chips.union(other_chips)))
332 def __merge_enums(enums, union=False):
339 if not union:
356 def merge_enums(self, names, newname, union=False):
366 union=union
391 def __merge_register_types(regtypes, union=False, field_keys={})
[all...] |
| /xsrc/external/mit/xcb-proto/dist/xcbgen/ |
| matcher.py | 71 def union(node, module, namespace): function
74 type = Union(name, node)
118 'union' : union,
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| gen_disasm.py | 124 return set.union(*[find_context_keys_expr(x) for x in expr[1:]])
|
| /xsrc/external/mit/MesaLib/dist/src/vulkan/util/ |
| vk_cmd_queue_gen.py | 80 % if len(c.params) <= 1: # Avoid "error C2016: C requires that a struct or union have at least one member"
99 union {
|
| /xsrc/external/mit/xedit/dist/lisp/modules/progmodes/ |
| c.lsp | 1013 "throw|try|typedef|union|unsigned|virtual|void|volatile|while"
|
| /xsrc/external/mit/fontconfig/dist/doc/ |
| fcconfig.fncs | 312 earlier elements in the list are elided. The union of Unicode coverage of
|
| /xsrc/external/mit/freetype/dist/docs/reference/assets/javascripts/ |
| application.c33a9706.js | 23 */,D.Set=function(e){if(this.elements=Object.create(null),e){this.length=e.length;for(var t=0;t<this.length;t++)this.elements[e[t]]=!0}else this.length=0},D.Set.complete={intersect:function(e){return e},union:function(e){return e},contains:function(){return!0}},D.Set.empty={intersect:function(){return this},union:function(e){return e},contains:function(){return!1}},D.Set.prototype.contains=function(e){return!!this.elements[e]},D.Set.prototype.intersect=function(e){var t,n,r,i=[];if(e===D.Set.complete)return this;if(e===D.Set.empty)return e;n=this.length<e.length?(t=this,e):(t=e,this),r=Object.keys(t.elements);for(var o=0;o<r.length;o++){var a=r[o];a in n.elements&&i.push(a)}return new D.Set(i)},D.Set.prototype.union=function(e){return e===D.Set.complete?D.Set.complete:e===D.Set.empty?this:new D.Set(Object.keys(this.elements).concat(Object.keys(e.elements)))},D.idf=function(e,t){var n=0;for(var r in e)"_index"!=r&&(n+=Object.keys(e[r]).length);var i=(t-n+.5)/(n+.5);return Math.log(1+Math.abs(i))},D.Token=function(e,t){this.str=e||"",this.metadata=t||{}},D.Token.prototype.toString=function(){return this.str},D.Token.prototype.update=function(e){return this.str=e(this.str,this.metadata),this},D.Token.prototype.clone=function(e){return e=e||function(e){return e},new D.Token(e(this.str,this.metadata),this.metadata)}
56 */,D.Index=function(e){this.invertedIndex=e.invertedIndex,this.fieldVectors=e.fieldVectors,this.tokenSet=e.tokenSet,this.fields=e.fields,this.pipeline=e.pipeline},D.Index.prototype.search=function(t){return this.query(function(e){new D.QueryParser(t,e).parse()})},D.Index.prototype.query=function(e){for(var t=new D.Query(this.fields),n=Object.create(null),r=Object.create(null),i=Object.create(null),o=Object.create(null),a=Object.create(null),s=0;s<this.fields.length;s++)r[this.fields[s]]=new D.Vector;e.call(t,t);for(s=0;s<t.clauses.length;s++){var c=t.clauses[s],l=null,u=D.Set.complete;l=c.usePipeline?this.pipeline.runString(c.term,{fields:c.fields}):[c.term];for(var f=0;f<l.length;f++){var d=l[f];c.term=d;var h=D.TokenSet.fromClause(c),p=this.tokenSet.intersect(h).toArray();if(0===p.length&&c.presence===D.Query.presence.REQUIRED){for(var m=0;m<c.fields.length;m++){o[P=c.fields[m]]=D.Set.empty}break}for(var y=0;y<p.length;y++){var v=p[y],g=this.invertedIndex[v],w=g._index;for(m=0;m<c.fields.length;m++){var _=g[P=c.fields[m]],E=Object.keys(_),x=v+"/"+P,b=new D.Set(E);if(c.presence==D.Query.presence.REQUIRED&&(u=u.union(b),void 0===o[P]&&(o[P]=D.Set.complete)),c.presence!=D.Query.presence.PROHIBITED){if(r[P].upsert(w,c.boost,function(e,t){return e+t}),!i[x]){for(var k=0;k<E.length;k++){var S,T=E[k],L=new D.FieldRef(T,P),R=_[T];void 0===(S=n[L])?n[L]=new D.MatchData(v,P,R):S.add(v,P,R)}i[x]=!0}}else void 0===a[P]&&(a[P]=D.Set.empty),a[P]=a[P].union(b)}}}if(c.presence===D.Query.presence.REQUIRED)for(m=0;m<c.fields.length;m++){o[P=c.fields[m]]=o[P].intersect(u)}}var O=D.Set.complete,C=D.Set.empty;for(s=0;s<this.fields.length;s++){var P;o[P=this.fields[s]]&&(O=O.intersect(o[P])),a[P]&&(C=C.union(a[P]))}var Q=Object.keys(n),A=[],I=Object.create(null);if(t.isNegated()){Q=Object.keys(this.fieldVectors);for(s=0;s<Q.length;s++){L=Q[s];var M=D.FieldRef.fromString(L);n[L]=new D.MatchData}}for(s=0;s<Q.length;s++){var N=(M=D.FieldRef.fromString(Q[s])).docRef;if(O.contains(N)&&!C.contains(N)){var j,F=this.fieldVectors[M],H=r[M.fieldName].similarity(F);if(void 0!==(j=I[N]))j.score+=H,j.matchData.combine(n[M]);else{var q={ref:N,score:H,matchData:n[M]};I[N]=q,A.push(q)}}}return A.sort(function(e,t){return t.score-e.score})},D.Index.prototype.toJSON=function(){var e=Object.keys(this.invertedIndex).sort().map(function(e){return[e,this.invertedIndex[e]]},this),t=Object.keys(this.fieldVectors).map(function(e){return[e,this.fieldVectors[e].toJSON()]},this);return{version:D.version,fields:this.fields,fieldVectors:t,invertedIndex:e,pipeline:this.pipeline.toJSON()}},D.Index.load=function(e){var t={},n={},r=e.fieldVectors,i=Object.create(null),o=e.invertedIndex,a=new D.TokenSet.Builder,s=D.Pipeline.load(e.pipeline);e.version!=D.version&&D.utils.warn("Version mismatch when loading serialised index. Current version of lunr '"+D.version+"' does not match serialized index '"+e.version+"'");for(var c=0;c<r.length;c++){var l=(f=r[c])[0],u=f[1];n[l]=new D.Vector(u)}for(c=0;c<o.length;c++){var f,d=(f=o[c])[0],h=f[1];a.insert(d),i[d]=h}return a.finish(),t.fields=e.fields,t.fieldVectors=n,t.invertedIndex=i,t.tokenSet=a.root,t.pipeline=s,new D.Index(t)}
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_algebraic.py | 120 the "find" part of the union-find algorithm.
136 the "union" part of the union-find algorithm.
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_algebraic.py | 127 the "find" part of the union-find algorithm.
143 the "union" part of the union-find algorithm.
|
| /xsrc/external/mit/xedit/dist/lisp/test/ |
| list.lsp | 1785 ;; union - function
1786 (equal-test '(b c f a d) #'union '(a b c) '(f a d))
1788 #'union '((x 5) (y 6)) '((z 2) (x 4)) :key #'car)
|
| /xsrc/external/mit/libpthread-stubs/dist/ |
| configure | 2136 union {
2148 "Anonymous union alignment botch");
|
| /xsrc/external/mit/fontconfig/dist/ |
| configure | 2931 union {
2943 "Anonymous union alignment botch");
20582 union
|
| /xsrc/external/mit/appres/dist/ |
| configure | 2264 union {
2276 "Anonymous union alignment botch");
|
| /xsrc/external/mit/bdftopcf/dist/ |
| configure | 2282 union {
2294 "Anonymous union alignment botch");
|
| /xsrc/external/mit/bitmap/dist/ |
| configure | 2365 union {
2377 "Anonymous union alignment botch");
|
| /xsrc/external/mit/editres/dist/ |
| configure | 2285 union {
2297 "Anonymous union alignment botch");
|
| /xsrc/external/mit/font-util/dist/ |
| configure | 2252 union {
2264 "Anonymous union alignment botch");
|
| /xsrc/external/mit/fonttosfnt/dist/ |
| configure | 2333 union {
2345 "Anonymous union alignment botch");
|
| /xsrc/external/mit/fslsfonts/dist/ |
| configure | 2332 union {
2344 "Anonymous union alignment botch");
|
| /xsrc/external/mit/fstobdf/dist/ |
| configure | 2249 union {
2261 "Anonymous union alignment botch");
|
| /xsrc/external/mit/iceauth/dist/ |
| configure | 2350 union {
2362 "Anonymous union alignment botch");
|
| /xsrc/external/mit/ico/dist/ |
| configure | 2248 union {
2260 "Anonymous union alignment botch");
|
| /xsrc/external/mit/imake/dist/ |
| configure | 2435 union {
2447 "Anonymous union alignment botch");
|
| /xsrc/external/mit/listres/dist/ |
| configure | 2265 union {
2277 "Anonymous union alignment botch");
|
| /xsrc/external/mit/lndir/dist/ |
| configure | 2341 union {
2353 "Anonymous union alignment botch");
|
