Home
last modified time | relevance | path

Searched +defs:Tree +defs:delete (Results 1 – 25 of 131) sorted by relevance

123456

/dports/security/vault/vault-1.8.2/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go23 type Tree struct { struct
24 root *Node
25 size int
35 func (t *Tree) Len() int {
49 func (t *Tree) Txn() *Txn {
190 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
285 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
293 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
301 func (t *Tree) Root() *Node {
307 func (t *Tree) Get(k []byte) (interface{}, bool) {
/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.go23 type Tree struct { struct
24 root *Node
25 size int
35 func (t *Tree) Len() int {
49 func (t *Tree) Txn() *Txn {
190 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
285 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
293 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
301 func (t *Tree) Root() *Node {
307 func (t *Tree) Get(k []byte) (interface{}, bool) {
/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.go23 type Tree struct { struct
24 root *Node
25 size int
35 func (t *Tree) Len() int {
49 func (t *Tree) Txn() *Txn {
190 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
285 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
293 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
301 func (t *Tree) Root() *Node {
307 func (t *Tree) Get(k []byte) (interface{}, bool) {
/dports/sysutils/helm/helm-3.5.2/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go23 type Tree struct { struct
24 root *Node
25 size int
35 func (t *Tree) Len() int {
49 func (t *Tree) Txn() *Txn {
190 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
285 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
293 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
301 func (t *Tree) Root() *Node {
307 func (t *Tree) Get(k []byte) (interface{}, bool) {
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/emirpasic/gods/gods-1.12.0/trees/btree/
H A Dbtree.go32 type Tree struct { struct
109 func (tree *Tree) Empty() bool {
114 func (tree *Tree) Size() int {
139 func (tree *Tree) Clear() {
145 func (tree *Tree) Height() int {
150 func (tree *Tree) Left() *Node {
171 func (tree *Tree) Right() *Node {
192 func (tree *Tree) String() string {
259 func (tree *Tree) middle() int {
376 func (tree *Tree) splitRoot() {
[all …]
/dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go32 type Tree struct { struct
109 func (tree *Tree) Empty() bool {
114 func (tree *Tree) Size() int {
139 func (tree *Tree) Clear() {
145 func (tree *Tree) Height() int {
150 func (tree *Tree) Left() *Node {
171 func (tree *Tree) Right() *Node {
192 func (tree *Tree) String() string {
259 func (tree *Tree) middle() int {
376 func (tree *Tree) splitRoot() {
[all …]
/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go32 type Tree struct { struct
109 func (tree *Tree) Empty() bool {
114 func (tree *Tree) Size() int {
139 func (tree *Tree) Clear() {
145 func (tree *Tree) Height() int {
150 func (tree *Tree) Left() *Node {
171 func (tree *Tree) Right() *Node {
192 func (tree *Tree) String() string {
259 func (tree *Tree) middle() int {
376 func (tree *Tree) splitRoot() {
[all …]
/dports/sysutils/gomplate/gomplate-3.9.0/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go32 type Tree struct { struct
109 func (tree *Tree) Empty() bool {
114 func (tree *Tree) Size() int {
139 func (tree *Tree) Clear() {
145 func (tree *Tree) Height() int {
150 func (tree *Tree) Left() *Node {
171 func (tree *Tree) Right() *Node {
192 func (tree *Tree) String() string {
259 func (tree *Tree) middle() int {
376 func (tree *Tree) splitRoot() {
[all …]
/dports/devel/gitty/gitty-0.3.0/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go32 type Tree struct { struct
109 func (tree *Tree) Empty() bool {
114 func (tree *Tree) Size() int {
139 func (tree *Tree) Clear() {
145 func (tree *Tree) Height() int {
150 func (tree *Tree) Left() *Node {
171 func (tree *Tree) Right() *Node {
192 func (tree *Tree) String() string {
259 func (tree *Tree) middle() int {
376 func (tree *Tree) splitRoot() {
[all …]
/dports/databases/prometheus-postgresql-adapter/prometheus-postgresql-adapter-0.6.0/vendor/github.com/prometheus/prometheus/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/github.com/docker/docker/moby-20.10.2/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
601 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
609 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
617 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
625 func (t *Tree) Root() *Node {
[all …]
/dports/sysutils/helmfile/vault-f6547fa8e820/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
601 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
609 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
617 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
625 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-secrets-kv/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-auth-kerberos/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-secrets-terraform/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-secrets-gcp/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-secrets-mongodbatlas/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-auth-gcp/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-auth-jwt/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-auth-kubernetes/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-secrets-alicloud/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-database-couchbase/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-database-elasticsearch/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-database-mongodbatlas/vendor/github.com/hashicorp/go-immutable-radix/
H A Diradix.go26 type Tree struct { struct
27 root *Node
28 size int
42 func (t *Tree) Len() int {
80 func (t *Tree) Txn() *Txn {
335 func (t *Txn) delete(parent, n *Node, search []byte) (*Node, *leafNode) { func
606 func (t *Tree) Insert(k []byte, v interface{}) (*Tree, interface{}, bool) {
614 func (t *Tree) Delete(k []byte) (*Tree, interface{}, bool) {
622 func (t *Tree) DeletePrefix(k []byte) (*Tree, bool) {
630 func (t *Tree) Root() *Node {
[all …]

123456