Search Options

Results per page
Sort
Preferred Languages
Advance

Results 241 - 250 of 560 for elemLen (0.05 sec)

  1. src/main/java/org/codelibs/core/beans/PropertyDesc.java

         */
        ParameterizedClassDesc getParameterizedClassDesc();
    
        /**
         * Returns the element type if this property is a parameterized {@link Collection}.
         *
         * @return the element type if this property is a parameterized {@link Collection}, otherwise {@literal null}
         */
        Class<?> getElementClassOfCollection();
    
        /**
    Registered: Sat Dec 20 08:55:33 UTC 2025
    - Last Modified: Sat May 10 01:32:17 UTC 2025
    - 4.3K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/primitives/Ints.java

          int tmp = array[i];
          array[i] = array[j];
          array[j] = tmp;
        }
      }
    
      /**
       * Performs a right rotation of {@code array} of "distance" places, so that the first element is
       * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance
       * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Ints.asList(array),
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Oct 22 18:14:49 UTC 2025
    - 31.3K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/util/ThreadDumpUtil.java

                writer.accept("Thread: " + entry.getKey());
                final StackTraceElement[] trace = entry.getValue();
                for (final StackTraceElement element : trace) {
                    writer.accept("\tat " + element);
                }
            }
        }
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 3.3K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/suggest/settings/SuggestSettings.java

                        collection.forEach(element -> arraySettings.add(new Tuple<>(key, element)));
                    } else if (value instanceof Object[]) {
                        for (final Object element : (Object[]) value) {
                            arraySettings.add(new Tuple<>(key, element));
                        }
                    } else {
                        defaultSettings.put(key, value);
    Registered: Sat Dec 20 13:04:59 UTC 2025
    - Last Modified: Mon Nov 24 03:40:05 UTC 2025
    - 20.1K bytes
    - Viewed (0)
  5. internal/s3select/errors.go

    		message:    "The value of a parameter in SelectRequest element is invalid. Check the service API documentation and try again.",
    		statusCode: 400,
    		cause:      err,
    	}
    }
    
    func errInvalidScanRangeParameter(err error) *s3Error {
    	return &s3Error{
    		code:       "InvalidRequestParameter",
    		message:    "The value of a parameter in ScanRange element is invalid. Check the service API documentation and try again.",
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Mon Mar 14 16:48:36 UTC 2022
    - 4.3K bytes
    - Viewed (0)
  6. src/main/java/org/codelibs/fess/dict/DictionaryFile.java

                return parent.get(index);
            }
    
            @Override
            public E set(final int index, final E element) {
                return parent.set(index, element);
            }
    
            @Override
            public void add(final int index, final E element) {
                parent.add(index, element);
            }
    
            @Override
            public E remove(final int index) {
                return parent.remove(index);
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Thu Nov 20 07:09:00 UTC 2025
    - 11.2K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

              }
              swap(array, low, high); // End of innermost loop.
            }
            array[from + 1] = array[high]; // Insert partitioning element.
            array[high] = partition;
    
            // Continue the partition that contains the kth element.
            if (high >= k) {
              to = high - 1;
            }
            if (high <= k) {
              from = low;
            }
          }
        }
      }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  8. guava-testlib/src/com/google/common/testing/EqualsTester.java

        List<Object> list = new ArrayList<>(equalityGroup.length);
        for (int i = 0; i < equalityGroup.length; i++) {
          Object element = equalityGroup[i];
          if (element == null) {
            throw new NullPointerException("at index " + i);
          }
          list.add(element);
        }
        equalityGroups.add(list);
        return this;
      }
    
      /** Run tests on equals method, throwing a failure on an invalid test */
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 6.1K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/query/QueryProcessor.java

         */
        protected void createFilterChain() {
            FilterChain chain = createDefaultFilterChain();
            for (final Filter element : filterList) {
                chain = appendFilterChain(element, chain);
            }
            filterChain = chain;
        }
    
        /**
         * Appends a filter to an existing filter chain.
         *
         * @param filter the filter to append
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 7.2K bytes
    - Viewed (0)
  10. internal/bucket/lifecycle/rule.go

    	return r.NoncurrentVersionExpiration.Validate()
    }
    
    func (r Rule) validatePrefixAndFilter() error {
    	// In the now deprecated PutBucketLifecycle API, Rule had a mandatory Prefix element and there existed no Filter field.
    	// See https://docs.aws.amazon.com/AmazonS3/latest/API/API_PutBucketLifecycle.html
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Mon Nov 25 20:12:21 UTC 2024
    - 6.4K bytes
    - Viewed (0)
Back to top