Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 16 for meves (0.02 sec)

  1. src/main/resources/fess_indices/_aws/fess.json

    "quelcom", "qui", "quin", "quina", "quines", "quins", "s'ha", "s'han", "sa", "semblant", "semblants", "ses", "seu ", "seus", "seva", "seva", "seves", "si", "sobre", "sobretot", "sóc", "solament", "sols", "son ", "són", "sons ", "sota", "sou", "t'ha", "t'han", "t'he", "ta", "tal", "també", "tampoc", "tan", "tant", "tanta", "tantes", "teu", "teus", "teva", "teves", "ton", "tons", "tot", "tota", "totes", "tots", "un", "una", "unes", "uns", "us", "va", "vaig", "vam", "van", "vas", "veu", "vosaltres", "vostra",...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Jun 14 00:36:40 UTC 2025
    - 117.3K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/core/sql/ResultSetUtil.java

            }
            try {
                resultSet.close();
            } catch (final SQLException e) {
                logger.log(format("ECL0017", e.getMessage()), e);
            }
        }
    
        /**
         * Moves the result set to the next position.
         *
         * @param resultSet
         *            The result set. Must not be {@literal null}.
         * @return Whether the result set successfully moved to the next position.
         */
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Thu Jul 31 08:16:49 UTC 2025
    - 2.9K bytes
    - Viewed (0)
  3. cmd/net_test.go

    		}
    	}
    }
    
    func TestSortIPs(t *testing.T) {
    	testCases := []struct {
    		ipList       []string
    		sortedIPList []string
    	}{
    		// Default case of two ips one with higher octet moves
    		// to the beginning of the list.
    		{
    			ipList:       []string{"127.0.0.1", "10.0.0.13"},
    			sortedIPList: []string{"10.0.0.13", "127.0.0.1"},
    		},
    		// With multiple types of octet, chooses a higher octet.
    		{
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 9.2K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/app/web/search/SearchAction.java

                }
                saveError(messages -> {
                    messages.addErrorsResultSizeExceeded(GLOBAL);
                });
                return redirectToRoot();
            }
        }
    
        /**
         * Moves to a specific page.
         * @param form The search form.
         * @param move The number of pages to move.
         * @return The HTML response.
         */
        protected HtmlResponse doMove(final SearchForm form, final int move) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 14K bytes
    - Viewed (0)
  5. src/main/resources/fess_label_pt_BR.properties

    labels.facet_timestamp_1day=Últimas 24 horas
    labels.facet_timestamp_1week=Última semana
    labels.facet_timestamp_1month=Último mês
    labels.facet_timestamp_1year=Último ano
    labels.facet_timestamp_3month=Últimos 3 meses
    labels.facet_timestamp_6month=Últimos 6 meses
    labels.facet_timestamp_2year=Últimos 2 anos
    labels.facet_timestamp_3year=Últimos 3 anos
    labels.facet_contentLength_title=Tamanho
    labels.facet_contentLength_10k=  - 10KB
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 10 04:56:21 UTC 2025
    - 45.1K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/CompactHashSet.java

        if (index == -1) {
          return false;
        }
    
        moveLastEntry(index, mask);
        size--;
        incrementModCount();
    
        return true;
      }
    
      /**
       * Moves the last entry in the entry array into {@code dstIndex}, and nulls out its old position.
       */
      void moveLastEntry(int dstIndex, int mask) {
        Object table = requireTable();
        int[] entries = requireEntries();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 23.9K bytes
    - Viewed (0)
  7. src/main/resources/fess_label_es.properties

    labels.facet_timestamp_1day=Últimas 24 horas
    labels.facet_timestamp_1week=Última semana
    labels.facet_timestamp_1month=Último mes
    labels.facet_timestamp_1year=Último año
    labels.facet_timestamp_3month=Últimos 3 meses
    labels.facet_timestamp_6month=Últimos 6 meses
    labels.facet_timestamp_2year=Últimos 2 años
    labels.facet_timestamp_3year=Últimos 3 años
    labels.facet_contentLength_title=Tamaño
    labels.facet_contentLength_10k=  - 10KB
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 10 04:56:21 UTC 2025
    - 45.4K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/HashBiMap.java

      void removeEntryValueHashKnown(int entry, int valueHash) {
        removeEntry(entry, Hashing.smearedHash(keys[entry]), valueHash);
      }
    
      /**
       * Moves the entry previously positioned at {@code src} to {@code dest}. Assumes the entry
       * previously at {@code src} has already been removed from the data structures.
       */
      private void moveEntryToIndex(int src, int dest) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 36.2K bytes
    - Viewed (0)
  9. guava/src/com/google/common/collect/CompactHashMap.java

          return NOT_FOUND;
        }
    
        Object oldValue = value(index);
    
        moveLastEntry(index, mask);
        size--;
        incrementModCount();
    
        return oldValue;
      }
    
      /**
       * Moves the last entry in the entry array into {@code dstIndex}, and nulls out its old position.
       */
      void moveLastEntry(int dstIndex, int mask) {
        Object table = requireTable();
        int[] entries = requireEntries();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 39.6K bytes
    - Viewed (0)
  10. docs/fr/docs/async.md

    * L'apprentissage profond (ou **Deep Learning**) : est un sous-domaine du **Machine Learning**, donc les mêmes raisons s'appliquent. Avec la différence qu'il n'y a pas une unique feuille de calcul de nombres à multiplier, mais une énorme quantité d'entre elles, et dans de nombreux cas, on utilise un processeur spécial pour construire et / ou utiliser ces modèles....
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 25.4K bytes
    - Viewed (0)
Back to top