Home
last modified time | relevance | path

Searched refs:setUnion (Results 1 – 25 of 399) sorted by relevance

12345678910>>...16

/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/apparentlymart/go-versions/versions/
H A Dset_union.go8 type setUnion []setI type
10 func (s setUnion) Has(v Version) bool {
19 func (s setUnion) AllRequested() Set {
25 si := make(setUnion, 0, len(s))
39 func (s setUnion) GoString() string {
62 r := make(setUnion, 0, len(sets))
67 if su, ok := set.setI.(setUnion); ok {
85 r := make(setUnion, 1, len(others)+1)
91 if su, ok := ss.setI.(setUnion); ok {
103 var _ setFinite = setUnion{}
[all …]
/dports/audio/clementine-player/Clementine-1.4.0rc1/3rdparty/taglib/
H A Dtagunion.cpp56 #define setUnion(method, value) \ macro
204 setUnion(Title, s); in setTitle()
209 setUnion(Artist, s); in setArtist()
214 setUnion(Album, s); in setAlbum()
219 setUnion(Comment, s); in setComment()
224 setUnion(Genre, s); in setGenre()
229 setUnion(Year, i); in setYear()
234 setUnion(Track, i); in setTrack()
/dports/audio/taglib/taglib-1.12/taglib/
H A Dtagunion.cpp56 #define setUnion(method, value) \ macro
204 setUnion(Title, s); in setTitle()
209 setUnion(Artist, s); in setArtist()
214 setUnion(Album, s); in setAlbum()
219 setUnion(Comment, s); in setComment()
224 setUnion(Genre, s); in setGenre()
229 setUnion(Year, i); in setYear()
234 setUnion(Track, i); in setTrack()
/dports/multimedia/musikcube/musikcube-0.96.7/src/plugins/taglib_plugin/taglib-1.11/taglib/
H A Dtagunion.cpp56 #define setUnion(method, value) \ macro
204 setUnion(Title, s); in setTitle()
209 setUnion(Artist, s); in setArtist()
214 setUnion(Album, s); in setAlbum()
219 setUnion(Comment, s); in setComment()
224 setUnion(Genre, s); in setGenre()
229 setUnion(Year, i); in setYear()
234 setUnion(Track, i); in setTrack()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/analysis/
H A DSourceInterpreter.java229 Set<AbstractInsnNode> setUnion = in merge() local
232 if (setUnion == value1.insns && value1.size == value2.size) { in merge()
235 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
239 HashSet<AbstractInsnNode> setUnion = new HashSet<>(); in merge() local
240 setUnion.addAll(value1.insns); in merge()
241 setUnion.addAll(value2.insns); in merge()
242 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/analysis/
H A DSourceInterpreter.java229 Set<AbstractInsnNode> setUnion = in merge() local
232 if (setUnion == value1.insns && value1.size == value2.size) { in merge()
235 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
239 HashSet<AbstractInsnNode> setUnion = new HashSet<>(); in merge() local
240 setUnion.addAll(value1.insns); in merge()
241 setUnion.addAll(value2.insns); in merge()
242 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/analysis/
H A DSourceInterpreter.java229 Set<AbstractInsnNode> setUnion = in merge() local
232 if (setUnion == value1.insns && value1.size == value2.size) { in merge()
235 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
239 HashSet<AbstractInsnNode> setUnion = new HashSet<>(); in merge() local
240 setUnion.addAll(value1.insns); in merge()
241 setUnion.addAll(value2.insns); in merge()
242 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/analysis/
H A DSourceInterpreter.java228 Set<AbstractInsnNode> setUnion = in merge() local
231 if (setUnion == value1.insns && value1.size == value2.size) { in merge()
234 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
238 HashSet<AbstractInsnNode> setUnion = new HashSet<AbstractInsnNode>(); in merge() local
239 setUnion.addAll(value1.insns); in merge()
240 setUnion.addAll(value2.insns); in merge()
241 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/analysis/
H A DSourceInterpreter.java228 Set<AbstractInsnNode> setUnion = in merge() local
231 if (setUnion == value1.insns && value1.size == value2.size) { in merge()
234 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
238 HashSet<AbstractInsnNode> setUnion = new HashSet<AbstractInsnNode>(); in merge() local
239 setUnion.addAll(value1.insns); in merge()
240 setUnion.addAll(value2.insns); in merge()
241 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/analysis/
H A DSourceInterpreter.java228 Set<AbstractInsnNode> setUnion = in merge() local
231 if (setUnion == value1.insns && value1.size == value2.size) { in merge()
234 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
238 HashSet<AbstractInsnNode> setUnion = new HashSet<AbstractInsnNode>(); in merge() local
239 setUnion.addAll(value1.insns); in merge()
240 setUnion.addAll(value2.insns); in merge()
241 return new SourceValue(Math.min(value1.size, value2.size), setUnion); in merge()
/dports/audio/faust/faust-2.37.3/compiler/tlib/
H A Ddcond.cpp79 A.push_back(setUnion(h1,h2));
84 Tree ii = setUnion(t1,t2);
114 A.push_back(setUnion(h1, h2)); in cnfOr()
122 Tree ii = setUnion(A[i], A[j]); in cnfOr()
167 Tree ii = setUnion(A[i], B[j]); in cnfAnd()
211 A.push_back(setUnion(h1, h2)); in TRACE_dnfAnd()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
46 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
46 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
46 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
46 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
47 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
47 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
47 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
47 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
47 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/gdc.test/runnable/imports/
H A Dlink15194std.d20 TypeInfo setUnion(Rs...)(Rs ) in version()
47 SetUnion!(Rs) setUnion(Rs...)(Rs )
/dports/devel/llnextgen/LLnextgen-0.5.5/src/
H A DruleAnalysis.c406 changed |= setUnion(term->first, alternative->first); in termComputeFirstSet()
552 setUnion(currentFollow, grammarPart->uTerm.first); in alternativeComputeFollowSet()
563 setUnion(currentFollow, grammarPart->uTerm.first); in alternativeComputeFollowSet()
569 setUnion(currentFollow, grammarPart->uTerm.first); in alternativeComputeFollowSet()
902 setUnion(term->contains, alternative->contains); in termComputeContainsSet()
904 setUnion(term->contains, alternative->first); in termComputeContainsSet()
910 setUnion(term->contains, term->first); in termComputeContainsSet()
950 setUnion(alternative->contains, grammarPart->uTerm.contains); in alternativeComputeContainsSet()
1502 setUnion(alternative->first, term->follow); in termFixupFirst()
1509 setUnion(alternative->first, term->first); in termFixupFirst()
[all …]
/dports/math/vtk9/VTK-9.1.0/Utilities/Maintenance/
H A DVTKTestsByLanguage.py223 setUnion = c[key] | b[key]
225 setUnion = b[key]
226 if setUnion:
227 for fn in setUnion:
/dports/math/vtk8/VTK-8.2.0/Utilities/Maintenance/
H A DVTKTestsByLanguage.py223 setUnion = c[key] | b[key]
225 setUnion = b[key]
226 if setUnion:
227 for fn in setUnion:
/dports/lang/gcc12-devel/gcc-12-20211205/libsanitizer/sanitizer_common/
H A Dsanitizer_bitvector.h56 bool setUnion(const BasicBitVector &v) { in setUnion() function
197 bool setUnion(const TwoLevelBitVector &v) { in setUnion() function
205 if (l2_[i0][i1].setUnion(v.l2_[i0][i1])) in setUnion()
251 setUnion(v); in copyFrom()

12345678910>>...16