Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 31 - 37 of 37 for adjacent (0.2 seconds)

  1. src/archive/tar/common.go

    // If the input is sparseHoles, then it will output sparseDatas and vice-versa.
    // The input must have been already validated.
    //
    // This function mutates src and returns a normalized map where:
    //   - adjacent fragments are coalesced together
    //   - only the last fragment may be empty
    //   - the endOffset of the last fragment is the total size
    func invertSparseEntries(src []sparseEntry, size int64) []sparseEntry {
    	dst := src[:0]
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Oct 07 19:46:36 GMT 2025
    - 24.5K bytes
    - Click Count (0)
  2. src/main/java/org/codelibs/fess/llm/AbstractLlmClient.java

            if (history.isEmpty()) {
                return;
            }
    
            // Build turn list: group adjacent user-assistant pairs as turns, standalone messages as single-message turns
            final List<int[]> turns = new ArrayList<>();
            int idx = 0;
            while (idx < history.size()) {
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 21 06:04:58 GMT 2026
    - 72K bytes
    - Click Count (0)
  3. compat/maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java

     * under the License.
     */
    package org.apache.maven.repository;
    
    import java.util.ArrayList;
    import java.util.List;
    
    /**
     * MetadataGraph node - as it's a directed graph - holds adjacency lists for incident and exident nodes
     *
     *
     */
    @Deprecated
    public class MetadataGraphNode {
        /** node payload */
        MavenArtifactMetadata metadata;
    
        /** nodes, incident to this (depend on me) */
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 2.4K bytes
    - Click Count (0)
  4. docs/fr/docs/tutorial/request-files.md

    `UploadFile` a les méthodes `async` suivantes. Elles appellent toutes les méthodes correspondantes du fichier sous-jacent (en utilisant le `SpooledTemporaryFile` interne).
    
    - `write(data)` : écrit `data` (`str` ou `bytes`) dans le fichier.
    - `read(size)` : lit `size` (`int`) octets/caractères du fichier.
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 8.2K bytes
    - Click Count (0)
  5. lib/fips140/v1.26.0.zip

    fiatScalarNonzero(&nonzero, (*[4]uint64)(&diff)) nonzero |= nonzero >> 32 nonzero |= nonzero >> 16 nonzero |= nonzero >> 8 nonzero |= nonzero >> 4 nonzero |= nonzero >> 2 nonzero |= nonzero >> 1 return int(^nonzero) & 1 } // nonAdjacentForm computes a width-w non-adjacent form for this scalar. // // w must be between 2 and 8, or nonAdjacentForm will panic. func (s *Scalar) nonAdjacentForm(w uint) [256]int8 { // This implementation is adapted from the one // in curve25519-dalek and is documented there: // https://...
    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)
  6. lib/fips140/v1.0.0-c2097c7c.zip

    fiatScalarNonzero(&nonzero, (*[4]uint64)(&diff)) nonzero |= nonzero >> 32 nonzero |= nonzero >> 16 nonzero |= nonzero >> 8 nonzero |= nonzero >> 4 nonzero |= nonzero >> 2 nonzero |= nonzero >> 1 return int(^nonzero) & 1 } // nonAdjacentForm computes a width-w non-adjacent form for this scalar. // // w must be between 2 and 8, or nonAdjacentForm will panic. func (s *Scalar) nonAdjacentForm(w uint) [256]int8 { // This implementation is adapted from the one // in curve25519-dalek and is documented there: // https://...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  7. docs/fr/docs/help-fastapi.md

    ### Suggérer des solutions { #suggest-solutions }
    
    * Après avoir compris la question, vous pouvez leur donner une **réponse** possible.
    
    * Dans de nombreux cas, il est préférable de comprendre leur **problème sous‑jacent ou cas d'utilisation**, car il pourrait exister une meilleure façon de le résoudre que ce qu'ils essaient de faire.
    
    ### Demander la clôture { #ask-to-close }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 14.6K bytes
    - Click Count (0)
Back to Top