summaryrefslogtreecommitdiff
path: root/vendor/golang.org/x/text/unicode/norm/trie.go
diff options
context:
space:
mode:
authorKali Kaneko (leap communications) <kali@leap.se>2019-01-18 16:45:30 +0100
committerKali Kaneko (leap communications) <kali@leap.se>2019-01-24 02:11:08 +0100
commitce354a6afbf1813c9a5565a00f6937c1b6fd1e42 (patch)
tree5f8fef7e2879a8aec6e8c22302c4fce5e46e7083 /vendor/golang.org/x/text/unicode/norm/trie.go
parent56dd0f4dfdc33594502ec02421425c3432570be3 (diff)
[pkg] remove vendoring of golang/x/*
I think there's no need of vendoring this. The debian package builds fine without them - at least with the text-dev package in testing.
Diffstat (limited to 'vendor/golang.org/x/text/unicode/norm/trie.go')
-rw-r--r--vendor/golang.org/x/text/unicode/norm/trie.go54
1 files changed, 0 insertions, 54 deletions
diff --git a/vendor/golang.org/x/text/unicode/norm/trie.go b/vendor/golang.org/x/text/unicode/norm/trie.go
deleted file mode 100644
index 423386b..0000000
--- a/vendor/golang.org/x/text/unicode/norm/trie.go
+++ /dev/null
@@ -1,54 +0,0 @@
-// 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 norm
-
-type valueRange struct {
- value uint16 // header: value:stride
- lo, hi byte // header: lo:n
-}
-
-type sparseBlocks struct {
- values []valueRange
- offset []uint16
-}
-
-var nfcSparse = sparseBlocks{
- values: nfcSparseValues[:],
- offset: nfcSparseOffset[:],
-}
-
-var nfkcSparse = sparseBlocks{
- values: nfkcSparseValues[:],
- offset: nfkcSparseOffset[:],
-}
-
-var (
- nfcData = newNfcTrie(0)
- nfkcData = newNfkcTrie(0)
-)
-
-// lookupValue determines the type of block n and looks up the value for b.
-// For n < t.cutoff, the block is a simple lookup table. Otherwise, the block
-// is a list of ranges with an accompanying value. Given a matching range r,
-// the value for b is by r.value + (b - r.lo) * stride.
-func (t *sparseBlocks) lookup(n uint32, b byte) uint16 {
- offset := t.offset[n]
- header := t.values[offset]
- lo := offset + 1
- hi := lo + uint16(header.lo)
- for lo < hi {
- m := lo + (hi-lo)/2
- r := t.values[m]
- if r.lo <= b && b <= r.hi {
- return r.value + uint16(b-r.lo)*header.value
- }
- if b < r.lo {
- hi = m
- } else {
- lo = m + 1
- }
- }
- return 0
-}