Search Options

Results per page
Sort
Preferred Languages
Advance

Results 741 - 750 of 2,946 for name (0.01 sec)

  1. src/cmd/asm/internal/lex/input.go

    func (in *Input) define() {
    	name := in.macroName()
    	args, tokens := in.macroDefinition(name)
    	in.defineMacro(name, args, tokens)
    }
    
    // defineMacro stores the macro definition in the Input.
    func (in *Input) defineMacro(name string, args []string, tokens []Token) {
    	if in.macros[name] != nil {
    		in.Error("redefinition of macro:", name)
    	}
    	in.macros[name] = &Macro{
    		name:   name,
    		args:   args,
    		tokens: tokens,
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Sep 06 13:17:27 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  2. guava-gwt/src/com/google/common/ForceGuavaCompilation.gwt.xml

    <module>
      <inherits name="com.google.common.annotations.Annotations" />
      <inherits name="com.google.common.base.Base" />
      <inherits name="com.google.common.cache.Cache" />
      <inherits name="com.google.common.collect.Collect" />
      <inherits name="com.google.common.escape.Escape" />
      <inherits name="com.google.common.html.Html" />
      <inherits name="com.google.common.io.Io" />
      <inherits name="com.google.common.math.Math" />
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Sep 27 15:04:14 UTC 2021
    - 1.1K bytes
    - Viewed (0)
  3. tests/distinct_test.go

    		t.Fatalf("errors happened when create users: %v", err)
    	}
    
    	var names []string
    	DB.Table("users").Where("name like ?", "distinct%").Order("name").Pluck("name", &names)
    	AssertEqual(t, names, []string{"distinct", "distinct", "distinct", "distinct-2", "distinct-3"})
    
    	var names1 []string
    	DB.Model(&User{}).Where("name like ?", "distinct%").Distinct().Order("name").Pluck("Name", &names1)
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Jan 06 07:02:53 UTC 2022
    - 2.5K bytes
    - Viewed (0)
  4. tests/customize_field_test.go

    	}
    
    	generateStruct := func(name string) *CustomizeFieldStruct {
    		return &CustomizeFieldStruct{
    			Name:             name,
    			FieldAllowCreate: name + "_allow_create",
    			FieldAllowUpdate: name + "_allow_update",
    			FieldAllowSave:   name + "_allow_save",
    			FieldAllowSave2:  name + "_allow_save2",
    			FieldAllowSave3:  name + "_allow_save3",
    			FieldReadonly:    name + "_allow_readonly",
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Fri Sep 11 09:33:31 UTC 2020
    - 6.9K bytes
    - Viewed (0)
  5. src/cmd/asm/internal/asm/asm.go

    		}
    	case target.Type == obj.TYPE_REG:
    		// JMP R1
    		*targetAddr = *target
    	case target.Type == obj.TYPE_MEM && (target.Name == obj.NAME_EXTERN || target.Name == obj.NAME_STATIC):
    		// JMP main·morestack(SB)
    		*targetAddr = *target
    	case target.Type == obj.TYPE_INDIR && (target.Name == obj.NAME_EXTERN || target.Name == obj.NAME_STATIC):
    		// JMP *main·morestack(SB)
    		*targetAddr = *target
    		targetAddr.Type = obj.TYPE_INDIR
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Aug 05 17:31:25 UTC 2025
    - 26.2K bytes
    - Viewed (0)
  6. .github/workflows/codeql-analysis.yml

    # or to provide custom queries or build logic.
    name: "CodeQL"
    
    on:
      push:
        branches: [master]
      pull_request:
        # The branches below must be a subset of the branches above
        branches: [master]
      schedule:
        - cron: '0 11 * * 4'
    
    jobs:
      analyze:
        name: Analyze
        runs-on: ubuntu-latest
    
        strategy:
          fail-fast: false
          matrix:
    Registered: Thu Sep 04 15:34:10 UTC 2025
    - Last Modified: Fri Oct 02 13:24:14 UTC 2020
    - 2.5K bytes
    - Viewed (0)
  7. src/main/java/org/codelibs/fess/crawler/util/FessCrawlerConfig.java

        }
    
        /**
         * Gets the name of the data index for the crawler.
         *
         * @return the data index name
         */
        @Override
        public String getDataIndex() {
            return ComponentUtil.getFessConfig().getIndexDocumentCrawlerIndex() + ".data";
        }
    
        /**
         * Gets the name of the filter index for the crawler.
         *
         * @return the filter index name
         */
        @Override
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  8. src/cmd/addr2line/main.go

    			continue
    		}
    		pc, _ := strconv.ParseUint(strings.TrimPrefix(p, "0x"), 16, 64)
    		file, line, fn := tab.PCToLine(pc)
    		name := "?"
    		if fn != nil {
    			name = fn.Name
    		} else {
    			file = "?"
    			line = 0
    		}
    		fmt.Fprintf(stdout, "%s\n%s:%d\n", name, file, line)
    	}
    	stdout.Flush()
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Jun 21 19:58:04 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  9. src/test/java/jcifs/smb/Kerb5AuthenticatorTest.java

            return tok.toByteArray();
        }
    
        @Test
        @DisplayName("createContext: rejects NetBIOS/short host names")
        void createContext_rejectsShortNetbiosHost() {
            Kerb5Authenticator auth = new Kerb5Authenticator((Subject) null);
    
            // Using an uppercase short name (no dot) must throw an unsupported operation
            SmbUnsupportedOperationException ex =
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  10. cmd/bitrot.go

    // If the algorithm is not supported String panics.
    func (a BitrotAlgorithm) String() string {
    	name, ok := bitrotAlgorithms[a]
    	if !ok {
    		logger.CriticalIf(GlobalContext, errors.New("Unsupported bitrot algorithm"))
    	}
    	return name
    }
    
    // NewBitrotVerifier returns a new BitrotVerifier implementing the given algorithm.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Feb 26 19:26:13 UTC 2025
    - 7.7K bytes
    - Viewed (0)
Back to top