Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for estraverse (0.07 seconds)

  1. kotlin-js-store/yarn.lock

      integrity sha512-39nnKffWz8xN1BU/2c79n9nB9HDzo0niYUqx6xyqUnyoAnQyyWpOTdZEeiCch8BBu515t4wp9ZmgVfVhn9EBpw==
    
    estraverse@^5.2.0:
      version "5.3.0"
      resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-5.3.0.tgz#2eea5290702f26ab8fe5370370ff86c965d21123"
      integrity sha512-MMdARuVEQziNTeJD8DgMqmhwR11BRQ/cBP+pLtYdSTnf3MIO8fFeiINEbX36ZdNlfU/7A9f3gUw49B3oQsvwBA==
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sat Jul 22 12:28:51 GMT 2023
    - 87.4K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/reflect/TypeToken.java

              @Override
              @Nullable Class<?> getSuperclass(Class<?> type) {
                return type.getSuperclass();
              }
            };
    
        /** For just classes, we don't have to traverse interfaces. */
        final TypeCollector<K> classesOnly() {
          return new ForwardingTypeCollector<K>(this) {
            @Override
            Iterable<? extends K> getInterfaces(K type) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 53.8K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/MapMakerInternalMap.java

         * be read without locking. Next fields of nodes are immutable (final). All list additions are
         * performed at the front of each bin. This makes it easy to check changes, and also fast to
         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
         * works well for hash tables since the bin lists tend to be short. (The average length is less
         * than two.)
         *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 89.9K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

         * be read without locking. Next fields of nodes are immutable (final). All list additions are
         * performed at the front of each bin. This makes it easy to check changes, and also fast to
         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
         * works well for hash tables since the bin lists tend to be short. (The average length is less
         * than two.)
         *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 89.9K bytes
    - Click Count (0)
Back to Top