summaryrefslogtreecommitdiff
path: root/vendor/modernc.org/mathutil/permute.go
diff options
context:
space:
mode:
authorLibravatar Terin Stock <terinjokes@gmail.com>2025-03-09 17:47:56 +0100
committerLibravatar Terin Stock <terinjokes@gmail.com>2025-03-10 01:59:49 +0100
commit3ac1ee16f377d31a0fb80c8dae28b6239ac4229e (patch)
treef61faa581feaaeaba2542b9f2b8234a590684413 /vendor/modernc.org/mathutil/permute.go
parent[chore] update URLs to forked source (diff)
downloadgotosocial-3ac1ee16f377d31a0fb80c8dae28b6239ac4229e.tar.xz
[chore] remove vendor
Diffstat (limited to 'vendor/modernc.org/mathutil/permute.go')
-rw-r--r--vendor/modernc.org/mathutil/permute.go39
1 files changed, 0 insertions, 39 deletions
diff --git a/vendor/modernc.org/mathutil/permute.go b/vendor/modernc.org/mathutil/permute.go
deleted file mode 100644
index e2ff3d615..000000000
--- a/vendor/modernc.org/mathutil/permute.go
+++ /dev/null
@@ -1,39 +0,0 @@
-// Copyright (c) 2014 The mathutil Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style
-// license that can be found in the LICENSE file.
-
-package mathutil // import "modernc.org/mathutil"
-
-import (
- "sort"
-)
-
-// PermutationFirst generates the first permutation of data.
-func PermutationFirst(data sort.Interface) {
- sort.Sort(data)
-}
-
-// PermutationNext generates the next permutation of data if possible and
-// return true. Return false if there is no more permutation left. Based on
-// the algorithm described here:
-// http://en.wikipedia.org/wiki/Permutation#Generation_in_lexicographic_order
-func PermutationNext(data sort.Interface) bool {
- var k, l int
- for k = data.Len() - 2; ; k-- { // 1.
- if k < 0 {
- return false
- }
-
- if data.Less(k, k+1) {
- break
- }
- }
- for l = data.Len() - 1; !data.Less(k, l); l-- { // 2.
- }
- data.Swap(k, l) // 3.
- for i, j := k+1, data.Len()-1; i < j; i++ { // 4.
- data.Swap(i, j)
- j--
- }
- return true
-}