fa0101bd60
This changes the BEP protocol to use protocol buffer serialization instead of XDR, and therefore also the database format. The local discovery protocol is also updated to be protocol buffer format. GitHub-Pull-Request: https://github.com/syncthing/syncthing/pull/3276 LGTM: AudriusButkevicius
100 lines
3.1 KiB
Go
100 lines
3.1 KiB
Go
// Copyright (c) 2013, Vastech SA (PTY) LTD. All rights reserved.
|
|
// http://github.com/gogo/protobuf
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following disclaimer
|
|
// in the documentation and/or other materials provided with the
|
|
// distribution.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
package sortkeys
|
|
|
|
import (
|
|
"sort"
|
|
)
|
|
|
|
func Strings(l []string) {
|
|
sort.Strings(l)
|
|
}
|
|
|
|
func Float64s(l []float64) {
|
|
sort.Float64s(l)
|
|
}
|
|
|
|
func Float32s(l []float32) {
|
|
sort.Sort(Float32Slice(l))
|
|
}
|
|
|
|
func Int64s(l []int64) {
|
|
sort.Sort(Int64Slice(l))
|
|
}
|
|
|
|
func Int32s(l []int32) {
|
|
sort.Sort(Int32Slice(l))
|
|
}
|
|
|
|
func Uint64s(l []uint64) {
|
|
sort.Sort(Uint64Slice(l))
|
|
}
|
|
|
|
func Uint32s(l []uint32) {
|
|
sort.Sort(Uint32Slice(l))
|
|
}
|
|
|
|
func Bools(l []bool) {
|
|
sort.Sort(BoolSlice(l))
|
|
}
|
|
|
|
type BoolSlice []bool
|
|
|
|
func (p BoolSlice) Len() int { return len(p) }
|
|
func (p BoolSlice) Less(i, j int) bool { return p[j] }
|
|
func (p BoolSlice) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
|
|
|
|
type Int64Slice []int64
|
|
|
|
func (p Int64Slice) Len() int { return len(p) }
|
|
func (p Int64Slice) Less(i, j int) bool { return p[i] < p[j] }
|
|
func (p Int64Slice) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
|
|
|
|
type Int32Slice []int32
|
|
|
|
func (p Int32Slice) Len() int { return len(p) }
|
|
func (p Int32Slice) Less(i, j int) bool { return p[i] < p[j] }
|
|
func (p Int32Slice) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
|
|
|
|
type Uint64Slice []uint64
|
|
|
|
func (p Uint64Slice) Len() int { return len(p) }
|
|
func (p Uint64Slice) Less(i, j int) bool { return p[i] < p[j] }
|
|
func (p Uint64Slice) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
|
|
|
|
type Uint32Slice []uint32
|
|
|
|
func (p Uint32Slice) Len() int { return len(p) }
|
|
func (p Uint32Slice) Less(i, j int) bool { return p[i] < p[j] }
|
|
func (p Uint32Slice) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
|
|
|
|
type Float32Slice []float32
|
|
|
|
func (p Float32Slice) Len() int { return len(p) }
|
|
func (p Float32Slice) Less(i, j int) bool { return p[i] < p[j] }
|
|
func (p Float32Slice) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
|