HsaSet ground floor by an array to store the hash value, under the hash value chain table with element, a hash value more than 8 hanging element is changed to red and black tree storage element

Linkedhashset is based on the hashset singly linked list into the can record the order of double chain list
So did the linkedhashset red-black tree? If there is one more than eight elements become red and black tree, the role of double chain chain table and the
Whether linkedhashset is red and black tree, with more than eight elements or double chain list, it is much slower than hashset query?
To solve the ah,

CodePudding user response:

Well the red-black tree sort function