Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 73 for godina (0.04 sec)

  1. src/main/resources/fess_indices/fess/sv/stopwords.txt

    dessa
    några
    deras
    blir
    mina
    samma
    vilken
    er
    sådan
    vår
    blivit
    dess
    inom
    mellan
    sådant
    varför
    varje
    vilka
    ditt
    vem
    vilket
    sitta
    sådana
    vart
    dina
    vars
    vårt
    våra
    ert
    era
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Mon Nov 27 12:59:36 UTC 2023
    - 700 bytes
    - Viewed (0)
  2. src/main/resources/fess_label_it.properties

    labels.purgeByBots=Elimina per Bot
    labels.logLevel=Livello di log
    labels.purgeSearchLogDay=Elimina log di ricerca
    labels.query=Query
    labels.queryId=ID query
    labels.rt=rt
    labels.searchLog=Log di ricerca
    labels.sort=Ordina
    labels.start=Posizione iniziale
    labels.loginRequired=Login richiesto
    labels.loginLink=Mostra link di login
    labels.threadName=Nome thread
    labels.url=URL
    labels.userFavorite=Log preferiti
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 10 04:56:21 UTC 2025
    - 43.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/net/MediaType.java

       *
       * @since 20.0
       */
      public static final MediaType BASIC_AUDIO = createConstant(AUDIO_TYPE, "basic");
    
      /**
       * Advanced Audio Coding. For more information, see <a
       * href="https://en.wikipedia.org/wiki/Advanced_Audio_Coding">Advanced Audio Coding</a>.
       *
       * @since 20.0
       */
      public static final MediaType AAC_AUDIO = createConstant(AUDIO_TYPE, "aac");
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 48K bytes
    - Viewed (0)
  4. guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java

     * http://creativecommons.org/publicdomain/zero/1.0/
     */
    
    /*
     * Source:
     * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/jsr166e/extra/AtomicDoubleArray.java?revision=1.5
     * (Modified to adapt to guava coding conventions and
     * to use AtomicLongArray instead of sun.misc.Unsafe)
     */
    
    package com.google.common.util.concurrent;
    
    import static com.google.common.base.Preconditions.checkNotNull;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 10.2K bytes
    - Viewed (0)
  5. guava/src/com/google/common/util/concurrent/AtomicDouble.java

     * http://creativecommons.org/publicdomain/zero/1.0/
     */
    
    /*
     * Source:
     * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/jsr166e/extra/AtomicDouble.java?revision=1.13
     * (Modified to adapt to guava coding conventions and
     * to use AtomicLongFieldUpdater instead of sun.misc.Unsafe)
     */
    
    package com.google.common.util.concurrent;
    
    import static com.google.common.base.Preconditions.checkNotNull;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 9.5K bytes
    - Viewed (0)
  6. README.md

    ### Development Workflow
    1. **Fork** the repository on GitHub
    2. **Create** your feature branch: `git checkout -b feature/amazing-feature`
    3. **Follow** the coding standards: `mvn formatter:format`
    4. **Add** comprehensive tests for new functionality
    5. **Commit** your changes: `git commit -m 'Add amazing feature'`
    6. **Push** to the branch: `git push origin feature/amazing-feature`
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Sun Aug 31 02:56:02 UTC 2025
    - 12.7K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java

     * domain. The author hereby disclaims copyright to this source code.
     */
    
    /*
     * Source:
     * http://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp
     * (Modified to adapt to Guava coding conventions and to use the HashFunction interface)
     */
    
    package com.google.common.hash;
    
    import static com.google.common.base.Preconditions.checkPositionIndexes;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 11.8K bytes
    - Viewed (0)
  8. okhttp/src/jvmTest/kotlin/okhttp3/DuplexTest.kt

        assumeNotWindows()
        enableProtocol(Protocol.HTTP_2)
        val body =
          MockSocketHandler()
            .exhaustResponse()
            .receiveRequest("hey\n")
            .receiveRequest("whats going on\n")
            .exhaustRequest()
        server.enqueue(
          MockResponse
            .Builder()
            .clearHeaders()
            .addHeader("h1", "v1")
            .addHeader("h2", "v2")
            .socketHandler(body)
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Jun 18 12:28:21 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  9. guava/src/com/google/common/util/concurrent/ExecutionList.java

      private static void executeListener(Runnable runnable, Executor executor) {
        try {
          executor.execute(runnable);
        } catch (Exception e) { // sneaky checked exception
          // Log it and keep going -- bad runnable and/or executor. Don't punish the other runnables if
          // we're given a bad one. We only catch Exception because we want Errors to propagate up.
          log.get()
              .log(
                  Level.SEVERE,
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/graph/Graphs.java

       * is always detected before reusing an edge, so no special logic is required. In the undirected
       * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going
       * from B to A).
       */
      private static boolean canTraverseWithoutReusingEdge(
          Graph<?> graph, Object nextNode, @Nullable Object previousNode) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
Back to top