Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 29 for Safine (0.17 sec)

  1. src/cmd/cgo/internal/test/cthread_windows.c

    // Copyright 2013 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.
    
    #define WIN32_LEAN_AND_MEAN
    #include <windows.h>
    #include <process.h>
    #include "_cgo_export.h"
    
    __stdcall
    static unsigned int
    addThread(void *p)
    {
    	int i, max;
    	
    	max = *(int*)p;
    	for(i=0; i<max; i++)
    		Add(i);
    	return 0;
    }
    
    void
    C
    - Registered: Tue Apr 23 11:13:09 GMT 2024
    - Last Modified: Wed May 17 21:53:11 GMT 2023
    - 1.1K bytes
    - Viewed (0)
  2. doc/asm.html

    is also treated as implicitly marked <code>NOPTR</code>.
    It is not possible to define a symbol containing pointers in an assembly source file;
    such a symbol must be defined in a Go source file instead.
    Assembly source can still refer to the symbol by name
    even without <code>DATA</code> and <code>GLOBL</code> directives.
    A good general rule of thumb is to define all non-<code>RODATA</code>
    symbols in Go instead of in assembly.
    </p>
    
    <p>
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Tue Nov 28 19:15:27 GMT 2023
    - 36.3K bytes
    - Viewed (0)
  3. src/bufio/example_test.go

    // list with an empty final value.
    func ExampleScanner_emptyFinalToken() {
    	// Comma-separated list; last entry is empty.
    	const input = "1,2,3,4,"
    	scanner := bufio.NewScanner(strings.NewReader(input))
    	// Define a split function that separates on commas.
    	onComma := func(data []byte, atEOF bool) (advance int, token []byte, err error) {
    		for i := 0; i < len(data); i++ {
    			if data[i] == ',' {
    				return i + 1, data[:i], nil
    			}
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Oct 23 09:06:30 GMT 2023
    - 4.9K bytes
    - Viewed (0)
  4. doc/godebug.md

    When preparing any change that is permitted by Go 1 compatibility
    but may nonetheless break some existing programs,
    we first engineer the change to keep as many existing programs working as possible.
    For the remaining programs,
    we define a new GODEBUG setting that
    allows individual programs to opt back in to the old behavior.
    A GODEBUG setting may not be added if doing so is infeasible,
    but that should be extremely rare.
    
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Tue Apr 16 17:29:58 GMT 2024
    - 13.5K bytes
    - Viewed (0)
  5. api/go1.txt

    pkg go/token, const CONST Token
    pkg go/token, const CONTINUE Token
    pkg go/token, const DEC Token
    pkg go/token, const DEFAULT Token
    pkg go/token, const DEFER Token
    pkg go/token, const DEFINE Token
    pkg go/token, const ELLIPSIS Token
    pkg go/token, const ELSE Token
    pkg go/token, const EOF Token
    pkg go/token, const EQL Token
    pkg go/token, const FALLTHROUGH Token
    pkg go/token, const FLOAT Token
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Wed Aug 14 18:58:28 GMT 2013
    - 1.7M bytes
    - Viewed (2)
  6. src/cmd/asm/internal/lex/input.go

    		switch in.Stack.Text() {
    		case "else", "endif", "ifdef", "ifndef", "line":
    			// Press on.
    		default:
    			return false
    		}
    	}
    	switch in.Stack.Text() {
    	case "define":
    		in.define()
    	case "else":
    		in.else_()
    	case "endif":
    		in.endif()
    	case "ifdef":
    		in.ifdef(true)
    	case "ifndef":
    		in.ifdef(false)
    	case "include":
    		in.include()
    	case "line":
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Aug 29 07:48:38 GMT 2023
    - 12.6K bytes
    - Viewed (0)
  7. src/cmd/asm/internal/asm/testdata/buildtagerror.s

    // Copyright 2020 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.
    
    #define X 1
    
    Others
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Oct 13 01:16:56 GMT 2020
    - 227 bytes
    - Viewed (0)
  8. src/cmd/cgo/internal/test/issue24161e1/main.go

      typedef CFStringRef SecKeyAlgorithm;
      static CFDataRef SecKeyCreateSignature(SecKeyRef key, SecKeyAlgorithm algorithm, CFDataRef dataToSign, CFErrorRef *error){return NULL;}
      #define kSecKeyAlgorithmECDSASignatureDigestX962SHA1 foo()
      static SecKeyAlgorithm foo(void){return NULL;}
    #endif
    */
    import "C"
    import (
    	"fmt"
    	"testing"
    )
    
    func f1() {
    Go
    - Registered: Tue Mar 26 11:13:08 GMT 2024
    - Last Modified: Fri May 12 12:00:02 GMT 2023
    - 1K bytes
    - Viewed (0)
  9. src/cmd/asm/internal/asm/parse.go

    			if p.sawCode {
    				p.errorf("misplaced //go:build comment")
    			}
    			continue
    		}
    		if tok != '\n' {
    			p.sawCode = true
    		}
    		if tok == '#' {
    			// A leftover wisp of a #include/#define/etc,
    			// to let us know that p.sawCode should be true now.
    			// Otherwise ignored.
    			continue
    		}
    		return tok
    	}
    }
    
    // line consumes a single assembly line from p.lex of the form
    //
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Feb 21 14:34:57 GMT 2024
    - 36.9K bytes
    - Viewed (0)
  10. src/bytes/bytes.go

    func Map(mapping func(r rune) rune, s []byte) []byte {
    	// In the worst case, the slice can grow when mapped, making
    	// things unpleasant. But it's so rare we barge in assuming it's
    	// fine. It could also shrink but that falls out naturally.
    	b := make([]byte, 0, len(s))
    	for i := 0; i < len(s); {
    		wid := 1
    		r := rune(s[i])
    		if r >= utf8.RuneSelf {
    			r, wid = utf8.DecodeRune(s[i:])
    		}
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Feb 19 19:51:15 GMT 2024
    - 33.8K bytes
    - Viewed (0)
Back to top