- Sort Score
- Result 10 results
- Languages All
Results 1421 - 1430 of 1,602 for tive (0.07 sec)
-
src/main/java/org/codelibs/fess/es/log/cbean/cq/bs/BsFavoriteLogCQ.java
* either express or implied. See the License for the specific language * governing permissions and limitations under the License. */ package org.codelibs.fess.es.log.cbean.cq.bs; import java.time.LocalDateTime; import java.util.ArrayList; import java.util.Collection; import org.codelibs.fess.es.log.allcommon.EsAbstractConditionQuery; import org.codelibs.fess.es.log.cbean.cq.FavoriteLogCQ;
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 42.7K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Http2Connection.kt
private var degradedPongsReceived = 0L private var awaitPingsSent = 0L private var awaitPongsReceived = 0L /** Consider this connection to be unhealthy if a degraded pong isn't received by this time. */ private var degradedPongDeadlineNs = 0L internal val flowControlListener: FlowControlListener = builder.flowControlListener /** Settings we communicate to the peer. */ val okHttpSettings =
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sat Apr 20 17:03:43 UTC 2024 - 32.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ArrayTable.java
* * <p><b>Warning:</b> {@code ArrayTable} is rarely the {@link Table} implementation you want. First, * it requires that the complete universe of rows and columns be specified at construction time. * Second, it is always backed by an array large enough to hold a value for every possible * combination of row and column keys. (This is rarely optimal unless the table is extremely dense.)
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 26.3K bytes - Viewed (0) -
src/bytes/buffer_test.go
t.Errorf("after too-large Grow, recover() = %v; want %v", err, ErrTooLarge) } }() buf := NewBuffer(make([]byte, 1)) const maxInt = int(^uint(0) >> 1) buf.Grow(maxInt) } // Was a bug: used to give EOF reading empty slice at EOF. func TestReadEmptyAtEOF(t *testing.T) { b := new(Buffer) slice := make([]byte, 0) n, err := b.Read(slice) if err != nil { t.Errorf("read error: %v", err) }
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Sep 03 20:55:15 UTC 2024 - 18.6K bytes - Viewed (0) -
finisher_api.go
// value includes a deleted_at field, then Delete performs a soft delete instead by setting deleted_at with the current // time if null. func (db *DB) Delete(value interface{}, conds ...interface{}) (tx *DB) { tx = db.getInstance() if len(conds) > 0 { if exprs := tx.Statement.BuildCondition(conds[0], conds[1:]...); len(exprs) > 0 {
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Sat Sep 14 12:58:29 UTC 2024 - 22.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Ascii.java
@GwtCompatible @ElementTypesAreNonnullByDefault public final class Ascii { private Ascii() {} /* The ASCII control characters, per RFC 20. */ /** * Null ('\0'): The all-zeros character which may serve to accomplish time fill and media fill. * Normally used as a C string terminator. * * <p>Although RFC 20 names this as "Null", note that it is distinct from the C/C++ "NULL" * pointer. * * @since 8.0 */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 02 13:50:22 UTC 2024 - 21.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* distinct elements, and add the last element over again many times over. We don't want a * situation where we re-sort the entire buffer every time the last element is re-added. * * <p>The solution is to ensure there are O(n) spaces left over in the buffer after * sortAndDedup -- that is, at least c*n for some constant c > 0. Ensuring the buffer size
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 39.1K bytes - Viewed (0) -
cmd/data-usage-cache_gen.go
err = msgp.WrapError(err, "cycleCompleted") return } if cap(z.cycleCompleted) >= int(zb0002) { z.cycleCompleted = (z.cycleCompleted)[:zb0002] } else { z.cycleCompleted = make([]time.Time, zb0002) } for za0001 := range z.cycleCompleted { z.cycleCompleted[za0001], bts, err = msgp.ReadTimeBytes(bts) if err != nil { err = msgp.WrapError(err, "cycleCompleted", za0001) return
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 22 15:30:50 UTC 2024 - 75K bytes - Viewed (0) -
go.sum
golang.org/x/text v0.18.0/go.mod h1:BuEKDfySbSR4drPmRPG/7iBdf8hvFMuRexcpahXilzY= golang.org/x/time v0.0.0-20211116232009-f0f3c7e86c11/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ= golang.org/x/time v0.6.0 h1:eTDhh4ZXt5Qf0augr54TN6suAUudPcawVZeIAPU7D4U= golang.org/x/time v0.6.0/go.mod h1:3BpzKBy/shNhVucY/MWOyx10tF3SFh9QdLuxbVysPQM=
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 22 15:30:50 UTC 2024 - 78K bytes - Viewed (0) -
docs/ko/docs/index.md
--- "_**FastAPI**가 너무 좋아서 구름 위를 걷는듯 합니다. 정말 즐겁습니다!_" <div style="text-align: right; margin-right: 10%;">Brian Okken - <strong><a href="https://pythonbytes.fm/episodes/show/123/time-to-right-the-py-wrongs?time_in_sec=855" target="_blank">Python Bytes</a> 팟캐스트 호스트</strong> <a href="https://twitter.com/brianokken/status/1112220079972728832" target="_blank"><small>(ref)</small></a></div> ---
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Fri Aug 16 16:50:01 UTC 2024 - 19.4K bytes - Viewed (0)