Search Options

Results per page
Sort
Preferred Languages
Advance

Results 141 - 150 of 594 for prefijo (0.12 sec)

  1. guava-tests/test/com/google/common/primitives/IntArrayAsListTest.java

          Integer[] prefix = {(int) 86, (int) 99};
          Integer[] all = concat(prefix, elements);
          return asList(all).subList(2, elements.length + 2);
        }
      }
    
      public static final class IntsAsListMiddleSubListGenerator extends TestIntegerListGenerator {
        @Override
        protected List<Integer> create(Integer[] elements) {
          Integer[] prefix = {Integer.MIN_VALUE, Integer.MAX_VALUE};
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Jun 01 09:32:35 UTC 2023
    - 5.7K bytes
    - Viewed (0)
  2. schema/schema_test.go

    	if table == "" {
    		return baseColumnName
    	}
    
    	s := strings.Split(table, "_")
    
    	var prefix string
    	switch len(s) {
    	case 1:
    		prefix = s[0][:3]
    	case 2:
    		prefix = s[0][:1] + s[1][:2]
    	default:
    		prefix = s[0][:1] + s[1][:1] + s[2][:1]
    	}
    	return prefix + "_" + baseColumnName
    }
    
    func TestEmbeddedStructForCustomizedNamingStrategy(t *testing.T) {
    	type CorpBase struct {
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Jun 20 12:19:31 UTC 2024
    - 13.3K bytes
    - Viewed (0)
  3. src/README.vendor

    imported normally and vendored by the standard library.
    
    Vendored packages are internally renamed with a "vendor/" prefix
    to preserve the invariant that all packages have distinct paths.
    This is necessary to avoid compiler and linker conflicts. Adding
    a "vendor/" prefix also maintains the invariant that standard
    library packages begin with a dotless path element.
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Sep 30 19:15:39 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  4. cmd/batch-handlers.go

    		objInfoCh := make(chan miniogo.ObjectInfo, 1)
    		go func() {
    			prefixes := r.Source.Prefix.F()
    			if len(prefixes) == 0 {
    				prefixes = []string{""}
    			}
    			for _, prefix := range prefixes {
    				prefixObjInfoCh := c.ListObjects(ctx, r.Source.Bucket, miniogo.ListObjectsOptions{
    					Prefix:       prefix,
    					WithVersions: minioSrc,
    					Recursive:    true,
    					WithMetadata: true,
    				})
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Oct 18 15:32:09 UTC 2024
    - 62.2K bytes
    - Viewed (0)
  5. android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBenchmark.java

      private String[] strings;
    
      @BeforeExperiment
      @SuppressWarnings("unchecked")
      void setUp() throws Exception {
        String prefix =
            (useMonitor ? "com.google.common.util.concurrent.MonitorBased" : "java.util.concurrent.");
        String className = prefix + queueType + "BlockingQueue";
        Constructor<?> constructor = Class.forName(className).getConstructor(int.class);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 2K bytes
    - Viewed (0)
  6. build-logic-commons/basics/src/main/kotlin/gradlebuild/basics/classanalysis/ClassGraph.kt

            }
        }
    
        fun matches(packageName: String): Boolean {
            if (names.contains(packageName)) {
                return true
            }
            for (prefix in prefixes) {
                if (packageName.startsWith(prefix)) {
                    names.add(packageName)
                    return true
                }
            }
            return false
        }
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Sat Sep 30 16:17:28 UTC 2023
    - 2.6K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/CompactHashing.java

      }
    
      /** Returns the hash prefix given the current mask. */
      static int getHashPrefix(int value, int mask) {
        return value & ~mask;
      }
    
      /** Returns the index, or 0 if the entry is "null". */
      static int getNext(int entry, int mask) {
        return entry & mask;
      }
    
      /** Returns a new value combining the prefix and suffix using the given mask. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 15:34:52 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  8. cmd/object-api-interface.go

    	ListObjects(ctx context.Context, bucket, prefix, marker, delimiter string, maxKeys int) (result ListObjectsInfo, err error)
    	ListObjectsV2(ctx context.Context, bucket, prefix, continuationToken, delimiter string, maxKeys int, fetchOwner bool, startAfter string) (result ListObjectsV2Info, err error)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 22 21:57:20 UTC 2024
    - 17.3K bytes
    - Viewed (0)
  9. pom.xml

    							<src>${project.build.directory}/fess</src>
    							<excludes>**/fess_config.properties,**/fess_env*.properties,**/tika.xml</excludes>
    							<mapper>
    								<type>perm</type>
    								<prefix>${packaging.fess.app.dir}</prefix>
    								<filemode>755</filemode>
    								<user>${packaging.fess.user}</user>
    								<group>${packaging.fess.group}</group>
    							</mapper>
    						</data>
    						<!-- Add libs -->
    						<data>
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 02:16:03 UTC 2024
    - 49.1K bytes
    - Viewed (0)
  10. okhttp/src/main/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt

     * bits.
     *
     * We split each code point into a 14-bit prefix and a 7-bit suffix. All code points with the same
     * prefix are called a 'section'. There are 128 code points per section.
     *
     * Ranges Data (32,612 bytes)
     * ==========================
     *
     * Each entry is 4 bytes, and represents a _range_ of code points that all share a common 14-bit
     * prefix. Entries are sorted by their complete code points.
     *
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Tue Apr 02 11:39:58 UTC 2024
    - 9K bytes
    - Viewed (0)
Back to top