hashring

Documentation

Index

• type HashRing
  • func New(numOfVNode uint32) *HashRing
  • func (r *HashRing) AddNode(node *Node)
  • func (r *HashRing) CalcIndex(key string) uint32
  • func (r *HashRing) GetNode(key string) (uint32, string)
  • func (r *HashRing) GetNodeByIndex(keyIndex uint32) (uint32, string)
  • func (r *HashRing) GetNodeExcludedNodeIDs(key string, NodeIDs []string) (uint32, string)
  • func (r *HashRing) GetNodeUpDownNodes(NodeID string) (string, string)
  • func (r *HashRing) IsOnline(ID string) bool
  • func (r *HashRing) Node(ID string) *Node
  • func (r *HashRing) PrintNodes()
  • func (r *HashRing) RandomGetNodes(num int) []*Node
  • func (r *HashRing) RemoveNode(nodeID string) bool
  • func (r *HashRing) SetOffline(ID string)
  • func (r *HashRing) SetOnline(ID string)
  • func (r *HashRing) TraversalNRing()
  • func (r *HashRing) TraversalVRing()
• type Node
  • func (n *Node) Less(than rbtree.Item) bool
• type VNode
  • func (vn *VNode) Less(than rbtree.Item) bool

Types

type HashRing

type HashRing struct {
	VRing           *rbtree.Rbtree
	NRing           *rbtree.Rbtree
	Nodes           *sync.Map       // map(NodeID => *Node)
	NodeStatus      map[string]bool // map(NodeID => status)
	NodeCount       uint32
	NodeOkCount     uint32
	NumberOfVirtual uint32
	sync.Mutex
}

HashRing

func New

func New(numOfVNode uint32) *HashRing

NewHashRing

func (*HashRing) AddNode

func (r *HashRing) AddNode(node *Node)

AddNode

func (*HashRing) CalcIndex

func (r *HashRing) CalcIndex(key string) uint32

CalcIndex

func (*HashRing) GetNode

func (r *HashRing) GetNode(key string) (uint32, string)

GetNode @params key

func (*HashRing) GetNodeByIndex

func (r *HashRing) GetNodeByIndex(keyIndex uint32) (uint32, string)

GetNodeByIndex @params keyIndex

func (*HashRing) GetNodeExcludedNodeIDs

func (r *HashRing) GetNodeExcludedNodeIDs(key string, NodeIDs []string) (uint32, string)

GetNodeMissNodeID get node excluded given NodeIDs @params key

func (*HashRing) GetNodeUpDownNodes

func (r *HashRing) GetNodeUpDownNodes(NodeID string) (string, string)

GetNodeUpDownNodes get upstream of downstream of node @params

func (*HashRing) IsOnline

func (r *HashRing) IsOnline(ID string) bool

func (*HashRing) Node

func (r *HashRing) Node(ID string) *Node

func (*HashRing) PrintNodes

func (r *HashRing) PrintNodes()

PrintNodes print all non-virtual nodes

func (*HashRing) RandomGetNodes

func (r *HashRing) RandomGetNodes(num int) []*Node

func (*HashRing) RemoveNode

func (r *HashRing) RemoveNode(nodeID string) bool

RemoveNode

func (*HashRing) SetOffline

func (r *HashRing) SetOffline(ID string)

func (*HashRing) SetOnline

func (r *HashRing) SetOnline(ID string)

func (*HashRing) TraversalNRing

func (r *HashRing) TraversalNRing()

TraversalNRing traverse non-virtual rbtree

func (*HashRing) TraversalVRing

func (r *HashRing) TraversalVRing()

TraversalVRing traverse virtual rbtree

type Node

type Node struct {
	ID   string
	Host string
	Rest string
	Data *sync.Map
}

Node

func (*Node) Less

func (n *Node) Less(than rbtree.Item) bool

Less of rbtree

type VNode

type VNode struct {
	Index  uint32 // index, crc32 of hashkey
	NodeID string
}

VNode virtual node

func (*VNode) Less

func (vn *VNode) Less(than rbtree.Item) bool

Less of rbtree