mirror of
https://github.com/kaspanet/kaspad.git
synced 2025-05-21 22:36:42 +00:00
ce95c6dc9d
* Refactor the Difficulty adjastment to the new design * Add the necessary things to the factory for the DAA constructor * Add missing dagParams to difficultymanager constructor * Use DAGTraversal for blueBlockWindow, and don't store PowMax compactBits
28 lines
829 B
Go
28 lines
829 B
Go
// Copyright (c) 2013-2017 The btcsuite developers
|
|
// Use of this source code is governed by an ISC
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package difficultymanager
|
|
|
|
// timeSorter implements sort.Interface to allow a slice of timestamps to
|
|
// be sorted.
|
|
type timeSorter []int64
|
|
|
|
// Len returns the number of timestamps in the slice. It is part of the
|
|
// sort.Interface implementation.
|
|
func (s timeSorter) Len() int {
|
|
return len(s)
|
|
}
|
|
|
|
// Swap swaps the timestamps at the passed indices. It is part of the
|
|
// sort.Interface implementation.
|
|
func (s timeSorter) Swap(i, j int) {
|
|
s[i], s[j] = s[j], s[i]
|
|
}
|
|
|
|
// Less returns whether the timstamp with index i should sort before the
|
|
// timestamp with index j. It is part of the sort.Interface implementation.
|
|
func (s timeSorter) Less(i, j int) bool {
|
|
return s[i] < s[j]
|
|
}
|