|
|
@ -205,7 +205,7 @@ func (m *sortedMap) Remove(nonce uint64) bool { |
|
|
|
// removed from the list.
|
|
|
|
// removed from the list.
|
|
|
|
//
|
|
|
|
//
|
|
|
|
// Note, all transactions with nonces lower than start will also be returned to
|
|
|
|
// Note, all transactions with nonces lower than start will also be returned to
|
|
|
|
// prevent getting into and invalid state. This is not something that should ever
|
|
|
|
// prevent getting into an invalid state. This is not something that should ever
|
|
|
|
// happen but better to be self correcting than failing!
|
|
|
|
// happen but better to be self correcting than failing!
|
|
|
|
func (m *sortedMap) Ready(start uint64) types.Transactions { |
|
|
|
func (m *sortedMap) Ready(start uint64) types.Transactions { |
|
|
|
// Short circuit if no transactions are available
|
|
|
|
// Short circuit if no transactions are available
|
|
|
@ -421,7 +421,7 @@ func (l *list) Remove(tx *types.Transaction) (bool, types.Transactions) { |
|
|
|
// removed from the list.
|
|
|
|
// removed from the list.
|
|
|
|
//
|
|
|
|
//
|
|
|
|
// Note, all transactions with nonces lower than start will also be returned to
|
|
|
|
// Note, all transactions with nonces lower than start will also be returned to
|
|
|
|
// prevent getting into and invalid state. This is not something that should ever
|
|
|
|
// prevent getting into an invalid state. This is not something that should ever
|
|
|
|
// happen but better to be self correcting than failing!
|
|
|
|
// happen but better to be self correcting than failing!
|
|
|
|
func (l *list) Ready(start uint64) types.Transactions { |
|
|
|
func (l *list) Ready(start uint64) types.Transactions { |
|
|
|
txs := l.txs.Ready(start) |
|
|
|
txs := l.txs.Ready(start) |
|
|
|