- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,431 for uniqueId (0.22 sec)
-
platforms/jvm/language-java/src/test/groovy/org/gradle/api/internal/tasks/compile/incremental/transaction/CompileTransactionTest.groovy
when: newCompileTransaction(classesToDelete, sourcesToDelete).execute { assert hasOnlyDirectories(destinationDir) assert stashDir.list() .collect { it.replaceAll(".uniqueId.*", "") } .sort() == ["another-file.txt", "file.txt", "some-ann-file.ann", "some-ann-file.class", "some-dest-file.class",
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Aug 28 11:40:18 UTC 2023 - 18K bytes - Viewed (0) -
pkg/ctrlz/assets/static/js/jquery-3.2.1.slim.min.js
odeType)return!1;o=p="only"===a&&!o&&"nextSibling"}return!0}if(o=[g?q.firstChild:q.lastChild],g&&s){m=q,l=m[u]||(m[u]={}),k=l[m.uniqueID]||(l[m.uniqueID]={}),j=k[a]||[],n=j[0]===w&&j[1],t=n&&j[2],m=n&&q.childNodes[n];while(m=++n&&m&&m[p]||(t=n=0)||o.pop())if(1===m.nodeType&&++t&&m===b){k[a]=[w,n,t];break}}else if(s&&(m=b,l=m[u]||(m[u]={}),k=l[m.uniqueID]||(l[m.uniqueID]={}),j=k[a]||[],n=j[0]===w&&j[1],t=n),t===!1)while(m=++n&&m&&m[p]||(t=n=0)||o.pop())if((h?m.nodeName.toLowerCase()===r:1===m.nod...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 23 17:08:31 UTC 2023 - 68K bytes - Viewed (0) -
platforms/software/publish/src/test/groovy/org/gradle/api/publish/internal/metadata/GradleModuleMetadataWriterTest.groovy
import org.gradle.api.publish.internal.versionmapping.VersionMappingStrategyInternal import org.gradle.internal.component.external.model.DefaultImmutableCapability import org.gradle.internal.id.UniqueId import org.gradle.internal.scopeids.id.BuildInvocationScopeId import org.gradle.test.fixtures.file.TestNameTestDirectoryProvider import org.gradle.util.GradleVersion import org.gradle.util.TestUtil import org.junit.Rule
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Dec 21 07:21:42 UTC 2023 - 36.9K bytes - Viewed (0) -
src/main/webapp/js/admin/jquery-3.6.3.min.js
return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&p){d=(s=(r=(i=(o=(a=c)[E]||(a[E]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if(1===a.nodeType&&++d&&a===e){i[h]=[k,s,d];break}}else if(p&&(d=s=(r=(i=(o=(a=e)[E]||(a[E]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1]),!1===d)while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if((x?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 17 12:13:41 UTC 2023 - 87.8K bytes - Viewed (0) -
src/main/webapp/js/jquery-3.6.3.min.js
return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&p){d=(s=(r=(i=(o=(a=c)[E]||(a[E]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if(1===a.nodeType&&++d&&a===e){i[h]=[k,s,d];break}}else if(p&&(d=s=(r=(i=(o=(a=e)[E]||(a[E]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1]),!1===d)while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if((x?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 17 12:13:41 UTC 2023 - 87.8K bytes - Viewed (0) -
cmd/erasure-object.go
if v, err := base64.StdEncoding.DecodeString(userDefined[ReplicationSsecChecksumHeader]); err == nil { fi.Checksum = v } } delete(userDefined, ReplicationSsecChecksumHeader) uniqueID := mustGetUUID() tempObj := uniqueID // Initialize erasure metadata. for index := range partsMetadata { partsMetadata[index] = fi } // Order disks according to erasure distribution
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 78.6K bytes - Viewed (0) -
doc/next/6-stdlib/2-unique.md
### New unique package The new [unique] package provides facilities for canonicalizing values (like "interning" or "hash-consing"). Any value of comparable type may be canonicalized with the new `Make[T]` function, which produces a reference to a canonical copy of the value in the form of a `Handle[T]`. Two `Handle[T]` are equal if and only if the values used to produce the handles are equal, allowing programs to deduplicate values and reduce
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 18:34:13 UTC 2024 - 566 bytes - Viewed (0) -
src/crypto/x509/x509.go
SerialNumber *big.Int SignatureAlgorithm pkix.AlgorithmIdentifier Issuer asn1.RawValue Validity validity Subject asn1.RawValue PublicKey publicKeyInfo UniqueId asn1.BitString `asn1:"optional,tag:1"` SubjectUniqueId asn1.BitString `asn1:"optional,tag:2"` Extensions []pkix.Extension `asn1:"omitempty,optional,explicit,tag:3"` }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 09:20:15 UTC 2024 - 82K bytes - Viewed (0) -
pkg/proxy/ipvs/graceful_termination.go
func (q *graceTerminateRSList) add(rs *listItem) bool { q.lock.Lock() defer q.lock.Unlock() uniqueRS := rs.String() if _, ok := q.list[uniqueRS]; ok { return false } klog.V(5).InfoS("Adding real server to graceful delete real server list", "realServer", rs) q.list[uniqueRS] = rs return true } // remove remove an element from the rsList
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Dec 19 01:20:51 UTC 2023 - 6.6K bytes - Viewed (0) -
schema/constraint.go
return "CONSTRAINT ? UNIQUE (?)", []interface{}{clause.Column{Name: uni.Name}, clause.Column{Name: uni.Field.DBName}} } // ParseUniqueConstraints parse schema unique constraints func (schema *Schema) ParseUniqueConstraints() map[string]UniqueConstraint { uniques := make(map[string]UniqueConstraint) for _, field := range schema.Fields { if field.Unique {
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Mon Mar 18 07:33:54 UTC 2024 - 1.9K bytes - Viewed (0)