Add unit tests for the formula function UNIQUE

- Update dependencies modules

Author: xuri

calc.go

@@ -14582,21 +14582,19 @@ func (fn *formulaFuncs) UNICODE(argsList *list.List) formulaArg {
 	return fn.code("UNICODE", argsList)
 }
 
-// UNIQUE function returns a list of unique values in a list or range.
-// For syntax refer to
-// https://support.microsoft.com/en-us/office/unique-function-c5ab87fd-30a3-4ce9-9d1a-40204fb85e1e.
+// UNIQUE function returns a list of unique values in a list or range. The
+// syntax of the function is:
+//
+//	UNIQUE(array,[by_col],[exactly_once])
 func (fn *formulaFuncs) UNIQUE(argsList *list.List) formulaArg {
 	args, errArg := getFormulaUniqueArgs(argsList)
 	if errArg != nil {
 		return *errArg
 	}
-
 	if args.byColumn {
 		args.cellRange, args.cols, args.rows = transposeFormulaArgsList(args.cellRange, args.cols, args.rows)
 	}
-
 	counts := map[string]int{}
-
 	for i := 0; i < len(args.cellRange); i += args.cols {
 		key := concatValues(args.cellRange[i : i+args.cols])
 
@@ -14605,9 +14603,7 @@ func (fn *formulaFuncs) UNIQUE(argsList *list.List) formulaArg {
 		}
 		counts[key]++
 	}
-
 	uniqueAxes := [][]formulaArg{}
-
 	for i := 0; i < len(args.cellRange); i += args.cols {
 		key := concatValues(args.cellRange[i : i+args.cols])
 
@@ -14616,37 +14612,33 @@ func (fn *formulaFuncs) UNIQUE(argsList *list.List) formulaArg {
 		}
 		delete(counts, key)
 	}
-
 	if args.byColumn {
 		uniqueAxes = transposeFormulaArgsMatrix(uniqueAxes)
 	}
-
 	return newMatrixFormulaArg(uniqueAxes)
 }
 
+// transposeFormulaArgsMatrix transposes a 2D slice of formulaArg.
 func transposeFormulaArgsMatrix(args [][]formulaArg) [][]formulaArg {
 	if len(args) == 0 {
 		return args
 	}
-
 	transposedArgs := make([][]formulaArg, len(args[0]))
-
 	for i := 0; i < len(args[0]); i++ {
 		transposedArgs[i] = make([]formulaArg, len(args))
 	}
-
 	for i := 0; i < len(args); i++ {
 		for j := 0; j < len(args[i]); j++ {
 			transposedArgs[j][i] = args[i][j]
 		}
 	}
-
 	return transposedArgs
 }
 
+// transposeFormulaArgsList transposes a flat slice of formulaArg given the
+// number of columns and rows.
 func transposeFormulaArgsList(args []formulaArg, cols, rows int) ([]formulaArg, int, int) {
 	transposedArgs := make([]formulaArg, len(args))
-
 	for i := 0; i < rows; i++ {
 		for j := 0; j < cols; j++ {
 			transposedArgs[j*rows+i] = args[i*cols+j]
@@ -14655,6 +14647,8 @@ func transposeFormulaArgsList(args []formulaArg, cols, rows int) ([]formulaArg,
 	return transposedArgs, rows, cols
 }
 
+// concatValues concatenates the values of a slice of formulaArg into a single
+// string.
 func concatValues(args []formulaArg) string {
 	val := ""
 	for _, arg := range args {
@@ -14664,6 +14658,7 @@ func concatValues(args []formulaArg) string {
 	return val
 }
 
+// uniqueArgs holds the parsed arguments for the UNIQUE function.
 type uniqueArgs struct {
 	cellRange   []formulaArg
 	cols        int
@@ -14672,22 +14667,21 @@ type uniqueArgs struct {
 	exactlyOnce bool
 }
 
+// getFormulaUniqueArgs parses and validates the arguments for the UNIQUE
+// function.
 func getFormulaUniqueArgs(argsList *list.List) (uniqueArgs, *formulaArg) {
 	res := uniqueArgs{}
-
 	argsLen := argsList.Len()
 	if argsLen == 0 {
 		errArg := newErrorFormulaArg(formulaErrorVALUE, "UNIQUE requires at least 1 argument")
 		return res, &errArg
 	}
-
 	if argsLen > 3 {
 		msg := fmt.Sprintf("UNIQUE takes at most 3 arguments, received %d arguments", argsLen)
 		errArg := newErrorFormulaArg(formulaErrorVALUE, msg)
 
 		return res, &errArg
 	}
-
 	firstArg := argsList.Front()
 	res.cellRange = firstArg.Value.(formulaArg).ToList()
 	if len(res.cellRange) == 0 {
@@ -14697,33 +14691,27 @@ func getFormulaUniqueArgs(argsList *list.List) (uniqueArgs, *formulaArg) {
 	if res.cellRange[0].Type == ArgError {
 		return res, &res.cellRange[0]
 	}
-
 	rmin, rmax := calcColsRowsMinMax(false, argsList)
 	cmin, cmax := calcColsRowsMinMax(true, argsList)
 	res.cols, res.rows = cmax-cmin+1, rmax-rmin+1
-
 	secondArg := firstArg.Next()
 	if secondArg == nil {
 		return res, nil
 	}
-
 	argByColumn := secondArg.Value.(formulaArg).ToBool()
 	if argByColumn.Type == ArgError {
 		return res, &argByColumn
 	}
 	res.byColumn = (argByColumn.Value() == "TRUE")
-
 	thirdArg := secondArg.Next()
 	if thirdArg == nil {
 		return res, nil
 	}
-
 	argExactlyOnce := thirdArg.Value.(formulaArg).ToBool()
 	if argExactlyOnce.Type == ArgError {
 		return res, &argExactlyOnce
 	}
 	res.exactlyOnce = (argExactlyOnce.Value() == "TRUE")
-
 	return res, nil
 }
 

calc_test.go

@@ -5240,6 +5240,24 @@ func TestCalcUniqueErrors(t *testing.T) {
 	}
 }
 
+func TestTransposeFormulaArgsMatrix(t *testing.T) {
+	assert.Empty(t, transposeFormulaArgsMatrix([][]formulaArg{}))
+}
+
+func TestGetFormulaUniqueArgs(t *testing.T) {
+	argsList := list.New()
+	emptyArg := newEmptyFormulaArg()
+	argsList.PushBack(emptyArg)
+
+	_, err := getFormulaUniqueArgs(argsList)
+	assert.Equal(t, "missing first argument to UNIQUE", err.Error)
+
+	argsList = list.New()
+	argsList.PushBack(newListFormulaArg([]formulaArg{newErrorFormulaArg(formulaErrorNAME, formulaErrorNAME)}))
+	_, err = getFormulaUniqueArgs(argsList)
+	assert.Equal(t, formulaErrorNAME, err.Error)
+}
+
 func TestCalcDatabase(t *testing.T) {
 	cellData := [][]interface{}{
 		{"Tree", "Height", "Age", "Yield", "Profit", "Height"},

go.mod

@@ -8,10 +8,10 @@ require (
 	github.com/tiendc/go-deepcopy v1.7.1
 	github.com/xuri/efp v0.0.1
 	github.com/xuri/nfp v0.0.2-0.20250530014748-2ddeb826f9a9
-	golang.org/x/crypto v0.43.0
+	golang.org/x/crypto v0.45.0
 	golang.org/x/image v0.25.0
-	golang.org/x/net v0.46.0
-	golang.org/x/text v0.30.0
+	golang.org/x/net v0.47.0
+	golang.org/x/text v0.31.0
 )
 
 require (

go.sum

@@ -15,14 +15,14 @@ github.com/xuri/efp v0.0.1 h1:fws5Rv3myXyYni8uwj2qKjVaRP30PdjeYe2Y6FDsCL8=
 github.com/xuri/efp v0.0.1/go.mod h1:ybY/Jr0T0GTCnYjKqmdwxyxn2BQf2RcQIIvex5QldPI=
 github.com/xuri/nfp v0.0.2-0.20250530014748-2ddeb826f9a9 h1:+C0TIdyyYmzadGaL/HBLbf3WdLgC29pgyhTjAT/0nuE=
 github.com/xuri/nfp v0.0.2-0.20250530014748-2ddeb826f9a9/go.mod h1:WwHg+CVyzlv/TX9xqBFXEZAuxOPxn2k1GNHwG41IIUQ=
-golang.org/x/crypto v0.43.0 h1:dduJYIi3A3KOfdGOHX8AVZ/jGiyPa3IbBozJ5kNuE04=
-golang.org/x/crypto v0.43.0/go.mod h1:BFbav4mRNlXJL4wNeejLpWxB7wMbc79PdRGhWKncxR0=
+golang.org/x/crypto v0.45.0 h1:jMBrvKuj23MTlT0bQEOBcAE0mjg8mK9RXFhRH6nyF3Q=
+golang.org/x/crypto v0.45.0/go.mod h1:XTGrrkGJve7CYK7J8PEww4aY7gM3qMCElcJQ8n8JdX4=
 golang.org/x/image v0.25.0 h1:Y6uW6rH1y5y/LK1J8BPWZtr6yZ7hrsy6hFrXjgsc2fQ=
 golang.org/x/image v0.25.0/go.mod h1:tCAmOEGthTtkalusGp1g3xa2gke8J6c2N565dTyl9Rs=
-golang.org/x/net v0.46.0 h1:giFlY12I07fugqwPuWJi68oOnpfqFnJIJzaIIm2JVV4=
-golang.org/x/net v0.46.0/go.mod h1:Q9BGdFy1y4nkUwiLvT5qtyhAnEHgnQ/zd8PfU6nc210=
-golang.org/x/text v0.30.0 h1:yznKA/E9zq54KzlzBEAWn1NXSQ8DIp/NYMy88xJjl4k=
-golang.org/x/text v0.30.0/go.mod h1:yDdHFIX9t+tORqspjENWgzaCVXgk0yYnYuSZ8UzzBVM=
+golang.org/x/net v0.47.0 h1:Mx+4dIFzqraBXUugkia1OOvlD6LemFo1ALMHjrXDOhY=
+golang.org/x/net v0.47.0/go.mod h1:/jNxtkgq5yWUGYkaZGqo27cfGZ1c5Nen03aYrrKpVRU=
+golang.org/x/text v0.31.0 h1:aC8ghyu4JhP8VojJ2lEHBnochRno1sgL6nEi9WGFGMM=
+golang.org/x/text v0.31.0/go.mod h1:tKRAlv61yKIjGGHX/4tP1LTbc13YSec1pxVEWXzfoeM=
 gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=
 gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
 gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=