Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 117 for appendix (0.05 sec)

  1. gradle/wrapper/gradle-wrapper.jar

    class package org.gradle.wrapper; public final class Logger implements Appendable { public final boolean quiet; public void Logger(boolean); public final void log(String); public final Appendable append(CharSequence); public final Appendable append(CharSequence, int, int); public final Appendable append(char); } org/gradle/wrapper/PathAssembler.class package org.gradle.wrapper; public final class PathAssembler { public void PathAssembler(java.io.File, java.io.File); } org/gradle/wrapper/PropertiesFileHandle.class...
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Thu Oct 30 01:56:29 UTC 2025
    - 44.6K bytes
    - Viewed (1)
  2. doc/go_spec.html

    s3 := append(s2, s0...)            // append a slice              s3 is []int{0, 0, 2, 3, 5, 7, 0, 0}
    s4 := append(s3[3:6], s3[2:]...)   // append overlapping slice    s4 is []int{3, 5, 7, 2, 3, 5, 7, 0, 0}
    
    var t []interface{}
    t = append(t, 42, 3.1415, "foo")   //                             t is []interface{}{42, 3.1415, "foo"}
    
    var b []byte
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Dec 02 23:07:19 UTC 2025
    - 286.5K bytes
    - Viewed (1)
  3. fess-crawler/src/main/java/org/codelibs/fess/crawler/util/TextUtil.java

     *
     * <p>The text normalization process includes:
     * <ul>
     *   <li>Treating ISO control characters and specified space characters as spaces.</li>
     *   <li>Appending alphanumeric characters (0-9, A-Z, a-z) to the buffer.</li>
     *   <li>Appending symbol characters (!-/, :-@, [-`, {-~) to the buffer.</li>
     *   <li>Optionally removing duplicate terms based on a flag.</li>
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Sat Nov 22 13:28:22 UTC 2025
    - 12K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/query/QueryProcessor.java

         * @param chain the existing filter chain to append to
         * @return a new filter chain that includes the appended filter
         */
        protected FilterChain appendFilterChain(final Filter filter, final FilterChain chain) {
            return (context, query, boost) -> filter.execute(context, query, boost, chain);
        }
    
        /**
         * Creates the default filter chain that executes query commands.
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 7.2K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/core/lang/StringUtil.java

            buf.append(Character.forDigit(i & 0x0f, 16));
        }
    
        /**
         * Appends the hexadecimal string representation of a number to the given StringBuilder.
         *
         * @param buf
         *            the StringBuilder to append to
         * @param i
         *            the number to convert
         */
        public static void appendHex(final StringBuilder buf, final int i) {
    Registered: Sat Dec 20 08:55:33 UTC 2025
    - Last Modified: Sat Nov 22 11:21:59 UTC 2025
    - 21.5K bytes
    - Viewed (0)
  6. src/bytes/buffer.go

    		}
    	}()
    	// TODO(http://golang.org/issue/51462): We should rely on the append-make
    	// pattern so that the compiler can call runtime.growslice. For example:
    	//	return append(b, make([]byte, n)...)
    	// This avoids unnecessary zero-ing of the first len(b) bytes of the
    	// allocated slice, but this pattern causes b to escape onto the heap.
    	//
    	// Instead use the append-make pattern with a nil slice to ensure that
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Fri Nov 14 19:01:17 UTC 2025
    - 16.5K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/primitives/ImmutableLongArray.java

          return "[]";
        }
        StringBuilder builder = new StringBuilder(length() * 5); // rough estimate is fine
        builder.append('[').append(array[start]);
    
        for (int i = start + 1; i < end; i++) {
          builder.append(", ").append(array[i]);
        }
        builder.append(']');
        return builder.toString();
      }
    
      /**
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Fri Dec 12 14:49:24 UTC 2025
    - 22K bytes
    - Viewed (0)
  8. guava/src/com/google/common/primitives/ImmutableIntArray.java

          return "[]";
        }
        StringBuilder builder = new StringBuilder(length() * 5); // rough estimate is fine
        builder.append('[').append(array[start]);
    
        for (int i = start + 1; i < end; i++) {
          builder.append(", ").append(array[i]);
        }
        builder.append(']');
        return builder.toString();
      }
    
      /**
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Fri Dec 12 14:49:24 UTC 2025
    - 21.5K bytes
    - Viewed (0)
  9. src/bytes/bytes_test.go

    }
    
    func TestSplit(t *testing.T) {
    	for _, tt := range splittests {
    		a := SplitN([]byte(tt.s), []byte(tt.sep), tt.n)
    
    		// Appending to the results should not change future results.
    		var x []byte
    		for _, v := range a {
    			x = append(v, 'z')
    		}
    
    		result := sliceOfString(a)
    		if !slices.Equal(result, tt.a) {
    			t.Errorf(`Split(%q, %q, %d) = %v; want %v`, tt.s, tt.sep, tt.n, result, tt.a)
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Dec 23 23:54:14 UTC 2025
    - 62.9K bytes
    - Viewed (0)
  10. src/main/java/org/codelibs/fess/helper/ViewHelper.java

            final StringBuilder buf = new StringBuilder(100);
            buf.append("/WEB-INF/view/").append(page);
            if (StringUtil.isNotBlank(lang)) {
                buf.append('_').append(lang);
                if (StringUtil.isNotBlank(country)) {
                    buf.append('_').append(country);
                }
            }
            buf.append(".jsp");
            return buf.toString();
        }
    
        /**
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 52.6K bytes
    - Viewed (0)
Back to top