aboutsummaryrefslogtreecommitdiffstats
path: root/vendor/github.com/syndtr/goleveldb/leveldb/util.go
blob: e572a329e948af67843148e0131af6e089e1d27f (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
// Copyright (c) 2012, Suryandaru Triandana <syndtr@gmail.com>
// All rights reserved.
//
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

package leveldb

import (
    "fmt"
    "sort"

    "github.com/syndtr/goleveldb/leveldb/storage"
)

func shorten(str string) string {
    if len(str) <= 8 {
        return str
    }
    return str[:3] + ".." + str[len(str)-3:]
}

var bunits = [...]string{"", "Ki", "Mi", "Gi"}

func shortenb(bytes int) string {
    i := 0
    for ; bytes > 1024 && i < 4; i++ {
        bytes /= 1024
    }
    return fmt.Sprintf("%d%sB", bytes, bunits[i])
}

func sshortenb(bytes int) string {
    if bytes == 0 {
        return "~"
    }
    sign := "+"
    if bytes < 0 {
        sign = "-"
        bytes *= -1
    }
    i := 0
    for ; bytes > 1024 && i < 4; i++ {
        bytes /= 1024
    }
    return fmt.Sprintf("%s%d%sB", sign, bytes, bunits[i])
}

func sint(x int) string {
    if x == 0 {
        return "~"
    }
    sign := "+"
    if x < 0 {
        sign = "-"
        x *= -1
    }
    return fmt.Sprintf("%s%d", sign, x)
}

func minInt(a, b int) int {
    if a < b {
        return a
    }
    return b
}

func maxInt(a, b int) int {
    if a > b {
        return a
    }
    return b
}

type fdSorter []storage.FileDesc

func (p fdSorter) Len() int {
    return len(p)
}

func (p fdSorter) Less(i, j int) bool {
    return p[i].Num < p[j].Num
}

func (p fdSorter) Swap(i, j int) {
    p[i], p[j] = p[j], p[i]
}

func sortFds(fds []storage.FileDesc) {
    sort.Sort(fdSorter(fds))
}

func ensureBuffer(b []byte, n int) []byte {
    if cap(b) < n {
        return make([]byte, n)
    }
    return b[:n]
}