Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 311 - 320 of 366 for seal (0.04 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. api/go1.2.txt

    pkg crypto/cipher, type AEAD interface { NonceSize, Open, Overhead, Seal }
    pkg crypto/cipher, type AEAD interface, NonceSize() int
    pkg crypto/cipher, type AEAD interface, Open([]uint8, []uint8, []uint8, []uint8) ([]uint8, error)
    pkg crypto/cipher, type AEAD interface, Overhead() int
    pkg crypto/cipher, type AEAD interface, Seal([]uint8, []uint8, []uint8, []uint8) []uint8
    pkg crypto/md5, func Sum([]uint8) [16]uint8
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Oct 18 04:36:59 GMT 2013
    - 1.9M bytes
    - Click Count (1)
  2. docs/pt/docs/deployment/concepts.md

    Mostrarei alguns exemplos concretos nos próximos capítulos.
    
    ---
    
    Os próximos conceitos a serem considerados são todos sobre o programa que executa sua API real (por exemplo, Uvicorn).
    
    ## Programa e Processo { #program-and-process }
    
    Falaremos muito sobre o "**processo**" em execução, então é útil ter clareza sobre o que ele significa e qual é a diferença com a palavra "**programa**".
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Nov 12 16:23:57 GMT 2025
    - 20.5K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/primitives/ShortsTest.java

        assertThat(newArray).isEqualTo(new short[] {(short) 0, (short) 1, (short) 2});
        newArray[1] = (short) 5;
        assertThat((short) list.get(1)).isEqualTo((short) 1);
      }
    
      // This test stems from a real bug found by andrewk
      public void testAsList_subList_toArray_roundTrip() {
        short[] array = {(short) 0, (short) 1, (short) 2, (short) 3};
        List<Short> list = Shorts.asList(array);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:45:32 GMT 2025
    - 27.5K bytes
    - Click Count (0)
  4. src/main/java/jcifs/smb1/netbios/NbtAddress.java

                        }
                        return null;
                    }
                    if (isDataFromNodeStatus) {
                        /* 'this' has been updated and should now
                         * have a real NetBIOS name
                         */
                        calledName = null;
                        return hostName.name;
                    }
                } catch (final UnknownHostException uhe) {
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 31.7K bytes
    - Click Count (0)
  5. impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/LookupInvoker.java

                            + "The --fail-on-severity flag will not take effect.");
                }
            }
    
            // at this point logging is set up, reply so far accumulated logs, if any and swap logger with real one
            Logger logger =
                    new Slf4jLogger(context.loggerFactory.getLogger(getClass().getName()));
            context.logger.drain().forEach(e -> logger.log(e.level(), e.message(), e.error()));
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Tue Oct 28 13:01:07 GMT 2025
    - 43.2K bytes
    - Click Count (0)
  6. docs/en/docs/async.md

    Then the cashier 💁 says "I'm finished with doing the burgers" by putting your number on the counter's display, but you don't jump like crazy immediately when the displayed number changes to your turn number. You know no one will steal your burgers because you have the number of your turn, and they have theirs.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:56:21 GMT 2025
    - 24K bytes
    - Click Count (0)
  7. src/archive/tar/reader.go

    		// no action. Thus, we try an innocent seek to the current position
    		// to see if Seek is really supported.
    		pos1, err := sr.Seek(0, io.SeekCurrent)
    		if pos1 >= 0 && err == nil {
    			// Seek seems supported, so perform the real Seek.
    			pos2, err := sr.Seek(n-1, io.SeekCurrent)
    			if pos2 < 0 || err != nil {
    				return err
    			}
    			seekSkipped = pos2 - pos1
    		}
    	}
    
    	copySkipped, err := io.CopyN(io.Discard, r, n-seekSkipped)
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Oct 07 19:46:36 GMT 2025
    - 26.9K bytes
    - Click Count (0)
  8. okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat

    scot
    
    // search : Charleston Road Registry Inc.
    // https://www.iana.org/domains/root/db/search.html
    search
    
    // seat : SEAT, S.A. (Sociedad Unipersonal)
    // https://www.iana.org/domains/root/db/seat.html
    seat
    
    // secure : Amazon Registry Services, Inc.
    // https://www.iana.org/domains/root/db/secure.html
    secure
    
    // security : XYZ.COM LLC
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Fri Dec 27 13:39:56 GMT 2024
    - 309.7K bytes
    - Click Count (1)
  9. android/guava/src/com/google/common/collect/Sets.java

          // It's a weird formula, but tests prove it works.
          int adjust = size() - 1;
          for (int i = 0; i < axes.size(); i++) {
            adjust *= 31;
            adjust = ~~adjust;
            // in GWT, we have to deal with integer overflow carefully
          }
          int hash = 1;
          for (Set<E> axis : axes) {
            hash = 31 * hash + (size() / axis.size() * axis.hashCode());
    
            hash = ~~hash;
          }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 81.6K bytes
    - Click Count (0)
  10. docs/es/docs/alternatives.md

    Otra gran funcionalidad necesaria por las APIs es la validación de datos, asegurarse de que los datos sean válidos, dados ciertos parámetros. Por ejemplo, que algún campo sea un `int`, y no algún string aleatorio. Esto es especialmente útil para los datos entrantes.
    
    Sin un sistema de validación de datos, tendrías que hacer todas las comprobaciones a mano, en código.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 10:15:01 GMT 2025
    - 25.9K bytes
    - Click Count (0)
Back to Top