- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 6,394 for fromP2 (0.25 sec)
-
src/crypto/internal/edwards25519/scalarmult.go
import "sync" // basepointTable is a set of 32 affineLookupTables, where table i is generated // from 256i * basepoint. It is precomputed the first time it's used. func basepointTable() *[32]affineLookupTable { basepointTablePrecomp.initOnce.Do(func() { p := NewGeneratorPoint() for i := 0; i < 32; i++ { basepointTablePrecomp.table[i].FromP3(p) for j := 0; j < 8; j++ { p.Add(p, p) } } })
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:10 UTC 2022 - 6.3K bytes - Viewed (0) -
clause/from.go
package clause // From from clause type From struct { Tables []Table Joins []Join } // Name from clause name func (from From) Name() string { return "FROM" } // Build build from clause func (from From) Build(builder Builder) { if len(from.Tables) > 0 { for idx, table := range from.Tables { if idx > 0 { builder.WriteByte(',') } builder.WriteQuoted(table) } } else {
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Wed Jul 15 02:25:10 UTC 2020 - 630 bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/test/integration/ratcheting_test_cases/invalid/referencegrant/missing-from.yaml
apiVersion: gateway.networking.k8s.io/v1beta1 kind: ReferenceGrant metadata: name: missing-from spec: to: - group: ""
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 27 17:15:18 UTC 2023 - 144 bytes - Viewed (0) -
releasenotes/notes/jwt-from-cookies.yaml
apiVersion: release-notes/v2 kind: feature area: security issue: - 47847 releaseNotes: - |
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Nov 30 18:37:25 UTC 2023 - 140 bytes - Viewed (0) -
docs/distributed/distributed-from-config-file.sh
Poorna <******@****.***> 1716056341 -0700
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat May 18 18:19:01 UTC 2024 - 3.2K bytes - Viewed (0) -
maven-core/src/test/resources/projects/child-which-inherits-from-super-model.xml
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Sun Nov 23 12:04:30 UTC 2014 - 954 bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/dependencyManagement/managingTransitiveDependencies-enforcedConstraintsFromBOM/tests/forced-platform-from-bom.sample.conf
Laura Kassovic <******@****.***> 1701107622 -0800
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 34 bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/dependencyManagement/managingTransitiveDependencies-constraintsFromBOM/tests/importing-dependency-constraints-from-bom.sample.conf
Laura Kassovic <******@****.***> 1701107622 -0800
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 34 bytes - Viewed (0) -
src/cmd/link/internal/ld/inittask.go
} } if len(roots) == 0 { // Nothing to do return 0 } // Edges record dependencies between packages. // {from,to} is in edges if from's package imports to's package. // This list is used to implement reverse edge lookups. type edge struct { from, to loader.Sym } var edges []edge // List of packages that are ready to schedule. We use a lexicographic
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 30 20:09:45 UTC 2024 - 6.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom.go
// to make the work arrays smaller and pointer-free. // fromID translates from ID to *Block where that is needed. fromID := f.Cache.allocBlockSlice(maxBlockID) defer f.Cache.freeBlockSlice(fromID) for _, v := range f.Blocks { fromID[v.ID] = v } idom := make([]*Block, maxBlockID) // Step 1. Carry out a depth first search of the problem graph. Number // the vertices from 1 to n as they are reached during the search.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Dec 03 17:08:51 UTC 2022 - 7.4K bytes - Viewed (0)