Search Options

Results per page
Sort
Preferred Languages
Advance

Results 311 - 320 of 1,193 for Ground (0.31 sec)

  1. misc/chrome/gophertool/background.html

    <html>
    <!--
     Copyright 2011 The Go Authors. All rights reserved.
     Use of this source code is governed by a BSD-style
     license that can be found in the LICENSE file.
    -->
    <head>
    <script src="gopher.js"></script>
    <script src="background.js"></script>
    </head>
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Oct 08 00:56:10 UTC 2012
    - 265 bytes
    - Viewed (0)
  2. schema/constraint_test.go

    			Constraint: "name <> 'jinzhu'",
    		},
    	}
    
    	checks := user.ParseCheckConstraints()
    
    	for k, result := range results {
    		v, ok := checks[k]
    		if !ok {
    			t.Errorf("Failed to found check %v from parsed checks %+v", k, checks)
    		}
    
    		for _, name := range []string{"Name", "Constraint"} {
    			if reflect.ValueOf(result).FieldByName(name).Interface() != reflect.ValueOf(v).FieldByName(name).Interface() {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun Feb 04 07:49:19 UTC 2024
    - 2.2K bytes
    - Viewed (0)
  3. cmd/metrics-v2_gen.go

    			}
    		default:
    			bts, err = msgp.Skip(bts)
    			if err != nil {
    				err = msgp.WrapError(err)
    				return
    			}
    		}
    	}
    	o = bts
    	return
    }
    
    // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
    func (z *MetricDescription) Msgsize() (s int) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 23 20:56:18 UTC 2025
    - 19.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/cache/Striped64.java

       * using a secondary hash (Marsaglia XorShift) to try to find a
       * free slot.
       *
       * The table size is capped because, when there are more threads
       * than CPUs, supposing that each thread were bound to a CPU,
       * there would exist a perfect hash function mapping threads to
       * slots that eliminates collisions. When we reach capacity, we
       * search for this mapping by randomly varying the hash codes of
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Jan 15 22:17:15 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/fess/app/service/RelatedQueryService.java

        /**
         * Retrieves a specific related query by its unique identifier.
         *
         * @param id the unique identifier of the related query to retrieve
         * @return an OptionalEntity containing the RelatedQuery if found, or empty if not found
         */
        public OptionalEntity<RelatedQuery> getRelatedQuery(final String id) {
            return relatedQueryBhv.selectByPK(id);
        }
    
        /**
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 5.4K bytes
    - Viewed (0)
  6. src/main/java/jcifs/smb1/smb1/SmbComNegotiateResponse.java

                                len += 2;
                                if (len > 256) {
                                    throw new RuntimeException("zero termination not found");
                                }
                            }
                            server.oemDomainName = new String(buffer, bufferIndex, len, UNI_ENCODING);
                        } else {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 6K bytes
    - Viewed (0)
  7. src/cmd/asm/internal/lex/lex.go

    // Copyright 2015 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Package lex implements lexical analysis for the assembler.
    package lex
    
    import (
    	"fmt"
    	"log"
    	"os"
    	"strings"
    	"text/scanner"
    
    	"cmd/internal/src"
    )
    
    // A ScanToken represents an input item. It is a simple wrapping of rune, as
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Aug 29 18:31:05 UTC 2023
    - 4.1K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/app/service/StopwordsService.java

        }
    
        /**
         * Retrieves a stopwords file for a given dictionary ID.
         *
         * @param dictId The ID of the dictionary.
         * @return An optional entity containing the stopwords file, or empty if not found.
         */
        public OptionalEntity<StopwordsFile> getStopwordsFile(final String dictId) {
            return dictionaryManager.getDictionaryFile(dictId)
                    .filter(StopwordsFile.class::isInstance)
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 4.6K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/app/service/SynonymService.java

        }
    
        /**
         * Retrieves a synonym file for a given dictionary ID.
         *
         * @param dictId The ID of the dictionary.
         * @return An optional entity containing the synonym file, or empty if not found.
         */
        public OptionalEntity<SynonymFile> getSynonymFile(final String dictId) {
            return dictionaryManager.getDictionaryFile(dictId)
                    .filter(SynonymFile.class::isInstance)
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 4.5K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/ImmutableSortedMultiset.java

       * @throws NullPointerException if any of {@code elements} is null
       */
      public static <E> ImmutableSortedMultiset<E> copyOf(Iterable<? extends E> elements) {
        // Hack around E not being a subtype of Comparable.
        // Unsafe, see ImmutableSortedMultisetFauxverideShim.
        @SuppressWarnings("unchecked")
        Ordering<E> naturalOrder = (Ordering<E>) Ordering.<Comparable<?>>natural();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 29.5K bytes
    - Viewed (0)
Back to top