- Sort Score
- Num 10 results
- Language All
Results 241 - 245 of 245 for describe (0.16 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
src/main/webapp/js/admin/popper.min.js.map
@function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @argument {Number|String} options.offset=0\n * The offset value as described in the modifier description\n * @returns {Object} The data object, properly modified\n */\nexport default function offset(data, { offset }) {\n const { placement, offsets: { popper, reference } } = data;\n const basePlacement = placement.split('-')[0];\n\n...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 120.9K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
* the query result cursor will both be closed, even if the operation is cancelled or fails. * * <p>Note that if you don't call {@code closeAsync()}, the captured objects will not be closed. The * automatic-closing approach described above is safer. * * @param <V> the type of the value of this step * @since 30.0 */ // TODO(dpb): Consider reusing one CloseableList for the entire pipeline, modulo combinations.
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 101.7K bytes - Click Count (0) -
tensorflow/c/c_api.cc
"nodes after running them or create a new session."); } } } namespace { // Helper method that creates a shape handle for a shape described by dims. tensorflow::shape_inference::ShapeHandle ShapeHandleFromDims( tensorflow::shape_inference::InferenceContext* ic, int num_dims, const int64_t* dims) { if (num_dims != -1) {Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 04 05:55:32 GMT 2025 - 102.4K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
b.limbs[:n] switch n { default: // Attempt to use a stack-allocated backing array. T := make([]uint, 0, preallocLimbs*2) if cap(T) < n*2 { T = make([]uint, 0, n*2) } T = T[:n*2] // This loop implements Word-by-Word Montgomery Multiplication, as // described in Algorithm 4 (Fig. 3) of "Efficient Software // Implementations of Modular Exponentiation" by Shay Gueron // [https://eprint.iacr.org/2011/239.pdf]. var c uint for i := 0; i < n; i++ { _ = T[n+i] // bounds check elimination hint // Step 1 (T =...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
docs/en/docs/release-notes.md
* In `encoders.jsonable_encoder` remove parameter `sqlalchemy_safe`. * It was an early hack to allow returning SQLAlchemy models, but it was never documented, and the recommended way is using Pydantic's `orm_mode` as described in the tutorial: [SQL (Relational) Databases](https://fastapi.tiangolo.com/tutorial/sql-databases/). * PR [#1864](https://github.com/tiangolo/fastapi/pull/1864). ### DocsCreated: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0)