forked from btcsuite/btcd
-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
82e7953
commit efa4083
Showing
35 changed files
with
3,690 additions
and
1,185 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,16 +1,16 @@ | ||
| module github.com/btcsuite/btcd/btcutil | ||
|
|
||
| go 1.16 | ||
| go 1.21.4 | ||
|
|
||
| require ( | ||
| github.com/aead/siphash v1.0.1 | ||
| github.com/btcsuite/btcd v0.23.0 | ||
| github.com/btcsuite/btcd v0.23.4 | ||
| github.com/btcsuite/btcd/btcec/v2 v2.1.3 | ||
| github.com/btcsuite/btcd/chaincfg/chainhash v1.0.1 | ||
| github.com/davecgh/go-spew v1.1.1 | ||
| github.com/decred/dcrd/dcrec/secp256k1/v4 v4.0.1 | ||
| github.com/kkdai/bstream v0.0.0-20161212061736-f391b8402d23 | ||
| golang.org/x/crypto v0.0.0-20200622213623-75b288015ac9 | ||
| golang.org/x/crypto v0.14.0 | ||
| ) | ||
|
|
||
| replace github.com/btcsuite/btcd => ../ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,39 @@ | ||
| treap | ||
| ===== | ||
|
|
||
| [](https://github.com/btcsuite/btcd/actions) | ||
| [](http://copyfree.org) | ||
| [](https://pkg.go.dev/github.com/btcsuite/btcd/database/internal/treap) | ||
|
|
||
| Package treap implements a treap data structure that is used to hold ordered | ||
| key/value pairs using a combination of binary search tree and heap semantics. | ||
| It is a self-organizing and randomized data structure that doesn't require | ||
| complex operations to maintain balance. Search, insert, and delete | ||
| operations are all O(log n). Both mutable and immutable variants are provided. | ||
|
|
||
| The mutable variant is typically faster since it is able to simply update the | ||
| treap when modifications are made. However, a mutable treap is not safe for | ||
| concurrent access without careful use of locking by the caller and care must be | ||
| taken when iterating since it can change out from under the iterator. | ||
|
|
||
| The immutable variant works by creating a new version of the treap for all | ||
| mutations by replacing modified nodes with new nodes that have updated values | ||
| while sharing all unmodified nodes with the previous version. This is extremely | ||
| useful in concurrent applications since the caller only has to atomically | ||
| replace the treap pointer with the newly returned version after performing any | ||
| mutations. All readers can simply use their existing pointer as a snapshot | ||
| since the treap it points to is immutable. This effectively provides O(1) | ||
| snapshot capability with efficient memory usage characteristics since the old | ||
| nodes only remain allocated until there are no longer any references to them. | ||
|
|
||
| Package treap is licensed under the copyfree ISC license. | ||
|
|
||
| ## Usage | ||
|
|
||
| This package is only used internally in the database code and as such is not | ||
| available for use outside of it. | ||
|
|
||
| ## License | ||
|
|
||
| Package treap is licensed under the [copyfree](http://copyfree.org) ISC | ||
| License. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,136 @@ | ||
| // Copyright (c) 2015-2016 The btcsuite developers | ||
| // Use of this source code is governed by an ISC | ||
| // license that can be found in the LICENSE file. | ||
|
|
||
| package treap | ||
|
|
||
| import ( | ||
| "math/rand" | ||
| "time" | ||
| ) | ||
|
|
||
| const ( | ||
| // staticDepth is the size of the static array to use for keeping track | ||
| // of the parent stack during treap iteration. Since a treap has a very | ||
| // high probability that the tree height is logarithmic, it is | ||
| // exceedingly unlikely that the parent stack will ever exceed this size | ||
| // even for extremely large numbers of items. | ||
| staticDepth = 128 | ||
|
|
||
| // nodeFieldsSize is the size the fields of each node takes excluding | ||
| // the contents of the key and value. It assumes 64-bit pointers so | ||
| // technically it is smaller on 32-bit platforms, but overestimating the | ||
| // size in that case is acceptable since it avoids the need to import | ||
| // unsafe. It consists of 24-bytes for each key and value + 8 bytes for | ||
| // each of the priority, left, and right fields (24*2 + 8*3). | ||
| nodeFieldsSize = 72 | ||
| ) | ||
|
|
||
| var ( | ||
| // emptySlice is used for keys that have no value associated with them | ||
| // so callers can distinguish between a key that does not exist and one | ||
| // that has no value associated with it. | ||
| emptySlice = make([]byte, 0) | ||
| ) | ||
|
|
||
| // treapNode represents a node in the treap. | ||
| type treapNode struct { | ||
| key []byte | ||
| value []byte | ||
| priority int | ||
| left *treapNode | ||
| right *treapNode | ||
| } | ||
|
|
||
| // nodeSize returns the number of bytes the specified node occupies including | ||
| // the struct fields and the contents of the key and value. | ||
| func nodeSize(node *treapNode) uint64 { | ||
| return nodeFieldsSize + uint64(len(node.key)+len(node.value)) | ||
| } | ||
|
|
||
| // newTreapNode returns a new node from the given key, value, and priority. The | ||
| // node is not initially linked to any others. | ||
| func newTreapNode(key, value []byte, priority int) *treapNode { | ||
| return &treapNode{key: key, value: value, priority: priority} | ||
| } | ||
|
|
||
| // parentStack represents a stack of parent treap nodes that are used during | ||
| // iteration. It consists of a static array for holding the parents and a | ||
| // dynamic overflow slice. It is extremely unlikely the overflow will ever be | ||
| // hit during normal operation, however, since a treap's height is | ||
| // probabilistic, the overflow case needs to be handled properly. This approach | ||
| // is used because it is much more efficient for the majority case than | ||
| // dynamically allocating heap space every time the treap is iterated. | ||
| type parentStack struct { | ||
| index int | ||
| items [staticDepth]*treapNode | ||
| overflow []*treapNode | ||
| } | ||
|
|
||
| // Len returns the current number of items in the stack. | ||
| func (s *parentStack) Len() int { | ||
| return s.index | ||
| } | ||
|
|
||
| // At returns the item n number of items from the top of the stack, where 0 is | ||
| // the topmost item, without removing it. It returns nil if n exceeds the | ||
| // number of items on the stack. | ||
| func (s *parentStack) At(n int) *treapNode { | ||
| index := s.index - n - 1 | ||
| if index < 0 { | ||
| return nil | ||
| } | ||
|
|
||
| if index < staticDepth { | ||
| return s.items[index] | ||
| } | ||
|
|
||
| return s.overflow[index-staticDepth] | ||
| } | ||
|
|
||
| // Pop removes the top item from the stack. It returns nil if the stack is | ||
| // empty. | ||
| func (s *parentStack) Pop() *treapNode { | ||
| if s.index == 0 { | ||
| return nil | ||
| } | ||
|
|
||
| s.index-- | ||
| if s.index < staticDepth { | ||
| node := s.items[s.index] | ||
| s.items[s.index] = nil | ||
| return node | ||
| } | ||
|
|
||
| node := s.overflow[s.index-staticDepth] | ||
| s.overflow[s.index-staticDepth] = nil | ||
| return node | ||
| } | ||
|
|
||
| // Push pushes the passed item onto the top of the stack. | ||
| func (s *parentStack) Push(node *treapNode) { | ||
| if s.index < staticDepth { | ||
| s.items[s.index] = node | ||
| s.index++ | ||
| return | ||
| } | ||
|
|
||
| // This approach is used over append because reslicing the slice to pop | ||
| // the item causes the compiler to make unneeded allocations. Also, | ||
| // since the max number of items is related to the tree depth which | ||
| // requires expontentially more items to increase, only increase the cap | ||
| // one item at a time. This is more intelligent than the generic append | ||
| // expansion algorithm which often doubles the cap. | ||
| index := s.index - staticDepth | ||
| if index+1 > cap(s.overflow) { | ||
| overflow := make([]*treapNode, index+1) | ||
| copy(overflow, s.overflow) | ||
| s.overflow = overflow | ||
| } | ||
| s.overflow[index] = node | ||
| s.index++ | ||
| } | ||
|
|
||
| func init() { | ||
| rand.Seed(time.Now().UnixNano()) | ||
| } |
Oops, something went wrong.