Sort

[maxatome]

usage:

Sort(HOW_TO_SORT, TESTDEEP_OPERATOR|EXPECTED_VALUE)

Sort would be a smuggler operator allowing to sort a slice or an array before comparing its content.

Accepted input: any slice or array.
Output: slice

If the input is []T or [n]T, HOW_TO_SORT can be:

• 1 or any int > 0: checks the slice/array is ordered in ascending order;
• -1 or any int < 0: checks the slice/array is ordered in descending order;
• func (a, b T) bool returning true if a < b: checks the slice/array is ordered according to the function passed;
• []string{"FIELD1", "FIELD2", …}: only if T is a struct or a pointer on a struct, checks the slice/array of structs is ordered by struct field FIELD1, then by field FIELD2, …
  Fields can be prefixed by "-" to specify a descending order instead of ascending default one.

Unless for the func (a, b T) bool case, sorting would be handled the same way tdutil.SortableValues does.

Examples of use:

got := []int{4, -1, 2, 0, 4}

// This one succeeds
td.Cmp(t, got, td.Sort(1, []int{-3, -1, 0, 2, 4}))

// As this one
td.Cmp(t, got, td.Sort(-1, []int{4, 2, 0, -1, -3}))

// Success using a function
td.Cmp(t, got, td.Sort(func (a, b int) bool { return a < b }, []int{-3, -1, 0, 2, 4}))

Other examples of HOW_TO_SORT values can be found in Sorted discussion & examples.

Note: the goal is not to replace Bag but to provide an alternative. In the case of slice of big structs, the Bag error report is sometimes hard to read while only one field mismatches.

[maxatome]

Implemented in branch sort, doc & tests to be completed, examples to be done.