Home
last modified time | relevance | path

Searched refs:longestPrefix (Results 1 – 25 of 200) sorted by relevance

12345678

/dports/lang/solidity/solidity_0.8.11/libsolidity/interface/
H A DImportRemapper.cpp51 size_t longestPrefix = 0; in apply() local
67 if (prefix.length() < longestPrefix && context.length() == longestContext) in apply()
74 longestPrefix = prefix.length(); in apply()
78 path.append(_path.begin() + static_cast<string::difference_type>(longestPrefix), _path.end()); in apply()
/dports/biology/abyss/abyss-2.3.1/MergePaths/
H A DPathConsensus.cpp300 size_t longestPrefix, size_t longestSuffix, in outputNewContig() argument
305 assert(longestPrefix > 0); in outputNewContig()
322 first = path.begin() + longestPrefix, in outputNewContig()
341 *(solutions[0].begin() + longestPrefix - 1), in outputNewContig()
562 size_t longestPrefix; in alignMulti() local
564 for (longestPrefix = 0; in alignMulti()
565 longestPrefix < min_len; longestPrefix++) { in alignMulti()
569 const ContigNode& pathnode = (*solIter)[longestPrefix]; in alignMulti()
609 assert(longestPrefix > 0 && longestSuffix > 0); in alignMulti()
615 Path path(solIter->begin() + longestPrefix, in alignMulti()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/devtools-frontend/src/test/unittests/front_end/common/
H A DTrie_test.ts55 assert.strictEqual(trie.longestPrefix('supercalifragilisticexpialidocious', false), 'superca');
58 assert.strictEqual(trie.longestPrefix('supercalifragilisticexpialidocious', true), 'super');
/dports/biology/abyss/abyss-2.3.1/SimpleGraph/
H A DSimpleGraph.cpp338 size_t longestPrefix; in constructAmbiguousPath() local
340 for (longestPrefix = 0; in constructAmbiguousPath()
341 longestPrefix < min_len; longestPrefix++) { in constructAmbiguousPath()
342 const ContigNode& common_path_node = firstSol[longestPrefix]; in constructAmbiguousPath()
345 const ContigNode& pathnode = (*solIter)[longestPrefix]; in constructAmbiguousPath()
362 longestSuffix < min_len-longestPrefix; longestSuffix++) { in constructAmbiguousPath()
388 longestPrefix, longestSuffix); in constructAmbiguousPath()
/dports/dns/dnscrypt-proxy2/dnscrypt-proxy-2.1.1/vendor/github.com/k-sone/critbitgo/
H A Dcritbit.go277 return longestPrefix(&t.root, given)
280 func longestPrefix(n *node, key []byte) ([]byte, interface{}, bool) { func
283 if k, v, ok := longestPrefix(&n.internal.child[direction], key); ok {
287 return longestPrefix(&n.internal.child[0], key)
/dports/sysutils/rest-server/rest-server-0.10.0/vendor/goji.io/
H A Drouter_trie.go113 func longestPrefix(a, b string) string { func
147 lp := longestPrefix(prefix, tn.children[i].prefix)
/dports/sysutils/rest-server/goji-2.0.2/
H A Drouter_trie.go113 func longestPrefix(a, b string) string { func
147 lp := longestPrefix(prefix, tn.children[i].prefix)
/dports/www/webhook/webhook-2.8.0/vendor/github.com/go-chi/chi/chi-4.0.2/
H A Dtree.go179 commonPrefix := longestPrefix(search, n.prefix)
551 idx = longestPrefix(pattern, n.prefix)
560 idx = longestPrefix(pattern, "*")
735 func longestPrefix(k1, k2 string) int { func
/dports/www/webhook/webhook-2.8.0/vendor/github.com/go-chi/chi/
H A Dtree.go179 commonPrefix := longestPrefix(search, n.prefix)
551 idx = longestPrefix(pattern, n.prefix)
560 idx = longestPrefix(pattern, "*")
735 func longestPrefix(k1, k2 string) int { func
/dports/security/vault/vault-1.8.2/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go135 commonPrefix := longestPrefix(search, child.prefix)
313 func longestPrefix(k1, k2 []byte) int { func
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go135 commonPrefix := longestPrefix(search, child.prefix)
313 func longestPrefix(k1, k2 []byte) int { func
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/docker/swarmkit/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go135 commonPrefix := longestPrefix(search, child.prefix)
313 func longestPrefix(k1, k2 []byte) int { func
/dports/sysutils/helm/helm-3.5.2/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go135 commonPrefix := longestPrefix(search, child.prefix)
313 func longestPrefix(k1, k2 []byte) int { func
/dports/net/rclone/rclone-1.57.0/vendor/github.com/go-chi/chi/v5/
H A Dtree.go178 commonPrefix := longestPrefix(search, n.prefix)
569 idx = longestPrefix(pattern, n.prefix)
578 idx = longestPrefix(pattern, "*")
753 func longestPrefix(k1, k2 string) int { func
/dports/www/gitea/gitea-1.16.5/vendor/github.com/go-chi/chi/v5/
H A Dtree.go178 commonPrefix := longestPrefix(search, n.prefix)
569 idx = longestPrefix(pattern, n.prefix)
578 idx = longestPrefix(pattern, "*")
753 func longestPrefix(k1, k2 string) int { func
/dports/dns/blocky/blocky-0.17/vendor/github.com/go-chi/chi/
H A Dtree.go179 commonPrefix := longestPrefix(search, n.prefix)
568 idx = longestPrefix(pattern, n.prefix)
577 idx = longestPrefix(pattern, "*")
752 func longestPrefix(k1, k2 string) int { func
/dports/net/clash/clash-1.6.0/vendor/github.com/go-chi/chi/v5/
H A Dtree.go178 commonPrefix := longestPrefix(search, n.prefix)
569 idx = longestPrefix(pattern, n.prefix)
578 idx = longestPrefix(pattern, "*")
753 func longestPrefix(k1, k2 string) int { func
/dports/ftp/sftpgo/sftpgo-2.2.0/vendor/github.com/go-chi/chi/v5/
H A Dtree.go178 commonPrefix := longestPrefix(search, n.prefix)
569 idx = longestPrefix(pattern, n.prefix)
578 idx = longestPrefix(pattern, "*")
753 func longestPrefix(k1, k2 string) int { func
/dports/audio/visp-go/visp-2585747/vendor/github.com/go-chi/chi/
H A Dtree.go178 commonPrefix := longestPrefix(search, n.prefix)
569 idx = longestPrefix(pattern, n.prefix)
578 idx = longestPrefix(pattern, "*")
753 func longestPrefix(k1, k2 string) int { func
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/go-chi/chi/
H A Dtree.go179 commonPrefix := longestPrefix(search, n.prefix)
568 idx = longestPrefix(pattern, n.prefix)
577 idx = longestPrefix(pattern, "*")
752 func longestPrefix(k1, k2 string) int { func
/dports/security/vault/vault-1.8.2/vendor/github.com/docker/docker/vendor/github.com/armon/go-radix/
H A Dradix.go119 func longestPrefix(k1, k2 string) int { func
178 commonPrefix := longestPrefix(search, n.prefix)
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/github.com/docker/docker/moby-20.10.2/vendor/github.com/armon/go-radix/
H A Dradix.go119 func longestPrefix(k1, k2 string) int { func
178 commonPrefix := longestPrefix(search, n.prefix)
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/docker/docker/vendor/github.com/armon/go-radix/
H A Dradix.go119 func longestPrefix(k1, k2 string) int { func
178 commonPrefix := longestPrefix(search, n.prefix)
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/docker/docker/vendor/github.com/armon/go-radix/
H A Dradix.go119 func longestPrefix(k1, k2 string) int { func
178 commonPrefix := longestPrefix(search, n.prefix)
/dports/sysutils/docker/docker-ce-18.09.5/components/engine/vendor/github.com/armon/go-radix/
H A Dradix.go119 func longestPrefix(k1, k2 string) int { func
178 commonPrefix := longestPrefix(search, n.prefix)

12345678