Linux vmi284606.contaboserver.net 4.15.0-213-generic #224-Ubuntu SMP Mon Jun 19 13:30:12 UTC 2023 x86_64
Apache/2.4.57 (Ubuntu)
: 167.86.127.34 | : 216.73.217.1
Cant Read [ /etc/named.conf ]
7.2.24-0ubuntu0.18.04.17
root
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
local /
go /
src /
sort /
[ HOME SHELL ]
Name
Size
Permission
Action
example_interface_test.go
1.47
KB
-rw-r--r--
example_keys_test.go
2.68
KB
-rw-r--r--
example_multi_test.go
4.05
KB
-rw-r--r--
example_search_test.go
1.16
KB
-rw-r--r--
example_test.go
2.85
KB
-rw-r--r--
example_wrapper_test.go
1.63
KB
-rw-r--r--
export_test.go
239
B
-rw-r--r--
genzfunc.go
2.91
KB
-rw-r--r--
search.go
4.14
KB
-rw-r--r--
search_test.go
4.25
KB
-rw-r--r--
slice.go
1.26
KB
-rw-r--r--
slice_go113.go
305
B
-rw-r--r--
slice_go14.go
468
B
-rw-r--r--
slice_go18.go
291
B
-rw-r--r--
sort.go
15.8
KB
-rw-r--r--
sort_test.go
15.09
KB
-rw-r--r--
zfuncversion.go
4.82
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : example_interface_test.go
// Copyright 2011 The Go 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 sort_test import ( "fmt" "sort" ) type Person struct { Name string Age int } func (p Person) String() string { return fmt.Sprintf("%s: %d", p.Name, p.Age) } // ByAge implements sort.Interface for []Person based on // the Age field. type ByAge []Person func (a ByAge) Len() int { return len(a) } func (a ByAge) Swap(i, j int) { a[i], a[j] = a[j], a[i] } func (a ByAge) Less(i, j int) bool { return a[i].Age < a[j].Age } func Example() { people := []Person{ {"Bob", 31}, {"John", 42}, {"Michael", 17}, {"Jenny", 26}, } fmt.Println(people) // There are two ways to sort a slice. First, one can define // a set of methods for the slice type, as with ByAge, and // call sort.Sort. In this first example we use that technique. sort.Sort(ByAge(people)) fmt.Println(people) // The other way is to use sort.Slice with a custom Less // function, which can be provided as a closure. In this // case no methods are needed. (And if they exist, they // are ignored.) Here we re-sort in reverse order: compare // the closure with ByAge.Less. sort.Slice(people, func(i, j int) bool { return people[i].Age > people[j].Age }) fmt.Println(people) // Output: // [Bob: 31 John: 42 Michael: 17 Jenny: 26] // [Michael: 17 Jenny: 26 Bob: 31 John: 42] // [John: 42 Bob: 31 Jenny: 26 Michael: 17] }
Close