Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 500 for blockId (0.07 sec)

  1. build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/AssembleDslDocTask.groovy

            } else if (title.matches('(?i).* blocks')) {
                mergeBlocks(typeTable, model)
            } else {
                return
            }
    
            typeTable['@role'] = 'dslTypes'
        }
    
        def mergeBlocks(Element blocksTable, DslDocModel model) {
            blocksTable.addFirst {
                thead {
                    tr {
                        td('Block')
                        td('Description')
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Wed Dec 09 08:14:05 UTC 2020
    - 9.8K bytes
    - Viewed (0)
  2. okhttp/src/main/kotlin/okhttp3/internal/http2/Http2Connection.kt

       * window sufficient to send [byteCount], the caller will block. For example, a user of
       * `HttpURLConnection` who flushes more bytes to the output stream than the connection's write
       * window will block.
       *
       * Zero [byteCount] writes are not subject to flow control and will not block. The only use case
       * for zero [byteCount] is closing a flushed output stream.
       */
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sat Apr 20 17:03:43 UTC 2024
    - 32.6K bytes
    - Viewed (0)
  3. doc/go_spec.html

    </p>
    
    <h2 id="Blocks">Blocks</h2>
    
    <p>
    A <i>block</i> is a possibly empty sequence of declarations and statements
    within matching brace brackets.
    </p>
    
    <pre class="ebnf">
    Block = "{" StatementList "}" .
    StatementList = { Statement ";" } .
    </pre>
    
    <p>
    In addition to explicit blocks in the source code, there are implicit blocks:
    </p>
    
    <ol>
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Oct 02 00:58:01 UTC 2024
    - 282.5K bytes
    - Viewed (0)
  4. internal/grid/README.md

    Returning any error will also cancel the stream remotely.
    
    CAREFUL: When utilizing two-way communication, it is important to ensure that the remote handler is not blocked on a send.
    If the remote handler is blocked on a send, and the client is trying to send without the remote receiving, 
    the operation would become deadlocked if the channels are full.
    
    ### Typed handlers
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 9.4K bytes
    - Viewed (0)
  5. cmd/erasure-encode.go

    // Write writes data to writers.
    func (p *multiWriter) Write(ctx context.Context, blocks [][]byte) error {
    	for i := range p.writers {
    		if p.errs[i] != nil {
    			continue
    		}
    		if p.writers[i] == nil {
    			p.errs[i] = errDiskNotFound
    			continue
    		}
    		var n int
    		n, p.errs[i] = p.writers[i].Write(blocks[i])
    		if p.errs[i] == nil {
    			if n != len(blocks[i]) {
    				p.errs[i] = io.ErrShortWrite
    				p.writers[i] = nil
    			}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed May 15 00:11:04 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  6. docs/de/docs/tutorial/dependencies/dependencies-with-yield.md

    **FastAPI** verwendet sie intern, um das zu erreichen.
    
    ///
    
    ## Abhängigkeiten mit `yield` und `HTTPException`.
    
    Sie haben gesehen, dass Ihre Abhängigkeiten `yield` verwenden können und `try`-Blöcke haben können, die Exceptions abfangen.
    
    Auf die gleiche Weise könnten Sie im Exit-Code nach dem `yield` eine `HTTPException` oder ähnliches auslösen.
    
    /// tip | "Tipp"
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 13.4K bytes
    - Viewed (0)
  7. src/main/java/jcifs/smb1/smb1/NtStatus.java

            "The user must change his password before he logs on the first time.",
            "NT_STATUS_NOT_FOUND",
            "The referenced account is currently locked out and may not be logged on to.",
            "The remote system is not reachable by the transport.",
            "NT_STATUS_IO_REPARSE_TAG_NOT_HANDLED",
        };
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 11.1K bytes
    - Viewed (0)
  8. internal/lock/lock_windows.go

    	}
    
    	err := lockFileEx(fd, flags, 1, 0, &syscall.Overlapped{})
    	if err == nil || err == errLockViolation {
    		return nil
    	}
    	if err.Error() == "The process cannot access the file because another process has locked a portion of the file." {
    		return ErrAlreadyLocked
    	}
    	return err
    }
    
    func lockFileEx(h syscall.Handle, flags, locklow, lockhigh uint32, ol *syscall.Overlapped) (err error) {
    	reserved := uint32(0)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Oct 18 18:08:15 UTC 2023
    - 7.9K bytes
    - Viewed (0)
  9. docs/erasure/README.md

    a mathematical algorithm to reconstruct missing or corrupted data. MinIO uses Reed-Solomon code to shard objects into variable data and parity blocks. For example, in a 12 drive setup, an object can be sharded to a variable number of data and parity blocks across all the drives - ranging from six data and six parity blocks to ten data and two parity blocks.
    
    By default, MinIO shards the objects across N/2 data and N/2 parity drives. Though, you can use [storage classes](https://github.com/m...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 4.1K bytes
    - Viewed (0)
  10. src/main/java/jcifs/smb1/util/Base64.java

            length -= remainder;
            int block;
            int i = 0;
            while (i < length) {
                block = ((bytes[i++] & 0xff) << 16) | ((bytes[i++] & 0xff) << 8) |
                        (bytes[i++] & 0xff);
                buffer.append(ALPHABET.charAt(block >>> 18));
                buffer.append(ALPHABET.charAt((block >>> 12) & 0x3f));
                buffer.append(ALPHABET.charAt((block >>> 6) & 0x3f));
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 20:39:42 UTC 2019
    - 3.7K bytes
    - Viewed (0)
Back to top