Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 783 for search_ (0.22 sec)

  1. src/test/java/org/codelibs/core/beans/util/CopyOptionsTest.java

         */
        @Test
        public void testPrefix() throws Exception {
            final CopyOptions option = new CopyOptions();
            assertThat(option.prefix(BeanNames.search_()), is(sameInstance(option)));
            assertThat(option.prefix, is("search_"));
        }
    
        /**
         * @throws Exception
         */
        @Test
        public void testBeanDelimiter() throws Exception {
            final CopyOptions option = new CopyOptions();
    Registered: Wed Jun 12 12:50:12 UTC 2024
    - Last Modified: Thu Mar 07 01:59:08 UTC 2024
    - 12K bytes
    - Viewed (0)
  2. src/test/java/org/codelibs/core/beans/util/BeanUtilTest.java

                return createCharSequence("abc_exclude");
            }
    
            /**
             * @return CharSequence
             */
            public static CharSequence search_() {
                return createCharSequence("search_");
            }
    
            /**
             * @return CharSequence
             */
            public static CharSequence abc_() {
                return createCharSequence("abc_");
    Registered: Wed Jun 12 12:50:12 UTC 2024
    - Last Modified: Thu Mar 07 01:59:08 UTC 2024
    - 34.5K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/SortedLists.java

              @ParametricNullness E key,
              List<? extends E> list,
              int foundIndex) {
            // Of course, we have to use binary search to find the precise
            // breakpoint...
            int lower = 0;
            int upper = foundIndex;
            // Of course, we have to use binary search to find the precise breakpoint...
            // Everything between lower and upper inclusive compares at <= 0.
            while (lower < upper) {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 10.9K bytes
    - Viewed (0)
  4. guava/src/com/google/common/collect/SortedLists.java

              @ParametricNullness E key,
              List<? extends E> list,
              int foundIndex) {
            // Of course, we have to use binary search to find the precise
            // breakpoint...
            int lower = 0;
            int upper = foundIndex;
            // Of course, we have to use binary search to find the precise breakpoint...
            // Everything between lower and upper inclusive compares at <= 0.
            while (lower < upper) {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 10.9K bytes
    - Viewed (0)
  5. src/net/dnsclient_unix_test.go

    		},
    		{
    			desc: "searchX error fails in strict mode",
    			resolveWhich: func(quest dnsmessage.Question) resolveWhichEnum {
    				if quest.Name.String() == searchX {
    					return resolveTimeout
    				}
    				return resolveOK
    			},
    			wantStrictErr: makeTimeout(),
    			wantIPs:       []string{ip4, ip6},
    		},
    		{
    			desc: "searchX IPv4-only timeout fails in strict mode",
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sun Apr 14 18:23:45 UTC 2024
    - 72.4K bytes
    - Viewed (0)
  6. pkg/kubelet/network/dns/dns_test.go

    		{"search ", []string{}, []string{}, []string{}, false},  // search empty
    		{"search .", []string{}, []string{}, []string{}, false}, // ignore lone dot
    		{"search . foo", []string{}, []string{"foo"}, []string{}, false},
    		{"search foo .", []string{}, []string{"foo"}, []string{}, false},
    		{"search foo .  bar", []string{}, []string{"foo", "bar"}, []string{}, false},
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Jun 04 06:25:43 UTC 2024
    - 25.6K bytes
    - Viewed (0)
  7. src/main/java/org/codelibs/fess/rank/fusion/DefaultSearcher.java

    import org.lastaflute.web.util.LaRequestUtil;
    import org.opensearch.action.search.SearchRequestBuilder;
    import org.opensearch.action.search.SearchResponse;
    import org.opensearch.common.document.DocumentField;
    import org.opensearch.search.SearchHit;
    import org.opensearch.search.SearchHits;
    import org.opensearch.search.aggregations.Aggregations;
    import org.opensearch.search.fetch.subphase.highlight.HighlightField;
    
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 10.1K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/rank/fusion/RankFusionProcessor.java

                return parent.toString();
            }
        }
    
        public void setSeacher(final RankFusionSearcher searcher) {
            this.searchers[0] = searcher;
        }
    
        public void register(final RankFusionSearcher searcher) {
            if (logger.isDebugEnabled()) {
                logger.debug("Load {}", searcher.getClass().getSimpleName());
            }
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 16.5K bytes
    - Viewed (0)
  9. docs/debugging/pprofgoparser/main.go

    	flag.DurationVar(&margin, "margin", 0, "margin time")
    	flag.StringVar(&searchText, "search", "", "Regex to search for a text in one goroutine stacktrace")
    }
    
    func parseGoroutineType2(path string) (map[time.Duration][]string, error) {
    	f, err := os.Open(path)
    	if err != nil {
    		return nil, err
    	}
    
    	bf := bytes.Buffer{}
    
    	save := func(s string) {
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Wed Mar 06 11:43:16 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  10. src/internal/bytealg/bytealg.go

    		if i&1 != 0 {
    			pow *= sq
    		}
    		sq *= sq
    	}
    	return hash, pow
    }
    
    // IndexRabinKarp uses the Rabin-Karp search algorithm to return the index of the
    // first occurrence of sep in s, or -1 if not present.
    func IndexRabinKarp[T string | []byte](s, sep T) int {
    	// Rabin-Karp search
    	hashss, pow := HashStr(sep)
    	n := len(sep)
    	var h uint32
    	for i := 0; i < n; i++ {
    		h = h*PrimeRK + uint32(s[i])
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 19 19:51:15 UTC 2024
    - 3.1K bytes
    - Viewed (0)
Back to top