- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for longText (0.22 sec)
-
tests/migrate_test.go
Def string `gorm:"size:512;index:idx_def,unique"` Abc string `gorm:"size:65000000"` } DB.Migrator().DropTable("my_tables") sql := "CREATE TABLE `my_tables` (`def` varchar(512),`abc` longtext,UNIQUE INDEX `idx_def` (`def`))" if err := DB.Exec(sql).Error; err != nil { t.Errorf("Failed, got error: %v", err) } session := DB.Session(&gorm.Session{Logger: Tracer{ Logger: DB.Config.Logger,
Go - Registered: Sun Mar 24 09:35:10 GMT 2024 - Last Modified: Mon Mar 18 11:24:16 GMT 2024 - 56.2K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/-HostnamesCommon.kt
return b == addressOffset + 4 } /** Encodes an IPv6 address in canonical form according to RFC 5952. */ internal fun inet6AddressToAscii(address: ByteArray): String { // Go through the address looking for the longest run of 0s. Each group is 2-bytes. // A run must be longer than one group (section 4.2.2). // If there are multiple equal runs, the first one must be used (section 4.2.3). var longestRunOffset = -1
Plain Text - Registered: Fri Mar 22 11:42:09 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Strings.java
for (n = len; n < size - n; n <<= 1) { System.arraycopy(array, 0, array, n, n); } System.arraycopy(array, 0, array, n, size - n); return new String(array); } /** * Returns the longest string {@code prefix} such that {@code a.toString().startsWith(prefix) && * b.toString().startsWith(prefix)}, taking care not to split surrogate pairs. If {@code a} and * {@code b} have no common prefix, returns the empty string.
Java - Registered: Fri Mar 22 12:43:11 GMT 2024 - Last Modified: Fri Apr 09 00:49:18 GMT 2021 - 12.3K bytes - Viewed (0) -
cni/pkg/repair/netns.go
// We want the pause container, as the istio-validation one may exit before we are done. // We do this by detecting the longest running process. We could look at `cmdline`, but is likely more reliable to weird platforms. for _, p := range procs { ns := getPidNamespace(p.PID) fd, err := unix.Open(ns, unix.O_RDONLY, 0) if err != nil {
Go - Registered: Wed Mar 27 22:53:09 GMT 2024 - Last Modified: Wed Dec 20 22:14:13 GMT 2023 - 4.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
} } if (connections.isEmpty()) cleanupQueue.cancelAll() } /** * Performs maintenance on this pool, evicting the connection that has been idle the longest if * either it has exceeded the keep alive limit or the idle connections limit. * * Returns the duration in nanoseconds to sleep until the next scheduled call to this method.
Plain Text - Registered: Fri Mar 22 11:42:09 GMT 2024 - Last Modified: Wed Mar 06 17:33:38 GMT 2024 - 9.9K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/Dfs.java
Java - Registered: Sun Mar 24 00:10:09 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 11.7K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
// Start by looking for exact matches. We start at the leftmost label. For example, foo.bar.com // will look like: [foo, bar, com], [bar, com], [com]. The longest matching rule wins. var exactMatch: String? = null for (i in domainLabelsUtf8Bytes.indices) { val rule = publicSuffixListBytes.binarySearch(domainLabelsUtf8Bytes, i) if (rule != null) {
Plain Text - Registered: Fri Mar 22 11:42:09 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 11.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
/** * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders * elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue.
Java - Registered: Fri Mar 22 12:43:11 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
src/main/java/jcifs/smb/DfsImpl.java
log.trace("No match for domain based root, checking standalone " + domain); } /* * We did not match a domain based root. Now try to match the * longest path in the list of stand-alone referrals. */ CacheEntry<DfsReferralDataInternal> refs; synchronized ( this.referralsLock ) { refs = this.referrals;
Java - Registered: Sun Mar 24 00:10:09 GMT 2024 - Last Modified: Thu Jan 05 13:07:29 GMT 2023 - 29.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
/** * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders * elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue.
Java - Registered: Fri Mar 22 12:43:11 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0)