Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 36 for cSrc (0.04 sec)

  1. fess-crawler/src/test/java/org/codelibs/fess/crawler/helper/impl/MimeTypeHelperImplTest.java

            assertContentType("image/vnd.dxf", "extractor/dxf/autocad_R12_LT2.dxf", "autocad_R12_LT2.dxf");
    
            assertContentType("text/x-csrc", "extractor/program/test.c", "test.c");
            assertContentType("text/x-c++src", "extractor/program/test.cpp", "test.cpp");
            assertContentType("text/x-chdr", "extractor/program/test.h", "test.h");
    Registered: Wed Jun 12 15:17:51 UTC 2024
    - Last Modified: Thu Feb 22 01:36:27 UTC 2024
    - 11.6K bytes
    - Viewed (0)
  2. src/runtime/syscall_windows_test.go

    	}
    	defer f.Close()
    
    	fmt.Fprint(f, `
    #include <stdint.h>
    typedef struct { uint8_t x, y; } uint8Pair_t;
    `)
    	for _, cbf := range getCallbackTestFuncs() {
    		cbf.cSrc(f, false)
    		cbf.cSrc(f, true)
    	}
    }
    
    func (d *cbDLL) build(t *testing.T, dir string) string {
    	srcname := d.name + ".c"
    	d.makeSrc(t, filepath.Join(dir, srcname))
    	outname := d.name + ".dll"
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Aug 31 16:31:35 UTC 2023
    - 32.5K bytes
    - Viewed (0)
  3. src/crypto/hmac/hmac_test.go

    type hmacTest struct {
    	hash      func() hash.Hash
    	key       []byte
    	in        []byte
    	out       string
    	size      int
    	blocksize int
    }
    
    var hmacTests = []hmacTest{
    	// Tests from US FIPS 198
    	// https://csrc.nist.gov/publications/fips/fips198/fips-198a.pdf
    	{
    		sha1.New,
    		[]byte{
    			0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
    			0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Nov 18 18:38:14 UTC 2020
    - 21.8K bytes
    - Viewed (0)
  4. src/crypto/aes/aes_test.go

    		for j := 0; j < 4; j++ {
    			if x := td[j][i]; x != w {
    				t.Fatalf("td[%d][%d] = %#x, want %#x", j, i, x, w)
    			}
    			w = w<<24 | w>>8
    		}
    	}
    }
    
    // Test vectors are from FIPS 197:
    //	https://csrc.nist.gov/publications/fips/fips197/fips-197.pdf
    
    // Appendix A of FIPS 197: Key expansion examples
    type KeyTest struct {
    	key []byte
    	enc []uint32
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 25 14:58:19 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  5. src/go/types/issues_test.go

    )
    
    func _() {
    	// Packages should be fully qualified when there is ambiguity within the
    	// error string itself.
    	a.F(template /* ERRORx "cannot use.*html/template.* as .*text/template" */ .Template{})
    }
    `
    		csrc = `
    package c
    
    import (
    	"a"
    	"fmt"
    	"html/template"
    )
    
    // go.dev/issue/46905: make sure template is not the first package qualified.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 28.1K bytes
    - Viewed (0)
  6. src/crypto/sha256/sha256block_ppc64x.s

    #include "textflag.h"
    
    // SHA256 block routine. See sha256block.go for Go equivalent.
    //
    // The algorithm is detailed in FIPS 180-4:
    //
    //  https://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf
    //
    // Wt = Mt; for 0 <= t <= 15
    // Wt = SIGMA1(Wt-2) + SIGMA0(Wt-15) + Wt-16; for 16 <= t <= 63
    //
    // a = H0
    // b = H1
    // c = H2
    // d = H3
    // e = H4
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:29:44 UTC 2024
    - 14.4K bytes
    - Viewed (0)
  7. src/crypto/ecdsa/ecdsa_test.go

    	r, ok := new(big.Int).SetString(s, 16)
    	if !ok {
    		panic("bad hex")
    	}
    	return r
    }
    
    func TestVectors(t *testing.T) {
    	// This test runs the full set of NIST test vectors from
    	// https://csrc.nist.gov/groups/STM/cavp/documents/dss/186-3ecdsatestvectors.zip
    	//
    	// The SigVer.rsp file has been edited to remove test vectors for
    	// unsupported algorithms and has been compressed.
    
    	if testing.Short() {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 26 21:33:58 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  8. src/cmd/compile/internal/types2/issues_test.go

    )
    
    func _() {
    	// Packages should be fully qualified when there is ambiguity within the
    	// error string itself.
    	a.F(template /* ERRORx "cannot use.*html/template.* as .*text/template" */ .Template{})
    }
    `
    		csrc = `
    package c
    
    import (
    	"a"
    	"fmt"
    	"html/template"
    )
    
    // go.dev/issue/46905: make sure template is not the first package qualified.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 28.1K bytes
    - Viewed (0)
  9. src/crypto/cipher/gcm.go

    //	the coefficient of x¹²⁷ can be obtained by v.high & 1.
    type gcmFieldElement struct {
    	low, high uint64
    }
    
    // gcm represents a Galois Counter Mode with a specific key. See
    // https://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/gcm/gcm-revised-spec.pdf
    type gcm struct {
    	cipher    Block
    	nonceSize int
    	tagSize   int
    	// productTable contains the first sixteen powers of the key, H.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 13 18:57:38 UTC 2024
    - 13.7K bytes
    - Viewed (0)
  10. src/cmd/internal/notsha256/sha256block_amd64.s

    //go:build !purego
    
    #include "textflag.h"
    
    // SHA256 block routine. See sha256block.go for Go equivalent.
    //
    // The algorithm is detailed in FIPS 180-4:
    //
    //  https://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf
    
    // Wt = Mt; for 0 <= t <= 15
    // Wt = SIGMA1(Wt-2) + SIGMA0(Wt-15) + Wt-16; for 16 <= t <= 63
    //
    // a = H0
    // b = H1
    // c = H2
    // d = H3
    // e = H4
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:27 UTC 2023
    - 14K bytes
    - Viewed (0)
Back to top