backsync

package module

v0.0.0-...-a4a2b2c Latest Latest Go to latest Published: Dec 6, 2017 License: GPL-3.0 Imports: 4 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type Candidate struct {
	// contains filtered or unexported fields
}

type CandidateByScore []Candidate

func (a CandidateByScore) Len() int

func (a CandidateByScore) Less(i, j int) bool

func (a CandidateByScore) Swap(i, j int)

type Manager struct {
	// contains filtered or unexported fields
}

func New(r *redis.Client, itemSetName, updateTimeHashName, inuseTimeHashName string, timeLimit, minIdleTime time.Duration) *Manager

func (m *Manager) Add(item string) error

func (m *Manager) Delete(items []string) error

func (m *Manager) Top(n int) (items []string, err error)

to probe for 8*n candidate, and return the atmost least-update n items thus, the Top will return least updated 12.5% records, it is quite good approx

if minIdleSec > 0, then the library will only return record with idle time > minIdleSec