mirror of
https://github.com/luxfi/sdk.git
synced 2026-10-30 15:19:23 +00:00
zeekayandHanzo Dev
da299df77d
Lux Partners Limited is not the entity behind this work. Every place the old name stood — copyright lines, site footers, brand config, legal and compliance text — now names the company that actually holds it. lux.fund is the exception and is not renamed to match: that site belongs to Lux Assets Management LLC, a different company, and it says so. Two kinds of line were left for a person rather than rewritten. A dated news item recording that Lux Partners Limited was established in the Isle of Man is a historical fact, and renaming it would falsify the record. And a sentence asserting that the company is domiciled in the Isle of Man is a claim about a jurisdiction, not a name — an Inc or an LLC is not an Isle of Man company, so swapping the name there would assert something untrue. Co-authored-by: Hanzo Dev <[email protected]>
184 lines
5.3 KiB
Go
184 lines
5.3 KiB
Go
// Copyright (C) 2020-2025, Lux Industries Inc All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package heap
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/luxfi/ids"
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
type testItem struct {
|
|
id ids.ID
|
|
value uint64
|
|
}
|
|
|
|
func TestUnit64HeapPushPopMin(t *testing.T) {
|
|
require := require.New(t)
|
|
minHeap := New[*testItem, uint64](0, true)
|
|
require.Equal(minHeap.Len(), 0, "heap not initialized properly.")
|
|
mempoolItem1 := &testItem{ids.GenerateTestID(), 10}
|
|
mempoolItem2 := &testItem{ids.GenerateTestID(), 7}
|
|
mempoolItem3 := &testItem{ids.GenerateTestID(), 15}
|
|
|
|
// Middle UnitPrice
|
|
med := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem1.id,
|
|
Item: mempoolItem1,
|
|
Val: mempoolItem1.value,
|
|
Index: minHeap.Len(),
|
|
}
|
|
// Lesser UnitPrice
|
|
low := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem2.id,
|
|
Item: mempoolItem2,
|
|
Val: mempoolItem2.value,
|
|
Index: minHeap.Len(),
|
|
}
|
|
// Greatest UnitPrice
|
|
high := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem3.id,
|
|
Item: mempoolItem3,
|
|
Val: mempoolItem3.value,
|
|
Index: minHeap.Len(),
|
|
}
|
|
minHeap.Push(med)
|
|
minHeap.Push(low)
|
|
minHeap.Push(high)
|
|
// Added all three
|
|
require.Equal(minHeap.Len(), 3, "Not pushed correctly.")
|
|
// Check if added to lookup table
|
|
ok := minHeap.Has(med.ID)
|
|
require.True(ok, "Item not found in lookup.")
|
|
ok = minHeap.Has(low.ID)
|
|
require.True(ok, "Item not found in lookup.")
|
|
ok = minHeap.Has(high.ID)
|
|
require.True(ok, "Item not found in lookup.")
|
|
// Pop and check popped correctly. Order should be 2, 1, 3
|
|
popped := minHeap.Pop()
|
|
require.Equal(low, popped, "Incorrect item removed.")
|
|
popped = minHeap.Pop()
|
|
require.Equal(med, popped, "Incorrect item removed.")
|
|
popped = minHeap.Pop()
|
|
require.Equal(high, popped, "Incorrect item removed.")
|
|
}
|
|
|
|
func TestUnit64HeapPushPopMax(t *testing.T) {
|
|
require := require.New(t)
|
|
maxHeap := New[*testItem, uint64](0, false)
|
|
require.Equal(maxHeap.Len(), 0, "heap not initialized properly.")
|
|
|
|
mempoolItem1 := &testItem{ids.GenerateTestID(), 10}
|
|
mempoolItem2 := &testItem{ids.GenerateTestID(), 7}
|
|
mempoolItem3 := &testItem{ids.GenerateTestID(), 15}
|
|
|
|
// Middle UnitPrice
|
|
med := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem1.id,
|
|
Item: mempoolItem1,
|
|
Val: mempoolItem1.value,
|
|
Index: maxHeap.Len(),
|
|
}
|
|
// Lesser UnitPrice
|
|
low := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem2.id,
|
|
Item: mempoolItem2,
|
|
Val: mempoolItem2.value,
|
|
Index: maxHeap.Len(),
|
|
}
|
|
// Greatest UnitPrice
|
|
high := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem3.id,
|
|
Item: mempoolItem3,
|
|
Val: mempoolItem3.value,
|
|
Index: maxHeap.Len(),
|
|
}
|
|
maxHeap.Push(med)
|
|
maxHeap.Push(low)
|
|
maxHeap.Push(high)
|
|
// Added all three
|
|
require.Equal(maxHeap.Len(), 3, "Not pushed correctly.")
|
|
// Check if added to lookup table
|
|
ok := maxHeap.Has(med.ID)
|
|
require.True(ok, "Item not found in lookup.")
|
|
ok = maxHeap.Has(low.ID)
|
|
require.True(ok, "Item not found in lookup.")
|
|
ok = maxHeap.Has(high.ID)
|
|
require.True(ok, "Item not found in lookup.")
|
|
// Pop and check popped correctly. Order should be 2, 1, 3
|
|
popped := maxHeap.Pop()
|
|
require.Equal(high, popped, "Incorrect item removed.")
|
|
popped = maxHeap.Pop()
|
|
require.Equal(med, popped, "Incorrect item removed.")
|
|
popped = maxHeap.Pop()
|
|
require.Equal(low, popped, "Incorrect item removed.")
|
|
}
|
|
|
|
func TestUnit64HeapPushExists(t *testing.T) {
|
|
// Push an item already in heap
|
|
require := require.New(t)
|
|
minHeap := New[*testItem, uint64](0, true)
|
|
require.Equal(minHeap.Len(), 0, "heap not initialized properly.")
|
|
mempoolItem := &testItem{ids.GenerateTestID(), 10}
|
|
entry := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem.id,
|
|
Item: mempoolItem,
|
|
Val: mempoolItem.value,
|
|
Index: minHeap.Len(),
|
|
}
|
|
minHeap.Push(entry)
|
|
// Pushed correctly
|
|
require.Equal(minHeap.Len(), 1, "Not pushed correctly.")
|
|
// Check if added to lookup table
|
|
ok := minHeap.Has(entry.ID)
|
|
require.True(ok, "Item not found in lookup.")
|
|
minHeap.Push(entry)
|
|
// Only 1 item
|
|
require.Equal(minHeap.Len(), 1, "Not pushed correctly.")
|
|
}
|
|
|
|
func TestUnit64HeapGetID(t *testing.T) {
|
|
// Push an item and grab its ID
|
|
require := require.New(t)
|
|
minHeap := New[*testItem, uint64](0, true)
|
|
require.Equal(minHeap.Len(), 0, "heap not initialized properly.")
|
|
|
|
mempoolItem := &testItem{ids.GenerateTestID(), 10}
|
|
entry := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem.id,
|
|
Item: mempoolItem,
|
|
Val: mempoolItem.value,
|
|
Index: minHeap.Len(),
|
|
}
|
|
_, ok := minHeap.Get(mempoolItem.id)
|
|
require.False(ok, "Entry returned before pushing.")
|
|
minHeap.Push(entry)
|
|
// Pushed correctly
|
|
require.Equal(minHeap.Len(), 1, "Not pushed correctly.")
|
|
entryReturned, ok := minHeap.Get(mempoolItem.id)
|
|
require.True(ok, "Entry not returned.")
|
|
require.Equal(entry, entryReturned, "Returned incorrect entry")
|
|
}
|
|
|
|
func TestUnit64HeapHasID(t *testing.T) {
|
|
require := require.New(t)
|
|
minHeap := New[*testItem, uint64](0, true)
|
|
require.Equal(minHeap.Len(), 0, "heap not initialized properly.")
|
|
mempoolItem := &testItem{ids.GenerateTestID(), 10}
|
|
entry := &Entry[*testItem, uint64]{
|
|
ID: mempoolItem.id,
|
|
Item: mempoolItem,
|
|
Val: mempoolItem.value,
|
|
Index: minHeap.Len(),
|
|
}
|
|
ok := minHeap.Has(mempoolItem.id)
|
|
require.False(ok, "Entry has ID before pushing.")
|
|
minHeap.Push(entry)
|
|
// Pushed correctly
|
|
require.Equal(minHeap.Len(), 1, "Not pushed correctly.")
|
|
ok = minHeap.Has(mempoolItem.id)
|
|
require.True(ok, "Entry was not found in heap.")
|
|
}
|