Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type ExecQueue ¶
type ExecQueue struct {
// contains filtered or unexported fields
}
ExecQueue implements a queue that executes function calls in a single thread, in the same order as they have been queued.
func NewExecQueue ¶
NewExecQueue creates a new execution Queue.
func (*ExecQueue) CanQueue ¶
CanQueue returns true if more function calls can be added to the execution Queue.
type ExpirationFactor ¶
ExpirationFactor is calculated from logOffset. 1 <= Factor < 2 and Factor*2^Exp describes the multiplier applicable for additions and the divider for readouts. If logOffset changes slowly then it saves some expensive operations to not calculate them for each addition and readout but cache this intermediate form for some time. It is also useful for structures where multiple values are expired with the same Expirer.
func ExpFactor ¶
func ExpFactor(logOffset Fixed64) ExpirationFactor
ExpFactor calculates ExpirationFactor based on logOffset
type ExpiredValue ¶
type ExpiredValue struct {
Base, Exp uint64 // rlp encoding works by default
}
ExpiredValue is a scalar value that is continuously expired (decreased exponentially) based on the provided logarithmic expiration offset value.
The formula for value calculation is: base*2^(exp-logOffset). In order to simplify the calculation of ExpiredValue, its value is expressed in the form of an exponent with a base of 2.
Also here is a trick to reduce a lot of calculations. In theory, when a value X decays over time and then a new value Y is added, the final result should be X*2^(exp-logOffset)+Y. However it's very hard to represent in memory. So the trick is using the idea of inflation instead of exponential decay. At this moment the temporary value becomes: X*2^exp+Y*2^logOffset_1, apply the exponential decay when we actually want to calculate the value.
e.g. t0: V = 100 t1: add 30, inflationary value is: 100 + 30/0.3, 0.3 is the decay coefficient t2: get value, decay coefficient is 0.2 now, final result is: 200*0.2 = 40
func (*ExpiredValue) Add ¶
func (e *ExpiredValue) Add(amount int64, logOffset Fixed64) int64
Add adds a signed value at the given moment
func (*ExpiredValue) AddExp ¶
func (e *ExpiredValue) AddExp(a ExpiredValue)
AddExp adds another ExpiredValue
func (*ExpiredValue) IsZero ¶
func (e *ExpiredValue) IsZero() bool
IsZero returns true if the value is zero
func (*ExpiredValue) SubExp ¶
func (e *ExpiredValue) SubExp(a ExpiredValue)
SubExp subtracts another ExpiredValue
func (ExpiredValue) Value ¶
func (e ExpiredValue) Value(logOffset Fixed64) uint64
Value calculates the value at the given moment.
type Expirer ¶
type Expirer struct {
// contains filtered or unexported fields
}
Expirer changes logOffset with a linear rate which can be changed during operation. It is not thread safe, if access by multiple goroutines is needed then it should be encapsulated into a locked structure. Note that if neither SetRate nor SetLogOffset are used during operation then LogOffset is thread safe.
func (*Expirer) SetLogOffset ¶
SetLogOffset sets logOffset instantly.
type Fixed64 ¶
type Fixed64 int64
Fixed64 implements 64-bit fixed point arithmetic functions.
func Float64ToFixed64 ¶
Float64ToFixed64 converts float64 to Fixed64 format.
func Uint64ToFixed64 ¶
Uint64ToFixed64 converts uint64 integer to Fixed64 format.
type Limiter ¶
type Limiter struct {
// contains filtered or unexported fields
}
Limiter protects a network request serving mechanism from denial-of-service attacks. It limits the total amount of resources used for serving requests while ensuring that the most valuable connections always have a reasonable chance of being served.
func (*Limiter) Add ¶
Add adds a new request to the node queue belonging to the given id. Value belongs to the requesting node. A higher value gives the request a higher chance of being served quickly in case of heavy load or a DDoS attack. Cost is a rough estimate of the serving cost of the request. A lower cost also gives the request a better chance.
type LinearExpiredValue ¶
type LinearExpiredValue struct {
Offset uint64 // The latest time offset
Val uint64 // The remaining value, can never be negative
Rate mclock.AbsTime `rlp:"-"` // Expiration rate(by nanosecond), will ignored by RLP
}
LinearExpiredValue is very similar with the expiredValue which the value will continuously expired. But the different part is it's expired linearly.
type UpdateTimer ¶
type UpdateTimer struct {
// contains filtered or unexported fields
}
func NewUpdateTimer ¶
func NewUpdateTimer(clock mclock.Clock, threshold time.Duration) *UpdateTimer
type ValueExpirer ¶
type ValueExpirer interface {
SetRate(now mclock.AbsTime, rate float64)
SetLogOffset(now mclock.AbsTime, logOffset Fixed64)
LogOffset(now mclock.AbsTime) Fixed64
}
ValueExpirer controls value expiration rate
type WeightedRandomSelect ¶
type WeightedRandomSelect struct {
// contains filtered or unexported fields
}
WeightedRandomSelect is capable of weighted random selection from a set of items
func NewWeightedRandomSelect ¶
func NewWeightedRandomSelect(wfn WeightFn) *WeightedRandomSelect
NewWeightedRandomSelect returns a new WeightedRandomSelect structure
func (*WeightedRandomSelect) Choose ¶
func (w *WeightedRandomSelect) Choose() WrsItem
Choose randomly selects an item from the set, with a chance proportional to its current weight. If the weight of the chosen element has been decreased since the last stored value, returns it with a newWeight/oldWeight chance, otherwise just updates its weight and selects another one
func (*WeightedRandomSelect) IsEmpty ¶
func (w *WeightedRandomSelect) IsEmpty() bool
IsEmpty returns true if the set is empty
func (*WeightedRandomSelect) Remove ¶
func (w *WeightedRandomSelect) Remove(item WrsItem)
Remove removes an item from the set
func (*WeightedRandomSelect) Update ¶
func (w *WeightedRandomSelect) Update(item WrsItem)
Update updates an item's weight, adds it if it was non-existent or removes it if the new weight is zero. Note that explicitly updating decreasing weights is not necessary.
Source Files