Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 52 for MaxLen (0.27 sec)

  2. github.com/golang/go

    src/cmd/vendor/golang.org/x/text/internal/language/lookup.go 

    		[maxLen]byte{'i', '-', 'b', 'n', 'n'}:                          _bnn, // i-bnn
		[maxLen]byte{'i', '-', 'h', 'a', 'k'}:                          _hak, // i-hak
		[maxLen]byte{'i', '-', 'k', 'l', 'i', 'n', 'g', 'o', 'n'}:      _tlh, // i-klingon
		[maxLen]byte{'i', '-', 'l', 'u', 'x'}:                          _lb,  // i-lux
		[maxLen]byte{'i', '-', 'n', 'a', 'v', 'a', 'j', 'o'}:           _nv,  // i-navajo
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jan 24 13:01:26 UTC 2024
    - 12.1K bytes
    - Viewed (0)
  3. github.com/codelibs/jcifs

    src/main/java/jcifs/util/Strings.java 

         * @param bufferIndex
     * @param maxLen
     * @return position of terminating null bytes
     */
    public static int findUNITermination ( byte[] buffer, int bufferIndex, int maxLen ) {
        int len = 0;
        while ( buffer[ bufferIndex + len ] != (byte) 0x00 || buffer[ bufferIndex + len + 1 ] != (byte) 0x00 ) {
            len += 2;
            if ( len > maxLen ) {
                if ( log.isDebugEnabled() ) {
    Registered: Wed Jun 12 15:45:55 UTC 2024
    - Last Modified: Mon Mar 13 12:00:57 UTC 2023
    - 4.9K bytes
    - Viewed (0)
  4. github.com/golang/go

    src/internal/bytealg/index_native.go 

    package bytealg

// Index returns the index of the first instance of b in a, or -1 if b is not present in a.
// Requires 2 <= len(b) <= MaxLen.
//
//go:noescape
func Index(a, b []byte) int

// IndexString returns the index of the first instance of b in a, or -1 if b is not present in a.
// Requires 2 <= len(b) <= MaxLen.
//
//go:noescape
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 02 22:56:35 UTC 2023
    - 590 bytes
    - Viewed (0)
  5. github.com/golang/go

    src/internal/bytealg/bytealg.go 

    	offsetS390xHasVX = unsafe.Offsetof(cpu.S390X.HasVX)

	offsetPPC64HasPOWER9 = unsafe.Offsetof(cpu.PPC64.IsPOWER9)
)

// MaxLen is the maximum length of the string to be searched for (argument b) in Index.
// If MaxLen is not 0, make sure MaxLen >= 4.
var MaxLen int

// PrimeRK is the prime base used in Rabin-Karp algorithm.
const PrimeRK = 16777619

// HashStr returns the hash and the appropriate multiplicative
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 19 19:51:15 UTC 2024
    - 3.1K bytes
    - Viewed (0)
  6. github.com/codelibs/jcifs

    src/main/java/jcifs/smb1/http/NetworkExplorer.java 

                            break;
                    }
                }
            }
            sorted.add( j, dirents[i] );
        }
        if( maxLen > 50 ) {
            maxLen = 50;
        }
        maxLen *= 9; /* convert to px */

        out = resp.getWriter();

        resp.setContentType( "text/html" );
    Registered: Wed Jun 12 15:45:55 UTC 2024
    - Last Modified: Wed Jan 22 03:57:31 UTC 2020
    - 19.7K bytes
    - Viewed (0)
  7. github.com/golang/go

    src/internal/bytealg/index_generic.go 

    // Index returns the index of the first instance of b in a, or -1 if b is not present in a.
// Requires 2 <= len(b) <= MaxLen.
func Index(a, b []byte) int {
	panic("unimplemented")
}

// IndexString returns the index of the first instance of b in a, or -1 if b is not present in a.
// Requires 2 <= len(b) <= MaxLen.
func IndexString(a, b string) int {
	panic("unimplemented")
}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 28 18:17:57 UTC 2021
    - 901 bytes
    - Viewed (0)
  8. github.com/codelibs/jcifs

    src/test/java/jcifs/tests/NamingTest.java 

    
    private static String[] splitString ( String str, int maxLen ) {
        int num = str.length() / maxLen;
        if ( str.length() % maxLen != 0 ) {
            num++;
        }
        String strings[] = new String[num];
        for ( int i = 0; i < num; i++ ) {
            strings[ i ] = str.substring(i * maxLen, Math.min(str.length() - 1, ( i + 1 ) * maxLen));
        }
        return strings;
    }
    Registered: Wed Jun 12 15:45:55 UTC 2024
    - Last Modified: Sat Jun 06 10:48:05 UTC 2020
    - 7K bytes
    - Viewed (0)
  9. github.com/codelibs/jcifs

    src/main/java/jcifs/smb1/smb1/ServerMessageBlock.java 

                                                src[srcIndex + len + 1] != (byte)0x00 ) {
                    len += 2;
                    if( len > maxLen ) {
if( log.level > 0 )
Hexdump.hexdump( System.err, src, srcIndex, maxLen < 128 ? maxLen + 8 : 128 );
                        throw new RuntimeException( "zero termination not found" );
                    }
                }
    Registered: Wed Jun 12 15:45:55 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 21K bytes
    - Viewed (0)
  10. github.com/golang/go

    src/vendor/golang.org/x/net/http2/hpack/huffman.go 

    // Huffman-encoded strings.
var ErrInvalidHuffman = errors.New("hpack: invalid Huffman-encoded data")

// huffmanDecode decodes v to buf.
// If maxLen is greater than 0, attempts to write more to buf than
// maxLen bytes will return ErrStringLength.
func huffmanDecode(buf *bytes.Buffer, maxLen int, v []byte) error {
	rootHuffmanNode := getRootHuffmanNode()
	n := rootHuffmanNode
	// cur is the bit buffer that has not been fed into n.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Aug 05 19:54:32 UTC 2022
    - 5.8K bytes
    - Viewed (0)
  11. github.com/codelibs/jcifs

    src/main/java/jcifs/http/NetworkExplorer.java 

                            break;
                    }
                }
            }
            sorted.add(j, dirents[ i ]);
        }
        if ( maxLen > 50 ) {
            maxLen = 50;
        }
        maxLen *= 9; /* convert to px */

        resp.setContentType("text/html");

        out.println("<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\">");
    Registered: Wed Jun 12 15:45:55 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 21.3K bytes
    - Viewed (0)
Back to top