d2dbb8c963
* cli: initial work on debug; server-status target * debug: add metrics capture target (#7376) * check against DR secondary * debug: add compression * refactor check into preflight func * debug: set short test time on tests, fix exit code bug * debug: use temp dir for output on tests * debug: use mholt/archiver for compression * first pass on adding pprof * use logger for output * refactor polling target capture logic * debug: poll and collect replication status * debug: poll and collect host-info; rename output files and collection refactor * fix comments * add archive test; fix bugs found * rename flag name to singular target * add target output test; scaffold other tests cases * debug/test: add pprof and index file tests * debug/test: add min timing check tests * debug: fix index gen race and collection goroutine race * debug: extend archive tests, handle race between program exit and polling goroutines * update docstring * debug: correctly add to pollingWg * debug: add config target support * debug: don't wait on interrupt shutdown; add file exists unit tests * move pprof bits into its goroutine * debug: skip empty metrics and some pprof file creation if permission denied, add matching unit test * address comments and feedback * Vault debug using run.Group (#7658) * debug: switch to use oklog/run.Group * debug: use context to cancel requests and interrupt rungroups. * debug: trigger the first interval properly * debug: metrics collection should use metrics interval * debug: add missing continue on metrics error * debug: remove the use of buffered chan to trigger first interval * debug: don't shadow BaseCommand's client, properly block on interval capture failures * debug: actually use c.cachedClient everywhere * go mod vendor * debug: run all pprof in goroutines; bump pprof timings in tests to reduce flakiness * debug: update help text
53 lines
1.2 KiB
Go
53 lines
1.2 KiB
Go
// Copyright 2014-2017 Ulrich Kunitz. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package lzma
|
|
|
|
import "errors"
|
|
|
|
// MatchAlgorithm identifies an algorithm to find matches in the
|
|
// dictionary.
|
|
type MatchAlgorithm byte
|
|
|
|
// Supported matcher algorithms.
|
|
const (
|
|
HashTable4 MatchAlgorithm = iota
|
|
BinaryTree
|
|
)
|
|
|
|
// maStrings are used by the String method.
|
|
var maStrings = map[MatchAlgorithm]string{
|
|
HashTable4: "HashTable4",
|
|
BinaryTree: "BinaryTree",
|
|
}
|
|
|
|
// String returns a string representation of the Matcher.
|
|
func (a MatchAlgorithm) String() string {
|
|
if s, ok := maStrings[a]; ok {
|
|
return s
|
|
}
|
|
return "unknown"
|
|
}
|
|
|
|
var errUnsupportedMatchAlgorithm = errors.New(
|
|
"lzma: unsupported match algorithm value")
|
|
|
|
// verify checks whether the matcher value is supported.
|
|
func (a MatchAlgorithm) verify() error {
|
|
if _, ok := maStrings[a]; !ok {
|
|
return errUnsupportedMatchAlgorithm
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (a MatchAlgorithm) new(dictCap int) (m matcher, err error) {
|
|
switch a {
|
|
case HashTable4:
|
|
return newHashTable(dictCap, 4)
|
|
case BinaryTree:
|
|
return newBinTree(dictCap)
|
|
}
|
|
return nil, errUnsupportedMatchAlgorithm
|
|
}
|