Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for parseKey (0.08 seconds)

  1. internal/store/store_test.go

    			expectedKey: Key{
    				Name:      "01894394-d046-4783-ba0d-f1c6885790dc",
    				Extension: ".event",
    				ItemCount: 1,
    			},
    		},
    	}
    
    	for i, testCase := range testCases {
    		key := parseKey(testCase.str)
    		if testCase.expectedKey.Name != key.Name {
    			t.Fatalf("case[%v]: Expected key.Name: %v, got %v", i, testCase.expectedKey.Name, key.Name)
    		}
    		if testCase.expectedKey.Compress != key.Compress {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Sep 06 23:06:30 GMT 2024
    - 4K bytes
    - Click Count (0)
  2. internal/store/store.go

    		return ""
    	}()
    }
    
    func getItemCount(k string) (count int, err error) {
    	count = 1
    	v := strings.Split(k, ":")
    	if len(v) == 2 {
    		return strconv.Atoi(v[0])
    	}
    	return count, err
    }
    
    func parseKey(k string) (key Key) {
    	key.Name = k
    	if strings.HasSuffix(k, compressExt) {
    		key.Compress = true
    		key.Name = strings.TrimSuffix(key.Name, compressExt)
    	}
    	if key.ItemCount, _ = getItemCount(k); key.ItemCount > 1 {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  3. internal/store/queuestore.go

    	}
    
    	// Sort entries...
    	sort.Slice(entries, func(i, j int) bool {
    		return store.entries[entries[i]] < store.entries[entries[j]]
    	})
    
    	for i := range entries {
    		keys = append(keys, parseKey(entries[i]))
    	}
    
    	return keys
    }
    
    // list will read all entries from disk.
    // Entries are returned sorted by modtime, oldest first.
    // Underlying entry list in store is *not* updated.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 7.8K bytes
    - Click Count (0)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    []byte) (*EncapsulationKey768, error) { // The actual logic is in a separate function to outline this allocation. ek := &EncapsulationKey768{} return parseEK(ek, encapsulationKey) } // parseEK parses an encryption key from its encoded form. // // It implements the initial stages of K-PKE.Encrypt according to FIPS 203, // Algorithm 14. func parseEK(ek *EncapsulationKey768, ekPKE []byte) (*EncapsulationKey768, error) { if len(ekPKE) != EncapsulationKeySize { return nil, errors.New("mlkem: invalid encapsulation...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  5. lib/fips140/v1.1.0-rc1.zip

    []byte) (*EncapsulationKey768, error) { // The actual logic is in a separate function to outline this allocation. ek := &EncapsulationKey768{} return parseEK(ek, encapsulationKey) } // parseEK parses an encryption key from its encoded form. // // It implements the initial stages of K-PKE.Encrypt according to FIPS 203, // Algorithm 14. func parseEK(ek *EncapsulationKey768, ekPKE []byte) (*EncapsulationKey768, error) { if len(ekPKE) != EncapsulationKeySize { return nil, errors.New("mlkem: invalid encapsulation...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top