tideland / go-slices Goto Github PK

• Drop DeleteAllWith() as it is just Filter()
• Move less in IsSortedWith() and SortWith() to first argument position to match other functions

• Add Merge(vsa, vsb) appending and sorting vsa and vsb
• Add UniqueMerge(vsa, vsb) appending, unifying and sorting vsa and vsb
• Add MergeWith(vsa, vsb, less) appending and sorting vsa and vsb using lessto compare the values
• Add UniqueMergeWith(vsa, vsb, less) appending, unifying and sorting vsa and vsb using lessto compare the values

• Add DeleteAllWith(ivs, pred) deleting all values where pred(iv) bool returns true

• Add DropFirst(ivs) removing the first value; returns nil for nil
• Add DropLast(ivs) removing the last value; returns nil for nil

• Move function arguments of sort.go to end position
• Adopt changes is tests

Compare the content of two slices in two function:

• Compare() to compare the elements direct
• CompareWith() to compare the elements with a helper function, e.g. to compare structs

Open questions:

• What is the output?

• Rename comps.go to process.go
• Move function arguments of process.go to end position
• Adopt changes is tests

• Function Sort() is sorting a slice with values implementing the constraints.Ordered constraint
• Function SortWith() is sorting a slice with the help of a less function
• Similar functions IsSorted() and IsSortedWith() for testing

• Move tests.go into slices.go
• Move tests_test.go into tests_test.go
• Drop tests.go and tests_test.go

• DeleteAll() to delete all occurrence of a value
• DeleteWith() to delete the first occurrence where pred() returns true
• DeleteAllWith() to delete all occurrence where pred() returns true

• Function Unique() to find only unique values in slice of comparables
• Function UniqueWith() to find only unique values in any slice with the help of a test function

• Move function arguments of slices.go to end position
• Adopt changes in tests

• Update go.mod to Go 1.19
• Fix links in README

• Build interprets logging in tests as error
• Some tests have no descriptions

• Integrate a shuffle function using

rand.Shuffle(len(items), func(i, j int) {
    items[i], items[j] = items[j], items[i]
})