Home
last modified time | relevance | path

Searched refs:polynomes (Results 1 – 25 of 33) sorted by relevance

12

/dports/security/lego/lego-4.5.3/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/net/storj/storj-1.45.3/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/sysutils/helmfile/vault-f6547fa8e820/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/security/vault/vault-1.8.2/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/www/gitea/gitea-1.16.5/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/devel/awless/awless-0.1.11/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/misc/concourse/vault-bdd38fca2cff/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/sysutils/gomplate/gomplate-3.9.0/vendor/github.com/hashicorp/vault/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/sysutils/helmfile/helmfile-0.138.7/vendor/github.com/hashicorp/vault/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/devel/gitlab-runner/vault-sdk-v0.1.13/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/misc/concourse/concourse-6.7.2/vendor/github.com/hashicorp/vault/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/sysutils/gomplate/vault-sdk-v0.1.13/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/github.com/hashicorp/vault/vault-api-v1.0.4/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/net/traefik/traefik-2.6.1/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/sysutils/istio/vault-sdk-v0.1.12/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/ftp/sftpgo/sftpgo-2.2.0/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/hashicorp/vault/vendor/github.com/boombuler/barcode/utils/
H A Dreedsolomon.go9 polynomes []*GFPoly member
23 if degree >= len(rs.polynomes) {
24 last := rs.polynomes[len(rs.polynomes)-1]
25 for d := len(rs.polynomes); d <= degree; d++ {
27 rs.polynomes = append(rs.polynomes, next)
31 return rs.polynomes[degree]
/dports/math/scilab/scilab-6.1.1/scilab/modules/randlib/macros/
H A D%grand_perm.sci16 // All data types are supported: Integers, reals, complexes, strings, polynomes..
37 // // with polynomes:
/dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/crypto-api-0.13.3/
H A Dcrypto-api.cabal33 Description: Build all the CMAC polynomes up to 10000 bits instead of just the usual ones
/dports/devel/hs-git-annex/git-annex-8.20210903/_cabal_deps/crypto-api-0.13.3/
H A Dcrypto-api.cabal33 Description: Build all the CMAC polynomes up to 10000 bits instead of just the usual ones
/dports/science/gnudatalanguage/gdl-1.0.1/testsuite/
H A Dtest_fx_root.pro134 ; FX_ROOT can be used to search for complex roots of polynomes.
/dports/math/giacxcas/giac-1.6.0/check/
H A DTP03-sol.cas2 gcd(6,3);#Attention, a priori pour lui c'est des polynomes, on a dela chance il les normalise bien.
H A DTP14-sol.cas8 …pace. De plus, il faut aussi faire attention pour les� coefficients des polynomes, on les veut tou…
H A DTP16-sol.cas100 … et un autre de degre 1. Mais en un point�ou x^2+y^2=1, le degre de ces polynomes chute de 1, et l…
/dports/math/giacxcas/giac-1.6.0/src/
H A Dall_global_var6 Relatif a l'affichage pendant le pgcd de polynomes, pas grave

12