code stringlengths 114 1.05M | path stringlengths 3 312 | quality_prob float64 0.5 0.99 | learning_prob float64 0.2 1 | filename stringlengths 3 168 | kind stringclasses 1 value |
|---|---|---|---|---|---|
package paths
/*
576. 出界的路径数 https://leetcode-cn.com/problems/out-of-boundary-paths/
给定一个 m × n 的网格和一个球。球的起始坐标为 (i,j) ，你可以将球移到相邻的单元格内，或者往上、下、左、右四个方向上移动使球穿过网格边界。
但是，你最多可以移动 N 次。找出可以将球移出边界的路径数量。
答案可能非常大，返回 结果 mod 109 + 7 的值。
示例 1：
输入: m = 2, n = 2, N = 2, i = 0, j = 0
输出: 6
解释:
示例 2：
输入: m = 1, n = 3, N = 3, i = 0, j = 1
输出: 12
解释:
说明:
球一旦出界，就不能再被移动回网格内。
网格的长度和高度在 [1,50] 的范围内。
N 在 [0,50] 的范围内。
*/
/*
从dfs到dp
*/
/*
1. 朴素dfs实现，76 / 94 个通过测试用例；第77个超时
*/
func findPaths0(m int, n int, N int, i int, j int) int {
if i >= N && (m-i) > N && j >= N && (n-j) > N {
return 0
}
const max = 1000000007
var dfs func(r, c, rest int) int
dfs = func(r, c, rest int) int {
if rest < 0 {
return 0
}
if r == -1 || r == m || c == -1 || c == n {
return 1
}
rest--
return (dfs(r+1, c, rest)%max + dfs(r-1, c, rest)%max + dfs(r, c-1, rest)%max + dfs(r, c+1, rest)%max) % max
}
return dfs(i, j, N)
}
/*
2. 加备忘录，减少递归
*/
func findPaths1(m int, n int, N int, i int, j int) int {
if i >= N && (m-i) > N && j >= N && (n-j) > N {
return 0
}
const max = 1000000007
const init = -1
memo := make3d(m, n, N+1, init)
var dfs func(r, c, rest int) int
dfs = func(r, c, rest int) int {
if rest < 0 {
return 0
}
if r == -1 || r == m || c == -1 || c == n {
return 1
}
if memo[r][c][rest] != init {
return memo[r][c][rest]
}
rest--
down := dfs(r+1, c, rest) % max
up := dfs(r-1, c, rest) % max
left := dfs(r, c-1, rest) % max
right := dfs(r, c+1, rest) % max
rest++
memo[r][c][rest] = (down + up + left + right) % max
return memo[r][c][rest]
}
return dfs(i, j, N)
}
/*
3. 自底向上到动态规划
上面到解法是自顶向下递归，不难改为自底向上动态规划；
参考：
三维dp的动态规划：https://leetcode-cn.com/problems/out-of-boundary-paths/solution/zhuang-tai-ji-du-shi-zhuang-tai-ji-by-christmas_wa/
二维dp的动态规划：https://leetcode-cn.com/problems/out-of-boundary-paths/solution/javade-dfsyu-dong-tai-gui-hua-by-zackqf/
代码略
*/
func make3d(m, n, k, fill int) [][][]int {
r := make([][][]int, m)
for i := range r {
r[i] = make([][]int, n)
for j := range r[i] {
r[i][j] = make([]int, k)
for k := range r[i][j] {
r[i][j][k] = fill
}
}
}
return r
} | solutions/out-of-boundary-paths/d.go | 0.563858 | 0.40987 | d.go | starcoder |
package draw
import (
"math"
"github.com/pzduniak/unipdf/model"
)
// CubicBezierCurve is defined by:
// R(t) = P0*(1-t)^3 + P1*3*t*(1-t)^2 + P2*3*t^2*(1-t) + P3*t^3
// where P0 is the current point, P1, P2 control points and P3 the final point.
type CubicBezierCurve struct {
P0 Point // Starting point.
P1 Point // Control point 1.
P2 Point // Control point 2.
P3 Point // Final point.
}
// NewCubicBezierCurve returns a new cubic Bezier curve.
func NewCubicBezierCurve(x0, y0, x1, y1, x2, y2, x3, y3 float64) CubicBezierCurve {
curve := CubicBezierCurve{}
curve.P0 = NewPoint(x0, y0)
curve.P1 = NewPoint(x1, y1)
curve.P2 = NewPoint(x2, y2)
curve.P3 = NewPoint(x3, y3)
return curve
}
// AddOffsetXY adds X,Y offset to all points on a curve.
func (curve CubicBezierCurve) AddOffsetXY(offX, offY float64) CubicBezierCurve {
curve.P0.X += offX
curve.P1.X += offX
curve.P2.X += offX
curve.P3.X += offX
curve.P0.Y += offY
curve.P1.Y += offY
curve.P2.Y += offY
curve.P3.Y += offY
return curve
}
// GetBounds returns the bounding box of the Bezier curve.
func (curve CubicBezierCurve) GetBounds() model.PdfRectangle {
minX := curve.P0.X
maxX := curve.P0.X
minY := curve.P0.Y
maxY := curve.P0.Y
// 1000 points.
for t := 0.0; t <= 1.0; t += 0.001 {
Rx := curve.P0.X*math.Pow(1-t, 3) +
curve.P1.X*3*t*math.Pow(1-t, 2) +
curve.P2.X*3*math.Pow(t, 2)*(1-t) +
curve.P3.X*math.Pow(t, 3)
Ry := curve.P0.Y*math.Pow(1-t, 3) +
curve.P1.Y*3*t*math.Pow(1-t, 2) +
curve.P2.Y*3*math.Pow(t, 2)*(1-t) +
curve.P3.Y*math.Pow(t, 3)
if Rx < minX {
minX = Rx
}
if Rx > maxX {
maxX = Rx
}
if Ry < minY {
minY = Ry
}
if Ry > maxY {
maxY = Ry
}
}
bounds := model.PdfRectangle{}
bounds.Llx = minX
bounds.Lly = minY
bounds.Urx = maxX
bounds.Ury = maxY
return bounds
}
// CubicBezierPath represents a collection of cubic Bezier curves.
type CubicBezierPath struct {
Curves []CubicBezierCurve
}
// NewCubicBezierPath returns a new empty cubic Bezier path.
func NewCubicBezierPath() CubicBezierPath {
bpath := CubicBezierPath{}
bpath.Curves = []CubicBezierCurve{}
return bpath
}
// AppendCurve appends the specified Bezier curve to the path.
func (p CubicBezierPath) AppendCurve(curve CubicBezierCurve) CubicBezierPath {
p.Curves = append(p.Curves, curve)
return p
}
// Copy returns a clone of the Bezier path.
func (p CubicBezierPath) Copy() CubicBezierPath {
bpathcopy := CubicBezierPath{}
bpathcopy.Curves = []CubicBezierCurve{}
for _, c := range p.Curves {
bpathcopy.Curves = append(bpathcopy.Curves, c)
}
return bpathcopy
}
// Offset shifts the Bezier path with the specified offsets.
func (p CubicBezierPath) Offset(offX, offY float64) CubicBezierPath {
for i, c := range p.Curves {
p.Curves[i] = c.AddOffsetXY(offX, offY)
}
return p
}
// GetBoundingBox returns the bounding box of the Bezier path.
func (p CubicBezierPath) GetBoundingBox() Rectangle {
bbox := Rectangle{}
minX := 0.0
maxX := 0.0
minY := 0.0
maxY := 0.0
for idx, c := range p.Curves {
curveBounds := c.GetBounds()
if idx == 0 {
minX = curveBounds.Llx
maxX = curveBounds.Urx
minY = curveBounds.Lly
maxY = curveBounds.Ury
continue
}
if curveBounds.Llx < minX {
minX = curveBounds.Llx
}
if curveBounds.Urx > maxX {
maxX = curveBounds.Urx
}
if curveBounds.Lly < minY {
minY = curveBounds.Lly
}
if curveBounds.Ury > maxY {
maxY = curveBounds.Ury
}
}
bbox.X = minX
bbox.Y = minY
bbox.Width = maxX - minX
bbox.Height = maxY - minY
return bbox
} | bot/vendor/github.com/pzduniak/unipdf/contentstream/draw/bezier_curve.go | 0.888002 | 0.603815 | bezier_curve.go | starcoder |
package bulletproofs
import (
"github.com/incognitochain/incognito-chain/privacy/operation"
"github.com/incognitochain/incognito-chain/privacy/privacy_util"
"github.com/pkg/errors"
)
// ConvertIntToBinary represents a integer number in binary
func ConvertUint64ToBinary(number uint64, n int) []*operation.Scalar {
if number == 0 {
res := make([]*operation.Scalar, n)
for i := 0; i < n; i++ {
res[i] = new(operation.Scalar).FromUint64(0)
}
return res
}
binary := make([]*operation.Scalar, n)
for i := 0; i < n; i++ {
binary[i] = new(operation.Scalar).FromUint64(number % 2)
number /= 2
}
return binary
}
//nolint:gocritic // This function uses capitalized variable name
func computeHPrime(y *operation.Scalar, N int, H []*operation.Point) []*operation.Point {
yInverse := new(operation.Scalar).Invert(y)
HPrime := make([]*operation.Point, N)
expyInverse := new(operation.Scalar).FromUint64(1)
for i := 0; i < N; i++ {
HPrime[i] = new(operation.Point).ScalarMult(H[i], expyInverse)
expyInverse.Mul(expyInverse, yInverse)
}
return HPrime
}
//nolint:gocritic // This function uses capitalized variable name
func computeDeltaYZ(z, zSquare *operation.Scalar, yVector []*operation.Scalar, N int) (*operation.Scalar, error) {
oneNumber := new(operation.Scalar).FromUint64(1)
twoNumber := new(operation.Scalar).FromUint64(2)
oneVectorN := powerVector(oneNumber, privacy_util.MaxExp)
twoVectorN := powerVector(twoNumber, privacy_util.MaxExp)
oneVector := powerVector(oneNumber, N)
deltaYZ := new(operation.Scalar).Sub(z, zSquare)
// ip1 = <1^(n*m), y^(n*m)>
var ip1, ip2 *operation.Scalar
var err error
if ip1, err = innerProduct(oneVector, yVector); err != nil {
return nil, err
} else if ip2, err = innerProduct(oneVectorN, twoVectorN); err != nil {
return nil, err
} else {
deltaYZ.Mul(deltaYZ, ip1)
sum := new(operation.Scalar).FromUint64(0)
zTmp := new(operation.Scalar).Set(zSquare)
for j := 0; j < int(N/privacy_util.MaxExp); j++ {
zTmp.Mul(zTmp, z)
sum.Add(sum, zTmp)
}
sum.Mul(sum, ip2)
deltaYZ.Sub(deltaYZ, sum)
}
return deltaYZ, nil
}
func innerProduct(a []*operation.Scalar, b []*operation.Scalar) (*operation.Scalar, error) {
if len(a) != len(b) {
return nil, errors.New("Incompatible sizes of a and b")
}
result := new(operation.Scalar).FromUint64(uint64(0))
for i := range a {
// res = a[i]*b[i] + res % l
result.MulAdd(a[i], b[i], result)
}
return result, nil
}
func vectorAdd(a []*operation.Scalar, b []*operation.Scalar) ([]*operation.Scalar, error) {
if len(a) != len(b) {
return nil, errors.New("Incompatible sizes of a and b")
}
result := make([]*operation.Scalar, len(a))
for i := range a {
result[i] = new(operation.Scalar).Add(a[i], b[i])
}
return result, nil
}
//nolint:gocritic // This function uses capitalized variable name
func setAggregateParams(N int) *bulletproofParams {
aggParam := new(bulletproofParams)
aggParam.g = AggParam.g[0:N]
aggParam.h = AggParam.h[0:N]
aggParam.u = AggParam.u
aggParam.cs = AggParam.cs
return aggParam
}
func roundUpPowTwo(v int) int {
if v == 0 {
return 1
}
v--
v |= v >> 1
v |= v >> 2
v |= v >> 4
v |= v >> 8
v |= v >> 16
v++
return v
}
func hadamardProduct(a []*operation.Scalar, b []*operation.Scalar) ([]*operation.Scalar, error) {
if len(a) != len(b) {
return nil, errors.New("Invalid input")
}
result := make([]*operation.Scalar, len(a))
for i := 0; i < len(result); i++ {
result[i] = new(operation.Scalar).Mul(a[i], b[i])
}
return result, nil
}
// powerVector calculates base^n
func powerVector(base *operation.Scalar, n int) []*operation.Scalar {
result := make([]*operation.Scalar, n)
result[0] = new(operation.Scalar).FromUint64(1)
if n > 1 {
result[1] = new(operation.Scalar).Set(base)
for i := 2; i < n; i++ {
result[i] = new(operation.Scalar).Mul(result[i-1], base)
}
}
return result
}
// vectorAddScalar adds a vector to a big int, returns big int array
func vectorAddScalar(v []*operation.Scalar, s *operation.Scalar) []*operation.Scalar {
result := make([]*operation.Scalar, len(v))
for i := range v {
result[i] = new(operation.Scalar).Add(v[i], s)
}
return result
}
// vectorMulScalar mul a vector to a big int, returns a vector
func vectorMulScalar(v []*operation.Scalar, s *operation.Scalar) []*operation.Scalar {
result := make([]*operation.Scalar, len(v))
for i := range v {
result[i] = new(operation.Scalar).Mul(v[i], s)
}
return result
}
// CommitAll commits a list of PCM_CAPACITY value(s)
func encodeVectors(l []*operation.Scalar, r []*operation.Scalar, g []*operation.Point, h []*operation.Point) (*operation.Point, error) {
if len(l) != len(r) || len(g) != len(l) || len(h) != len(g) {
return nil, errors.New("Invalid input")
}
tmp1 := new(operation.Point).MultiScalarMult(l, g)
tmp2 := new(operation.Point).MultiScalarMult(r, h)
res := new(operation.Point).Add(tmp1, tmp2)
return res, nil
}
// bulletproofParams includes all generator for aggregated range proof
func newBulletproofParams(m int) *bulletproofParams {
maxExp := privacy_util.MaxExp
numCommitValue := privacy_util.NumBase
maxOutputCoin := privacy_util.MaxOutputCoin
capacity := maxExp * m // fixed value
param := new(bulletproofParams)
param.g = make([]*operation.Point, capacity)
param.h = make([]*operation.Point, capacity)
csByte := []byte{}
for i := 0; i < capacity; i++ {
param.g[i] = operation.HashToPointFromIndex(int64(numCommitValue+i), operation.CStringBulletProof)
param.h[i] = operation.HashToPointFromIndex(int64(numCommitValue+i+maxOutputCoin*maxExp), operation.CStringBulletProof)
csByte = append(csByte, param.g[i].ToBytesS()...)
csByte = append(csByte, param.h[i].ToBytesS()...)
}
param.u = new(operation.Point)
param.u = operation.HashToPointFromIndex(int64(numCommitValue+2*maxOutputCoin*maxExp), operation.CStringBulletProof)
csByte = append(csByte, param.u.ToBytesS()...)
param.cs = operation.HashToPoint(csByte)
return param
}
func generateChallenge(hashCache []byte, values []*operation.Point) *operation.Scalar {
bytes := []byte{}
bytes = append(bytes, hashCache...)
for i := 0; i < len(values); i++ {
bytes = append(bytes, values[i].ToBytesS()...)
}
hash := operation.HashToScalar(bytes)
return hash
} | privacy/privacy_v2/bulletproofs/bulletproofs_helper.go | 0.620047 | 0.481941 | bulletproofs_helper.go | starcoder |
package dynamicarray
// errors: used to handle CheckRangeFromIndex function with a reasonable error value
import (
"errors"
)
var defaultCapacity = 10
// DynamicArray structure
// size: length of array
// capacity: the maximum length of the segment
// elementData: an array of any type of data with interface
type DynamicArray struct {
size int
capacity int
elementData []interface{}
}
// Put function is change/update the value in array with the index and new value
func (da *DynamicArray) Put(index int, element interface{}) error {
err := da.CheckRangeFromIndex(index)
if err != nil {
return err
}
da.elementData[index] = element
return nil
}
// Add function is add new element to our array
func (da *DynamicArray) Add(element interface{}) {
if da.size == da.capacity {
da.NewCapacity()
}
da.elementData[da.size] = element
da.size++
}
// Remove function is remove an element with the index
func (da *DynamicArray) Remove(index int) error {
err := da.CheckRangeFromIndex(index)
if err != nil {
return err
}
copy(da.elementData[index:], da.elementData[index+1:da.size])
da.elementData[da.size-1] = nil
da.size--
return nil
}
// Get function is return one element with the index of array
func (da *DynamicArray) Get(index int) (interface{}, error) {
err := da.CheckRangeFromIndex(index)
if err != nil {
return nil, err
}
return da.elementData[index], nil
}
// IsEmpty function is check that the array has value or not
func (da *DynamicArray) IsEmpty() bool {
return da.size == 0
}
// GetData function return all value of array
func (da *DynamicArray) GetData() []interface{} {
return da.elementData[:da.size]
}
// CheckRangeFromIndex function it will check the range from the index
func (da *DynamicArray) CheckRangeFromIndex(index int) error {
if index >= da.size || index < 0 {
return errors.New("index out of range")
}
return nil
}
// NewCapacity function increase the capacity
func (da *DynamicArray) NewCapacity() {
if da.capacity == 0 {
da.capacity = defaultCapacity
} else {
da.capacity = da.capacity << 1
}
newDataElement := make([]interface{}, da.capacity)
copy(newDataElement, da.elementData)
da.elementData = newDataElement
} | data_structures/dynamic_array/dynamicarray.go | 0.771843 | 0.528655 | dynamicarray.go | starcoder |
package mocks
import "github.com/bryanl/doit/do"
import "github.com/stretchr/testify/mock"
import "github.com/digitalocean/godo"
type ImagesService struct {
mock.Mock
}
// List provides a mock function with given fields: public
func (_m *ImagesService) List(public bool) (do.Images, error) {
ret := _m.Called(public)
var r0 do.Images
if rf, ok := ret.Get(0).(func(bool) do.Images); ok {
r0 = rf(public)
} else {
r0 = ret.Get(0).(do.Images)
}
var r1 error
if rf, ok := ret.Get(1).(func(bool) error); ok {
r1 = rf(public)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// ListDistribution provides a mock function with given fields: public
func (_m *ImagesService) ListDistribution(public bool) (do.Images, error) {
ret := _m.Called(public)
var r0 do.Images
if rf, ok := ret.Get(0).(func(bool) do.Images); ok {
r0 = rf(public)
} else {
r0 = ret.Get(0).(do.Images)
}
var r1 error
if rf, ok := ret.Get(1).(func(bool) error); ok {
r1 = rf(public)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// ListApplication provides a mock function with given fields: public
func (_m *ImagesService) ListApplication(public bool) (do.Images, error) {
ret := _m.Called(public)
var r0 do.Images
if rf, ok := ret.Get(0).(func(bool) do.Images); ok {
r0 = rf(public)
} else {
r0 = ret.Get(0).(do.Images)
}
var r1 error
if rf, ok := ret.Get(1).(func(bool) error); ok {
r1 = rf(public)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// ListUser provides a mock function with given fields: public
func (_m *ImagesService) ListUser(public bool) (do.Images, error) {
ret := _m.Called(public)
var r0 do.Images
if rf, ok := ret.Get(0).(func(bool) do.Images); ok {
r0 = rf(public)
} else {
r0 = ret.Get(0).(do.Images)
}
var r1 error
if rf, ok := ret.Get(1).(func(bool) error); ok {
r1 = rf(public)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// GetByID provides a mock function with given fields: id
func (_m *ImagesService) GetByID(id int) (*do.Image, error) {
ret := _m.Called(id)
var r0 *do.Image
if rf, ok := ret.Get(0).(func(int) *do.Image); ok {
r0 = rf(id)
} else {
if ret.Get(0) != nil {
r0 = ret.Get(0).(*do.Image)
}
}
var r1 error
if rf, ok := ret.Get(1).(func(int) error); ok {
r1 = rf(id)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// GetBySlug provides a mock function with given fields: slug
func (_m *ImagesService) GetBySlug(slug string) (*do.Image, error) {
ret := _m.Called(slug)
var r0 *do.Image
if rf, ok := ret.Get(0).(func(string) *do.Image); ok {
r0 = rf(slug)
} else {
if ret.Get(0) != nil {
r0 = ret.Get(0).(*do.Image)
}
}
var r1 error
if rf, ok := ret.Get(1).(func(string) error); ok {
r1 = rf(slug)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// Update provides a mock function with given fields: id, iur
func (_m *ImagesService) Update(id int, iur *godo.ImageUpdateRequest) (*do.Image, error) {
ret := _m.Called(id, iur)
var r0 *do.Image
if rf, ok := ret.Get(0).(func(int, *godo.ImageUpdateRequest) *do.Image); ok {
r0 = rf(id, iur)
} else {
if ret.Get(0) != nil {
r0 = ret.Get(0).(*do.Image)
}
}
var r1 error
if rf, ok := ret.Get(1).(func(int, *godo.ImageUpdateRequest) error); ok {
r1 = rf(id, iur)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// Delete provides a mock function with given fields: id
func (_m *ImagesService) Delete(id int) error {
ret := _m.Called(id)
var r0 error
if rf, ok := ret.Get(0).(func(int) error); ok {
r0 = rf(id)
} else {
r0 = ret.Error(0)
}
return r0
} | do/mocks/ImagesService.go | 0.647798 | 0.417865 | ImagesService.go | starcoder |
package contrast
import (
"image"
"image/color"
"math"
"hawx.me/code/img/altcolor"
"hawx.me/code/img/utils"
)
const Epsilon = 1.0e-10
// Adjust changes the contrast in the Image. A value of 0 has no effect.
func Adjust(img image.Image, value float64) image.Image {
return utils.MapColor(img, AdjustC(value))
}
func AdjustC(value float64) utils.Composable {
return func(c color.Color) color.Color {
// Turns out ImageMagick thinks HSB=HSV.
d := altcolor.HSVAModel.Convert(c).(altcolor.HSVA)
d.V += 0.5 * value * (0.5*(math.Sin(math.Pi*(d.V-0.5))+1.0) - d.V)
if d.V > 1.0 {
d.V = 1.0
} else if d.V < 0.0 {
d.V = 0.0
}
return d
}
}
// Linear adjusts the contrast using a linear function. A value of 1 has no
// effect, and a value of 0 will return a grey image.
func Linear(img image.Image, value float64) image.Image {
return utils.MapColor(img, LinearC(value))
}
func LinearC(value float64) utils.Composable {
return func(c color.Color) color.Color {
r, g, b, a := utils.RatioRGBA(c)
r = utils.Truncatef((((r - 0.5) * value) + 0.5) * 255)
g = utils.Truncatef((((g - 0.5) * value) + 0.5) * 255)
b = utils.Truncatef((((b - 0.5) * value) + 0.5) * 255)
a = a * 255
return color.NRGBA{uint8(r), uint8(g), uint8(b), uint8(a)}
}
}
// Sigmoidal adjusts the contrast in a non-linear way. Factor sets how much to
// increase the contrast, midpoint sets where midtones fall in the resultant
// image.
func Sigmoidal(img image.Image, factor, midpoint float64) image.Image {
return utils.MapColor(img, SigmoidalC(factor, midpoint))
}
func SigmoidalC(factor, midpoint float64) utils.Composable {
sigmoidal := func(x float64) float64 {
return 1.0 / (1.0 + math.Exp(factor*(midpoint-x)))
}
// Pre-compute useful terms
sig0 := sigmoidal(0.0)
sig1 := sigmoidal(1.0)
var scaledSigmoidal func(float64) float64
if factor == 0 {
scaledSigmoidal = func(x float64) float64 {
return x
}
} else if factor > 0 {
scaledSigmoidal = func(x float64) float64 {
return (sigmoidal(x) - sig0) / (sig1 - sig0)
}
} else {
scaledSigmoidal = func(x float64) float64 {
argument := (sig1-sig0)*x + sig0
var clamped float64
if argument < Epsilon {
clamped = Epsilon
} else {
if argument > 1-Epsilon {
clamped = 1 - Epsilon
} else {
clamped = argument
}
}
return midpoint - math.Log(1.0/clamped-1.0)/factor
}
}
return func(c color.Color) color.Color {
r, g, b, a := utils.RatioRGBA(c)
r = utils.Truncatef(scaledSigmoidal(r) * 255)
g = utils.Truncatef(scaledSigmoidal(g) * 255)
b = utils.Truncatef(scaledSigmoidal(b) * 255)
a = a * 255
return color.NRGBA{uint8(r), uint8(g), uint8(b), uint8(a)}
}
} | contrast/adjust.go | 0.877975 | 0.510619 | adjust.go | starcoder |
package context
import (
"github.com/murphybytes/analyze/errors"
"github.com/murphybytes/analyze/internal/ast"
"regexp"
)
// @len(arr) returns the length of an array
func _len(args []interface{}) (interface{}, error) {
if len(args) != 1 {
return nil, errors.New(errors.SyntaxError, "wrong number of arguments for len expected 1 got %d", len(args))
}
arr, ok := args[0].([]interface{})
if !ok {
return nil, errors.New(errors.TypeMismatch, "expected array got %T for len function", args[0])
}
return len(arr), nil
}
// @select(arr, expression) returns a subset of arr such that elements of the subset are such that expression is true.
// note that each element can be referenced in the expression by a variable, for example: "$foo == 3" would return each
// element in an array that was equal to three. You would use $foo.bar == "complete" to reference the field "bar" in an
// array of objects, returning all objects where "bar" == "complete"
func _select(args []interface{}) (interface{}, error) {
if len(args) != 2 {
return nil, errors.New(errors.SyntaxError, "wrong number of arguments for select, expected 2 got %d", len(args))
}
arr, ok := args[0].([]interface{})
if !ok {
return nil, errors.New(errors.TypeMismatch, "expected array got %T for first argument of select", args[0])
}
expression, ok := args[1].(string)
if !ok {
return nil, errors.New(errors.TypeMismatch, "expected string argument for second argument of select")
}
parser := ast.Parser()
var ast ast.Expression
if err := parser.ParseString("", expression, &ast); err != nil {
return nil, err
}
var selected []interface{}
for _, elt := range arr {
ctx, err := New(elt)
if err != nil {
return nil, err
}
result, err := ast.Eval(ctx)
if err != nil {
return nil, err
}
if bool(*result.Bool) {
selected = append(selected, elt)
}
}
return selected, nil
}
// @array(val1, val2, .... valN) converts a list of values to an array
func _array(args []interface{}) (interface{}, error) {
return args, nil
}
// @in(arr, val) if value is in array returns true
func _in(args []interface{}) (interface{}, error) {
if len(args) != 2 {
return nil, errors.New(errors.SyntaxError, "wrong number of arguments for in, expected 2, got %d", len(args))
}
switch t := args[0].(type) {
case []interface{}:
for _, elt := range t {
match, err := compare(elt, args[1])
if err != nil {
return nil, err
}
if match {
return true, nil
}
}
return false, nil
}
return nil, errors.New(errors.TypeMismatch, "expected array for first argument for in function")
}
// @has(obj, fieldname) returns true if field exists in object
func _has(args []interface{})(interface{},error){
if len(args) != 2 {
return nil, errors.New(errors.SyntaxError, "wrong number of arguments for has function expected 2, got %d", len(args))
}
switch t := args[0].(type) {
case map[string]interface{}:
key, ok := args[1].(string)
if !ok {
return nil, errors.New(errors.TypeMismatch, "expect string for second has function argument")
}
_, present := t[key]
return present, nil
}
return nil, errors.New(errors.TypeMismatch, "expected object for first argument of has function")
}
// @match(string, regex-string) returns true if string matches regex-string of the form /regular expression/
func _match(args []interface{})(interface{},error){
if len(args) != 2 {
return nil, errors.New(errors.SyntaxError, "match expects 2 arguments")
}
val, ok := args[0].(string)
if !ok {
return nil, errors.New(errors.TypeMismatch, "match expects string argument")
}
exp, ok := args[1].(string)
if !ok {
return nil, errors.New(errors.TypeMismatch, "match expects string argument 2")
}
regex, err := regexp.Compile(exp)
if err != nil {
return nil, err
}
return regex.MatchString(val), nil
}
func compare(l, r interface{}) (bool, error) {
switch t := l.(type) {
case int:
if rt, ok := r.(int); ok {
return t == rt, nil
}
return false, errors.New(errors.TypeMismatch, "type mismatch")
case *int:
if rt, ok := r.(*int); ok {
return *t == *rt, nil
}
return false, errors.New(errors.TypeMismatch, "type mismatch")
case float64:
if rt, ok := r.(float64); ok {
return t == rt, nil
}
return false, errors.New(errors.TypeMismatch, "type mismatch")
case *float64:
if rt, ok := r.(*float64); ok {
return *t == *rt, nil
}
return false, errors.New(errors.TypeMismatch, "type mismatch")
case string:
if rt, ok := r.(string); ok {
return t == rt, nil
}
return false, errors.New(errors.TypeMismatch, "type mismatch")
case *string:
if rt, ok := r.(*string); ok {
return *t == *rt, nil
}
return false, errors.New(errors.TypeMismatch, "type mismatch")
}
return false, errors.New(errors.UnsupportedType, "unsupported type for in function")
} | context/builtin_functions.go | 0.57344 | 0.535159 | builtin_functions.go | starcoder |
package section
import (
"math"
)
// TriangleSection - section created by triangles. It is a universal type of section
type TriangleSection struct {
Elements []Triangle // Slice of triangles
}
// Area - cross-section area
func (s TriangleSection) Area() (area float64) {
for _, tr := range s.Elements {
if tr.check() == nil {
area += tr.area()
}
}
return
}
func (s TriangleSection) centerMassX() float64 {
var summs float64
var areas float64
for _, tr := range s.Elements {
area := tr.area()
summs += area * tr.centerMassX()
areas += area
}
return summs / areas
}
func (s TriangleSection) centerMassZ() float64 {
var summs float64
var areas float64
for _, tr := range s.Elements {
area := tr.area()
summs += area * tr.centerMassZ()
areas += area
}
return summs / areas
}
// Jx - Moment inertia of axe X
func (s TriangleSection) Jx() (j float64) {
zc := s.centerMassZ()
for _, tr := range s.Elements {
if tr.check() == nil {
tm := Triangle{[3]Coord{
Coord{X: tr.P[0].X, Z: tr.P[0].Z - zc},
Coord{X: tr.P[1].X, Z: tr.P[1].Z - zc},
Coord{X: tr.P[2].X, Z: tr.P[2].Z - zc},
}}
j += tm.momentInertiaX()
}
}
return
}
// Jz - Moment inertia of axe Z
func (s TriangleSection) Jz() (j float64) {
xc := s.centerMassX()
for _, tr := range s.Elements {
if tr.check() == nil {
tm := Triangle{[3]Coord{
Coord{X: tr.P[0].X - xc, Z: tr.P[0].Z},
Coord{X: tr.P[1].X - xc, Z: tr.P[1].Z},
Coord{X: tr.P[2].X - xc, Z: tr.P[2].Z},
}}
j += tm.momentInertiaZ()
}
}
return
}
// Jmin - Minimal moment inertia
func (s TriangleSection) Jmin() (j float64) {
// degree 0
Jxo := s.Jx()
Jzo := s.Jz()
// degree 45
alpha45 := 45. / 180. * math.Pi
var rotateTriangle []Triangle
for _, tr := range s.Elements {
var rTriangle Triangle
for i := range tr.P {
lenght := math.Sqrt(tr.P[i].X*tr.P[i].X + tr.P[i].Z*tr.P[i].Z)
alpha := math.Atan(tr.P[i].Z / tr.P[i].X)
alpha += alpha45
rTriangle.P[i] = Coord{
X: lenght * math.Cos(alpha),
Z: lenght * math.Sin(alpha),
}
}
rotateTriangle = append(rotateTriangle, rTriangle)
}
Jx45 := TriangleSection{Elements: rotateTriangle}.Jx()
// f = (cos45)^2 = (sin45)^2
f := math.Pow(math.Cos(45./180.*math.Pi), 2.)
Jxyo := Jxo*f - Jx45 + Jzo*f
alpha := math.Atan(2 * Jxyo / (Jzo - Jxo))
Ju := Jxo*math.Pow(math.Cos(alpha), 2.) - Jxyo*math.Sin(2*alpha) + Jzo*math.Pow(math.Sin(alpha), 2.)
Jv := Jxo*math.Pow(math.Sin(alpha), 2.) + Jxyo*math.Sin(2*alpha) + Jzo*math.Pow(math.Cos(alpha), 2.)
return math.Min(Ju, Jv)
}
// Wx - Section modulus of axe X
func (s TriangleSection) Wx() (j float64) {
var zmax float64
zc := s.centerMassZ()
for _, tr := range s.Elements {
for _, c := range tr.P {
zmax = math.Max(zmax, c.Z-zc)
}
}
return s.Jx() / zmax
}
// Wz - Section modulus of axe Z
func (s TriangleSection) Wz() (j float64) {
var xmax float64
xc := s.centerMassX()
for _, tr := range s.Elements {
for _, c := range tr.P {
xmax = math.Max(xmax, c.X-xc)
}
}
return s.Jz() / xmax
}
// Check - check property of section
func (s TriangleSection) Check() error {
for _, tr := range s.Elements {
if err := tr.check(); err != nil {
return err
}
}
return nil
} | section/sectionTriangles.go | 0.656548 | 0.507873 | sectionTriangles.go | starcoder |
package chron
import (
"time"
"github.com/dustinevan/chron/dura"
"fmt"
"reflect"
"database/sql/driver"
"strings"
)
// Time implementations are instants in time that are transferable to
// other instants with a different precision--year, month, day, hour,
// minute, second, milli, micro, chron--which has nanosecond precision.
// Implementations are also transferable to an underlying time.Time
// via AsTime(). Transferring to a type with lower precision truncates.
// the underlying structs (Year, Month, ...) each wrap an anonymous
// time.Time allowing access to general time.Time functionality.
type Time interface {
AsYear() Year
AsMonth() Month
AsDay() Day
AsHour() Hour
AsMinute() Minute
AsSecond() Second
AsMilli() Milli
AsMicro() Micro
AsChron() Chron
AsTime() time.Time
Incrementer
}
// Incrementer implementations take in a dura.Time (similar to time.Duration)
// and return a nanosecond precision Chron instance. While Add and Sub functions
// are available via the internal time.Time, these functions allow addition and
// subtraction of fuzzy durations, Example: 1 year, 13 months, 54 days, and 3409853 seconds
// year and month would increment the fuzzy year and month durations, while days and seconds
// would increment by the exact values.
type Incrementer interface {
Increment(dura.Time) Chron
Decrement(dura.Time) Chron
}
// Chron is analogous to time.Time. Chron has nanosecond precision and implements the
// Time and Span interfaces.
type Chron struct {
time.Time
}
func Now() Chron {
return TimeOf(time.Now().In(time.UTC))
}
func NewTime(year int, month time.Month, day, hour, min, sec, nano int) Chron {
return Chron{time.Date(year, time.Month(month), day, hour, min, sec, nano, time.UTC)}
}
func TimeOf(t time.Time) Chron {
t = t.UTC()
return Chron{t}
}
func (t Chron) AsYear() Year { return YearOf(t.Time) }
func (t Chron) AsMonth() Month { return MonthOf(t.Time) }
func (t Chron) AsDay() Day { return DayOf(t.Time) }
func (t Chron) AsHour() Hour { return HourOf(t.Time) }
func (t Chron) AsMinute() Minute { return MinuteOf(t.Time) }
func (t Chron) AsSecond() Second { return SecondOf(t.Time) }
func (t Chron) AsMilli() Milli { return MilliOf(t.Time) }
func (t Chron) AsMicro() Micro { return MicroOf(t.Time) }
func (t Chron) AsChron() Chron { return t }
func (t Chron) AsTime() time.Time { return t.Time }
func (t Chron) Increment(d dura.Time) Chron {
return Chron{t.AddDate(d.Years(), d.Months(), d.Days()).Add(d.Duration())}
}
func (t Chron) Decrement(d dura.Time) Chron {
return Chron{t.AddDate(-1*d.Years(), -1*d.Months(), -1*d.Days()).Add(-1 * d.Duration())}
}
// AddN adds n Nanoseconds to the TimeExact
func (t Chron) AddN(n int) Chron {
return TimeOf(t.AsTime().Add(time.Duration(n)))
}
// span.Time implementation
func (t Chron) Start() Chron {
return t
}
func (t Chron) End() Chron {
return t
}
func (t Chron) Contains(s Span) bool {
return !t.Before(s) && !t.After(s)
}
func (t Chron) Before(s Span) bool {
return t.End().AsTime().Before(s.Start().AsTime())
}
func (t Chron) After(s Span) bool {
return t.Start().AsTime().After(s.End().AsTime())
}
func (t Chron) Duration() dura.Time {
return dura.Nano
}
func (t Chron) AddYears(y int) Chron {
return t.Increment(dura.Years(y))
}
func (t Chron) AddMonths(m int) Chron {
return t.Increment(dura.Months(m))
}
func (t Chron) AddDays(d int) Chron {
return t.Increment(dura.Days(d))
}
func (t Chron) AddHours(h int) Chron {
return t.Increment(dura.Hours(h))
}
func (t Chron) AddMinutes(m int) Chron {
return t.Increment(dura.Mins(m))
}
func (t Chron) AddSeconds(s int) Chron {
return t.Increment(dura.Secs(s))
}
func (t Chron) AddMillis(m int) Chron {
return t.Increment(dura.Millis(m))
}
func (t Chron) AddMicros(m int) Chron {
return t.Increment(dura.Micros(m))
}
func (t Chron) AddNanos(n int) Chron {
return t.AddN(n)
}
func (t *Chron) Scan(value interface{}) error {
if value == nil {
*t = ZeroValue().AsChron()
return nil
}
if tt, ok := value.(time.Time); ok {
*t = TimeOf(tt)
return nil
}
return fmt.Errorf("unsupported Scan, storing %s into type *chron.Day", reflect.TypeOf(value))
}
func (t Chron) Value() (driver.Value, error) {
// todo: error check the range.
return t.Time, nil
}
func ZeroValue() Chron {
return TimeOf(time.Time{})
}
func ZeroYear() Chron {
return NewYear(0).AsChron()
}
func ZeroUnix() Chron {
return TimeOf(time.Unix(0, 0))
}
func ZeroTime() time.Time {
return time.Time{}.UTC()
}
// see: https://stackoverflow.com/questions/25065055/what-is-the-maximum-time-time-in-go
// and time.Unix() implementation
var unixToInternal = int64((1969*365 + 1969/4 - 1969/100 + 1969/400) * 24 * 60 * 60)
var max = time.Unix(1<<63-1-unixToInternal, 999999999).UTC()
var minimum = time.Unix(-1*int64(^uint(0)>>1)-1+unixToInternal, 0).UTC()
func MaxValue() Chron {
return TimeOf(max)
}
func MinValue() Chron {
return TimeOf(minimum)
}
func Parse(s string) (time.Time, error) {
var errs []error
for _, fn := range ParseFunctions {
t, err := fn(s)
if err != nil {
errs = append(errs, err)
continue
}
return t, nil
}
return ZeroTime(), ErrJoin(errs, "; ")
}
func ErrJoin(errs []error, delim string) error {
s := make([]string, 0)
for _, e := range errs {
s = append(s, e.Error())
}
return fmt.Errorf("%s", strings.Join(s, delim))
} | time.go | 0.699562 | 0.483344 | time.go | starcoder |
package propcheck
import (
"fmt"
"strings"
"time"
)
type SimpleRNG struct {
Seed int
}
func (w SimpleRNG) String() string {
return fmt.Sprintf("SimpleRMG{Seed: %v}", w.Seed)
}
func NextInt(r SimpleRNG) (int, SimpleRNG) {
newSeed := (r.Seed*0x5DEECE66D + 0xB) & 0xFFFFFFFFFFFF
nextRNG := SimpleRNG{newSeed}
n := newSeed >> 16
return n, nextRNG
}
// All the subsequent functions return A function which takes A SimpleRNG and returns an (A(or B or C), SimpleRNG) pair.
// Generate A random Int.
func Int() func(SimpleRNG) (int, SimpleRNG) {
return func(r SimpleRNG) (int, SimpleRNG) {
return NextInt(r)
}
}
type WeightedGen[A any] struct {
Gen func(rng SimpleRNG) (A, SimpleRNG)
Weight int
}
// Generates A random value from A set of generators in proportion to an individual generator's weight in the list.
func Weighted[A any](wgen []WeightedGen[A]) func(SimpleRNG) (A, SimpleRNG) {
return func(rng SimpleRNG) (A, SimpleRNG) {
var r []func(SimpleRNG) (A, SimpleRNG)
for _, p := range wgen {
for i := 0; i < p.Weight; i++ {
r = append(r, p.Gen)
}
}
a := ChooseInt(0, len(r))
b, _ := a(rng)
d := b
g, rng2 := r[d](rng)
return g, rng2
}
}
// Generates A non-negative integer
var NonNegativeInt = func(rng SimpleRNG) (int, SimpleRNG) {
i, r := NextInt(rng)
if i < 0 {
return -(i + 1), r
} else {
return i, r
}
}
// Generates A float64 floating point number
var Float = func() func(SimpleRNG) (float64, SimpleRNG) {
fa := func(a int) float64 {
aa := a
aaa := float64(aa)
if aaa > 0 {
return 1.0 / aaa
} else {
return float64(0)
}
}
return Map(NonNegativeInt, fa)
}
var EmptyString = func() func(SimpleRNG) (string, SimpleRNG) {
return Id("")
}
// See https://www.joelonsoftware.com/2003/10/08/the-absolute-minimum-every-software-developer-absolutely-positively-must-know-about-unicode-and-character-sets-no-excuses/
// You must understand these things about Unicode and character sets. The jist is that A Unicode codepoint('\u04E00' for example) can result in A string of 1 to 4 characters
// depending on the character set.
// Be careful about specifying the stringMaxSize because if you make it too large you will probably never end up with an empty string. A rule of
// thumb is to make the stringMaxSize 1/3 of the number of test cases you are running.
func String(unicodeMaxSize int) func(SimpleRNG) (string, SimpleRNG) {
f := func(numOfCharactersInSet int, startingRune rune) []string {
var unicodeStrings []string
var currentUnicodeString string
var currentRune = startingRune
for x := 0; x <= numOfCharactersInSet; x++ {
currentUnicodeString = fmt.Sprintf("%v", string(currentRune))
unicodeStrings = append(unicodeStrings, currentUnicodeString)
currentRune = currentRune + 0x01
}
return unicodeStrings
}
//latin := f(128, '\u0000')
arabicNumbers := f(10, '\u0030')
asciiLowercaseLetters := f(26, '\u0061')
asciiUppercaseLetters := f(26, '\u0041')
//hanchinesesubset := f(1000, '\u4E00')
//cyrillic := f(646-456+60, '\u0400')
//greek := f(1023-880, '\u0370')
//bigUnicodeList := append(append(cyrillic, greek...), append(latin, hanchinesesubset...)...)
bigUnicodeList := append(arabicNumbers, append(asciiLowercaseLetters, asciiUppercaseLetters...)...)
start := 0
stopInclusive := len(bigUnicodeList)
return func(rng SimpleRNG) (string, SimpleRNG) {
var i int //The index into the big array of Unicode codepoints.
var lr = rng //The ever-changing random number generator inside the loop below.
var res []string //The growing list of unicode codepoints for making A single string at the end.
var randomMaxSize int //The max size of this string measured by the number of unicode code points, not necessarily the size of the resulting string.
randomMaxSize, lr = ChooseInt(0, unicodeMaxSize)(lr) //Randomly choose A value for the number of Unicode code points.
for x := 0; x < randomMaxSize; x++ {
_, lr = NextInt(lr)
i, lr = ChooseInt(start, stopInclusive)(lr)
res = append(res, bigUnicodeList[i])
}
return strings.Join(res, ""), lr
}
}
// Generates a random date (stopExclusive - start) days from or preceding 1999-12-31.
func ChooseDate(start int, stopExclusive int) func(SimpleRNG) (time.Time, SimpleRNG) {
g := func(days int, past bool) time.Time {
ninetynine := "1999-12-31"
current, _ := time.Parse("2006-01-02", ninetynine)
if past {
return current.AddDate(0, 0, -days).Round(time.Hour)
} else {
return current.AddDate(0, 0, days).Round(time.Hour)
}
}
return Map2(ChooseInt(start, stopExclusive), Boolean(), g)
}
// Generates an integer between start and stop exclusive
func ChooseInt(start int, stopExclusive int) func(SimpleRNG) (int, SimpleRNG) {
fa := func(a int) int {
var divisor = stopExclusive - start
if divisor <= 0 {
divisor = 1
}
aa := a //.(int)
r := start + aa%(divisor)
return r
}
return Map(NonNegativeInt, fa)
}
// Generates A random boolean
func Boolean() func(SimpleRNG) (bool, SimpleRNG) {
fa := func(a int) bool {
aa := a
return aa%2 == 0
}
return Map(NonNegativeInt, fa)
}
// Generates an array of N elements from the given generator
func ArrayOfN[T any](n int, g func(SimpleRNG) (T, SimpleRNG)) func(SimpleRNG) ([]T, SimpleRNG) {
var s []func(SimpleRNG) (T, SimpleRNG)
for x := 0; x < n; x++ {
s = append(s, g)
}
u := Sequence(s)
return u
}
// Generates an array with A size in the indicated range using the given Gen
func ChooseArray[T any](start, stopInclusive int, kind func(SimpleRNG) (T, SimpleRNG)) func(SimpleRNG) ([]T, SimpleRNG) {
return func(rng SimpleRNG) ([]T, SimpleRNG) {
if start < 0 || start > stopInclusive {
panic(fmt.Sprintf("Low range[%v] was < 0 or exceeded the high range[%v]", start, stopInclusive))
}
i, _ := ChooseInt(start, stopInclusive)(rng)
r, rng2 := ArrayOfN(i, kind)(rng)
return r, rng2
}
} | propcheck/gen.go | 0.778565 | 0.47859 | gen.go | starcoder |
package grammar
import (
"fmt"
"regexp"
)
// Token type represent the symbol or a substring of
// a grammar.
type Token string
// NonTerminal is the type respresenting the right-hand side
// of a rule in CNF with 2 symbols.
type NonTerminal struct {
Left Token
Right Token
}
// GetToken returns the token of a Rule. A NonTerminal doesn't
// have the token.
func (NonTerminal) GetToken() (Token, bool) {
return Token(""), false
}
// GetLeft returns the left symbol of the right-hand side rule.
func (nt NonTerminal) GetLeft() (Token, bool) {
return nt.Left, true
}
// GetRight returns the right symbol of the right-hand side rule.
func (nt NonTerminal) GetRight() (Token, bool) {
return nt.Right, true
}
// Terminal is the type representing the right-hand side
// of a rule in CNF with only one terminal.
type Terminal string
// GetToken returns the Token of the Rule.
func (t Terminal) GetToken() (Token, bool) {
return Token(t), true
}
// GetLeft returns the left symbol of the Rule. For a Terminal,
// No Token is returned.
func (Terminal) GetLeft() (Token, bool) {
return Token(""), false
}
// GetRight returns the right symbol of the Rule. For a Terminal,
// No Token is returned.
func (Terminal) GetRight() (Token, bool) {
return Token(""), false
}
// Rule is the interface representing the right-hand side of
// a CNF grammar.
type Rule interface {
//GetToken() (Token, bool)
//GetLeft() (Token, bool)
//GetRight() (Token, bool)
}
// Rules is a slice of Rule representing the different possibilities
// of each symbol.
type Rules []Rule
// Grammar is the type representing the CNF grammar.
type Grammar map[Token]Rules
// GetTokensOfT returns all the Terminal tokens matching the
// right-hand side given in paramater `s`.
func (g *Grammar) GetTokensOfT(s string) (tokens []Token) {
for t, rules := range *g {
for _, r := range rules {
v, ok := r.(string) // Terminal declared as type string
if ok && IsRegEq(v, s) {
tokens = append(tokens, t)
}
}
}
return
}
// GetTokensOfNT returns all the NonTerminal tokens matching the
// right-hand side given in paramater.
func (g *Grammar) GetTokensOfNT(leftT []Token, rightT []Token) (tokens []Token) {
for t, rules := range *g {
for _, r := range rules {
v, ok := r.(NonTerminal)
if ok {
for _, left := range leftT {
if left == v.Left {
for _, right := range rightT {
if right == v.Right {
tokens = append(tokens, t)
}
}
}
}
}
}
}
return
}
// GetListOfT returns a list of *Terminal matching with the
// left-hand side token `t` given in parameter.
func (g *Grammar) GetListOfT(t Token) (nt []*Terminal) {
for _, i := range (*g)[t] {
v, ok := i.(Terminal)
if ok {
nt = append(nt, &v)
}
}
return
}
// GetListOfNT returns a list of *NonTerminal matching with the
// left-hand side token `t` given in parameter.
func (g *Grammar) GetListOfNT(t Token) (nt []*NonTerminal) {
for _, i := range (*g)[t] {
v, ok := i.(NonTerminal)
if ok {
nt = append(nt, &v)
}
}
return
}
// IsRegEq check if the `reg` match as a regular expression with
// the value `val`.
func IsRegEq(reg string, val string) bool {
exp := fmt.Sprintf("^%s$", reg)
res, _ := regexp.MatchString(exp, val)
return res
} | grammar/grammar.go | 0.784773 | 0.490785 | grammar.go | starcoder |
package internal
import (
"fmt"
"github.com/nsf/termbox-go"
"io"
"math/rand"
)
/*
Maze represents the configuration of a specific Maze within InfiniMaze
*/
type Maze struct {
Directions [][]int //Each Point on the map is represented as an integer that defines the directions that can be traveled from that Point
Height int //Height of Maze
Width int //Width of Maze
XLocation int //Global X position within InfiniMaze
YLocation int //Global Y position within InfiniMaze
Exits [4]*Point //Point array for the four "doors" leading the adjoining Mazes
Cursor *Point //Users location within the Maze
NorthMaze *Maze //Reference to the Maze North of the current maze
SouthMaze *Maze //Reference to the Maze South of the current maze
WestMaze *Maze //Reference to the Maze West of the current maze
EastMaze *Maze //Reference to the Maze East of the current maze
}
// NewMaze creates a new Maze
func NewMaze(height int, width int, xLoc int, yLoc int) *Maze {
var directions [][]int
for x := 0; x < height; x++ {
directions = append(directions, make([]int, width))
}
maze := &Maze{
directions,
height,
width,
xLoc,
yLoc,
[4]*Point{
{height / 2, -1}, //left wall exit
{-1, width / 2}, //top wall exit
{height, width / 2}, //bottom wall exit
{height / 2, width}, //right wall exit
},
&Point{height / 2, width / 2},
nil,
nil,
nil,
nil,
}
maze.Generate()
return maze
}
// Neighbors gathers the nearest undecided points
func (maze *Maze) Neighbors(point *Point) (neighbors []int) {
for _, direction := range Directions {
next := point.Advance(direction)
if maze.Contains(next) && maze.Directions[next.X][next.Y] == 0 {
neighbors = append(neighbors, direction)
}
}
return neighbors
}
// Connected judges whether the two points is connected by a path on the maze
func (maze *Maze) Connected(point *Point, target *Point) bool {
dir := maze.Directions[point.X][point.Y]
for _, direction := range Directions {
if dir&direction != 0 {
next := point.Advance(direction)
if next.X == target.X && next.Y == target.Y {
return true
}
}
}
return false
}
// Next advances the Maze path randomly and returns the new point
func (maze *Maze) Next(point *Point) *Point {
neighbors := maze.Neighbors(point)
if len(neighbors) == 0 {
return nil
}
direction := neighbors[rand.Int()%len(neighbors)]
maze.Directions[point.X][point.Y] |= direction
next := point.Advance(direction)
maze.Directions[next.X][next.Y] |= Opposite[direction]
return next
}
// Generate the Maze
func (maze *Maze) Generate() {
point := maze.Cursor
stack := []*Point{point}
for len(stack) > 0 {
for {
point = maze.Next(point)
if point == nil {
break
}
stack = append(stack, point)
}
i := rand.Int() % ((len(stack) + 1) / 2)
point = stack[i]
stack = append(stack[:i], stack[i+1:]...)
}
//We ensure that we don't block off the exit "doors" here after Maze generation is done
exitSquare := maze.Exits[0].Advance(Right)
maze.Next(exitSquare)
exitSquare = maze.Exits[1].Advance(Down)
maze.Next(exitSquare)
exitSquare = maze.Exits[2].Advance(Up)
maze.Next(exitSquare)
exitSquare = maze.Exits[3].Advance(Left)
maze.Next(exitSquare)
}
//Prints the user global position in the top right
func (maze *Maze) printLocation() {
str := fmt.Sprintf("%d : %d ", maze.XLocation, maze.YLocation)
fg, bg := termbox.ColorDefault, termbox.ColorDefault
for i, c := range str {
termbox.SetCell(4*maze.Width+i-8, 1, c, fg, bg)
}
}
//Check for whether point on Maze is an exit "door" to another Maze
func (maze *Maze) PointIsExit(point *Point) bool {
for _, exitPoint := range maze.Exits {
if exitPoint.X == point.X && exitPoint.Y == point.Y {
return true
}
}
return false
}
// Advance the point forward by the argument direction
func (point *Point) Advance(direction int) *Point {
return &Point{point.X + dx[direction], point.Y + dy[direction]}
}
// Contains judges whether the argument point is inside Maze or not
func (maze *Maze) Contains(point *Point) bool {
return 0 <= point.X && point.X < maze.Height && 0 <= point.Y && point.Y < maze.Width
}
// Move the cursor
func (maze *Maze) Move(direction int) {
point := maze.Cursor
next := point.Advance(direction)
// If there's a path on the Maze, we can move the cursor
if maze.Contains(next) && maze.Directions[point.X][point.Y]&direction == direction {
maze.Directions[point.X][point.Y] ^= direction << VisitedOffset
maze.Directions[next.X][next.Y] ^= Opposite[direction] << VisitedOffset
maze.Cursor = next
}
}
// Print out the Maze to the IO writer
func (maze *Maze) Print(writer io.Writer, format *Format) {
strwriter := make(chan string)
go maze.Write(strwriter, format)
for {
str := <-strwriter
switch str {
case "\u0000":
return
default:
_, _ = fmt.Fprint(writer, str)
}
}
}
// Write out the Maze to the writer channel
func (maze *Maze) Write(writer chan string, format *Format) {
//Print global maze location
maze.printLocation()
writer <- "\n"
for x, row := range maze.Directions {
// There are two lines printed for each Maze line
for _, direction := range []int{Up, Right} {
// The left wall
if x == maze.Height/2 && direction == Right {
writer <- format.ExitLeft
} else {
writer <- format.Wall
}
for y, directions := range row {
// In the `direction == Right` line, we print the path cell
if direction == Right {
if maze.Cursor.X == x && maze.Cursor.Y == y {
writer <- format.Cursor
} else {
writer <- format.Path
}
}
if directions&direction != 0 { // If there is a path in the direction (Up or Right) on the Maze
writer <- format.Path
} else if direction == Up && y == maze.Width/2 && x == 0 {
writer <- format.ExitUp
} else if direction == Right && x == maze.Height/2 && y == maze.Width-1 {
writer <- format.ExitRight
} else {
writer <- format.Wall
}
if direction == Up {
writer <- format.Wall
}
}
writer <- "\n"
}
}
// Print the bottom wall of the Maze
writer <- format.Wall
for y := 0; y < maze.Width; y++ {
if y == maze.Width/2 {
writer <- format.ExitDown
} else {
writer <- format.Wall
}
writer <- format.Wall
}
writer <- "\n\n"
// Inform that we finished printing the Maze
writer <- "\u0000"
} | internal/maze.go | 0.548432 | 0.44077 | maze.go | starcoder |
package main
import (
"fmt"
"math"
. "github.com/jakecoffman/cp"
"github.com/jakecoffman/cp/examples"
)
var queryStart Vector
func main() {
space := NewSpace()
queryStart = Vector{}
space.Iterations = 5
// fat segment
{
mass := 1.0
length := 100.0
a := Vector{-length / 2.0, 0}
b := Vector{length / 2.0, 0}
body := space.AddBody(NewBody(mass, MomentForSegment(mass, a, b, 0)))
body.SetPosition(Vector{0, 100})
space.AddShape(NewSegment(body, a, b, 20))
}
// static segment
{
space.AddShape(NewSegment(space.StaticBody, Vector{0, 300}, Vector{300, 0}, 0))
}
// pentagon
{
mass := 1.0
const numVerts = 5
verts := []Vector{}
for i := 0; i < numVerts; i++ {
angle := -2.0 * math.Pi * float64(i) / numVerts
verts = append(verts, Vector{30 * math.Cos(angle), 30 * math.Sin(angle)})
}
body := space.AddBody(NewBody(mass, MomentForPoly(mass, len(verts), verts, Vector{}, 0)))
body.SetPosition(Vector{50, 30})
space.AddShape(NewPolyShape(body, numVerts, verts, NewTransformIdentity(), 10))
}
// circle
{
mass := 1.0
r := 20.0
body := space.AddBody(NewBody(mass, MomentForCircle(mass, 0, r, Vector{})))
body.SetPosition(Vector{100, 100})
space.AddShape(NewCircle(body, r, Vector{}))
}
examples.Main(space, 1.0/60.0, update, examples.DefaultDraw)
}
func update(space *Space, dt float64) {
space.Step(dt)
if examples.RightClick {
queryStart = examples.Mouse
}
start := queryStart
end := examples.Mouse
radius := 10.0
examples.DrawSegment(start, end, FColor{0, 1, 0, 0})
str := `Query: Dist(%f) Point(%5.2f, %5.2f), `
segInfo := space.SegmentQueryFirst(start, end, radius, SHAPE_FILTER_ALL)
if segInfo.Shape != nil {
point := segInfo.Point
n := segInfo.Normal
examples.DrawSegment(start.Lerp(end, segInfo.Alpha), end, FColor{0, 0, 1, 1})
examples.DrawSegment(point, point.Add(n.Mult(16)), FColor{1, 0, 0, 1})
examples.DrawDot(3, point, FColor{1, 0, 0, 1})
str += fmt.Sprintf("Segment Query: Dist(%f) Normal(%5.2f, %5.2f)",
segInfo.Alpha*start.Distance(end), n.X, n.Y)
} else {
str += "Segment Query (None)"
}
// Draw a fat green line over the unoccluded part of the query
examples.DrawFatSegment(start, start.Lerp(end, segInfo.Alpha), radius, FColor{0, 1, 0, 1}, FColor{})
nearestInfo := space.PointQueryNearest(examples.Mouse, 100, SHAPE_FILTER_ALL)
if nearestInfo.Shape != nil {
examples.DrawDot(3, examples.Mouse, FColor{0.5, 0.5, 0.5, 1})
examples.DrawSegment(examples.Mouse, nearestInfo.Point, FColor{0.5, 0.5, 0.5, 1})
if nearestInfo.Distance < 0 {
examples.DrawBB(nearestInfo.Shape.BB(), FColor{1, 0, 0, 1})
}
}
examples.DrawString(Vector{-300, -200}, fmt.Sprintf(str, start.Distance(end), end.X, end.Y))
} | examples/query/query.go | 0.703346 | 0.555676 | query.go | starcoder |
package docs
import (
"bytes"
"encoding/json"
"strings"
"github.com/alecthomas/template"
"github.com/swaggo/swag"
)
var doc = `{
"swagger": "2.0",
"info": {
"description": "{{.Description}}",
"version": "{{.Version}}",
"title": "{{.Title}}",
"contact": {},
"license": {}
},
"host": "{{.Host}}",
"basePath": "{{.BasePath}}",
"tags": [
{
"name": "modules",
"description": "Terrafrom modules",
"externalDocs": {
"description": "Find out more",
"url": "https://www.terraform.io/docs/registry/api.html"
}
}
],
"schemes": {{ marshal .Schemes }},
"paths": {
"/": {
"get": {
"tags": [
"modules"
],
"summary": "List modules",
"description": "Returns modules",
"operationId": "getModules",
"produces": [
"application/json"
],
"parameters": [
{
"name": "offset",
"in": "query",
"description": "Pagenation offset",
"required": false,
"type": "integer"
},
{
"name": "limit",
"in": "query",
"description": "Pagenation limit",
"required": false,
"type": "integer"
},
{
"name": "provider",
"in": "query",
"description": "Limits modules to a specific provider",
"required": false,
"type": "string"
},
{
"name": "verified",
"in": "query",
"description": "If true, limits results to only verified modules. Any other value including none returns all modules including verified ones.",
"required": false,
"type": "boolean"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/search": {
"get": {
"tags": [
"modules"
],
"summary": "Search for modules in a given namespace",
"description": "Returns modules in the namespace",
"operationId": "searchModules",
"produces": [
"application/json"
],
"parameters": [
{
"name": "q",
"in": "query",
"description": "The search string. Search syntax understood depends on registry implementation. The public registry supports basic keyword or phrase searches.",
"required": true,
"type": "string"
},
{
"name": "offset",
"in": "query",
"description": "Pagenation offset",
"required": false,
"type": "integer"
},
{
"name": "limit",
"in": "query",
"description": "Pagenation limit",
"required": false,
"type": "integer"
},
{
"name": "provider",
"in": "query",
"description": "Limits modules to a specific provider",
"required": false,
"type": "string"
},
{
"name": "namespace",
"in": "query",
"description": "Limits results to a specific namespace",
"required": false,
"type": "string"
},
{
"name": "verified",
"in": "query",
"description": "If true, limits results to only verified modules. Any other value including none returns all modules including verified ones.",
"required": false,
"type": "boolean"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/{namespace}": {
"get": {
"tags": [
"modules"
],
"summary": "List modules in a given namespace",
"description": "Returns modules in the namespace",
"operationId": "getModulesByNamespace",
"produces": [
"application/json"
],
"parameters": [
{
"name": "namespace",
"in": "path",
"description": "Namespace...",
"required": true,
"type": "string"
},
{
"name": "offset",
"in": "query",
"description": "Pagenation offset",
"required": false,
"type": "integer"
},
{
"name": "limit",
"in": "query",
"description": "Pagenation limit",
"required": false,
"type": "integer"
},
{
"name": "provider",
"in": "query",
"description": "Limits modules to a specific provider",
"required": false,
"type": "string"
},
{
"name": "verified",
"in": "query",
"description": "If true, limits results to only verified modules. Any other value including none returns all modules including verified ones.",
"required": false,
"type": "boolean"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/{namespace}/{name}/{provider}/versions": {
"get": {
"tags": [
"modules"
],
"summary": "List modules in a given namespace",
"description": "Returns modules in the namespace",
"operationId": "getModuleByVersion",
"produces": [
"application/json"
],
"parameters": [
{
"name": "provider",
"in": "path",
"description": "Provider...",
"required": true,
"type": "string"
},
{
"name": "name",
"in": "path",
"description": "Module Name...",
"required": true,
"type": "string"
},
{
"name": "namespace",
"in": "path",
"description": "Namespace...",
"required": true,
"type": "string"
},
{
"name": "offset",
"in": "query",
"description": "Pagenation offset",
"required": false,
"type": "integer"
},
{
"name": "limit",
"in": "query",
"description": "Pagenation limit",
"required": false,
"type": "integer"
},
{
"name": "provider",
"in": "query",
"description": "Limits modules to a specific provider",
"required": false,
"type": "string"
},
{
"name": "verified",
"in": "query",
"description": "If true, limits results to only verified modules. Any other value including none returns all modules including verified ones.",
"required": false,
"type": "boolean"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/{namespace}/{name}/{provider}/{verion}/download": {
"get": {
"tags": [
"modules"
],
"summary": "Download Source Code for a Specific Module Version",
"description": "Downloads the specified version of a module for a single provider",
"operationId": "downloadModuleByProviderVersion",
"produces": [
"application/json"
],
"parameters": [
{
"name": "provider",
"in": "path",
"description": "Provider...",
"required": true,
"type": "string"
},
{
"name": "name",
"in": "path",
"description": "Module Name...",
"required": true,
"type": "string"
},
{
"name": "namespace",
"in": "path",
"description": "Namespace...",
"required": true,
"type": "string"
},
{
"name": "verion",
"in": "path",
"description": "The version of the module",
"required": true,
"type": "string"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/{namespace}/{name}/{provider}": {
"get": {
"tags": [
"modules"
],
"summary": "Latest Version for a Specific Module Provider",
"description": "Returns the latest version of a module for a single provider",
"operationId": "getLatestModuleByProvider",
"produces": [
"application/json"
],
"parameters": [
{
"name": "namespace",
"in": "path",
"description": "Namespace...",
"required": true,
"type": "string"
},
{
"name": "name",
"in": "path",
"description": "Module Name...",
"required": true,
"type": "string"
},
{
"name": "provider",
"in": "path",
"description": "Provider...",
"required": true,
"type": "string"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/{namespace}/{name}": {
"get": {
"tags": [
"modules"
],
"summary": "List Latest Version of Modules for All Providers",
"description": "Returns the latest version of each provider for a module.",
"operationId": "getLatestModule",
"produces": [
"application/json"
],
"parameters": [
{
"name": "namespace",
"in": "path",
"description": "Namespace...",
"required": true,
"type": "string"
},
{
"name": "name",
"in": "path",
"description": "Module Name...",
"required": true,
"type": "string"
},
{
"name": "offset",
"in": "query",
"description": "Pagenation offset",
"required": false,
"type": "integer"
},
{
"name": "limit",
"in": "query",
"description": "Pagenation limit",
"required": false,
"type": "integer"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/{namespace}/{name}/{provider}/{version}": {
"get": {
"tags": [
"modules"
],
"summary": "Get a Specific Module",
"description": "Returns the specified version of a module for a single provider",
"operationId": "geModuleByProviderVersion",
"produces": [
"application/json"
],
"parameters": [
{
"name": "namespace",
"in": "path",
"description": "Namespace...",
"required": true,
"type": "string"
},
{
"name": "name",
"in": "path",
"description": "Module Name...",
"required": true,
"type": "string"
},
{
"name": "provider",
"in": "path",
"description": "Provider...",
"required": true,
"type": "string"
},
{
"name": "version",
"in": "path",
"description": "Module version",
"required": true,
"type": "string"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
},
"/{namespace}/{name}/{provider}/download": {
"get": {
"tags": [
"modules"
],
"summary": "Download the Latest Version of a Module",
"description": "Downloads the latest version of a module for a single provider",
"operationId": "downloadLatestProviderModule",
"produces": [
"application/json"
],
"parameters": [
{
"name": "namespace",
"in": "path",
"description": "Namespace...",
"required": true,
"type": "string"
},
{
"name": "name",
"in": "path",
"description": "Module Name...",
"required": true,
"type": "string"
},
{
"name": "provider",
"in": "path",
"description": "Provider...",
"required": true,
"type": "string"
}
],
"responses": {
"200": {
"description": "successful operation"
},
"400": {
"description": "Invalid ID supplied"
},
"404": {
"description": "Modules not found"
}
}
}
}
},
"definitions": {
"ErrorResponse": {
"type": "object",
"properties": {
"errors": {
"type": "array",
"items": {
"type": "string"
}
}
}
}
},
"externalDocs": {
"description": "Find out more about Swagger",
"url": "http://swagger.io"
}
}`
type swaggerInfo struct {
Version string
Host string
BasePath string
Schemes []string
Title string
Description string
}
// SwaggerInfo holds exported Swagger Info so clients can modify it
var SwaggerInfo = swaggerInfo{
Version: "0.0.1",
Host: "localhost",
BasePath: "/v1/modules",
Schemes: []string{},
Title: "Private Terraform Regestry",
Description: "",
}
type s struct{}
func (s *s) ReadDoc() string {
sInfo := SwaggerInfo
sInfo.Description = strings.Replace(sInfo.Description, "\n", "\\n", -1)
t, err := template.New("swagger_info").Funcs(template.FuncMap{
"marshal": func(v interface{}) string {
a, _ := json.Marshal(v)
return string(a)
},
}).Parse(doc)
if err != nil {
return doc
}
var tpl bytes.Buffer
if err := t.Execute(&tpl, sInfo); err != nil {
return doc
}
return tpl.String()
}
func init() {
swag.Register(swag.Name, &s{})
} | docs/docs.go | 0.511473 | 0.440048 | docs.go | starcoder |
package machine
import (
"Go-SAP3/machine/types"
"math/bits"
)
// ArithmeticLogicUnit is asynchronous (un-clocked) ; Its value will change as soon as input words change.
type ArithmeticLogicUnit struct {
A types.Word
B types.Word
Sum types.Word
WriteEnable types.State
AluMode AluMode
Flags Flags
}
type Flags struct {
Carry types.State
Sign types.State
Zero types.State
Parity types.State
CaryEnable types.State
SignEnable types.State
ZeroEnable types.State
ParityEnable types.State
}
// AluMode bits control the operating mode of the ALU.
type AluMode struct {
Bit0 types.State // LSB
Bit1 types.State
Bit2 types.State
Bit3 types.State
Bit4 types.State // MSB
}
// AluMode modes are integer value of AluMode Bit flags.
const (
AluAdd = 0b00000
AluSubtract = 0b00001
AluIncrement = 0b00010
AluDecrement = 0b00011
AluComplement = 0b00100
AluAnd = 0b00101
AluOr = 0b00110
AluExclusiveOr = 0b00111
AluRotateLeft = 0b01000
AluRotateRight = 0b01001
AluAddCarry = 0b01010
AluSubtractBorrow = 0b01011
AluSetCarry = 0b01100
AluComplementCarry = 0b01101
AluRotateLeftCarry = 0b01110
AluRotateRightCarry = 0b01111
AluCompare = 0b10000
AluIncrementPair = 0b10001
AluDecrementPair = 0b10010
)
// Calculate returns the result of the arithmetic operation based on AluMode mode.
func (a *ArithmeticLogicUnit) Calculate() {
adder := BinaryAdder{}
var carryOut types.State
switch a.AluMode.getMode() {
case AluAdd:
a.Sum, carryOut = adder.Calculate(uint8(a.A), uint8(a.B), types.Low)
case AluAddCarry:
a.Sum, carryOut = adder.Calculate(uint8(a.A), uint8(a.B), a.Flags.Carry)
case AluSubtract:
bComplement2 := (^uint8(a.B)) + 1
a.Sum, carryOut = adder.Calculate(uint8(a.A), bComplement2, types.Low)
// 8085 complements the carry flag on subtraction.
carryOut = !carryOut
case AluSubtractBorrow:
// Combine B and Carry, subtract from A.
b := uint8(a.B)
if a.Flags.Carry {
b += 1
}
bComplement2 := (^b) + 1
a.Sum, carryOut = adder.Calculate(uint8(a.A), bComplement2, types.Low)
// 8085 complements the carry flag on subtraction.
carryOut = !carryOut
case AluIncrement:
a.Sum, carryOut = adder.Calculate(uint8(a.A), 1, types.Low)
case AluDecrement:
complement2 := (^uint8(1)) + 1
a.Sum, carryOut = adder.Calculate(uint8(a.A), complement2, types.Low)
// 8085 complements the carry flag on subtraction.
carryOut = !carryOut
case AluIncrementPair:
// 8085 INX does not affect any flags by design (since typically used for memory addresses).
var c types.State
a.B, c = adder.Calculate(uint8(a.B), 1, types.Low)
if c {
a.A, _ = adder.Calculate(uint8(a.A), 1, types.Low)
}
case AluDecrementPair:
// 8085 INX does not affect any flags by design (since typically used for memory addresses).
var c types.State
complement2 := (^uint8(1)) + 1
a.B, c = adder.Calculate(uint8(a.B), complement2, types.Low)
// 8085 complements the carry flag on subtraction.
c = !c
if c {
a.A, _ = adder.Calculate(uint8(a.A), complement2, types.Low)
}
case AluComplement:
a.Sum = ^a.A
case AluAnd:
a.Sum = a.A & a.B
case AluOr:
a.Sum = a.A | a.B
case AluExclusiveOr:
a.Sum = a.A ^ a.B
case AluSetCarry:
a.Flags.Carry = types.High
case AluComplementCarry:
a.Flags.Carry = !a.Flags.Carry
case AluRotateLeft:
carryOut = a.rotateAllLeft()
case AluRotateRight:
carryOut = a.rotateAllRight()
case AluRotateLeftCarry:
carryOut = a.rotateLeftCarry()
case AluRotateRightCarry:
carryOut = a.rotateRightCarry()
case AluCompare:
// Compare does B-A.
aComplement2 := (^uint8(a.A)) + 1
a.Sum, carryOut = adder.Calculate(uint8(a.B), aComplement2, types.Low)
// 8085 complements the carry flag on subtraction.
carryOut = !carryOut
}
if a.Flags.SignEnable == types.High {
a.Flags.Sign = a.Sum&0x80 != 0
}
if a.Flags.ZeroEnable == types.High {
a.Flags.Zero = a.Sum == 0
}
if a.Flags.CaryEnable == types.High {
a.Flags.Carry = carryOut
}
if a.Flags.ParityEnable == types.High {
p := bits.OnesCount8(uint8(a.Sum))
a.Flags.Parity = p%2 == 0
}
}
// getMode returns the Word value determined from Bit0 thru Bit3 flags.
func (a AluMode) getMode() types.Word {
v := 0
if a.Bit4 == types.High {
v |= 0b10000
}
if a.Bit3 == types.High {
v |= 0b01000
}
if a.Bit2 == types.High {
v |= 0b00100
}
if a.Bit1 == types.High {
v |= 0b00010
}
if a.Bit0 == types.High {
v |= 0b00001
}
return types.Word(v)
}
// Update refreshes the state of ArithmeticLogicUnit, summing the values currently set to its registers.
// When ArithmeticLogicUnit WriteEnable is High, the value is moved immediately to Bus Value.
func (a *ArithmeticLogicUnit) Update(acc AluRegister, temp AluRegister, s *System) {
a.A = acc.Get()
a.B = temp.Get()
if a.WriteEnable == types.High {
a.GetFlags(s.FRegister)
a.Calculate()
a.SetFlags(&s.FRegister)
s.Bus.Value = types.DoubleWord(a.Sum)
}
}
// GetFlags reads flag bits from Register and applies to ArithmeticLogicUnit.
// Register bits: [S Z 0 0 0 P 0 C]
func (a *ArithmeticLogicUnit) GetFlags(f Register) {
a.Flags.Carry = f.Value&0b0000_0001 != 0
a.Flags.Parity = f.Value&0b0000_0100 != 0
a.Flags.Zero = f.Value&0b0100_0000 != 0
a.Flags.Sign = f.Value&0b1000_0000 != 0
}
// SetFlags writes flag bits to Register from settings in ArithmeticLogicUnit.
// Register bits: [S Z 0 0 0 P 0 C]
func (a *ArithmeticLogicUnit) SetFlags(f *Register) {
if a.Flags.Sign {
f.Value |= 0b1000_0000
} else {
f.Value &= 0b0111_1111
}
if a.Flags.Zero {
f.Value |= 0b0100_0000
} else {
f.Value &= 0b1011_1111
}
if a.Flags.Parity {
f.Value |= 0b0000_0100
} else {
f.Value &= 0b1111_1011
}
if a.Flags.Carry {
f.Value |= 0b0000_0001
} else {
f.Value &= 0b1111_1110
}
}
func (a *ArithmeticLogicUnit) rotateAllLeft() types.State {
carryOut := a.A&0b1000_0000 != 0
a.Sum = a.A << 1
if a.Flags.Carry {
a.Sum += 1
}
return types.State(carryOut)
}
func (a *ArithmeticLogicUnit) rotateAllRight() types.State {
carryOut := a.A&0b0000_0001 != 0
a.Sum = a.A >> 1
if a.Flags.Carry {
a.Sum |= 0b1000_0000
}
return types.State(carryOut)
}
func (a *ArithmeticLogicUnit) rotateLeftCarry() types.State {
carryOut := a.A&0b1000_0000 != 0
a.Sum = a.A << 1
return types.State(carryOut)
}
func (a *ArithmeticLogicUnit) rotateRightCarry() types.State {
carryOut := a.A&0b0000_0001 != 0
a.Sum = a.A >> 1
return types.State(carryOut)
} | machine/alu.go | 0.597608 | 0.405979 | alu.go | starcoder |
package consolidators
import (
"math"
"github.com/m3db/m3/src/dbnode/client"
"github.com/m3db/m3/src/dbnode/encoding"
"github.com/m3db/m3/src/dbnode/ts"
"github.com/m3db/m3/src/query/block"
"github.com/m3db/m3/src/query/models"
"github.com/m3db/m3/src/query/storage/m3/storagemetadata"
"github.com/m3db/m3/src/x/ident"
)
// MatchOptions are multi fetch matching options.
type MatchOptions struct {
// MatchType is the equality matching type by which to compare series.
MatchType MatchType
}
// MatchType is a equality match type.
type MatchType uint
const (
// MatchIDs matches series based on ID only.
MatchIDs MatchType = iota
// MatchTags matcher series based on tags.
MatchTags
)
// QueryFanoutType is a query fanout type.
type QueryFanoutType uint
const (
// NamespaceInvalid indicates there is no valid namespace.
NamespaceInvalid QueryFanoutType = iota
// NamespaceCoversAllQueryRange indicates the given namespace covers
// the entire query range.
NamespaceCoversAllQueryRange
// NamespaceCoversPartialQueryRange indicates the given namespace covers
// a partial query range.
NamespaceCoversPartialQueryRange
)
func (t QueryFanoutType) String() string {
switch t {
case NamespaceCoversAllQueryRange:
return "coversAllQueryRange"
case NamespaceCoversPartialQueryRange:
return "coversPartialQueryRange"
default:
return "unknown"
}
}
// MultiFetchResults is a deduping accumalator for series iterators
// that allows merging using a given strategy.
type MultiFetchResults struct {
SeriesIterators encoding.SeriesIterators
Metadata block.ResultMetadata
Attrs storagemetadata.Attributes
Err error
}
// MultiFetchResult is a deduping accumalator for series iterators
// that allows merging using a given strategy.
type MultiFetchResult interface {
// Add appends series fetch results to the accumulator.
Add(r MultiFetchResults)
// AddWarnings appends warnings to the accumulator.
AddWarnings(warnings ...block.Warning)
Results() []MultiFetchResults
// FinalResult returns a series fetch result containing deduplicated series
// iterators and their metadata, and any errors encountered.
FinalResult() (SeriesFetchResult, error)
// FinalResultWithAttrs returns a series fetch result containing deduplicated series
// iterators and their metadata, as well as any attributes corresponding to
// these results, and any errors encountered.
FinalResultWithAttrs() (SeriesFetchResult, []storagemetadata.Attributes, error)
// Close releases all resources held by this accumulator.
Close() error
}
// SeriesFetchResult is a fetch result with associated metadata.
type SeriesFetchResult struct {
// Metadata is the set of metadata associated with the fetch result.
Metadata block.ResultMetadata
// seriesData is the list of series data for the result.
seriesData seriesData
}
// SeriesData is fetched series data.
type seriesData struct {
// seriesIterators are the series iterators for the series.
seriesIterators encoding.SeriesIterators
// tags are the decoded tags for the series.
tags []*models.Tags
}
// TagResult is a fetch tag result with associated metadata.
type TagResult struct {
// Metadata is the set of metadata associated with the fetch result.
Metadata block.ResultMetadata
// Tags is the list of tags for the result.
Tags []MultiTagResult
}
// MultiFetchTagsResult is a deduping accumalator for tag iterators.
type MultiFetchTagsResult interface {
// Add adds tagged ID iterators to the accumulator.
Add(
newIterator client.TaggedIDsIterator,
meta block.ResultMetadata,
err error,
)
// FinalResult returns a deduped list of tag iterators with
// corresponding series IDs.
FinalResult() (TagResult, error)
// Close releases all resources held by this accumulator.
Close() error
}
// CompletedTag represents a tag retrieved by a complete tags query.
type CompletedTag struct {
// Name the name of the tag.
Name []byte
// Values is a set of possible values for the tag.
// NB: if the parent CompleteTagsResult is set to CompleteNameOnly, this is
// expected to be empty.
Values [][]byte
}
// CompleteTagsResult represents a set of autocompleted tag names and values
type CompleteTagsResult struct {
// CompleteNameOnly indicates if the tags in this result are expected to have
// both names and values, or only names.
CompleteNameOnly bool
// CompletedTag is a list of completed tags.
CompletedTags []CompletedTag
// Metadata describes any metadata for the operation.
Metadata block.ResultMetadata
}
// CompleteTagsResultBuilder is a builder that accumulates and deduplicates
// incoming CompleteTagsResult values.
type CompleteTagsResultBuilder interface {
// Add appends an incoming CompleteTagsResult.
Add(*CompleteTagsResult) error
// Build builds a completed tag result.
Build() CompleteTagsResult
}
// MultiTagResult represents a tag iterator with its string ID.
type MultiTagResult struct {
// ID is the series ID.
ID ident.ID
// Iter is the tag iterator for the series.
Iter ident.TagIterator
}
const (
// BufferSteps is the default number of steps to buffer.
BufferSteps = 32
)
// StepCollector is implemented by any accumulators or consolidators working on
// stepwise iteration.
type StepCollector interface {
// AddPoint adds a datapoint to the current step it's within the valid time
// period; otherwise drops it silently, which is fine for consolidation.
AddPoint(ts.Datapoint)
// BufferStep computes the currently collected step values.
BufferStep()
// BufferStepCount gives the number of remaining buffer steps.
BufferStepCount() int
}
// ConsolidationFunc consolidates a bunch of datapoints into a single float value.
type ConsolidationFunc func(datapoints []ts.Datapoint) float64
// TakeLast is a consolidation function which takes the last datapoint.
func TakeLast(values []ts.Datapoint) float64 {
for i := len(values) - 1; i >= 0; i-- {
value := values[i].Value
if !math.IsNaN(value) {
return value
}
}
return math.NaN()
}
const initLength = BufferSteps
// Set NaN to a variable makes tests easier.
var nan = math.NaN() | src/query/storage/m3/consolidators/types.go | 0.69368 | 0.446072 | types.go | starcoder |
package service
import (
"fmt"
"log"
"strings"
"time"
"github.com/bwmarrin/discordgo"
)
func mentionUser(ID string) string {
return "<@" + ID + ">"
}
// SplitChannelMessageSend properly splits long output in order to accepted by the discord servers.
// also properly wrap single codeblocks that were split during this process
func SplitChannelMessageSend(s *discordgo.Session, channelID, text string) {
const codeblockDelimiter = "```"
codeblockFound := strings.Count(text, codeblockDelimiter) == 2
chunks := Split(text, "\n", 1800)
codeblockBegin := -1
codeblockEnd := -1
if codeblockFound {
beginSet := false
for idx, chunk := range chunks {
delimiterCount := strings.Count(chunk, codeblockDelimiter)
if delimiterCount == 2 {
codeblockBegin = idx
codeblockEnd = idx
break
} else if delimiterCount == 1 && !beginSet {
codeblockBegin = idx
beginSet = true
} else if delimiterCount == 1 && beginSet {
codeblockEnd = idx
break
}
}
}
isCodeblockSplit := 0 <= codeblockBegin && codeblockBegin < codeblockEnd
for idx, chunk := range chunks {
if isCodeblockSplit {
if idx == codeblockBegin {
chunk = chunk + codeblockDelimiter
} else if codeblockBegin < idx && idx < codeblockEnd {
chunk = codeblockDelimiter + chunk + codeblockDelimiter
} else if idx == codeblockEnd {
chunk = codeblockDelimiter + chunk
}
}
if _, err := s.ChannelMessageSend(channelID, chunk); err != nil {
log.Println(err)
}
}
}
func cleanupMsgs(dg *discordgo.Session, channelID string, limit int, beforeMsgID, afterMsgID, aroundMsgID string) error {
messages, err := dg.ChannelMessages(channelID, limit, beforeMsgID, afterMsgID, aroundMsgID)
if err != nil {
log.Printf("Failed to fetch messages: %v\n", err)
}
for len(messages) > 0 {
ids := make([]string, 0, len(messages))
for _, m := range messages {
ids = append(ids, m.ID)
}
err = dg.ChannelMessagesBulkDelete(channelID, ids)
if err != nil {
log.Printf("Could not bulk delete messages, trying individual deletion.")
for _, msgID := range ids {
err = dg.ChannelMessageDelete(channelID, msgID)
if err != nil {
return fmt.Errorf("Unable to cleanup messages individually: %w", err)
}
}
}
messages, err = dg.ChannelMessages(channelID, limit, beforeMsgID, afterMsgID, aroundMsgID)
if err != nil {
return fmt.Errorf("Failed to fetch messages: %v", err)
}
}
return nil
}
func cleanupBefore(dg *discordgo.Session, channelID, messageID string) error {
return cleanupMsgs(dg, channelID, 100, messageID, "", "")
}
func cleanupAfter(dg *discordgo.Session, channelID, messageID string) error {
return cleanupMsgs(dg, channelID, 100, "", messageID, "")
}
func sleepAndDelete(dg *discordgo.Session, channelID, messageID string, duration time.Duration) {
time.Sleep(duration)
dg.ChannelMessageDelete(channelID, messageID)
} | service/discord_utils.go | 0.50293 | 0.423458 | discord_utils.go | starcoder |
package govalidator
import (
"math"
"reflect"
)
// Abs returns absolute value of number
func Abs(value float64) float64 {
return math.Abs(value)
}
// Sign returns signum of number: 1 in case of value > 0, -1 in case of value < 0, 0 otherwise
func Sign(value float64) float64 {
if value > 0 {
return 1
} else if value < 0 {
return -1
} else {
return 0
}
}
// IsNegative returns true if value < 0
func IsNegative(value float64) bool {
return value < 0
}
// IsPositive returns true if value > 0
func IsPositive(value float64) bool {
return value > 0
}
// IsNonNegative returns true if value >= 0
func IsNonNegative(value float64) bool {
return value >= 0
}
// IsNonPositive returns true if value <= 0
func IsNonPositive(value float64) bool {
return value <= 0
}
// InRange returns true if value lies between left and right border
func InRangeInt(value, left, right interface{}) bool {
value64, _ := ToInt(value)
left64, _ := ToInt(left)
right64, _ := ToInt(right)
if left64 > right64 {
left64, right64 = right64, left64
}
return value64 >= left64 && value64 <= right64
}
// InRange returns true if value lies between left and right border
func InRangeFloat32(value, left, right float32) bool {
if left > right {
left, right = right, left
}
return value >= left && value <= right
}
// InRange returns true if value lies between left and right border
func InRangeFloat64(value, left, right float64) bool {
if left > right {
left, right = right, left
}
return value >= left && value <= right
}
// InRange returns true if value lies between left and right border, generic type to handle int, float32 or float64, all types must the same type
func InRange(value interface{}, left interface{}, right interface{}) bool {
reflectValue := reflect.TypeOf(value).Kind()
reflectLeft := reflect.TypeOf(left).Kind()
reflectRight := reflect.TypeOf(right).Kind()
if reflectValue == reflect.Int && reflectLeft == reflect.Int && reflectRight == reflect.Int {
return InRangeInt(value.(int), left.(int), right.(int))
} else if reflectValue == reflect.Float32 && reflectLeft == reflect.Float32 && reflectRight == reflect.Float32 {
return InRangeFloat32(value.(float32), left.(float32), right.(float32))
} else if reflectValue == reflect.Float64 && reflectLeft == reflect.Float64 && reflectRight == reflect.Float64 {
return InRangeFloat64(value.(float64), left.(float64), right.(float64))
} else {
return false
}
}
// IsWhole returns true if value is whole number
func IsWhole(value float64) bool {
return math.Remainder(value, 1) == 0
}
// IsNatural returns true if value is natural number (positive and whole)
func IsNatural(value float64) bool {
return IsWhole(value) && IsPositive(value)
} | vendor/github.com/asaskevich/govalidator/numerics.go | 0.896767 | 0.714242 | numerics.go | starcoder |
package sidecar
import (
"bytes"
"crypto/rand"
"crypto/sha256"
"fmt"
"github.com/btcsuite/btcd/btcec/v2"
"github.com/btcsuite/btcd/btcec/v2/ecdsa"
"github.com/btcsuite/btcd/btcutil"
"github.com/lightningnetwork/lnd/lnwire"
)
// Version is the version of the sidecar ticket format.
type Version uint8
const (
// VersionDefault is the initial version of the ticket format.
VersionDefault Version = 0
)
// State is the state a sidecar ticket currently is in. Each updater of the
// ticket is responsible for also setting the state correctly after adding their
// data according to their role.
type State uint8
const (
// StateCreated is the state a ticket is in after it's been first
// created and the offer information was added but not signed yet.
StateCreated State = 0
// StateOffered is the state a ticket is in after the offer data was
// signed by the sidecar provider.
StateOffered State = 1
// StateRegistered is the state a ticket is in after the recipient has
// registered it in their system and added their information.
StateRegistered State = 2
// StateOrdered is the state a ticket is in after the bid order for the
// sidecar channel was submitted and the order information was added to
// the ticket. The ticket now also contains a signature of the provider
// over the order digest.
StateOrdered State = 3
// StateExpectingChannel is the state a ticket is in after it's been
// returned to the channel recipient and their node was instructed to
// start listening for batch events for it.
StateExpectingChannel State = 4
// StateCompleted is the state a ticket is in after the sidecar channel
// was successfully opened and the bid order completed.
StateCompleted State = 5
// StateCanceled is the state a ticket is in after the sidecar channel
// bid order was canceled by the taker.
StateCanceled State = 6
)
// String returns the string representation of a sidecar ticket state.
func (s State) String() string {
switch s {
case StateCreated:
return "created"
case StateOffered:
return "offered"
case StateRegistered:
return "registered"
case StateOrdered:
return "ordered"
case StateExpectingChannel:
return "expecting channel"
case StateCompleted:
return "completed"
case StateCanceled:
return "canceled"
default:
return fmt.Sprintf("unknown <%d>", s)
}
}
// IsTerminal returns true if the ticket is in a final state and will not be
// updated ever again.
func (s State) IsTerminal() bool {
switch s {
case StateCompleted, StateCanceled:
return true
default:
return false
}
}
// Offer is a struct holding the information that a sidecar channel provider is
// committing to when offering to buy a channel for the recipient. The sidecar
// channel flow is initiated by the provider creating a ticket and adding its
// signed offer to it.
type Offer struct {
// Capacity is the channel capacity of the sidecar channel in satoshis.
Capacity btcutil.Amount
// PushAmt is the amount in satoshis that will be pushed to the
// recipient of the channel to kick start them with inbound capacity.
// If this is non-zero then the provider must pay for the push amount as
// well as all other costs from their Pool account. Makers can opt out
// of supporting push amounts when submitting ask orders so this will
// reduce the matching chances somewhat.
PushAmt btcutil.Amount
// LeaseDurationBlocks is the number of blocks the offered channel in
// this offer would be leased for.
LeaseDurationBlocks uint32
// SignPubKey is the public key for corresponding to the private key
// that signed the SigOfferDigest below and, in a later state, the
// SigOrderDigest of the Order struct.
SignPubKey *btcec.PublicKey
// SigOfferDigest is a signature over the offer digest, signed with the
// private key that corresponds to the SignPubKey above.
SigOfferDigest *ecdsa.Signature
// Auto determines if the provider requires that the ticket be
// completed using an automated negotiation sequence.
Auto bool
}
// Recipient is a struct holding the information about the recipient of the
// sidecar channel in question.
type Recipient struct {
// NodePubKey is the recipient nodes' identity public key that is
// advertised in the bid order.
NodePubKey *btcec.PublicKey
// MultiSigPubKey is a public key to which the recipient node has the
// private key to. It is the key that will be used as one of the 2-of-2
// multisig keys of the channel funding transaction output and is
// advertised in the bid order.
MultiSigPubKey *btcec.PublicKey
// MultiSigKeyIndex is the derivation index of the MultiSigPubKey.
MultiSigKeyIndex uint32
}
// Order is a struct holding the information about the sidecar bid order after
// it's been submitted by the provider.
type Order struct {
// BidNonce is the order nonce of the bid order that was submitted for
// purchasing the sidecar channel.
BidNonce [32]byte
// SigOrderDigest is a signature over the order digest, signed with the
// private key that corresponds to the SignPubKey in the Offer struct.
SigOrderDigest *ecdsa.Signature
}
// Execution is a struct holding information about the sidecar bid order during
// its execution.
type Execution struct {
// PendingChannelID is the pending channel ID of the currently
// registered funding shim that was added by the recipient node to
// receive the channel.
PendingChannelID [32]byte
}
// Ticket is a struct holding all the information for establishing/buying a
// sidecar channel. It is meant to be used in a PSBT like manner where each
// participant incrementally adds their information according to their role and
// the current step.
type Ticket struct {
// ID is a pseudorandom identifier of the ticket.
ID [8]byte
// Version is the version of the ticket serialization format.
Version Version
// State is the current state of the ticket. The state is updated by
// each participant and is therefore not covered in any of the signature
// digests.
State State
// Offer contains the initial conditions offered by the sidecar channel
// provider. Every ticket must start with an offer and therefore this
// member can never be empty or nil.
Offer Offer
// Recipient contains the information about the receiver node of the
// sidecar channel. This field must be set for all states greater or
// equal to StateRegistered.
Recipient *Recipient
// Order contains the information about the order that was submitted for
// leasing the sidecar channel represented by this ticket. This field
// must be set for all states greater or equal to StateOrdered.
Order *Order
// Execution contains the information about the execution part of the
// sidecar channel. This information is not meant to be exchanged
// between the participating parties but is included in the ticket to
// make it easy to serialize/deserialize a ticket state within the local
// database.
Execution *Execution
}
// NewTicket creates a new sidecar ticket with the given version and offer
// information.
func NewTicket(version Version, capacity, pushAmt btcutil.Amount,
duration uint32, offerPubKey *btcec.PublicKey,
auto bool) (*Ticket, error) {
t := &Ticket{
Version: version,
State: StateOffered,
Offer: Offer{
Capacity: capacity,
PushAmt: pushAmt,
LeaseDurationBlocks: duration,
SignPubKey: offerPubKey,
Auto: auto,
},
}
// The linter flags this, even though crypto/rand is being used...
if _, err := rand.Read(t.ID[:]); err != nil { // nolint:gosec
return nil, err
}
return t, nil
}
// OfferDigest returns a message digest over the offer fields.
func (t *Ticket) OfferDigest() ([32]byte, error) {
var (
msg bytes.Buffer
result [sha256.Size]byte
)
switch t.Version {
case VersionDefault:
err := lnwire.WriteElements(
&msg, t.ID[:], uint8(t.Version), t.Offer.Capacity,
t.Offer.PushAmt, t.Offer.Auto,
)
if err != nil {
return result, err
}
default:
return result, fmt.Errorf("unknown version %d", t.Version)
}
return sha256.Sum256(msg.Bytes()), nil
}
// OrderDigest returns a message digest over the order fields.
func (t *Ticket) OrderDigest() ([32]byte, error) {
var (
msg bytes.Buffer
result [sha256.Size]byte
)
if t.State < StateOrdered || t.Order == nil {
return result, fmt.Errorf("invalid state for order digest")
}
switch t.Version {
case VersionDefault:
err := lnwire.WriteElements(
&msg, t.ID[:], uint8(t.Version), t.Offer.Capacity,
t.Offer.PushAmt, t.Order.BidNonce[:],
)
if err != nil {
return result, err
}
default:
return result, fmt.Errorf("unknown version %d", t.Version)
}
return sha256.Sum256(msg.Bytes()), nil
}
// Store is the interface a persistent storage must implement for storing and
// retrieving sidecar tickets.
type Store interface {
// AddSidecar adds a record for the sidecar order to the database.
AddSidecar(sidecar *Ticket) error
// UpdateSidecar updates a sidecar order in the database.
UpdateSidecar(sidecar *Ticket) error
// Sidecar retrieves a specific sidecar by its ID and provider signing
// key (offer signature pubkey) or returns ErrNoSidecar if it's not
// found.
Sidecar(id [8]byte, offerSignPubKey *btcec.PublicKey) (*Ticket, error)
// Sidecars retrieves all known sidecar orders from the database.
Sidecars() ([]*Ticket, error)
} | sidecar/interfaces.go | 0.602529 | 0.465448 | interfaces.go | starcoder |
package testing
import (
"fmt"
"net/http"
"testing"
"github.com/magicmemories/go-jerakia"
th "github.com/magicmemories/go-jerakia/testhelper"
fake "github.com/magicmemories/go-jerakia/testhelper/client"
"github.com/stretchr/testify/assert"
)
// LookupBasicResponse provides a GET response of a lookup.
const LookupBasicResponse = `
{
"found": true,
"payload": {
"argentina": "buenos aires",
"france": "paris",
"spain": "malaga"
},
"status": "ok"
}
`
// LookupBasicResult is the expected result of a basic lookup.
var LookupBasicResult = jerakia.LookupResult{
Status: "ok",
Found: true,
Payload: map[string]interface{}{
"argentina": "buenos aires",
"france": "paris",
"spain": "malaga",
},
}
// HandleLookupBasic tests a basic lookup.
func HandleLookupBasic(t *testing.T) {
th.Mux.HandleFunc("/lookup/cities", func(w http.ResponseWriter, r *http.Request) {
assert.Equal(t, r.Method, "GET")
assert.Equal(t, r.Header.Get("X-Authentication"), fake.Token)
w.Header().Set("Content-Type", "application/json")
w.WriteHeader(http.StatusOK)
fmt.Fprintf(w, LookupBasicResponse)
})
}
// LookupSingleBoolResponse provides a GET response of a single bool lookup.
const LookupSingleBoolResponse = `
{
"found": true,
"payload": true,
"status": "ok"
}
`
// LookupSingleBoolResult is the expected result of a single bool lookup.
var LookupSingleBoolResult = jerakia.LookupResult{
Status: "ok",
Found: true,
Payload: true,
}
// HandleLookupSingleBool tests a single bool lookup.
func HandleLookupSingleBool(t *testing.T) {
th.Mux.HandleFunc("/lookup/booltrue", func(w http.ResponseWriter, r *http.Request) {
assert.Equal(t, r.Method, "GET")
assert.Equal(t, r.Header.Get("X-Authentication"), fake.Token)
w.Header().Set("Content-Type", "application/json")
w.WriteHeader(http.StatusOK)
fmt.Fprintf(w, LookupSingleBoolResponse)
})
}
// LookupMetadataResponse is the expected response of a metadata lookup.
const LookupMetadataResponse = `
{
"found": true,
"payload": [
"bob",
"lucy",
"david"
],
"status": "ok"
}
`
// LookupMetadataResult is the expected result of a metadata lookup.
var LookupMetadataResult = jerakia.LookupResult{
Status: "ok",
Found: true,
Payload: []interface{}{
"bob", "lucy", "david",
},
}
// HandleLookupMetadata tests a metadata lookup.
func HandleLookupMetadata(t *testing.T) {
th.Mux.HandleFunc("/lookup/users", func(w http.ResponseWriter, r *http.Request) {
assert.Equal(t, r.Method, "GET")
assert.Equal(t, r.Header.Get("X-Authentication"), fake.Token)
w.Header().Set("Content-Type", "application/json")
w.WriteHeader(http.StatusOK)
fmt.Fprintf(w, LookupMetadataResponse)
})
}
// LookupHashMergeResponse is the expected response of a hash merge lookup.
const LookupHashMergeResponse = `
{
"found": true,
"payload": {
"key0": {
"element0": "common"
},
"key1": {
"element2": "env"
},
"key2": {
"element3": {
"subelement3": "env"
}
},
"key3": "env"
},
"status": "ok"
}
`
// LookupHashMergeResult is the expected result of a hash merge lookup.
var LookupHashMergeResult = jerakia.LookupResult{
Status: "ok",
Found: true,
Payload: map[string]interface{}{
"key0": map[string]interface{}{
"element0": "common",
},
"key1": map[string]interface{}{
"element2": "env",
},
"key2": map[string]interface{}{
"element3": map[string]interface{}{
"subelement3": "env",
},
},
"key3": "env",
},
}
// HandleLookupHashMerge tests a hash merge lookup.
func HandleLookupHashMerge(t *testing.T) {
th.Mux.HandleFunc("/lookup/hash", func(w http.ResponseWriter, r *http.Request) {
assert.Equal(t, "GET", r.Method)
assert.Equal(t, fake.Token, r.Header.Get("X-Authentication"))
assert.Equal(t, []string{"cascade"}, r.URL.Query()["lookup_type"])
assert.Equal(t, []string{"hash"}, r.URL.Query()["merge"])
w.Header().Set("Content-Type", "application/json")
w.WriteHeader(http.StatusOK)
fmt.Fprintf(w, LookupHashMergeResponse)
})
}
// LookupKeylessResponse is the expected response of a keyless lookup.
const LookupKeylessResponse = `
{
"found": true,
"payload": {
"foo": "bar",
"hello": "world"
},
"status": "ok"
}
`
// LookupKeylessResult is the expected result of a keyless lookup.
var LookupKeylessResult = jerakia.LookupResult{
Status: "ok",
Found: true,
Payload: map[string]interface{}{
"foo": "bar",
"hello": "world",
},
}
// HandleLookupKeyless tests a keyless lookup.
func HandleLookupKeyless(t *testing.T) {
th.Mux.HandleFunc("/lookup", func(w http.ResponseWriter, r *http.Request) {
assert.Equal(t, "GET", r.Method)
assert.Equal(t, fake.Token, r.Header.Get("X-Authentication"))
assert.Equal(t, []string{"keyless"}, r.URL.Query()["namespace"])
w.Header().Set("Content-Type", "application/json")
w.WriteHeader(http.StatusOK)
fmt.Fprintf(w, LookupKeylessResponse)
})
} | testing/lookup_fixtures.go | 0.669637 | 0.435541 | lookup_fixtures.go | starcoder |
package geoindex
import (
"math"
"sort"
"time"
)
// A geoindex that stores points.
type PointsIndex struct {
index *geoIndex
currentPosition map[string]Point
}
// NewPointsIndex creates new PointsIndex that maintains the points in each cell.
func NewPointsIndex(resolution Meters) *PointsIndex {
newSet := func() interface{} {
return newSet()
}
return &PointsIndex{newGeoIndex(resolution, newSet), make(map[string]Point)}
}
// NewExpiringPointsIndex creates new PointIndex that expires the points in each cell after expiration minutes.
func NewExpiringPointsIndex(resolution Meters, expiration Minutes) *PointsIndex {
currentPosition := make(map[string]Point)
newExpiringSet := func() interface{} {
set := newExpiringSet(expiration)
set.OnExpire(func(id string, value interface{}) {
point := value.(Point)
delete(currentPosition, point.ID())
})
return set
}
return &PointsIndex{newGeoIndex(resolution, newExpiringSet), currentPosition}
}
func (pi *PointsIndex) Clone() *PointsIndex {
clone := &PointsIndex{}
// Copy all entries from current positions
clone.currentPosition = make(map[string]Point, len(pi.currentPosition))
for k, v := range pi.currentPosition {
clone.currentPosition[k] = v
}
// Copying underlying geoindex data
clone.index = pi.index.Clone()
return clone
}
// Get gets a point from the index given an id.
func (points *PointsIndex) Get(id string) Point {
if point, ok := points.currentPosition[id]; ok {
// first it gets the set of the currentPosition and then gets the point from the set
// this is done so it triggers expiration on expiringSet, and returns nil if a point has expired
if result, resultOk := points.index.GetEntryAt(point).(set).Get(id); resultOk {
return result.(Point)
}
}
return nil
}
// GetAll get all Points from the index as a map from id to point
func (points *PointsIndex) GetAll() map[string]Point {
newpoints := make(map[string]Point, 0)
for i, p := range points.currentPosition {
newpoints[i] = p
}
return newpoints
}
// Add adds a point to the index. If a point with the same Id already exists it gets replaced.
func (points *PointsIndex) Add(point Point) {
points.Remove(point.ID())
newSet := points.index.AddEntryAt(point).(set)
newSet.Add(point.ID(), point)
points.currentPosition[point.ID()] = point
}
// Add adds a point to the index. If a point with the same Id already exists it gets replaced.
// Note: this function is used for restoring, reinsert the history points
// Need to insert from old to new points in order for expiring to work
func (points *PointsIndex) AddWithTsNoSort(point Point, ts time.Time) {
points.Remove(point.ID())
newSet := points.index.AddEntryAt(point).(set)
newSet.AddWithTsNoSort(point.ID(), point, ts)
points.currentPosition[point.ID()] = point
}
// Remove removes a point from the index.
func (points *PointsIndex) Remove(id string) {
if prevPoint, ok := points.currentPosition[id]; ok {
set := points.index.GetEntryAt(prevPoint).(set)
set.Remove(prevPoint.ID())
delete(points.currentPosition, prevPoint.ID())
}
}
func between(value float64, min float64, max float64) bool {
return value >= min && value <= max
}
func getPoints(entries []interface{}, accept func(point Point) bool) []Point {
result := make([]Point, 0)
result = getPointsAppend(result, entries, accept)
return result
}
func getPointsAppend(s []Point, entries []interface{}, accept func(point Point) bool) []Point {
for _, entry := range entries {
pointsSetEntry := (entry).(set)
for _, value := range pointsSetEntry.Values() {
point := value.(Point)
if accept(point) {
s = append(s, point)
}
}
}
return s
}
// Range returns the points within the range defined by top left and bottom right.
func (points *PointsIndex) Range(topLeft Point, bottomRight Point) []Point {
entries := points.index.Range(topLeft, bottomRight)
accept := func(point Point) bool {
return between(point.Lat(), bottomRight.Lat(), topLeft.Lat()) &&
between(point.Lon(), topLeft.Lon(), bottomRight.Lon())
}
return getPoints(entries, accept)
}
type sortedPoints struct {
points []Point
point Point
}
func (p *sortedPoints) Len() int {
return len(p.points)
}
func (p *sortedPoints) Swap(i, j int) {
p.points[i], p.points[j] = p.points[j], p.points[i]
}
func (p *sortedPoints) Less(i, j int) bool {
return approximateSquareDistance(p.points[i], p.point) < approximateSquareDistance(p.points[j], p.point)
}
func min(a, b int) int {
if a < b {
return a
} else {
return b
}
}
// KNearest returns the k nearest points near point within maxDistance that match the accept criteria.
func (points *PointsIndex) KNearest(point Point, k int, maxDistance Meters, accept func(p Point) bool) []Point {
nearbyPoints := make([]Point, 0)
pointEntry := points.index.GetEntryAt(point).(set)
nearbyPoints = append(nearbyPoints, getPoints([]interface{}{pointEntry}, accept)...)
totalCount := 0
idx := cellOf(point, points.index.resolution)
// Explicitely assign a greater max distance so that we definitely return enough points
// and make sure it searches at least one square away.
coarseMaxDistance := math.Max(float64(maxDistance)*2.0, float64(points.index.resolution)*2.0+0.01)
for d := 1; float64(d)*float64(points.index.resolution) <= coarseMaxDistance; d++ {
oldCount := len(nearbyPoints)
nearbyPoints = getPointsAppend(nearbyPoints, points.index.get(idx.x-d, idx.x+d, idx.y+d, idx.y+d), accept)
nearbyPoints = getPointsAppend(nearbyPoints, points.index.get(idx.x-d, idx.x+d, idx.y-d, idx.y-d), accept)
nearbyPoints = getPointsAppend(nearbyPoints, points.index.get(idx.x-d, idx.x-d, idx.y-d+1, idx.y+d-1), accept)
nearbyPoints = getPointsAppend(nearbyPoints, points.index.get(idx.x+d, idx.x+d, idx.y-d+1, idx.y+d-1), accept)
totalCount += len(nearbyPoints) - oldCount
if totalCount > k {
break
}
}
sortedPoints := &sortedPoints{nearbyPoints, point}
sort.Sort(sortedPoints)
k = min(k, len(sortedPoints.points))
// filter points which longer than maxDistance away from point.
for i, nearbyPoint := range sortedPoints.points {
if Distance(point, nearbyPoint) > maxDistance || i == k {
k = i
break
}
}
return sortedPoints.points[0:k]
}
// PointsWithin returns all points with distance of point that match the accept criteria.
func (points *PointsIndex) PointsWithin(point Point, distance Meters, accept func(p Point) bool) []Point {
d := int(distance / points.index.resolution)
if d == 0 {
d = 1
}
idx := cellOf(point, points.index.resolution)
nearbyPoints := make([]Point, 0)
nearbyPoints = getPointsAppend(nearbyPoints, points.index.get(idx.x-d, idx.x+d, idx.y-d, idx.y+d), accept)
// filter points which longer than maxDistance away from point.
withinPoints := make([]Point, 0)
for _, nearbyPoint := range nearbyPoints {
if Distance(point, nearbyPoint) < distance {
withinPoints = append(withinPoints, nearbyPoint)
}
}
return withinPoints
} | points-index.go | 0.835383 | 0.61757 | points-index.go | starcoder |
package holtwinters
import "math"
type HoltWintersT struct {
Series []float64
SeasonLenth int
Npreds int
Alpha float64
Beta float64
Gamma float64
ScalingFactor float64
Result []float64
Smooth []float64
Season []float64
Trend []float64
PredictedDeviation []float64
UpperBond []float64
LowerBond []float64
}
func New(data []float64, slen int, npreds int, alpha float64, beta float64, gamma float64, scalingfactor float64) *HoltWintersT {
return &HoltWintersT{
Series: data,
SeasonLenth: slen,
Npreds: npreds,
Alpha: alpha,
Beta: beta,
Gamma: gamma,
ScalingFactor: scalingfactor,
}
}
func (h *HoltWintersT) initTrend() float64 {
sum := float64(0.0)
for idx := 0; idx < h.SeasonLenth; idx++ {
sum = sum + float64(h.Series[idx+h.SeasonLenth]-h.Series[idx])/float64(h.SeasonLenth)
}
return sum / float64(h.SeasonLenth)
}
func (h *HoltWintersT) seriesSum(start int, end int) float64 {
sum := float64(0.0)
for idx := start; idx < end; idx++ {
sum = sum + h.Series[idx]
}
return sum
}
func (h *HoltWintersT) initSeasonalComponets() map[int]float64 {
seasonals := make(map[int]float64)
seasonAverages := make([]float64, 0, 1)
Nseasons := len(h.Series) / h.SeasonLenth
SumOfValsOverAvg := float64(0.0)
for j := 0; j < Nseasons; j++ {
seasonAverages = append(seasonAverages, h.seriesSum(h.SeasonLenth*j, h.SeasonLenth*j+h.SeasonLenth)/float64(h.SeasonLenth))
}
for i := 0; i < h.SeasonLenth; i++ {
SumOfValsOverAvg = float64(0.0)
for k := 0; k < Nseasons; k++ {
SumOfValsOverAvg = SumOfValsOverAvg + h.Series[h.SeasonLenth*k+i] - seasonAverages[k]
}
seasonals[i] = SumOfValsOverAvg / float64(Nseasons)
}
return seasonals
}
func (h *HoltWintersT) TripleExponentialSmoothing() {
seasonals := h.initSeasonalComponets()
SeriesLenth := len(h.Series)
totalLength := SeriesLenth + h.Npreds
var smooth, lastsmooth, trend float64
for i := 0; i < totalLength; i++ {
if i == 0 {
smooth = h.Series[0]
trend = h.initTrend()
h.Result = append(h.Result, h.Series[0])
h.Smooth = append(h.Smooth, smooth)
h.Trend = append(h.Trend, trend)
h.Season = append(h.Season, seasonals[i%h.SeasonLenth])
h.PredictedDeviation = append(h.PredictedDeviation, 0)
h.UpperBond = append(h.UpperBond, h.Result[0]+h.ScalingFactor*h.PredictedDeviation[0])
h.LowerBond = append(h.LowerBond, h.Result[0]-h.ScalingFactor*h.PredictedDeviation[0])
continue
}
if i >= SeriesLenth { //Prediction
m := float64(i - SeriesLenth + 1)
h.Result = append(h.Result, (smooth+m*trend)+seasonals[i%h.SeasonLenth])
h.PredictedDeviation = append(h.PredictedDeviation, h.PredictedDeviation[i-1]*1.01)
} else {
val := h.Series[i]
lastsmooth, smooth = smooth, h.Alpha*(val-seasonals[i%h.SeasonLenth])+(1-h.Alpha)*(smooth+trend)
trend = h.Beta*(smooth-lastsmooth) + (1-h.Beta)*trend
seasonals[i%h.SeasonLenth] = h.Gamma*(val-smooth) + (1-h.Gamma)*seasonals[i%h.SeasonLenth]
h.Result = append(h.Result, smooth+trend+seasonals[i%h.SeasonLenth])
//BrutLag
h.PredictedDeviation = append(h.PredictedDeviation, h.Gamma*math.Abs(h.Series[i]-h.Result[i])+(1-h.Gamma)*h.PredictedDeviation[i-1])
}
h.UpperBond = append(h.UpperBond, h.Result[i]+h.ScalingFactor*h.PredictedDeviation[0])
h.LowerBond = append(h.UpperBond, h.Result[i]+h.ScalingFactor*h.PredictedDeviation[0])
h.Smooth = append(h.Smooth, smooth)
h.Trend = append(h.Trend, trend)
h.Season = append(h.Season, seasonals[i%h.SeasonLenth])
}
} | hw.go | 0.578329 | 0.454896 | hw.go | starcoder |
package main
import (
"image"
"image/color"
"math/rand"
"github.com/DumDumGeniuss/ggol"
)
type gameOfMatrixUnit struct {
WordsLength int
CountWords int
// One column (height of game size) can only have a word stream at a time, so we have this count
CountHeight int
}
var initialGameOfMatrixUnit gameOfMatrixUnit = gameOfMatrixUnit{
WordsLength: 0,
CountWords: 0,
CountHeight: 50,
}
// A game can only have 20 word of streams in total
var totalWordStreamsCount = 0
func gameOfMatrixNextUnitGenerator(
coord *ggol.Coordinate,
unit *gameOfMatrixUnit,
getAdjacentUnit ggol.AdjacentUnitGetter[gameOfMatrixUnit],
) (nextUnit *gameOfMatrixUnit) {
newUnit := *unit
if coord.Y == 0 {
if unit.CountWords == 0 && unit.CountHeight >= 50 && totalWordStreamsCount < 50 {
if rand.Intn(50) == 1 {
newUnit.WordsLength = 30 + rand.Intn(40)
newUnit.CountWords = 1
newUnit.CountHeight = 0
totalWordStreamsCount += 1
}
} else if unit.CountWords < unit.WordsLength {
newUnit.CountWords += 1
} else if unit.CountWords == unit.WordsLength && unit.CountWords != 0 {
newUnit.WordsLength = 0
newUnit.CountWords = 0
totalWordStreamsCount -= 1
}
newUnit.CountHeight += 1
return &newUnit
} else {
prevUnit, _ := getAdjacentUnit(coord, &ggol.Coordinate{X: 0, Y: -1})
newUnit = *prevUnit
return &newUnit
}
}
func initializeGameOfMatrixUnits(g ggol.Game[gameOfMatrixUnit]) {
// Do nothing
}
func drawGameOfMatrixUnit(coord *ggol.Coordinate, unit *gameOfMatrixUnit, blockSize int, image *image.Paletted, palette *[]color.Color) {
if unit.WordsLength == 0 {
return
}
for i := 0; i < blockSize; i += 1 {
for j := 0; j < blockSize; j += 1 {
if unit.CountWords == 1 {
image.Set(coord.X*blockSize+i, coord.Y*blockSize+j, (*palette)[1])
} else {
if (unit.CountWords)%2 == 0 {
colorIndex := int(float64(unit.CountWords-1) / float64(unit.WordsLength) * 8)
image.Set(coord.X*blockSize+i, coord.Y*blockSize+j, (*palette)[colorIndex+2])
}
}
}
}
}
func executeGameOfMatrix() {
size := ggol.Size{Width: 50, Height: 50}
game, _ := ggol.NewGame(&size, &initialGameOfMatrixUnit)
game.SetNextUnitGenerator(gameOfMatrixNextUnitGenerator)
initializeGameOfMatrixUnits(game)
previousSteps := 100
for i := 0; i < previousSteps; i += 1 {
game.GenerateNextUnits()
}
var gameOfMatrixPalette = []color.Color{
color.RGBA{0x00, 0x00, 0x00, 0xff},
color.RGBA{0xff, 0xff, 0xff, 0xff},
color.RGBA{0x16, 0xa3, 0x4a, 0xff},
color.RGBA{0x15, 0x80, 0x3d, 0xff},
color.RGBA{0x16, 0x65, 0x34, 0xff},
color.RGBA{0x14, 0x53, 0x2d, 0xff},
color.RGBA{0x14, 0x41, 0x20, 0xff},
color.RGBA{0x14, 0x30, 0x15, 0xff},
color.RGBA{0x14, 0x20, 0x10, 0xff},
color.RGBA{0x14, 0x10, 0x5, 0xff},
}
var images []*image.Paletted
var delays []int
blockSize := 10
iterationsCount := 200
duration := 0
for i := 0; i < iterationsCount; i += 1 {
newImage := image.NewPaletted(image.Rect(0, 0, size.Width*blockSize, size.Height*blockSize), gameOfMatrixPalette)
for x := 0; x < size.Width; x += 1 {
for y := 0; y < size.Height; y += 1 {
coord := &ggol.Coordinate{X: x, Y: y}
unit, _ := game.GetUnit(coord)
drawGameOfMatrixUnit(coord, unit, blockSize, newImage, &gameOfMatrixPalette)
}
}
images = append(images, newImage)
delays = append(delays, duration)
game.GenerateNextUnits()
}
outputGif("output/game_of_matrix.gif", images, delays)
} | example/game_of_matrix.go | 0.516108 | 0.503906 | game_of_matrix.go | starcoder |
package plaid
import (
"encoding/json"
)
// DistributionBreakdown Information about the accounts that the payment was distributed to.
type DistributionBreakdown struct {
// Name of the account for the given distribution.
AccountName NullableString `json:"account_name,omitempty"`
// The name of the bank that the payment is being deposited to.
BankName NullableString `json:"bank_name,omitempty"`
// The amount distributed to this account.
CurrentAmount NullableFloat32 `json:"current_amount,omitempty"`
// The ISO-4217 currency code of the net pay. Always `null` if `unofficial_currency_code` is non-null.
IsoCurrencyCode NullableString `json:"iso_currency_code,omitempty"`
// The last 2-4 alphanumeric characters of an account's official account number.
Mask NullableString `json:"mask,omitempty"`
// Type of the account that the paystub was sent to (e.g. 'checking').
Type NullableString `json:"type,omitempty"`
// The unofficial currency code associated with the net pay. Always `null` if `iso_currency_code` is non-`null`. Unofficial currency codes are used for currencies that do not have official ISO currency codes, such as cryptocurrencies and the currencies of certain countries. See the [currency code schema](https://plaid.com/docs/api/accounts#currency-code-schema) for a full listing of supported `iso_currency_code`s.
UnofficialCurrencyCode NullableString `json:"unofficial_currency_code,omitempty"`
CurrentPay *Pay `json:"current_pay,omitempty"`
AdditionalProperties map[string]interface{}
}
type _DistributionBreakdown DistributionBreakdown
// NewDistributionBreakdown instantiates a new DistributionBreakdown object
// This constructor will assign default values to properties that have it defined,
// and makes sure properties required by API are set, but the set of arguments
// will change when the set of required properties is changed
func NewDistributionBreakdown() *DistributionBreakdown {
this := DistributionBreakdown{}
return &this
}
// NewDistributionBreakdownWithDefaults instantiates a new DistributionBreakdown object
// This constructor will only assign default values to properties that have it defined,
// but it doesn't guarantee that properties required by API are set
func NewDistributionBreakdownWithDefaults() *DistributionBreakdown {
this := DistributionBreakdown{}
return &this
}
// GetAccountName returns the AccountName field value if set, zero value otherwise (both if not set or set to explicit null).
func (o *DistributionBreakdown) GetAccountName() string {
if o == nil || o.AccountName.Get() == nil {
var ret string
return ret
}
return *o.AccountName.Get()
}
// GetAccountNameOk returns a tuple with the AccountName field value if set, nil otherwise
// and a boolean to check if the value has been set.
// NOTE: If the value is an explicit nil, `nil, true` will be returned
func (o *DistributionBreakdown) GetAccountNameOk() (*string, bool) {
if o == nil {
return nil, false
}
return o.AccountName.Get(), o.AccountName.IsSet()
}
// HasAccountName returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasAccountName() bool {
if o != nil && o.AccountName.IsSet() {
return true
}
return false
}
// SetAccountName gets a reference to the given NullableString and assigns it to the AccountName field.
func (o *DistributionBreakdown) SetAccountName(v string) {
o.AccountName.Set(&v)
}
// SetAccountNameNil sets the value for AccountName to be an explicit nil
func (o *DistributionBreakdown) SetAccountNameNil() {
o.AccountName.Set(nil)
}
// UnsetAccountName ensures that no value is present for AccountName, not even an explicit nil
func (o *DistributionBreakdown) UnsetAccountName() {
o.AccountName.Unset()
}
// GetBankName returns the BankName field value if set, zero value otherwise (both if not set or set to explicit null).
func (o *DistributionBreakdown) GetBankName() string {
if o == nil || o.BankName.Get() == nil {
var ret string
return ret
}
return *o.BankName.Get()
}
// GetBankNameOk returns a tuple with the BankName field value if set, nil otherwise
// and a boolean to check if the value has been set.
// NOTE: If the value is an explicit nil, `nil, true` will be returned
func (o *DistributionBreakdown) GetBankNameOk() (*string, bool) {
if o == nil {
return nil, false
}
return o.BankName.Get(), o.BankName.IsSet()
}
// HasBankName returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasBankName() bool {
if o != nil && o.BankName.IsSet() {
return true
}
return false
}
// SetBankName gets a reference to the given NullableString and assigns it to the BankName field.
func (o *DistributionBreakdown) SetBankName(v string) {
o.BankName.Set(&v)
}
// SetBankNameNil sets the value for BankName to be an explicit nil
func (o *DistributionBreakdown) SetBankNameNil() {
o.BankName.Set(nil)
}
// UnsetBankName ensures that no value is present for BankName, not even an explicit nil
func (o *DistributionBreakdown) UnsetBankName() {
o.BankName.Unset()
}
// GetCurrentAmount returns the CurrentAmount field value if set, zero value otherwise (both if not set or set to explicit null).
func (o *DistributionBreakdown) GetCurrentAmount() float32 {
if o == nil || o.CurrentAmount.Get() == nil {
var ret float32
return ret
}
return *o.CurrentAmount.Get()
}
// GetCurrentAmountOk returns a tuple with the CurrentAmount field value if set, nil otherwise
// and a boolean to check if the value has been set.
// NOTE: If the value is an explicit nil, `nil, true` will be returned
func (o *DistributionBreakdown) GetCurrentAmountOk() (*float32, bool) {
if o == nil {
return nil, false
}
return o.CurrentAmount.Get(), o.CurrentAmount.IsSet()
}
// HasCurrentAmount returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasCurrentAmount() bool {
if o != nil && o.CurrentAmount.IsSet() {
return true
}
return false
}
// SetCurrentAmount gets a reference to the given NullableFloat32 and assigns it to the CurrentAmount field.
func (o *DistributionBreakdown) SetCurrentAmount(v float32) {
o.CurrentAmount.Set(&v)
}
// SetCurrentAmountNil sets the value for CurrentAmount to be an explicit nil
func (o *DistributionBreakdown) SetCurrentAmountNil() {
o.CurrentAmount.Set(nil)
}
// UnsetCurrentAmount ensures that no value is present for CurrentAmount, not even an explicit nil
func (o *DistributionBreakdown) UnsetCurrentAmount() {
o.CurrentAmount.Unset()
}
// GetIsoCurrencyCode returns the IsoCurrencyCode field value if set, zero value otherwise (both if not set or set to explicit null).
func (o *DistributionBreakdown) GetIsoCurrencyCode() string {
if o == nil || o.IsoCurrencyCode.Get() == nil {
var ret string
return ret
}
return *o.IsoCurrencyCode.Get()
}
// GetIsoCurrencyCodeOk returns a tuple with the IsoCurrencyCode field value if set, nil otherwise
// and a boolean to check if the value has been set.
// NOTE: If the value is an explicit nil, `nil, true` will be returned
func (o *DistributionBreakdown) GetIsoCurrencyCodeOk() (*string, bool) {
if o == nil {
return nil, false
}
return o.IsoCurrencyCode.Get(), o.IsoCurrencyCode.IsSet()
}
// HasIsoCurrencyCode returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasIsoCurrencyCode() bool {
if o != nil && o.IsoCurrencyCode.IsSet() {
return true
}
return false
}
// SetIsoCurrencyCode gets a reference to the given NullableString and assigns it to the IsoCurrencyCode field.
func (o *DistributionBreakdown) SetIsoCurrencyCode(v string) {
o.IsoCurrencyCode.Set(&v)
}
// SetIsoCurrencyCodeNil sets the value for IsoCurrencyCode to be an explicit nil
func (o *DistributionBreakdown) SetIsoCurrencyCodeNil() {
o.IsoCurrencyCode.Set(nil)
}
// UnsetIsoCurrencyCode ensures that no value is present for IsoCurrencyCode, not even an explicit nil
func (o *DistributionBreakdown) UnsetIsoCurrencyCode() {
o.IsoCurrencyCode.Unset()
}
// GetMask returns the Mask field value if set, zero value otherwise (both if not set or set to explicit null).
func (o *DistributionBreakdown) GetMask() string {
if o == nil || o.Mask.Get() == nil {
var ret string
return ret
}
return *o.Mask.Get()
}
// GetMaskOk returns a tuple with the Mask field value if set, nil otherwise
// and a boolean to check if the value has been set.
// NOTE: If the value is an explicit nil, `nil, true` will be returned
func (o *DistributionBreakdown) GetMaskOk() (*string, bool) {
if o == nil {
return nil, false
}
return o.Mask.Get(), o.Mask.IsSet()
}
// HasMask returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasMask() bool {
if o != nil && o.Mask.IsSet() {
return true
}
return false
}
// SetMask gets a reference to the given NullableString and assigns it to the Mask field.
func (o *DistributionBreakdown) SetMask(v string) {
o.Mask.Set(&v)
}
// SetMaskNil sets the value for Mask to be an explicit nil
func (o *DistributionBreakdown) SetMaskNil() {
o.Mask.Set(nil)
}
// UnsetMask ensures that no value is present for Mask, not even an explicit nil
func (o *DistributionBreakdown) UnsetMask() {
o.Mask.Unset()
}
// GetType returns the Type field value if set, zero value otherwise (both if not set or set to explicit null).
func (o *DistributionBreakdown) GetType() string {
if o == nil || o.Type.Get() == nil {
var ret string
return ret
}
return *o.Type.Get()
}
// GetTypeOk returns a tuple with the Type field value if set, nil otherwise
// and a boolean to check if the value has been set.
// NOTE: If the value is an explicit nil, `nil, true` will be returned
func (o *DistributionBreakdown) GetTypeOk() (*string, bool) {
if o == nil {
return nil, false
}
return o.Type.Get(), o.Type.IsSet()
}
// HasType returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasType() bool {
if o != nil && o.Type.IsSet() {
return true
}
return false
}
// SetType gets a reference to the given NullableString and assigns it to the Type field.
func (o *DistributionBreakdown) SetType(v string) {
o.Type.Set(&v)
}
// SetTypeNil sets the value for Type to be an explicit nil
func (o *DistributionBreakdown) SetTypeNil() {
o.Type.Set(nil)
}
// UnsetType ensures that no value is present for Type, not even an explicit nil
func (o *DistributionBreakdown) UnsetType() {
o.Type.Unset()
}
// GetUnofficialCurrencyCode returns the UnofficialCurrencyCode field value if set, zero value otherwise (both if not set or set to explicit null).
func (o *DistributionBreakdown) GetUnofficialCurrencyCode() string {
if o == nil || o.UnofficialCurrencyCode.Get() == nil {
var ret string
return ret
}
return *o.UnofficialCurrencyCode.Get()
}
// GetUnofficialCurrencyCodeOk returns a tuple with the UnofficialCurrencyCode field value if set, nil otherwise
// and a boolean to check if the value has been set.
// NOTE: If the value is an explicit nil, `nil, true` will be returned
func (o *DistributionBreakdown) GetUnofficialCurrencyCodeOk() (*string, bool) {
if o == nil {
return nil, false
}
return o.UnofficialCurrencyCode.Get(), o.UnofficialCurrencyCode.IsSet()
}
// HasUnofficialCurrencyCode returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasUnofficialCurrencyCode() bool {
if o != nil && o.UnofficialCurrencyCode.IsSet() {
return true
}
return false
}
// SetUnofficialCurrencyCode gets a reference to the given NullableString and assigns it to the UnofficialCurrencyCode field.
func (o *DistributionBreakdown) SetUnofficialCurrencyCode(v string) {
o.UnofficialCurrencyCode.Set(&v)
}
// SetUnofficialCurrencyCodeNil sets the value for UnofficialCurrencyCode to be an explicit nil
func (o *DistributionBreakdown) SetUnofficialCurrencyCodeNil() {
o.UnofficialCurrencyCode.Set(nil)
}
// UnsetUnofficialCurrencyCode ensures that no value is present for UnofficialCurrencyCode, not even an explicit nil
func (o *DistributionBreakdown) UnsetUnofficialCurrencyCode() {
o.UnofficialCurrencyCode.Unset()
}
// GetCurrentPay returns the CurrentPay field value if set, zero value otherwise.
func (o *DistributionBreakdown) GetCurrentPay() Pay {
if o == nil || o.CurrentPay == nil {
var ret Pay
return ret
}
return *o.CurrentPay
}
// GetCurrentPayOk returns a tuple with the CurrentPay field value if set, nil otherwise
// and a boolean to check if the value has been set.
func (o *DistributionBreakdown) GetCurrentPayOk() (*Pay, bool) {
if o == nil || o.CurrentPay == nil {
return nil, false
}
return o.CurrentPay, true
}
// HasCurrentPay returns a boolean if a field has been set.
func (o *DistributionBreakdown) HasCurrentPay() bool {
if o != nil && o.CurrentPay != nil {
return true
}
return false
}
// SetCurrentPay gets a reference to the given Pay and assigns it to the CurrentPay field.
func (o *DistributionBreakdown) SetCurrentPay(v Pay) {
o.CurrentPay = &v
}
func (o DistributionBreakdown) MarshalJSON() ([]byte, error) {
toSerialize := map[string]interface{}{}
if o.AccountName.IsSet() {
toSerialize["account_name"] = o.AccountName.Get()
}
if o.BankName.IsSet() {
toSerialize["bank_name"] = o.BankName.Get()
}
if o.CurrentAmount.IsSet() {
toSerialize["current_amount"] = o.CurrentAmount.Get()
}
if o.IsoCurrencyCode.IsSet() {
toSerialize["iso_currency_code"] = o.IsoCurrencyCode.Get()
}
if o.Mask.IsSet() {
toSerialize["mask"] = o.Mask.Get()
}
if o.Type.IsSet() {
toSerialize["type"] = o.Type.Get()
}
if o.UnofficialCurrencyCode.IsSet() {
toSerialize["unofficial_currency_code"] = o.UnofficialCurrencyCode.Get()
}
if o.CurrentPay != nil {
toSerialize["current_pay"] = o.CurrentPay
}
for key, value := range o.AdditionalProperties {
toSerialize[key] = value
}
return json.Marshal(toSerialize)
}
func (o *DistributionBreakdown) UnmarshalJSON(bytes []byte) (err error) {
varDistributionBreakdown := _DistributionBreakdown{}
if err = json.Unmarshal(bytes, &varDistributionBreakdown); err == nil {
*o = DistributionBreakdown(varDistributionBreakdown)
}
additionalProperties := make(map[string]interface{})
if err = json.Unmarshal(bytes, &additionalProperties); err == nil {
delete(additionalProperties, "account_name")
delete(additionalProperties, "bank_name")
delete(additionalProperties, "current_amount")
delete(additionalProperties, "iso_currency_code")
delete(additionalProperties, "mask")
delete(additionalProperties, "type")
delete(additionalProperties, "unofficial_currency_code")
delete(additionalProperties, "current_pay")
o.AdditionalProperties = additionalProperties
}
return err
}
type NullableDistributionBreakdown struct {
value *DistributionBreakdown
isSet bool
}
func (v NullableDistributionBreakdown) Get() *DistributionBreakdown {
return v.value
}
func (v *NullableDistributionBreakdown) Set(val *DistributionBreakdown) {
v.value = val
v.isSet = true
}
func (v NullableDistributionBreakdown) IsSet() bool {
return v.isSet
}
func (v *NullableDistributionBreakdown) Unset() {
v.value = nil
v.isSet = false
}
func NewNullableDistributionBreakdown(val *DistributionBreakdown) *NullableDistributionBreakdown {
return &NullableDistributionBreakdown{value: val, isSet: true}
}
func (v NullableDistributionBreakdown) MarshalJSON() ([]byte, error) {
return json.Marshal(v.value)
}
func (v *NullableDistributionBreakdown) UnmarshalJSON(src []byte) error {
v.isSet = true
return json.Unmarshal(src, &v.value)
} | plaid/model_distribution_breakdown.go | 0.791499 | 0.406685 | model_distribution_breakdown.go | starcoder |
package plaid
import (
"encoding/json"
)
// Deductions An object with the deduction information found on a paystub.
type Deductions struct {
Subtotals *[]Total `json:"subtotals,omitempty"`
Breakdown []DeductionsBreakdown `json:"breakdown"`
Totals *[]Total `json:"totals,omitempty"`
Total DeductionsTotal `json:"total"`
AdditionalProperties map[string]interface{}
}
type _Deductions Deductions
// NewDeductions instantiates a new Deductions object
// This constructor will assign default values to properties that have it defined,
// and makes sure properties required by API are set, but the set of arguments
// will change when the set of required properties is changed
func NewDeductions(breakdown []DeductionsBreakdown, total DeductionsTotal) *Deductions {
this := Deductions{}
this.Breakdown = breakdown
this.Total = total
return &this
}
// NewDeductionsWithDefaults instantiates a new Deductions object
// This constructor will only assign default values to properties that have it defined,
// but it doesn't guarantee that properties required by API are set
func NewDeductionsWithDefaults() *Deductions {
this := Deductions{}
return &this
}
// GetSubtotals returns the Subtotals field value if set, zero value otherwise.
func (o *Deductions) GetSubtotals() []Total {
if o == nil || o.Subtotals == nil {
var ret []Total
return ret
}
return *o.Subtotals
}
// GetSubtotalsOk returns a tuple with the Subtotals field value if set, nil otherwise
// and a boolean to check if the value has been set.
func (o *Deductions) GetSubtotalsOk() (*[]Total, bool) {
if o == nil || o.Subtotals == nil {
return nil, false
}
return o.Subtotals, true
}
// HasSubtotals returns a boolean if a field has been set.
func (o *Deductions) HasSubtotals() bool {
if o != nil && o.Subtotals != nil {
return true
}
return false
}
// SetSubtotals gets a reference to the given []Total and assigns it to the Subtotals field.
func (o *Deductions) SetSubtotals(v []Total) {
o.Subtotals = &v
}
// GetBreakdown returns the Breakdown field value
func (o *Deductions) GetBreakdown() []DeductionsBreakdown {
if o == nil {
var ret []DeductionsBreakdown
return ret
}
return o.Breakdown
}
// GetBreakdownOk returns a tuple with the Breakdown field value
// and a boolean to check if the value has been set.
func (o *Deductions) GetBreakdownOk() (*[]DeductionsBreakdown, bool) {
if o == nil {
return nil, false
}
return &o.Breakdown, true
}
// SetBreakdown sets field value
func (o *Deductions) SetBreakdown(v []DeductionsBreakdown) {
o.Breakdown = v
}
// GetTotals returns the Totals field value if set, zero value otherwise.
func (o *Deductions) GetTotals() []Total {
if o == nil || o.Totals == nil {
var ret []Total
return ret
}
return *o.Totals
}
// GetTotalsOk returns a tuple with the Totals field value if set, nil otherwise
// and a boolean to check if the value has been set.
func (o *Deductions) GetTotalsOk() (*[]Total, bool) {
if o == nil || o.Totals == nil {
return nil, false
}
return o.Totals, true
}
// HasTotals returns a boolean if a field has been set.
func (o *Deductions) HasTotals() bool {
if o != nil && o.Totals != nil {
return true
}
return false
}
// SetTotals gets a reference to the given []Total and assigns it to the Totals field.
func (o *Deductions) SetTotals(v []Total) {
o.Totals = &v
}
// GetTotal returns the Total field value
func (o *Deductions) GetTotal() DeductionsTotal {
if o == nil {
var ret DeductionsTotal
return ret
}
return o.Total
}
// GetTotalOk returns a tuple with the Total field value
// and a boolean to check if the value has been set.
func (o *Deductions) GetTotalOk() (*DeductionsTotal, bool) {
if o == nil {
return nil, false
}
return &o.Total, true
}
// SetTotal sets field value
func (o *Deductions) SetTotal(v DeductionsTotal) {
o.Total = v
}
func (o Deductions) MarshalJSON() ([]byte, error) {
toSerialize := map[string]interface{}{}
if o.Subtotals != nil {
toSerialize["subtotals"] = o.Subtotals
}
if true {
toSerialize["breakdown"] = o.Breakdown
}
if o.Totals != nil {
toSerialize["totals"] = o.Totals
}
if true {
toSerialize["total"] = o.Total
}
for key, value := range o.AdditionalProperties {
toSerialize[key] = value
}
return json.Marshal(toSerialize)
}
func (o *Deductions) UnmarshalJSON(bytes []byte) (err error) {
varDeductions := _Deductions{}
if err = json.Unmarshal(bytes, &varDeductions); err == nil {
*o = Deductions(varDeductions)
}
additionalProperties := make(map[string]interface{})
if err = json.Unmarshal(bytes, &additionalProperties); err == nil {
delete(additionalProperties, "subtotals")
delete(additionalProperties, "breakdown")
delete(additionalProperties, "totals")
delete(additionalProperties, "total")
o.AdditionalProperties = additionalProperties
}
return err
}
type NullableDeductions struct {
value *Deductions
isSet bool
}
func (v NullableDeductions) Get() *Deductions {
return v.value
}
func (v *NullableDeductions) Set(val *Deductions) {
v.value = val
v.isSet = true
}
func (v NullableDeductions) IsSet() bool {
return v.isSet
}
func (v *NullableDeductions) Unset() {
v.value = nil
v.isSet = false
}
func NewNullableDeductions(val *Deductions) *NullableDeductions {
return &NullableDeductions{value: val, isSet: true}
}
func (v NullableDeductions) MarshalJSON() ([]byte, error) {
return json.Marshal(v.value)
}
func (v *NullableDeductions) UnmarshalJSON(src []byte) error {
v.isSet = true
return json.Unmarshal(src, &v.value)
} | plaid/model_deductions.go | 0.505615 | 0.471406 | model_deductions.go | starcoder |
package unsafe
import "unsafe"
//sliceOf creates a new byte slice from the given pointer.
//The capacity of the returned slice is the same as the length.
//This function assumes that the caller keeps the ptr reachable.
func sliceOf(ptr unsafe.Pointer, length int) []byte { return unsafe.Slice((*byte)(ptr), length) }
// u8Tou16 converts the given byte slice to a uint16 slice
// The returned slice has a length of `len(v)/2`
func u8Tou16(d []byte) []uint16 {
if len(d) == 0 {
return nil
}
return unsafe.Slice((*uint16)(unsafe.Pointer(&d[0])), len(d)/2)
}
// u8Tou32 converts the given byte slice to a uint32 slice
// The returned slice has a length of `len(v)/4`
func u8Tou32(d []byte) []uint32 {
if len(d) == 0 {
return nil
}
return unsafe.Slice((*uint32)(unsafe.Pointer(&d[0])), len(d)/4)
}
// u8Tou64 converts the given byte slice to a uint64 slice
// The returned slice has a length of `len(v)/8`
func u8Tou64(d []byte) []uint64 {
if len(d) == 0 {
return nil
}
return unsafe.Slice((*uint64)(unsafe.Pointer(&d[0])), len(d)/8)
}
// u16Tou64 converts the given uint16 slice to a uint64 slice
// The returned slice has a length of `len(v)/4`
func u16Tou64(d []uint16) []uint64 {
if len(d) == 0 {
return nil
}
return unsafe.Slice((*uint64)(unsafe.Pointer(&d[0])), len(d)/4)
}
// i8Tou8 converts the given int8 slice to a uint8 slice
func i8Tou8(v []int8) []byte { return *(*[]byte)(unsafe.Pointer(&v)) }
// i16Tou16 converts the given int16 slice to a uint16 slice
func i16Tou16(v []int16) []uint16 { return *(*[]uint16)(unsafe.Pointer(&v)) }
// i64Tou32 converts the given int32 slice to a uint32 slice
func i32Tou32(v []int32) []uint32 { return *(*[]uint32)(unsafe.Pointer(&v)) }
// f32Tou32 converts the given float32 slice to a uint32 slice
func f32Tou32(v []float32) []uint32 { return *(*[]uint32)(unsafe.Pointer(&v)) }
// i64Tou64 converts the given int64 slice to a uint64 slice
func i64Tou64(v []int64) []uint64 { return *(*[]uint64)(unsafe.Pointer(&v)) }
// f64Tou64 converts the given float64 slice to a uint64 slice
func f64Tou64(v []float64) []uint64 { return *(*[]uint64)(unsafe.Pointer(&v)) } | internal/unsafe/go1.17.go | 0.763748 | 0.493958 | go1.17.go | starcoder |
package main
import (
"fmt"
"math"
"github.com/rolfschmidt/advent-of-code-2021/helper"
)
var lights string;
var matrix map[int]map[int]string;
var flip = false
func main() {
fmt.Println("Part 1", Part1())
fmt.Println("Part 2", Part2())
}
func Part1() int {
return Run(false)
}
func Part2() int {
return Run(true)
}
func MatrixGet(x int, y int) string {
if _, ok := matrix[y]; !ok {
if flip {
return "1"
} else {
return "0"
}
}
if _, ok := matrix[y][x]; !ok {
if flip {
return "1"
} else {
return "0"
}
}
return matrix[y][x]
}
func MatrixRange() (int, int, int, int) {
minY := math.MaxInt32
maxY := -1
minX := math.MaxInt32
maxX := -1
for y := range matrix {
minY = helper.IntMin(minY, y)
maxY = helper.IntMax(maxY, y)
for x := range matrix[y] {
minX = helper.IntMin(minX, x)
maxX = helper.IntMax(maxX, x)
}
}
return minY, maxY, minX, maxX
}
func MatrixPrint() {
minY, maxY, minX, maxX := MatrixRange()
for y := minY; y <= maxY; y++ {
for x := minX; x <= maxX; x++ {
vv := MatrixGet(x, y)
if vv == "1" {
fmt.Print("#")
} else {
fmt.Print(".")
}
}
fmt.Println()
}
}
func MatrixValueMap(check string) string {
return string(lights[helper.Binary2Int(check)])
}
func MatrixRun() map[int]map[int]string {
minY, maxY, minX, maxX := MatrixRange()
newMatrix := map[int]map[int]string{}
for y := minY - 3; y <= maxY + 3; y++ {
for x := minX - 3; x <= maxX + 3; x++ {
check := ""
for dy := -1; dy < 2; dy += 1 {
for dx := -1; dx < 2; dx += 1 {
check += MatrixGet(x + dx, y + dy)
}
}
if _, ok := newMatrix[y]; !ok {
newMatrix[y] = map[int]string{}
}
newMatrix[y][x] = MatrixValueMap(check)
}
}
return newMatrix
}
func MatrixLit() int {
minY, maxY, minX, maxX := MatrixRange()
count := 0
for y := minY; y <= maxY; y++ {
for x := minX; x <= maxX; x++ {
if MatrixGet(x, y) == "1" {
count += 1
}
}
}
return count
}
func Run(Part2 bool) int {
content := helper.Replace(helper.Replace(helper.ReadFileString("input.txt"), ".", "0"), "#", "1")
parts := helper.Split(content, "\n\n")
lights = parts[0]
matrix = map[int]map[int]string{}
for li, line := range helper.Split(parts[1], "\n") {
row := map[int]string{}
for ic, char := range helper.Split(line, "") {
row[ic] = char
}
matrix[li] = row
}
rounds := 2
if Part2 {
rounds = 50
}
for r := 0; r < rounds; r += 1 {
matrix = MatrixRun()
if MatrixValueMap("0") == "1" {
flip = !flip
}
}
return MatrixLit()
} | day20/main.go | 0.701917 | 0.412353 | main.go | starcoder |
package schemas
import (
"fmt"
"hash/crc32"
"regexp"
"strconv"
"github.com/mvisonneau/gitlab-ci-pipelines-exporter/pkg/config"
)
const (
mergeRequestRegexp string = `^((\d+)|refs/merge-requests/(\d+)/head)$`
// RefKindBranch refers to a branch
RefKindBranch RefKind = "branch"
// RefKindTag refers to a tag
RefKindTag RefKind = "tag"
// RefKindMergeRequest refers to a tag
RefKindMergeRequest RefKind = "merge-request"
)
// RefKind is used to determine the kind of the ref
type RefKind string
// Ref is what we will use a metrics entity on which we will
// perform regular pulling operations
type Ref struct {
Kind RefKind
Name string
Project Project
LatestPipeline Pipeline
LatestJobs Jobs
}
// RefKey ..
type RefKey string
// Key ..
func (ref Ref) Key() RefKey {
return RefKey(strconv.Itoa(int(crc32.ChecksumIEEE([]byte(string(ref.Kind) + ref.Project.Name + ref.Name)))))
}
// Refs allows us to keep track of all the Ref
// we have configured/discovered
type Refs map[RefKey]Ref
// Count returns the amount of projects refs in the map
func (refs Refs) Count() int {
return len(refs)
}
// DefaultLabelsValues ..
func (ref Ref) DefaultLabelsValues() map[string]string {
return map[string]string{
"kind": string(ref.Kind),
"project": ref.Project.Name,
"ref": ref.Name,
"topics": ref.Project.Topics,
"variables": ref.LatestPipeline.Variables,
}
}
// NewRef is an helper which returns a new Ref
func NewRef(
project Project,
kind RefKind,
name string,
) Ref {
return Ref{
Kind: kind,
Name: name,
Project: project,
LatestJobs: make(Jobs),
}
}
// GetRefRegexp returns the expected regexp given a ProjectPullRefs config and a RefKind
func GetRefRegexp(ppr config.ProjectPullRefs, rk RefKind) (re *regexp.Regexp, err error) {
switch rk {
case RefKindBranch:
return regexp.Compile(ppr.Branches.Regexp)
case RefKindTag:
return regexp.Compile(ppr.Tags.Regexp)
case RefKindMergeRequest:
return regexp.Compile(mergeRequestRegexp)
}
return nil, fmt.Errorf("invalid ref kind (%v)", rk)
}
// GetMergeRequestIIDFromRefName parse a refName to extract a merge request IID
func GetMergeRequestIIDFromRefName(refName string) (string, error) {
re := regexp.MustCompile(mergeRequestRegexp)
if matches := re.FindStringSubmatch(refName); len(matches) == 4 {
if len(matches[2]) > 0 {
return matches[2], nil
}
if len(matches[3]) > 0 {
return matches[3], nil
}
}
return refName, fmt.Errorf("unable to extract the merge-request ID from the ref (%s)", refName)
} | pkg/schemas/ref.go | 0.705481 | 0.416975 | ref.go | starcoder |
package ptr
import "time"
// To returns the value of the pointer passed in or the default value if the pointer is nil.
func To[T any](v *T) T {
var zero T
if v == nil {
return zero
}
return *v
}
// ToInt returns the value of the int pointer passed in or int if the pointer is nil.
// ToInt returns the value of the int pointer passed in or 0 if the pointer is nil.
func ToInt(v *int) int {
if v == nil {
return 0
}
return *v
}
// ToInt8 returns the value of the int8 pointer passed in or 0 if the pointer is nil.
func ToInt8(v *int8) int8 {
if v == nil {
return 0
}
return *v
}
// ToInt16 returns the value of the int16 pointer passed in or 0 if the pointer is nil.
func ToInt16(v *int16) int16 {
if v == nil {
return 0
}
return *v
}
// ToInt32 returns the value of the int32 pointer passed in or 0 if the pointer is nil.
func ToInt32(v *int32) int32 {
if v == nil {
return 0
}
return *v
}
// ToInt64 returns the value of the int64 pointer passed in or 0 if the pointer is nil.
func ToInt64(v *int64) int64 {
if v == nil {
return 0
}
return *v
}
// ToUInt returns the value of the uint pointer passed in or 0 if the pointer is nil.
func ToUInt(v *uint) uint {
if v == nil {
return 0
}
return *v
}
// ToUInt8 returns the value of the uint8 pointer passed in or 0 if the pointer is nil.
func ToUInt8(v *uint8) uint8 {
if v == nil {
return 0
}
return *v
}
// ToUInt16 returns the value of the uint16 pointer passed in or 0 if the pointer is nil.
func ToUInt16(v *uint16) uint16 {
if v == nil {
return 0
}
return *v
}
// ToUInt32 returns the value of the uint32 pointer passed in or 0 if the pointer is nil.
func ToUInt32(v *uint32) uint32 {
if v == nil {
return 0
}
return *v
}
// ToUInt64 returns the value of the uint64 pointer passed in or 0 if the pointer is nil.
func ToUInt64(v *uint64) uint64 {
if v == nil {
return 0
}
return *v
}
// ToByte returns the value of the byte pointer passed in or 0 if the pointer is nil.
func ToByte(v *byte) byte {
if v == nil {
return 0
}
return *v
}
// ToRune returns the value of the rune pointer passed in or 0 if the pointer is nil.
func ToRune(v *rune) rune {
if v == nil {
return 0
}
return *v
}
// ToBool returns the value of the bool pointer passed in or false if the pointer is nil.
func ToBool(v *bool) bool {
if v == nil {
return false
}
return *v
}
// ToString returns the value of the string pointer passed in or empty string if the pointer is nil.
func ToString(v *string) string {
if v == nil {
return ""
}
return *v
}
// ToFloat32 returns the value of the float32 pointer passed in or 0 if the pointer is nil.
func ToFloat32(v *float32) float32 {
if v == nil {
return 0
}
return *v
}
// ToFloat64 returns the value of the float64 pointer passed in or 0 if the pointer is nil.
func ToFloat64(v *float64) float64 {
if v == nil {
return 0
}
return *v
}
// ToComplex64 returns the value of the complex64 pointer passed in or 0 if the pointer is nil.
func ToComplex64(v *complex64) complex64 {
if v == nil {
return 0
}
return *v
}
// ToComplex128 returns the value of the complex128 pointer passed in or 0 if the pointer is nil.
func ToComplex128(v *complex128) complex128 {
if v == nil {
return 0
}
return *v
}
// ToDuration returns the value of the time.Duration pointer passed in or 0 if the pointer is nil.
func ToDuration(v *time.Duration) time.Duration {
if v == nil {
return 0
}
return *v
}
// ToTime returns the value of the time.Time pointer passed in or Time{} if the pointer is nil.
func ToTime(v *time.Time) time.Time {
if v == nil {
return time.Time{}
}
return *v
} | to.go | 0.826991 | 0.543045 | to.go | starcoder |
package problem054
// assume a valid solution exists
type game struct {
numberAt [][]int
rowSet []map[int]bool
columnSet []map[int]bool
boxSet [][]map[int]bool
}
const empty = 0
func (thisGame *game) set(row int, column int, number int) *game {
if number == empty {
delete(thisGame.rowSet[row], thisGame.numberAt[row][column])
delete(thisGame.columnSet[column], thisGame.numberAt[row][column])
delete(thisGame.boxSet[row/3][column/3], thisGame.numberAt[row][column])
} else {
thisGame.rowSet[row][number] = true
thisGame.columnSet[column][number] = true
thisGame.boxSet[row/3][column/3][number] = true
}
thisGame.numberAt[row][column] = number
return thisGame
}
func (thisGame *game) resolveAt(row int, column int) bool {
if row > 8 {
return true
}
nextRow, nextColumn := row, column+1
if nextColumn > 8 {
nextRow, nextColumn = row+1, 0
}
if thisGame.numberAt[row][column] != empty {
return thisGame.resolveAt(nextRow, nextColumn)
}
for i := 1; i < 10; i++ {
alreadyInBox := thisGame.boxSet[row/3][column/3][i]
alreadyOnRow := thisGame.rowSet[row][i]
alreadyOnColumn := thisGame.columnSet[column][i]
if !alreadyInBox && !alreadyOnRow && !alreadyOnColumn {
thisGame.set(row, column, i)
if thisGame.resolveAt(nextRow, nextColumn) {
return true
}
thisGame.set(row, column, empty)
}
}
return false
}
func ResolveSudoku(values [][]int) [][]int {
newGame := &game{
numberAt: make([][]int, 9, 9),
rowSet: make([]map[int]bool, 9, 9),
columnSet: make([]map[int]bool, 9, 9),
boxSet: make([][]map[int]bool, 3, 3),
}
for i := range newGame.numberAt {
newGame.numberAt[i] = make([]int, 9, 9)
}
for i := range newGame.rowSet {
newGame.rowSet[i] = map[int]bool{}
newGame.columnSet[i] = map[int]bool{}
}
for i := range newGame.boxSet {
newGame.boxSet[i] = make([]map[int]bool, 3, 3)
for j := range newGame.boxSet[i] {
newGame.boxSet[i][j] = map[int]bool{}
}
}
for rowIndex, row := range values {
for columnIndex := range row {
newGame.set(rowIndex, columnIndex, values[rowIndex][columnIndex])
}
}
newGame.resolveAt(0, 0)
return newGame.numberAt
} | problem054/problem054.go | 0.53437 | 0.481149 | problem054.go | starcoder |
package fuzz
import (
"math"
"reflect"
)
// DeepEqual is reflect.DeepEqual except that:
// 1. nil and empty slice/string are considered equal
// 2. NaNs compare equal.
func DeepEqual(a1, a2 interface{}) bool {
if a1 == nil || a2 == nil {
return a1 == a2
}
return deepValueEqual(reflect.ValueOf(a1), reflect.ValueOf(a2), make(map[visit]bool))
}
func deepValueEqual(v1, v2 reflect.Value, visited map[visit]bool) bool {
if !v1.IsValid() || !v2.IsValid() {
return v1.IsValid() == v2.IsValid()
}
if v1.Type() != v2.Type() {
return false
}
hard := func(k reflect.Kind) bool {
switch k {
case reflect.Array, reflect.Map, reflect.Slice, reflect.Struct:
return true
}
return false
}
if v1.CanAddr() && v2.CanAddr() && hard(v1.Kind()) {
addr1 := v1.UnsafeAddr()
addr2 := v2.UnsafeAddr()
if addr1 > addr2 {
// Canonicalize order to reduce number of entries in visited.
addr1, addr2 = addr2, addr1
}
// Short circuit if references are identical ...
if addr1 == addr2 {
return true
}
// ... or already seen
typ := v1.Type()
v := visit{addr1, addr2, typ}
if visited[v] {
return true
}
// Remember for later.
visited[v] = true
}
switch v1.Kind() {
case reflect.Array:
for i := 0; i < v1.Len(); i++ {
if !deepValueEqual(v1.Index(i), v2.Index(i), visited) {
return false
}
}
return true
case reflect.Slice:
if v1.Len() != v2.Len() {
return false
}
if v1.Pointer() == v2.Pointer() {
return true
}
for i := 0; i < v1.Len(); i++ {
if !deepValueEqual(v1.Index(i), v2.Index(i), visited) {
return false
}
}
return true
case reflect.Interface:
if v1.IsNil() || v2.IsNil() {
return v1.IsNil() == v2.IsNil()
}
return deepValueEqual(v1.Elem(), v2.Elem(), visited)
case reflect.Ptr:
return deepValueEqual(v1.Elem(), v2.Elem(), visited)
case reflect.Struct:
for i, n := 0, v1.NumField(); i < n; i++ {
if !deepValueEqual(v1.Field(i), v2.Field(i), visited) {
return false
}
}
return true
case reflect.Map:
if v1.Len() != v2.Len() {
return false
}
if v1.Pointer() == v2.Pointer() {
return true
}
for _, k := range v1.MapKeys() {
if !deepValueEqual(v1.MapIndex(k), v2.MapIndex(k), visited) {
return false
}
}
return true
case reflect.Func:
if v1.IsNil() && v2.IsNil() {
return true
}
// Can't do better than this:
return false
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
return v1.Int() == v2.Int()
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:
return v1.Uint() == v2.Uint()
case reflect.Float32, reflect.Float64:
f1 := v1.Float()
f2 := v2.Float()
return f1 == f2 || math.IsNaN(f1) && math.IsNaN(f2)
case reflect.Complex64, reflect.Complex128:
c1 := v1.Complex()
c2 := v2.Complex()
r1, i1 := real(c1), imag(c1)
r2, i2 := real(c2), imag(c2)
return (r1 == r2 || math.IsNaN(r1) && math.IsNaN(r2)) && (i1 == i2 || math.IsNaN(i1) && math.IsNaN(i2))
case reflect.String:
return v1.String() == v2.String()
case reflect.UnsafePointer:
return v1.Pointer() == v2.Pointer()
case reflect.Bool:
return v1.Bool() == v2.Bool()
case reflect.Chan:
return true
default:
panic("can't happen")
}
}
type visit struct {
a1 uintptr
a2 uintptr
typ reflect.Type
} | fuzz/util.go | 0.618665 | 0.640256 | util.go | starcoder |
package psql
import "fmt"
// Eq returns an Expression representing the equality comparison between a and b.
func Eq(a, b Expression) comparison {
return comparison{a, b, eq}
}
// NotEq returns an Expression representing the inequality comparison between a and b.
func NotEq(a, b Expression) comparison {
return comparison{a, b, neq}
}
// LessThan returns an Expression representing the less-than comparison between a and b.
func LessThan(a, b Expression) comparison {
return comparison{a, b, lt}
}
// LessThanOrEq returns an Expression representing the less-than-or-equal-to
// comparison between a and b.
func LessThanOrEq(a, b Expression) comparison {
return comparison{a, b, lte}
}
// GreaterThan returns an Expression representing the greater-than comparison
// between a and b.
func GreaterThan(a, b Expression) comparison {
return comparison{a, b, gt}
}
// GreaterThanOrEq returns an Expression representing the greater-than-or-equal-to
// comparison between a and b.
func GreaterThanOrEq(a, b Expression) comparison {
return comparison{a, b, gte}
}
type comparison struct {
a, b Expression
compType comparisonType
}
func (c comparison) ToSQLBoolean(p *Params) string {
return c.ToSQLExpr(p)
}
func (c comparison) ToSQLExpr(p *Params) string {
return fmt.Sprintf("(%s %s %s)", c.a.ToSQLExpr(p), c.compType, c.b.ToSQLExpr(p))
}
func (c comparison) Relations() []string {
var rels []string
rels = append(rels, c.a.Relations()...)
rels = append(rels, c.b.Relations()...)
return rels
}
type comparisonType int
const (
eq comparisonType = iota
neq
lt
lte
gt
gte
)
func (c comparisonType) String() string {
switch c {
case eq:
return "="
case neq:
return "<>"
case lt:
return "<"
case lte:
return "<="
case gt:
return ">"
case gte:
return ">="
default:
panic("unknown comparisonType")
}
}
// IsNull returns an Expression comparing expr and NULL for equality.
func IsNull(expr Expression) nullCheck {
return nullCheck{expr, false}
}
// IsNotNull returns an Expression comparing expr and NULL for inequality.
func IsNotNull(expr Expression) nullCheck {
return nullCheck{expr, true}
}
type nullCheck struct {
expr Expression
negated bool
}
func (c nullCheck) ToSQLBoolean(p *Params) string {
return c.ToSQLExpr(p)
}
func (c nullCheck) ToSQLExpr(p *Params) string {
return fmt.Sprintf("%s %s", c.expr.ToSQLExpr(p), c.operator())
}
func (c nullCheck) operator() string {
if c.negated {
return "IS NOT NULL"
}
return "IS NULL"
}
func (c nullCheck) Relations() []string {
return c.expr.Relations()
} | comparison.go | 0.899461 | 0.557123 | comparison.go | starcoder |
package equipslottype
import (
"github.com/kasworld/goguelike/config/gameconst"
)
func (et EquipSlotType) Attack() bool {
return attrib[et].Attack
}
func (et EquipSlotType) Defence() bool {
return attrib[et].Defence
}
func (et EquipSlotType) Rune() string {
return attrib[et].Rune
}
func (et EquipSlotType) Names() []string {
return attrib[et].Names
}
func (et EquipSlotType) Materials() []string {
return attrib[et].Materials
}
func (et EquipSlotType) BaseLen() float64 {
return float64(gameconst.ActiveObjBaseBiasLen) * attrib[et].CreateBiasRate
}
var attrib = [EquipSlotType_Count]struct {
Attack bool
Defence bool
CreateBiasRate float64 // bias rate of gameconst.ActiveObjBaseBiasLen when create
Rune string
Names []string
Materials []string
}{
Weapon: {true, false, .5, "/",
[]string{
"Dagger", "Mace", "Blade", "Spear", "Hammer", "Club", "Sword", "Pike", "Sickle",
"Knife", "Razor", "Trident", "Axe", "Staff", "Machete", "Rapier", "Scimitar",
"Trident", "Cutlass", "Flail", "Gladius", "Bardiche", "Falchion", "Flail",
"Glaive", "Guisarme", "Halberd", "Lance", "hook", "Pickaxe", "Scythe",
"Nunchaku", "Sabre", "Whip", "Estoc", "Flindbar", "Fauchard", "Harpoon",
},
[]string{
"Wood", "Bone",
"Stone", "Crystal", "Diamond",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
Shield: {false, true, .25, "(",
[]string{
"Buckler", "LightShield", "MediumShield", "HeavyShield", "TowerShield",
},
[]string{
"Wood", "Bone", "Hide",
"Stone",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
Helmet: {false, true, 0.125, "^",
[]string{
"Circlet", "Crown", "Hat", "Helm", "Hood", "Headband",
},
[]string{
"Wood", "Bone", "Hide", "Silk",
"Stone",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
Armor: {false, true, .25, "%",
[]string{
"Armor", "Coat", "Tunic", "Shirt", "Bodysuit", "Mail", "Chainmail", "Bandedmail",
"Splintmail", "Fieldplate", "Breastplate", "Halfplate", "Fullplate",
},
[]string{
"Wood", "Bone", "Hide", "Silk",
"Stone",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
Gauntlet: {false, true, 0.125, "=",
[]string{
"Gauntlet",
},
[]string{
"Wood", "Bone", "Hide", "Silk",
"Stone",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
Footwear: {false, true, 0.125, ",,",
[]string{
"Boots", "Sandals", "Shoes", "Slippers",
},
[]string{
"Wood", "Bone", "Hide", "Silk",
"Stone",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
Ring: {true, false, 0.125, "o",
[]string{
"Ring",
},
[]string{
"Wood", "Bone",
"Stone", "Coral", "Crystal", "Ruby", "Diamond",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
Amulet: {true, false, 0.125, "+",
[]string{
"Amulet",
},
[]string{
"Wood", "Bone",
"Stone", "Coral", "Crystal", "Ruby", "Diamond",
"Copper", "Brass", "Bronze", "Iron", "Steel", "Duralumin", "Silver", "Gold", "Platinum", "Titanium",
},
},
} | enum/equipslottype/attrib.go | 0.556159 | 0.40439 | attrib.go | starcoder |
package rangedbtest
import (
"context"
"fmt"
"sync"
"testing"
"time"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
"github.com/inklabs/rangedb"
"github.com/inklabs/rangedb/pkg/clock"
"github.com/inklabs/rangedb/pkg/clock/provider/sequentialclock"
"github.com/inklabs/rangedb/pkg/rangedberror"
"github.com/inklabs/rangedb/pkg/shortuuid"
)
// VerifyStore verifies the rangedb.Store interface.
func VerifyStore(t *testing.T, newStore func(*testing.T, clock.Clock, shortuuid.Generator) rangedb.Store) {
t.Helper()
t.Run("EventsByStream", func(t *testing.T) {
t.Run("returns 2 events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateIDA = "e332c377d5874a1d884033dac45dedab"
const aggregateIDB = "7188fc63d29a4f58a007406160139320"
store := newStore(t, sequentialclock.New(), uuid)
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 3}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB},
)
// When
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(eventA1))
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventA1.AggregateType(),
AggregateID: eventA1.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: eventA1.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: eventA1,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventA2.AggregateType(),
AggregateID: eventA2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: eventA2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: eventA2,
Metadata: nil,
},
)
})
t.Run("returns 2 events from stream with 3 events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateIDA = "f6ff053bcdf44cb89f59ec7008d4f590"
const aggregateIDB = "615d189413ba44a79ff3946bd4a8b1b4"
store := newStore(t, sequentialclock.New(), uuid)
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventA3 := &ThingWasDone{ID: aggregateIDA, Number: 3}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 3}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
&rangedb.EventRecord{Event: eventA3},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB},
)
// When
recordIterator := store.EventsByStream(ctx, 2, rangedb.GetEventStream(eventA1))
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventA2.AggregateType(),
AggregateID: eventA2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: eventA2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: eventA2,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventA3.AggregateType(),
AggregateID: eventA3.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 3,
EventType: eventA3.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: eventA3,
Metadata: nil,
},
)
})
t.Run("ordered by sequence number lexicographically", func(t *testing.T) {
// Given
const totalEventsToRequireBigEndian = 257
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const totalEvents = totalEventsToRequireBigEndian
events := make([]rangedb.Event, totalEvents)
const aggregateID = "e3f7e647d2c946f2a8c4c52966dcdc6e"
var eventRecords []*rangedb.EventRecord
for i := 0; i < totalEvents; i++ {
event := &ThingWasDone{ID: aggregateID, Number: i}
events[i] = event
eventRecords = append(eventRecords, &rangedb.EventRecord{Event: event})
}
ctx := TimeoutContext(t)
SaveEvents(t, store, eventRecords...)
// When
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(events[0]))
// Then
for i, event := range events {
require.True(t, recordIterator.Next(), i)
require.NoError(t, recordIterator.Err())
actualRecord := recordIterator.Record()
require.NotNil(t, actualRecord)
assert.Equal(t, event, actualRecord.Data)
}
AssertNoMoreResultsInIterator(t, recordIterator)
})
t.Run("starting with second entry", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateIDA = "bf663fe7adb74174bc316b2d7e2bc487"
const aggregateIDB = "ffc6f7262085461c9cd24ba843f4aab4"
store := newStore(t, sequentialclock.New(), uuid)
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 3}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB},
)
// When
recordIterator := store.EventsByStream(ctx, 2, rangedb.GetEventStream(eventA1))
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventA2.AggregateType(),
AggregateID: eventA2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: eventA2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: eventA2,
Metadata: nil,
},
)
})
t.Run("starting with second entry, stops from context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateIDA = "1e0d21ef42b640f3b83043d6c46d3130"
const aggregateIDB = "4b7b691baaa4494bb0254baf8f69c665"
store := newStore(t, sequentialclock.New(), uuid)
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventA3 := &ThingWasDone{ID: aggregateIDA, Number: 3}
eventA4 := &ThingWasDone{ID: aggregateIDA, Number: 4}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 4}
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
&rangedb.EventRecord{Event: eventA3},
&rangedb.EventRecord{Event: eventA4},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB},
)
ctx, done := context.WithCancel(TimeoutContext(t))
recordIterator := store.EventsByStream(ctx, 2, rangedb.GetEventStream(eventA1))
// When
require.True(t, recordIterator.Next(), recordIterator.Err())
done()
// Then
expectedRecord := &rangedb.Record{
AggregateType: eventA2.AggregateType(),
AggregateID: eventA2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: eventA2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: eventA2,
Metadata: nil,
}
assert.Equal(t, expectedRecord, recordIterator.Record())
assertCanceledIterator(t, recordIterator)
})
t.Run("stops before sending with context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "a1a112b026cc4ee287df2b201ebeae31"
event := &ThingWasDone{ID: aggregateID, Number: 1}
SaveEvents(t, store, &rangedb.EventRecord{Event: event})
ctx, done := context.WithCancel(TimeoutContext(t))
done()
// When
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(event))
// Then
assertCanceledIterator(t, recordIterator)
})
t.Run("errors when stream does not exist", func(t *testing.T) {
// Given
const aggregateID = "ad62bb76ab5b4bbd8266dfc2c5605fe6"
streamName := rangedb.GetStream("thing", aggregateID)
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
ctx := TimeoutContext(t)
// When
recordIterator := store.EventsByStream(ctx, 0, streamName)
// Then
assert.False(t, recordIterator.Next())
assert.Equal(t, rangedb.ErrStreamNotFound, recordIterator.Err())
})
})
t.Run("Events", func(t *testing.T) {
t.Run("all events ordered by global sequence number", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateIDA = "1b017406ea1045ddbdaa4f78df23f720"
const aggregateIDB = "3357a70d698f432aa53eb261d7806049"
const aggregateIDX = "14935d12e38747ffb98070e72e1386b7"
thingWasDoneA0 := &ThingWasDone{ID: aggregateIDA, Number: 100}
thingWasDoneA1 := &ThingWasDone{ID: aggregateIDA, Number: 200}
thingWasDoneB0 := &ThingWasDone{ID: aggregateIDB, Number: 300}
AnotherWasCompleteX0 := &AnotherWasComplete{ID: aggregateIDX}
SaveEvents(t, store, &rangedb.EventRecord{Event: thingWasDoneA0})
SaveEvents(t, store, &rangedb.EventRecord{Event: thingWasDoneB0})
SaveEvents(t, store, &rangedb.EventRecord{Event: thingWasDoneA1})
SaveEvents(t, store, &rangedb.EventRecord{Event: AnotherWasCompleteX0})
ctx := TimeoutContext(t)
// When
recordIterator := store.Events(ctx, 0)
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: thingWasDoneA0.AggregateType(),
AggregateID: thingWasDoneA0.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: thingWasDoneA0.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: thingWasDoneA0,
Metadata: nil,
},
&rangedb.Record{
AggregateType: thingWasDoneB0.AggregateType(),
AggregateID: thingWasDoneB0.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 1,
EventType: thingWasDoneB0.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: thingWasDoneB0,
Metadata: nil,
},
&rangedb.Record{
AggregateType: thingWasDoneA1.AggregateType(),
AggregateID: thingWasDoneA1.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 2,
EventType: thingWasDoneA1.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: thingWasDoneA1,
Metadata: nil,
},
&rangedb.Record{
AggregateType: AnotherWasCompleteX0.AggregateType(),
AggregateID: AnotherWasCompleteX0.AggregateID(),
GlobalSequenceNumber: 4,
StreamSequenceNumber: 1,
EventType: AnotherWasCompleteX0.EventType(),
EventID: uuid.Get(4),
InsertTimestamp: 3,
Data: AnotherWasCompleteX0,
Metadata: nil,
},
)
})
t.Run("all events starting with second entry", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "796ad1e510d043fab6a4134efc4a841c"
event1 := &ThingWasDone{ID: aggregateID, Number: 1}
event2 := &ThingWasDone{ID: aggregateID, Number: 2}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: event1},
&rangedb.EventRecord{Event: event2},
)
// When
recordIterator := store.Events(ctx, 2)
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: event2.AggregateType(),
AggregateID: event2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: event2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: event2,
Metadata: nil,
},
)
})
t.Run("all events starting with 3rd global entry", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateIDA = "af6e43e45b284fb2b8e3e8cf055acd93"
const aggregateIDB = "800f8ee98ae04a98868f45e777c66158"
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventB1 := &ThingWasDone{ID: aggregateIDB, Number: 3}
eventB2 := &ThingWasDone{ID: aggregateIDB, Number: 4}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB1},
&rangedb.EventRecord{Event: eventB2},
)
// When
recordIterator := store.Events(ctx, 3)
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventB1.AggregateType(),
AggregateID: eventB1.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 1,
EventType: eventB1.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: eventB1,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventB2.AggregateType(),
AggregateID: eventB2.AggregateID(),
GlobalSequenceNumber: 4,
StreamSequenceNumber: 2,
EventType: eventB2.EventType(),
EventID: uuid.Get(4),
InsertTimestamp: 3,
Data: eventB2,
Metadata: nil,
},
)
})
t.Run("stops before sending with context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "af6e43e45b284fb2b8e3e8cf055acd93"
event := &ThingWasDone{ID: aggregateID, Number: 1}
SaveEvents(t, store, &rangedb.EventRecord{Event: event})
ctx, done := context.WithCancel(TimeoutContext(t))
done()
// When
recordIterator := store.Events(ctx, 0)
// Then
assertCanceledIterator(t, recordIterator)
})
t.Run("all events starting with second entry, stops from context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "af6e43e45b284fb2b8e3e8cf055acd93"
event1 := &ThingWasDone{ID: aggregateID, Number: 1}
event2 := &ThingWasDone{ID: aggregateID, Number: 2}
event3 := &ThingWasDone{ID: aggregateID, Number: 3}
event4 := &ThingWasDone{ID: aggregateID, Number: 4}
ctx, done := context.WithCancel(TimeoutContext(t))
SaveEvents(t, store,
&rangedb.EventRecord{Event: event1},
&rangedb.EventRecord{Event: event2},
&rangedb.EventRecord{Event: event3},
&rangedb.EventRecord{Event: event4},
)
recordIterator := store.Events(ctx, 2)
// When
require.True(t, recordIterator.Next(), recordIterator.Err())
done()
// Then
expectedRecord := &rangedb.Record{
AggregateType: event2.AggregateType(),
AggregateID: event2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: event2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: event2,
Metadata: nil,
}
assert.Equal(t, expectedRecord, recordIterator.Record())
assertCanceledIterator(t, recordIterator)
})
t.Run("returns no events when global sequence number out of range", func(t *testing.T) {
// Given
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const aggregateIDA = "ac8185900da04af28f49e749c01494c5"
const aggregateIDB = "3357a70d698f432aa53eb261d7806049"
const aggregateIDX = "14935d12e38747ffb98070e72e1386b7"
thingWasDoneA0 := &ThingWasDone{ID: aggregateIDA, Number: 100}
thingWasDoneA1 := &ThingWasDone{ID: aggregateIDA, Number: 200}
thingWasDoneB0 := &ThingWasDone{ID: aggregateIDB, Number: 300}
AnotherWasCompleteX0 := &AnotherWasComplete{ID: aggregateIDX}
ctx := TimeoutContext(t)
SaveEvents(t, store, &rangedb.EventRecord{Event: thingWasDoneA0})
SaveEvents(t, store, &rangedb.EventRecord{Event: thingWasDoneB0})
SaveEvents(t, store, &rangedb.EventRecord{Event: thingWasDoneA1})
SaveEvents(t, store, &rangedb.EventRecord{Event: AnotherWasCompleteX0})
// When
recordIterator := store.Events(ctx, 5)
// Then
AssertNoMoreResultsInIterator(t, recordIterator)
})
})
t.Run("EventsByAggregateTypes", func(t *testing.T) {
t.Run("returns 3 events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateIDA = "68619bdf6d4f401793dee71d313a8fa6"
const aggregateIDB = "592b21138c024f1dbd626c24b00b8b4e"
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 3}
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB},
)
ctx := TimeoutContext(t)
// When
recordIterator := store.EventsByAggregateTypes(ctx, 0, eventA1.AggregateType())
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventA1.AggregateType(),
AggregateID: eventA1.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: eventA1.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: eventA1,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventA2.AggregateType(),
AggregateID: eventA2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: eventA2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: eventA2,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventB.AggregateType(),
AggregateID: eventB.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 1,
EventType: eventB.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: eventB,
Metadata: nil,
},
)
})
t.Run("starting with second entry", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateIDA = "d1ddf3a1965447feb5e7d3d35ed6973c"
const aggregateIDB = "04761d396e1d4d44b9b6534927b0dd2d"
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventB := &AnotherWasComplete{ID: aggregateIDB}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB},
)
// When
recordIterator := store.EventsByAggregateTypes(
ctx,
2,
eventA1.AggregateType(),
eventB.AggregateType(),
)
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventA2.AggregateType(),
AggregateID: eventA2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: eventA2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: eventA2,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventB.AggregateType(),
AggregateID: eventB.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 1,
EventType: eventB.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: eventB,
Metadata: nil,
},
)
})
t.Run("stops before sending with context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "7af380caca144040bcf3636c44ef0697"
event := &ThingWasDone{ID: aggregateID, Number: 1}
ctx, done := context.WithCancel(TimeoutContext(t))
SaveEvents(t, store, &rangedb.EventRecord{Event: event})
done()
// When
recordIterator := store.EventsByAggregateTypes(ctx, 0, event.AggregateType())
// Then
assertCanceledIterator(t, recordIterator)
})
})
t.Run("OptimisticDeleteStream", func(t *testing.T) {
t.Run("deletes a stream with 2 events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateIDA = "17852dae2f9448acb0174419c7634fdf"
store := newStore(t, sequentialclock.New(), uuid)
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
streamName := rangedb.GetEventStream(eventA1)
ctx := TimeoutContext(t)
// When
err := store.OptimisticDeleteStream(ctx, 2, streamName)
// Then
require.NoError(t, err)
t.Run("does not exist in stream", func(t *testing.T) {
recordIterator := store.EventsByStream(ctx, 0, streamName)
require.False(t, recordIterator.Next())
assert.Equal(t, rangedb.ErrStreamNotFound, recordIterator.Err())
})
t.Run("does not exist by aggregate type", func(t *testing.T) {
recordIterator := store.EventsByAggregateTypes(ctx, 0, eventA1.AggregateType())
require.False(t, recordIterator.Next())
assert.Nil(t, recordIterator.Err())
})
t.Run("does not exist in all events", func(t *testing.T) {
recordIterator := store.Events(ctx, 0)
require.False(t, recordIterator.Next())
assert.Nil(t, recordIterator.Err())
})
})
t.Run("errors from wrong expected stream sequence number", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateIDA = "17852dae2f9448acb0174419c7634fdf"
store := newStore(t, sequentialclock.New(), uuid)
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
streamName := rangedb.GetEventStream(eventA1)
// When
err := store.OptimisticDeleteStream(ctx, 5, streamName)
// Then
require.NotNil(t, err)
sequenceNumberErr, ok := err.(*rangedberror.UnexpectedSequenceNumber)
require.True(t, ok)
assert.Equal(t, 5, int(sequenceNumberErr.Expected))
assert.Equal(t, 2, int(sequenceNumberErr.ActualSequenceNumber))
})
t.Run("errors when stream does not exist", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "0dec62a37ea048c8affe2d933ef7bb77"
store := newStore(t, sequentialclock.New(), uuid)
ctx := TimeoutContext(t)
streamName := rangedb.GetStream("thing", aggregateID)
// When
err := store.OptimisticDeleteStream(ctx, 0, streamName)
// Then
assert.Equal(t, rangedb.ErrStreamNotFound, err)
})
t.Run("errors from canceled context attempting to delete a stream with 2 events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateIDA = "17852dae2f9448acb0174419c7634fdf"
store := newStore(t, sequentialclock.New(), uuid)
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
streamName := rangedb.GetEventStream(eventA1)
ctx, done := context.WithCancel(TimeoutContext(t))
done()
// When
err := store.OptimisticDeleteStream(ctx, 2, streamName)
// Then
assert.Equal(t, context.Canceled, err)
})
t.Run("maintains correct global sequence number when deleting the last event", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const (
aggregateIDA = "9fff598582c449f288eef8c3847731a0"
aggregateIDB = "5748d5cfe9734eb3bd99aec84f585718"
aggregateIDC = "1ede7e475b6c4766972dd95ec544548e"
)
store := newStore(t, sequentialclock.New(), uuid)
eventA := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventB := &AnotherWasComplete{ID: aggregateIDB}
eventC := &ThatWasDone{ID: aggregateIDC}
ctx := TimeoutContext(t)
SaveEvents(t, store, &rangedb.EventRecord{Event: eventA})
SaveEvents(t, store, &rangedb.EventRecord{Event: eventB})
streamName := rangedb.GetEventStream(eventB)
// When
err := store.OptimisticDeleteStream(ctx, 1, streamName)
// Then
require.NoError(t, err)
SaveEvents(t, store, &rangedb.EventRecord{Event: eventC})
t.Run("can retrieve from all events", func(t *testing.T) {
recordIterator := store.Events(ctx, 0)
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventA.AggregateType(),
AggregateID: eventA.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: eventA.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: eventA,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventC.AggregateType(),
AggregateID: eventC.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 1,
EventType: eventC.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: eventC,
Metadata: nil,
},
)
})
t.Run("can retrieve by aggregate types", func(t *testing.T) {
recordIterator := store.EventsByAggregateTypes(ctx, 0,
eventA.AggregateType(),
eventB.AggregateType(),
eventC.AggregateType(),
)
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: eventA.AggregateType(),
AggregateID: eventA.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: eventA.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: eventA,
Metadata: nil,
},
&rangedb.Record{
AggregateType: eventC.AggregateType(),
AggregateID: eventC.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 1,
EventType: eventC.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: eventC,
Metadata: nil,
},
)
})
t.Run("does not exist in stream", func(t *testing.T) {
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(eventB))
require.False(t, recordIterator.Next())
assert.Equal(t, rangedb.ErrStreamNotFound, recordIterator.Err())
})
})
})
t.Run("OptimisticSave", func(t *testing.T) {
t.Run("persists 1 event", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "dea1755baf824f618888ec11785fc11c"
store := newStore(t, sequentialclock.New(), uuid)
event := &ThingWasDone{ID: aggregateID, Number: 1}
ctx := TimeoutContext(t)
// When
newStreamSequenceNumber, err := store.OptimisticSave(
ctx,
0,
&rangedb.EventRecord{Event: event},
)
// Then
require.NoError(t, err)
assert.Equal(t, 1, int(newStreamSequenceNumber))
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(event))
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: event.AggregateType(),
AggregateID: event.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: event.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: event,
Metadata: nil,
},
)
})
t.Run("persists 2nd event after 1st", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "0e421791334146a7a0576c5b9f6649c9"
store := newStore(t, sequentialclock.New(), uuid)
event1 := &ThingWasDone{ID: aggregateID, Number: 1}
event2 := &ThingWasDone{ID: aggregateID, Number: 2}
ctx := TimeoutContext(t)
SaveEvents(t, store, &rangedb.EventRecord{Event: event1})
// When
newStreamSequenceNumber, err := store.OptimisticSave(
ctx,
1,
&rangedb.EventRecord{Event: event2},
)
// Then
require.NoError(t, err)
assert.Equal(t, 2, int(newStreamSequenceNumber))
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(event2))
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: event1.AggregateType(),
AggregateID: event1.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: event1.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: event1,
Metadata: nil,
},
&rangedb.Record{
AggregateType: event2.AggregateType(),
AggregateID: event2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: event2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: event2,
Metadata: nil,
},
)
})
t.Run("persists 2 events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "cd02dfa51e7f484d9c3336ac7ea7ae44"
store := newStore(t, sequentialclock.New(), uuid)
event1 := &ThingWasDone{ID: aggregateID, Number: 1}
event2 := &ThingWasDone{ID: aggregateID, Number: 2}
ctx := TimeoutContext(t)
// When
newStreamSequenceNumber, err := store.OptimisticSave(
ctx,
0,
&rangedb.EventRecord{
Event: event1,
Metadata: nil,
},
&rangedb.EventRecord{
Event: event2,
Metadata: nil,
},
)
// Then
require.NoError(t, err)
assert.Equal(t, 2, int(newStreamSequenceNumber))
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(event1))
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: event1.AggregateType(),
AggregateID: event1.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: event1.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: event1,
Metadata: nil,
},
&rangedb.Record{
AggregateType: event2.AggregateType(),
AggregateID: event2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: event2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: event2,
Metadata: nil,
},
)
})
t.Run("fails to save first event from wrong expected sequence number", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "e332c377d5874a1d884033dac45dedab"
event := ThingWasDone{ID: aggregateID, Number: 1}
ctx := TimeoutContext(t)
// When
lastStreamSequenceNumber, err := store.OptimisticSave(
ctx,
1,
&rangedb.EventRecord{Event: event},
)
// Then
require.NotNil(t, err)
assert.Equal(t, uint64(0), lastStreamSequenceNumber)
assert.Contains(t, err.Error(), "unexpected sequence number: 1, actual: 0")
assert.IsType(t, &rangedberror.UnexpectedSequenceNumber{}, err)
sequenceNumberErr, ok := err.(*rangedberror.UnexpectedSequenceNumber)
require.True(t, ok)
assert.Equal(t, uint64(1), sequenceNumberErr.Expected)
assert.Equal(t, uint64(0), sequenceNumberErr.ActualSequenceNumber)
})
t.Run("fails on 2nd event without persisting 1st event", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "db6625707734412ab530dd8818cc1e5b"
event1 := ThingWasDone{ID: aggregateID, Number: 1}
failingEvent := NewEventThatWillFailUnmarshal("thing", aggregateID)
ctx := TimeoutContext(t)
// When
lastStreamSequenceNumber, err := store.OptimisticSave(
ctx,
0,
&rangedb.EventRecord{Event: event1},
&rangedb.EventRecord{Event: failingEvent},
)
// Then
require.Error(t, err)
assert.Equal(t, uint64(0), lastStreamSequenceNumber)
t.Run("does not exist in stream", func(t *testing.T) {
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(event1))
require.False(t, recordIterator.Next())
assert.Equal(t, rangedb.ErrStreamNotFound, recordIterator.Err())
})
t.Run("does not exist by aggregate type", func(t *testing.T) {
recordIterator := store.EventsByAggregateTypes(ctx, 0, event1.AggregateType())
require.False(t, recordIterator.Next())
assert.Nil(t, recordIterator.Err())
})
t.Run("does not exist in all events", func(t *testing.T) {
recordIterator := store.Events(ctx, 0)
require.False(t, recordIterator.Next())
assert.Nil(t, recordIterator.Err())
})
})
t.Run("fails on 2nd event without persisting 1st event, with one previously saved event", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "db6625707734412ab530dd8818cc1e5b"
event1 := &ThingWasDone{ID: aggregateID, Number: 1}
event2 := &ThingWasDone{ID: aggregateID, Number: 2}
failingEvent := NewEventThatWillFailUnmarshal("thing", aggregateID)
ctx := TimeoutContext(t)
SaveEvents(t, store, &rangedb.EventRecord{Event: event1})
// When
lastStreamSequenceNumber, err := store.OptimisticSave(
ctx,
0,
&rangedb.EventRecord{Event: event2},
&rangedb.EventRecord{Event: failingEvent},
)
// Then
require.Error(t, err)
assert.Equal(t, uint64(0), lastStreamSequenceNumber)
expectedRecord := &rangedb.Record{
AggregateType: event1.AggregateType(),
AggregateID: event1.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: event1.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: event1,
Metadata: nil,
}
allEventsIter := store.Events(ctx, 0)
AssertRecordsInIterator(t, allEventsIter, expectedRecord)
streamEventsIter := store.EventsByStream(ctx, 0, rangedb.GetEventStream(event1))
AssertRecordsInIterator(t, streamEventsIter, expectedRecord)
aggregateTypeEventsIter := store.EventsByAggregateTypes(ctx, 0, event1.AggregateType())
AssertRecordsInIterator(t, aggregateTypeEventsIter, expectedRecord)
})
t.Run("does not allow saving multiple events from different aggregate types", func(t *testing.T) {
// Given
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const aggregateIDA = "fc071388f13847b095f8ff40e21e9c6a"
const aggregateIDB = "16f623eae8ec492aa83b081abd63415d"
eventA := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventB := &AnotherWasComplete{ID: aggregateIDB}
ctx := TimeoutContext(t)
// When
lastStreamSequenceNumber, err := store.OptimisticSave(
ctx,
0,
&rangedb.EventRecord{Event: eventA},
&rangedb.EventRecord{Event: eventB},
)
// Then
require.EqualError(t, err, "unmatched aggregate type")
assert.Equal(t, uint64(0), lastStreamSequenceNumber)
})
t.Run("does not allow saving multiple events from different streams", func(t *testing.T) {
// Given
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const aggregateIDA = "59ad4a670c644687a28cea140398283c"
const aggregateIDB = "28c28e267ea9455cb3b43ab8067824b3"
eventA := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 2}
ctx := TimeoutContext(t)
// When
lastStreamSequenceNumber, err := store.OptimisticSave(
ctx,
0,
&rangedb.EventRecord{Event: eventA},
&rangedb.EventRecord{Event: eventB},
)
// Then
require.EqualError(t, err, "unmatched aggregate ID")
assert.Equal(t, uint64(0), lastStreamSequenceNumber)
})
t.Run("stops before saving with context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "6a073d2113544c37a8ae3cfdef78b164"
event := &ThingWasDone{ID: aggregateID, Number: 1}
ctx, done := context.WithCancel(TimeoutContext(t))
done()
// When
lastStreamSequenceNumber, err := store.OptimisticSave(
ctx,
0,
&rangedb.EventRecord{Event: event},
)
// Then
assert.Equal(t, context.Canceled, err)
assert.Equal(t, uint64(0), lastStreamSequenceNumber)
})
t.Run("errors from missing events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
ctx := TimeoutContext(t)
// When
lastStreamSequenceNumber, err := store.OptimisticSave(ctx, 0)
// Then
assert.EqualError(t, err, "missing events")
assert.Equal(t, uint64(0), lastStreamSequenceNumber)
})
})
t.Run("Save", func(t *testing.T) {
t.Run("generates eventID if empty", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "3d28f73abf2c40fea57aa0a3de2bd7b9"
store := newStore(t, sequentialclock.New(), uuid)
event := &ThingWasDone{ID: aggregateID, Number: 1}
ctx := TimeoutContext(t)
// When
_, err := store.Save(ctx, &rangedb.EventRecord{Event: event})
// Then
require.NoError(t, err)
recordIterator := store.EventsByStream(ctx, 0, rangedb.GetEventStream(event))
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: event.AggregateType(),
AggregateID: event.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: event.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: event,
Metadata: nil,
},
)
})
t.Run("does not allow saving multiple events from different aggregate types", func(t *testing.T) {
// Given
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const aggregateIDA = "ea455c7c9eee4e2a9a6c6cbe14532d0d"
const aggregateIDB = "03b2db3441164859a8c1a111af0d38b8"
eventA := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventB := &AnotherWasComplete{ID: aggregateIDB}
ctx := TimeoutContext(t)
// When
_, err := store.Save(ctx,
&rangedb.EventRecord{Event: eventA},
&rangedb.EventRecord{Event: eventB},
)
// Then
require.EqualError(t, err, "unmatched aggregate type")
})
t.Run("does not allow saving multiple events from different streams", func(t *testing.T) {
// Given
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const aggregateIDA = "30afca29f919413d849f83e201e47e05"
const aggregateIDB = "463bfd65d0944e7f877ed5294bc842d3"
eventA := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 2}
ctx := TimeoutContext(t)
// When
_, err := store.Save(ctx,
&rangedb.EventRecord{Event: eventA},
&rangedb.EventRecord{Event: eventB},
)
// Then
require.EqualError(t, err, "unmatched aggregate ID")
})
t.Run("stops before saving with context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "6a073d2113544c37a8ae3cfdef78b164"
event := &ThingWasDone{ID: aggregateID, Number: 1}
ctx, done := context.WithCancel(TimeoutContext(t))
done()
// When
_, err := store.Save(ctx, &rangedb.EventRecord{Event: event})
// Then
assert.Equal(t, context.Canceled, err)
})
t.Run("errors from missing events", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
ctx := TimeoutContext(t)
// When
_, err := store.Save(ctx)
// Then
assert.EqualError(t, err, "missing events")
})
})
t.Run("AllEventsSubscription", func(t *testing.T) {
t.Run("Save sends new events to subscriber on save", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "fe7a973d57bb4693a997bb445776da6a"
store := newStore(t, sequentialclock.New(), uuid)
event1 := &ThingWasDone{ID: aggregateID, Number: 2}
event2 := &ThingWasDone{ID: aggregateID, Number: 3}
countSubscriber := NewCountSubscriber()
ctx := TimeoutContext(t)
BlockingSaveEvents(t, store, &rangedb.EventRecord{Event: event1})
subscription := store.AllEventsSubscription(ctx, 10, countSubscriber)
// When
err := subscription.Start()
// Then
require.NoError(t, err)
_, err = store.Save(ctx, &rangedb.EventRecord{Event: event2})
require.NoError(t, err)
ReadRecord(t, countSubscriber.AcceptRecordChan)
require.Equal(t, 1, countSubscriber.TotalEvents())
assert.Equal(t, 3, countSubscriber.TotalThingWasDoneNumber())
expectedRecord := &rangedb.Record{
AggregateType: event2.AggregateType(),
AggregateID: event2.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 2,
EventType: event2.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: event2,
Metadata: nil,
}
require.Equal(t, 1, len(countSubscriber.AcceptedRecords))
assert.Equal(t, expectedRecord, countSubscriber.AcceptedRecords[0])
})
t.Run("stops before subscribing with context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
countSubscriber := NewCountSubscriber()
ctx, done := context.WithCancel(TimeoutContext(t))
done()
subscription := store.AllEventsSubscription(ctx, 10, countSubscriber)
// When
err := subscription.Start()
// Then
assert.Equal(t, context.Canceled, err)
})
t.Run("returns no events when global sequence number out of range", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "fe7a973d57bb4693a997bb445776da6a"
store := newStore(t, sequentialclock.New(), uuid)
event1 := &ThingWasDone{ID: aggregateID, Number: 2}
event2 := &ThingWasDone{ID: aggregateID, Number: 3}
ctx := TimeoutContext(t)
BlockingSaveEvents(t, store,
&rangedb.EventRecord{Event: event1},
&rangedb.EventRecord{Event: event2},
)
countSubscriber := NewCountSubscriber()
subscription := store.AllEventsSubscription(ctx, 10, countSubscriber)
// When
err := subscription.StartFrom(3)
// Then
require.NoError(t, err)
require.Equal(t, 0, countSubscriber.TotalEvents())
})
})
t.Run("AggregateTypesSubscription", func(t *testing.T) {
t.Run("Save sends new events by aggregate type to subscriber on save", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID1 = "db353641085f462ca2d18b0baa9b0e66"
const aggregateID2 = "b14ae3514a5d4a28b5be23567faa3c67"
store := newStore(t, sequentialclock.New(), uuid)
event1 := &ThingWasDone{ID: aggregateID1, Number: 2}
event2 := &AnotherWasComplete{ID: aggregateID2}
event3 := &ThingWasDone{ID: aggregateID1, Number: 3}
ctx := TimeoutContext(t)
BlockingSaveEvents(t, store, &rangedb.EventRecord{Event: event1})
countSubscriber := NewCountSubscriber()
subscription := store.AggregateTypesSubscription(ctx, 10, countSubscriber, event1.AggregateType())
// When
err := subscription.Start()
// Then
require.NoError(t, err)
SaveEvents(t, store, &rangedb.EventRecord{Event: event2})
SaveEvents(t, store, &rangedb.EventRecord{Event: event3})
ReadRecord(t, countSubscriber.AcceptRecordChan)
require.Equal(t, 1, countSubscriber.TotalEvents())
assert.Equal(t, 3, countSubscriber.TotalThingWasDoneNumber())
expectedRecord := &rangedb.Record{
AggregateType: event3.AggregateType(),
AggregateID: event3.AggregateID(),
GlobalSequenceNumber: 3,
StreamSequenceNumber: 2,
EventType: event3.EventType(),
EventID: uuid.Get(3),
InsertTimestamp: 2,
Data: event3,
Metadata: nil,
}
require.Equal(t, 1, len(countSubscriber.AcceptedRecords))
assert.Equal(t, expectedRecord, countSubscriber.AcceptedRecords[0])
})
t.Run("stops before subscribing with context.Done", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
countSubscriber := NewCountSubscriber()
ctx, done := context.WithCancel(TimeoutContext(t))
done()
subscription := store.AggregateTypesSubscription(ctx, 10, countSubscriber, ThingWasDone{}.AggregateType())
// When
err := subscription.Start()
// Then
assert.Equal(t, context.Canceled, err)
})
})
t.Run("Subscriber dispatches command that results in saving another event", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
const aggregateID = "b0ec7e41cf56445382ce7d823937abef"
store := newStore(t, sequentialclock.New(), uuid)
event := ThingWasDone{ID: aggregateID, Number: 2}
triggerProcessManager := newTriggerProcessManager(store.Save)
ctx := TimeoutContext(t)
subscription := store.AllEventsSubscription(ctx, 10, triggerProcessManager)
require.NoError(t, subscription.Start())
// When
_, err := store.Save(ctx, &rangedb.EventRecord{Event: event})
require.NoError(t, err)
// Then
ReadRecord(t, triggerProcessManager.ReceivedRecords)
recordIterator := store.Events(TimeoutContext(t), 0)
expectedTriggeredEvent := AnotherWasComplete{
ID: "2",
}
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: event.AggregateType(),
AggregateID: event.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: event.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: &event,
Metadata: nil,
},
&rangedb.Record{
AggregateType: expectedTriggeredEvent.AggregateType(),
AggregateID: expectedTriggeredEvent.AggregateID(),
GlobalSequenceNumber: 2,
StreamSequenceNumber: 1,
EventType: expectedTriggeredEvent.EventType(),
EventID: uuid.Get(2),
InsertTimestamp: 1,
Data: &expectedTriggeredEvent,
Metadata: nil,
},
)
})
t.Run("save event by value and get event by pointer from store", func(t *testing.T) {
// Given
uuid := NewSeededUUIDGenerator()
store := newStore(t, sequentialclock.New(), uuid)
const aggregateID = "30d438b5214740259761acc015ad7af8"
event := ThingWasDone{ID: aggregateID, Number: 1}
ctx := TimeoutContext(t)
SaveEvents(t, store, &rangedb.EventRecord{Event: event})
// When
recordIterator := store.Events(ctx, 0)
// Then
AssertRecordsInIterator(t, recordIterator,
&rangedb.Record{
AggregateType: event.AggregateType(),
AggregateID: event.AggregateID(),
GlobalSequenceNumber: 1,
StreamSequenceNumber: 1,
EventType: event.EventType(),
EventID: uuid.Get(1),
InsertTimestamp: 0,
Data: &event,
Metadata: nil,
},
)
})
t.Run("TotalEventsInStream", func(t *testing.T) {
t.Run("with 2 events in a stream", func(t *testing.T) {
// Given
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const aggregateIDA = "a3df4f9f7cb44803a638dedb2ee92ff8"
const aggregateIDB = "fa02fbd78a8b4d5a9a7aaaf9edae8216"
eventA1 := &ThingWasDone{ID: aggregateIDA, Number: 1}
eventA2 := &ThingWasDone{ID: aggregateIDA, Number: 2}
eventB := &ThingWasDone{ID: aggregateIDB, Number: 3}
ctx := TimeoutContext(t)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventA1},
&rangedb.EventRecord{Event: eventA2},
)
SaveEvents(t, store,
&rangedb.EventRecord{Event: eventB},
)
// When
totalEvents, err := store.TotalEventsInStream(ctx, rangedb.GetEventStream(eventA1))
// Then
assert.Equal(t, 2, int(totalEvents))
assert.Nil(t, err)
})
t.Run("stops before returning with context.Done", func(t *testing.T) {
// Given
store := newStore(t, sequentialclock.New(), NewSeededUUIDGenerator())
const aggregateID = "6a073d2113544c37a8ae3cfdef78b164"
event := &ThingWasDone{ID: aggregateID, Number: 1}
ctx, done := context.WithCancel(TimeoutContext(t))
SaveEvents(t, store, &rangedb.EventRecord{Event: event})
done()
// When
totalEvents, err := store.TotalEventsInStream(ctx, rangedb.GetEventStream(event))
// Then
assert.Equal(t, 0, int(totalEvents))
assert.Equal(t, context.Canceled, err)
})
})
}
// ReadRecord helper to read a record or timeout.
func ReadRecord(t *testing.T, recordChan chan *rangedb.Record) *rangedb.Record {
select {
case <-time.After(100 * time.Millisecond):
require.Fail(t, "timout reading record")
case record := <-recordChan:
return record
}
return nil
}
func assertCanceledIterator(t *testing.T, iter rangedb.RecordIterator) {
ctx := TimeoutContext(t)
for iter.NextContext(ctx) {
}
assert.False(t, iter.Next())
assert.Nil(t, iter.Record())
assert.Equal(t, context.Canceled, iter.Err())
}
// AssertRecordsInIterator asserts all expected rangedb.Record exist in the rangedb.RecordIterator.
func AssertRecordsInIterator(t *testing.T, recordIterator rangedb.RecordIterator, expectedRecords ...*rangedb.Record) {
for i, expectedRecord := range expectedRecords {
assert.True(t, recordIterator.Next(), recordIterator.Err())
assert.Nil(t, recordIterator.Err())
require.Equal(t, expectedRecord, recordIterator.Record(), i)
}
AssertNoMoreResultsInIterator(t, recordIterator)
}
// AssertNoMoreResultsInIterator asserts no more rangedb.Record exist in the rangedb.RecordIterator.
func AssertNoMoreResultsInIterator(t *testing.T, iter rangedb.RecordIterator) {
require.False(t, iter.Next())
require.Nil(t, iter.Record())
require.Nil(t, iter.Err())
}
type countSubscriber struct {
AcceptRecordChan chan *rangedb.Record
sync sync.RWMutex
totalAcceptedEvents int
totalThingWasDone int
AcceptedRecords []*rangedb.Record
}
// NewCountSubscriber constructs a projection for counting events in a test context.
func NewCountSubscriber() *countSubscriber {
return &countSubscriber{
AcceptRecordChan: make(chan *rangedb.Record, 10),
}
}
// Accept receives a Record.
func (c *countSubscriber) Accept(record *rangedb.Record) {
c.sync.Lock()
c.totalAcceptedEvents++
event, ok := record.Data.(*ThingWasDone)
if ok {
c.totalThingWasDone += event.Number
}
c.AcceptedRecords = append(c.AcceptedRecords, record)
c.sync.Unlock()
c.AcceptRecordChan <- record
}
func (c *countSubscriber) TotalEvents() int {
c.sync.RLock()
defer c.sync.RUnlock()
return c.totalAcceptedEvents
}
func (c *countSubscriber) TotalThingWasDoneNumber() int {
c.sync.RLock()
defer c.sync.RUnlock()
return c.totalThingWasDone
}
// EventSaver a function that accepts eventRecords for saving.
type EventSaver func(ctx context.Context, eventRecord ...*rangedb.EventRecord) (uint64, error)
type triggerProcessManager struct {
eventSaver EventSaver
ReceivedRecords chan *rangedb.Record
}
func newTriggerProcessManager(eventSaver EventSaver) *triggerProcessManager {
return &triggerProcessManager{
eventSaver: eventSaver,
ReceivedRecords: make(chan *rangedb.Record, 10),
}
}
// Accept receives a Record.
func (t *triggerProcessManager) Accept(record *rangedb.Record) {
switch event := record.Data.(type) {
case *ThingWasDone:
ctx := context.Background()
_, _ = t.eventSaver(ctx, &rangedb.EventRecord{
Event: AnotherWasComplete{
ID: fmt.Sprintf("%d", event.Number),
}})
}
t.ReceivedRecords <- record
}
// LoadIterator returns a rangedb.RecordIterator filled with the supplied records.
func LoadIterator(records ...*rangedb.Record) rangedb.RecordIterator {
resultRecords := make(chan rangedb.ResultRecord, len(records))
for _, record := range records {
resultRecords <- rangedb.ResultRecord{
Record: record,
Err: nil,
}
}
close(resultRecords)
return rangedb.NewRecordIterator(resultRecords)
}
// BlockingSaveEvents helper to save events, ensuring the broadcaster has processed every record.
func BlockingSaveEvents(t *testing.T, store rangedb.Store, records ...*rangedb.EventRecord) {
ctx := TimeoutContext(t)
blockingSubscriber := NewBlockingSubscriber(nil)
subscription := store.AllEventsSubscription(ctx, 10, blockingSubscriber)
require.NoError(t, subscription.Start())
_, err := store.Save(ctx, records...)
require.NoError(t, err)
for i := 0; i < len(records); i++ {
ReadRecord(t, blockingSubscriber.Records)
}
}
// SaveEvents helper to save events with a timeout.
func SaveEvents(t *testing.T, store rangedb.Store, records ...*rangedb.EventRecord) {
ctx := TimeoutContext(t)
_, err := store.Save(ctx, records...)
require.NoError(t, err)
} | rangedbtest/verify_store.go | 0.575946 | 0.415788 | verify_store.go | starcoder |
package ast
import (
"github.com/pkg/errors"
"github.com/sjhitchner/go-pred/token"
"regexp"
"strconv"
)
type Attrib interface{}
// Functions used to build the AST
// They are included in the grammar.bnf so the parser
// can build the AST
func NewLogicalAnd(a, b Attrib) (*LogicalNode, error) {
return &LogicalNode{a.(Node), b.(Node), And}, nil
}
func NewLogicalOr(a, b Attrib) (*LogicalNode, error) {
return &LogicalNode{a.(Node), b.(Node), Or}, nil
}
func NewNegation(a Attrib) (*NegationNode, error) {
return &NegationNode{a.(Node)}, nil
}
func NewClause(a Attrib) (*ClauseNode, error) {
return &ClauseNode{a.(Node)}, nil
}
func NewComparisonGreaterThan(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), GreaterThan}, nil
}
func NewComparisonGreaterThanEquals(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), GreaterThanEquals}, nil
}
func NewComparisonLessThan(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), LessThan}, nil
}
func NewComparisonLessThanEquals(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), LessThanEquals}, nil
}
func NewComparisonEquals(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), Equals}, nil
}
func NewComparisonNotEquals(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), NotEquals}, nil
}
func NewComparisonIsNot(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), IsNot}, nil
}
func NewComparisonIs(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), Is}, nil
}
func NewComparisonContains(a, b Attrib) (*ComparisonNode, error) {
return &ComparisonNode{a.(Node), b.(Node), Contains}, nil
}
func NewMatches(a, b Attrib) (*RegexNode, error) {
bstring := string(b.(*token.Token).Lit)
bregex, err := regexp.Compile(bstring)
if err != nil {
return nil, err
}
return &RegexNode{a.(Node), bregex}, nil
}
func NewLiteralBool(a Attrib) (*LiteralNode, error) {
abool, ok := a.(bool)
if !ok {
return nil, errors.Errorf("%v not a bool", a)
}
return &LiteralNode{abool}, nil
}
func NewLiteralInt(a Attrib) (*LiteralNode, error) {
aint, err := IntValue(a.(*token.Token).Lit)
if err != nil {
return nil, err
}
return &LiteralNode{aint}, nil
}
func NewLiteralFloat(a Attrib) (*LiteralNode, error) {
afloat, err := FloatValue(a.(*token.Token).Lit)
if err != nil {
return nil, err
}
return &LiteralNode{afloat}, nil
}
func NewLiteralString(a Attrib) (*LiteralNode, error) {
astring := string(a.(*token.Token).Lit)
return &LiteralNode{astring}, nil
}
func NewResolver(a Attrib) (*ResolverNode, error) {
key := string(a.(*token.Token).Lit)
return &ResolverNode{key}, nil
}
func IntValue(lit []byte) (int64, error) {
return strconv.ParseInt(string(lit), 10, 64)
}
func BoolValue(lit []byte) (bool, error) {
return strconv.ParseBool(string(lit))
}
func FloatValue(lit []byte) (float64, error) {
return strconv.ParseFloat(string(lit), 64)
} | ast/ast.go | 0.725551 | 0.51068 | ast.go | starcoder |
package interfacelib
import (
"strconv"
)
func ToFloat64(params interface{}) (res float64) {
switch params.(type) {
case int64:
t, _ := params.(int64)
res = float64(t)
case int32:
t, _ := params.(int32)
res = float64(t)
case int16:
t, _ := params.(int16)
res = float64(t)
case int8:
t, _ := params.(int8)
res = float64(t)
case int:
t, _ := params.(int)
res = float64(t)
case uint:
t, _ := params.(uint)
res = float64(t)
case float64:
res, _ = params.(float64)
case float32:
t, _ := params.(float32)
res = float64(t)
case string:
str, _ := params.(string)
res, _ = strconv.ParseFloat(str, 64)
default:
res = 0
}
return res
}
func ToInt64(params interface{}) (res int64) {
switch params.(type) {
case int64:
res, _ = params.(int64)
case int32:
t, _ := params.(int32)
res = int64(t)
case int16:
t, _ := params.(int16)
res = int64(t)
case int8:
t, _ := params.(int8)
res = int64(t)
case int:
t, _ := params.(int)
res = int64(t)
case uint:
t, _ := params.(uint)
res = int64(t)
case float64:
t, _ := params.(float64)
res = int64(t)
case float32:
t, _ := params.(float32)
res = int64(t)
case string:
t, _ := params.(string)
res, _ = strconv.ParseInt(t, 10, 64)
default:
res = 0
}
return res
}
func ToString(params interface{}) (str string) {
switch params.(type) {
case int64:
t, _ := params.(int64)
str = strconv.FormatInt(int64(t), 10)
case int32:
t, _ := params.(int32)
str = strconv.FormatInt(int64(t), 10)
case int16:
t, _ := params.(int16)
str = strconv.FormatInt(int64(t), 10)
case int8:
t, _ := params.(int8)
str = strconv.FormatInt(int64(t), 10)
case int: // S
t, _ := params.(int)
str = strconv.FormatInt(int64(t), 10)
case uint:
t, _ := params.(uint)
str = strconv.FormatInt(int64(t), 10)
case []uint8:
t, _ := params.([]uint8)
var ba []byte
for _, b := range t {
ba = append(ba, byte(b))
}
str = string(ba)
case float64:
t, _ := params.(float64)
str = strconv.FormatFloat(t, 'E', -1, 64)
case float32:
t, _ := params.(float32)
str = strconv.FormatFloat(float64(t), 'E', -1, 64)
case string:
str, _ = params.(string)
default:
str = ""
}
return str
}
func StringToFloat64(params interface{}) float64 {
fv, _ := params.(float64)
return fv
}
func StringToInt64(params interface{}) int64 {
fv, _ := strconv.ParseInt(ToString(params), 10, 64)
return fv
} | interfacelib/interfacelib.go | 0.643441 | 0.442335 | interfacelib.go | starcoder |
package dithering
import (
"image"
"image/color"
"math"
)
// PixelError represents the error for each canal in the image
// when dithering an image
// Errors are floats because they are the result of a division
type PixelError struct {
// TODO(brouxco): the alpha value does not make a lot of sense in a PixelError
R, G, B, A float32
}
// RGBA returns the errors for each canal in the image
func (c PixelError) RGBA() (r, g, b, a uint32) {
return uint32(c.R), uint32(c.G), uint32(c.B), uint32(c.A)
}
// Add adds two PixelError
func (c PixelError) Add(c2 PixelError) PixelError {
r := c.R + c2.R
g := c.G + c2.G
b := c.B + c2.B
return PixelError{r, g, b, 0}
}
// Mul multiplies two PixelError
func (c PixelError) Mul(v float32) PixelError {
r := c.R * v
g := c.G * v
b := c.B * v
return PixelError{r, g, b, 0}
}
func pixelErrorModel(c color.Color) color.Color {
if _, ok := c.(PixelError); ok {
return c
}
r, g, b, a := c.RGBA()
return PixelError{float32(r), float32(g), float32(b), float32(a)}
}
// ErrorImage is an in-memory image whose At method returns dithering.PixelError values
type ErrorImage struct {
// Pix holds the image's pixels, in R, G, B, A order. The pixel at
// (x, y) starts at Pix[(y-Rect.Min.Y)*Stride + (x-Rect.Min.X)*4].
Pix []float32
// Stride is the Pix stride between vertically adjacent pixels.
Stride int
// Rect is the image's bounds.
Rect image.Rectangle
// Min & Max values in the image
Min, Max PixelError
}
// ColorModel returns the ErrorImage color model
func (p *ErrorImage) ColorModel() color.Model {
return color.ModelFunc(pixelErrorModel)
}
// Bounds returns the domain for which At can return non-zero color
func (p *ErrorImage) Bounds() image.Rectangle { return p.Rect }
// At returns the color of the pixel at (x, y)
func (p *ErrorImage) At(x, y int) color.Color {
if !(image.Point{x, y}.In(p.Rect)) {
return PixelError{}
}
i := p.PixOffset(x, y)
r := (p.Pix[i+0]) + float32(math.Abs(float64(p.Min.R)))/(p.Max.R-p.Min.R)*255
g := (p.Pix[i+1]) + float32(math.Abs(float64(p.Min.G)))/(p.Max.G-p.Min.G)*255
b := (p.Pix[i+2]) + float32(math.Abs(float64(p.Min.B)))/(p.Max.B-p.Min.B)*255
return color.RGBA{uint8(r), uint8(g), uint8(b), 255}
}
// PixelErrorAt returns the pixel error at (x, y)
func (p *ErrorImage) PixelErrorAt(x, y int) PixelError {
if !(image.Point{x, y}.In(p.Rect)) {
return PixelError{}
}
i := p.PixOffset(x, y)
r := p.Pix[i+0]
g := p.Pix[i+1]
b := p.Pix[i+2]
a := p.Pix[i+3]
return PixelError{r, g, b, a}
}
// PixOffset returns the index of the first element of Pix that corresponds to
// the pixel at (x, y).
func (p *ErrorImage) PixOffset(x, y int) int {
return (y-p.Rect.Min.Y)*p.Stride + (x-p.Rect.Min.X)*4
}
// Set sets the error of the pixel at (x, y)
func (p *ErrorImage) Set(x, y int, c color.Color) {
if !(image.Point{x, y}.In(p.Rect)) {
return
}
i := p.PixOffset(x, y)
c1 := color.ModelFunc(pixelErrorModel).Convert(c).(PixelError)
// TODO(brouxco): use min and max functions maybe ?
if c1.R > p.Max.R {
p.Max.R = c1.R
}
if c1.G > p.Max.G {
p.Max.G = c1.G
}
if c1.B > p.Max.B {
p.Max.B = c1.B
}
if c1.R < p.Min.R {
p.Min.R = c1.R
}
if c1.G < p.Min.G {
p.Min.G = c1.G
}
if c1.B < p.Min.B {
p.Min.B = c1.B
}
p.Pix[i+0] = c1.R
p.Pix[i+1] = c1.G
p.Pix[i+2] = c1.B
p.Pix[i+3] = c1.A
}
// SetPixelError sets the error of the pixel at (x, y)
func (p *ErrorImage) SetPixelError(x, y int, c PixelError) {
if !(image.Point{x, y}.In(p.Rect)) {
return
}
if c.R > p.Max.R {
p.Max.R = c.R
}
if c.G > p.Max.G {
p.Max.G = c.G
}
if c.B > p.Max.B {
p.Max.B = c.B
}
if c.R < p.Min.R {
p.Min.R = c.R
}
if c.G < p.Min.G {
p.Min.G = c.G
}
if c.B < p.Min.B {
p.Min.B = c.B
}
i := p.PixOffset(x, y)
p.Pix[i+0] = c.R
p.Pix[i+1] = c.G
p.Pix[i+2] = c.B
p.Pix[i+3] = c.A
}
// NewErrorImage returns a new ErrorImage image with the given width and height
func NewErrorImage(r image.Rectangle) *ErrorImage {
w, h := r.Dx(), r.Dy()
buf := make([]float32, 4*w*h)
return &ErrorImage{buf, 4 * w, r, PixelError{}, PixelError{}}
} | error.go | 0.606382 | 0.541894 | error.go | starcoder |
package units
const bunArea = "square metre"
// areaFamily represents the collection of units of area
var areaFamily = &Family{
baseUnitName: bunArea,
description: "unit of area",
name: Area,
}
// AreaNames maps names to units of area
var areaNames = map[string]Unit{
// metric
bunArea: {
0, 0, 1,
areaFamily,
"m\u00B2", bunArea, "square metres",
"a metric measure of area.",
[]Tag{TagSI, TagMetric},
map[string]string{
"square metres": "plural",
"square-metre": "hyphenated",
"square-metres": "hyphenated, plural",
"square-meter": "US spelling, hyphenated",
"square meter": "US spelling",
"square-meters": "US spelling, hyphenated, plural",
"square meters": "US spelling, plural",
},
"", "",
},
"are": {
0, 0, 1e2,
areaFamily,
"are", "are", "ares",
"a non-SI metric measure of area.",
[]Tag{TagMetric},
map[string]string{},
"", "",
},
"decare": {
0, 0, 1e3,
areaFamily,
"decare", "decare", "decares",
"a non-SI metric measure of area.",
[]Tag{TagMetric},
map[string]string{
"new dunam": `An Ottoman Turkish measure of area,` +
` formerly "forty standard paces in length and breadth".`,
"stremma": "A Greek unit of land area",
},
"", "",
},
"hectare": {
0, 0, 1e4,
areaFamily,
"ha", "hectare", "hectares",
"a non-SI metric measure of area." +
" Primariy used in the measurement of land",
[]Tag{TagMetric},
map[string]string{
"hectares": "plural",
},
"", "",
},
"square kilometre": {
0, 0, 1e6,
areaFamily,
"km\u00B2", "square kilometre", "square kilometres",
"a metric measure of area.",
[]Tag{TagSI, TagMetric},
map[string]string{
"square kilometres": "plural",
"square-kilometre": "hyphenated",
"square-kilometer": "US spelling, hyphenated",
"square kilometer": "US spelling",
"square-kilometres": "hyphenated, plural",
"square-kilometers": "US spelling, hyphenated, plural",
"square kilometers": "US spelling, plural",
},
"", "",
},
// Imperial / US
"square yard": {
0, 0, yard2ToMetre2,
areaFamily,
"yd\u00B2", "square yard", "square yards",
"an imperial measure of area.",
[]Tag{TagImperial, TagUScustomary},
map[string]string{
"square yards": "plural",
"square-yard": "hyphenated",
"square-yards": "hyphenated, plural",
},
"", "",
},
"square mile": {
0, 0, yard2ToMetre2 * 1760 * 1760,
areaFamily,
"mi\u00B2", "square mile", "square miles",
"an imperial measure of area.",
[]Tag{TagImperial, TagUScustomary},
map[string]string{
"square miles": "plural",
"square-mile": "hyphenated",
"square-miles": "hyphenated, plural",
},
"", "",
},
"perch": {
0, 0, yard2ToMetre2 * 30.25,
areaFamily,
"square perch", "square perch", "square perches",
"an imperial measure of area. It is equal to one square rod." +
" Note that a perch can also be a" +
" measure of length or volume.",
[]Tag{TagImperial, TagHist},
map[string]string{},
"", "",
},
"rood": {
0, 0, acreToMetre2 * 0.25,
areaFamily,
"ro", "rood", "roods",
"an imperial measure of area. It may also be called a rod" +
" though a rod is typically a measure of length. Note" +
" however that a rood is not a square rod but is 40" +
" square rods (one furlong by one rod).",
[]Tag{TagImperial, TagHist},
map[string]string{},
"", "",
},
"acre": {
0, 0, acreToMetre2,
areaFamily,
"acre", "acre", "acres",
"an imperial measure of area.",
[]Tag{TagImperial, TagUScustomary},
map[string]string{
"acres": "plural",
},
"", "",
},
"oxgang": {
0, 0, acreToMetre2 * 15,
areaFamily,
"oxgang", "oxgang", "oxgangs",
"an obsolete imperial measure of area. Derived from the" +
" area of land that could be ploughed by a single ox" +
" in one season." +
" Sometimes known as 'bovate' or, in Scotland, 'damh-imir'." +
" Sometimes given as 20 acres." +
" See also 'virgate' and 'carucate'.",
[]Tag{TagImperial, TagHist},
map[string]string{},
"", "",
},
"virgate": {
0, 0, acreToMetre2 * 30,
areaFamily,
"virgate", "virgate", "virgates",
"an obsolete imperial measure of area. Derived from the" +
" area of land that could be ploughed by a team of" +
" 2 oxen in one season." +
" See also 'oxgang' and 'carucate'.",
[]Tag{TagImperial, TagHist},
map[string]string{},
"", "",
},
"carucate": {
0, 0, acreToMetre2 * 120,
areaFamily,
"carucate", "carucate", "carucates",
"an obsolete imperial measure of area. Derived from the" +
" area of land that could be ploughed by a team of" +
" 8 oxen in one season." +
" See also 'oxgang' and 'virgate'.",
[]Tag{TagImperial, TagHist},
map[string]string{},
"", "",
},
// Colloquial
"Wales": {
0, 0, 20779 * 1e6,
areaFamily,
"Wales",
"times the size of Wales", "times the size of Wales",
"Wales is a mountainous country that is part of the United Kingdom" +
" lying west of the greater part of England." +
" In the Welsh language it is called Cymru.",
[]Tag{TagColloquial},
map[string]string{},
"", "",
},
"football pitch": {
0, 0, 7140,
areaFamily,
"football pitch", "football pitch", "football pitches",
"the size of a football pitch can vary considerably but" +
" the preferred size for many professional teams' stadiums" +
" is 105m x 68m giving the figure used here.",
[]Tag{TagColloquial},
map[string]string{
"soccer pitch": "alternative",
},
"", "",
},
"American football pitch": {
0, 0, 6400 * yard2ToMetre2,
areaFamily,
"football pitch", "football pitch", "football pitches",
"120 x 53 1/3 yards.",
[]Tag{TagColloquial},
map[string]string{
"US football pitch": "alternative",
},
"", "",
},
} | units/area.go | 0.548915 | 0.535827 | area.go | starcoder |
package otp
import (
"math"
"net/url"
"strconv"
"time"
)
// Time base one time password generator
type TimeBased struct {
// General calculation information
Info
// a function which retrieves the time which is used for calculation
GetTimeFn func() time.Time
// indicates how long a single otp is valid.
Period time.Duration
}
func (tbi *TimeBased) ensureInitialized() {
if tbi.GetTimeFn == nil {
tbi.GetTimeFn = time.Now
}
if tbi.Period <= 0 {
tbi.Period = DefaultTimePeriod
}
if tbi.Digits != Dec6 && tbi.Digits != Dec8 {
tbi.Digits = Dec6
}
if tbi.Algorithm < SHA1 || tbi.Algorithm > MD5 {
tbi.Algorithm = SHA1
}
}
// the default time period an otp is valid
const DefaultTimePeriod time.Duration = 30 * time.Second
// the default tolerance when checking a otp
const DefaultTimeTolerance time.Duration = 3 * time.Second
// checks if the given otp is valid. also takes some tolerance into account.
// a tolerance might be usefull for network latency etc.
func (tbi *TimeBased) IsValid(account Account, otp string, tolerance time.Duration) bool {
tbi.ensureInitialized()
if tolerance < 0 {
tolerance = -tolerance
}
now := tbi.GetTimeFn()
period := tbi.Period.Seconds()
secret := account.Secret()
hash := tbi.Algorithm.newHash()
digits := tbi.Digits
firstIt := getIteration(now.Add(-tolerance), period)
lastIt := getIteration(now.Add(+tolerance), period)
for it := firstIt; it <= lastIt; it++ {
if otp == calcOTP(secret, it, digits, hash) {
return true
}
}
return false
}
// calculates the current otp for the given account
func (tbi *TimeBased) CurrentOTP(account Account) string {
tbi.ensureInitialized()
return calcOTP(account.Secret(),
getIteration(tbi.GetTimeFn(), tbi.Period.Seconds()),
tbi.Digits,
tbi.Algorithm.newHash())
}
func getIteration(t time.Time, period float64) uint64 {
unixTime := uint64(t.Unix())
pSeconds := uint64(math.Abs(period))
if pSeconds == 0 {
pSeconds = uint64(DefaultTimePeriod.Seconds())
}
return unixTime / pSeconds
}
func (tbi *TimeBased) addOTPAuthUriParams(params url.Values, account Account) {
tbi.ensureInitialized()
if tbi.Period != DefaultTimePeriod {
params.Add("period", strconv.Itoa(int(tbi.Period.Seconds())))
}
}
func (tbi *TimeBased) string() string {
return "totp"
}
// returns an uri which could be provided to the user via qr code.
// it contains all necessary information to setup the otp generator
func (tbi *TimeBased) OTPAuthUri(account Account) string {
tbi.ensureInitialized()
return tbi.Info.getOTPAuthUri(tbi, account)
}
// returns a new timebased otp generator for the given issuer
// (6 digits, SHA1, based on current system time, every 30 seconds)
func NewDefaultTOTP(issuer string) *TimeBased {
tbi := new(TimeBased)
tbi.Issuer = issuer
tbi.ensureInitialized()
return tbi
} | totp.go | 0.68941 | 0.507507 | totp.go | starcoder |
package kyber
//The first block of constants define internal parameters.
//SEEDBYTES holds the lenght in byte of the random number to give as input, if wanted.
//The remaining constants are exported to allow for fixed-lenght array instantiation. For a given security level, the consts are the same as the output of the k.SIZEX() functions defined in keys.go
const (
n = 256
q = 3329
qInv = 62209
eta2 = 2
shake128Rate = 168
polysize = 384
SIZEZ = 32
SEEDBYTES = 32
Kyber512SizePK = 800
Kyber512SizeSK = 1632
Kyber512SizePKESK = 768
Kyber512SizeC = 768 //2*320 + 128
Kyber768SizePK = 1184
Kyber768SizeSK = 2400
Kyber768SizePKESK = 1152
Kyber768SizeC = 1088 //3*320 + 128
Kyber1024SizePK = 1568
Kyber1024SizeSK = 3168
Kyber1024SizePKESK = 1536
Kyber1024SizeC = 1568 //4*352 + 160
)
//Kyber struct defines the internal parameters to be used given a security level
type Kyber struct {
Name string
params *parameters
}
//parameters hold all internal varying parameters used in a kyber scheme
type parameters struct {
K int
ETA1 int
DU int
DV int
SIZEPK int //= K*POLYSIZE + SEEDBYTES
SIZESK int //= SIZEZ + 32 + SIZEPK + K*POLYSIZE
SIZEPKESK int //= K * POLYSIZE
SIZEC int
}
//NewKyber512 defines a kyber instance with a light security level.
func NewKyber512() *Kyber {
return &Kyber{
Name: "Kyber512",
params: ¶meters{
K: 2,
ETA1: 3,
DU: 10,
DV: 4,
SIZEPK: 800,
SIZESK: 1632,
SIZEPKESK: 768,
SIZEC: 2*320 + 128,
}}
}
//NewKyber768 defines a kyber instance with a medium security level.
func NewKyber768() *Kyber {
return &Kyber{
Name: "Kyber768",
params: ¶meters{
K: 3,
ETA1: 2,
DU: 10,
DV: 4,
SIZEPK: 1184,
SIZESK: 2400,
SIZEPKESK: 1152,
SIZEC: 3*320 + 128,
}}
}
//NewKyber1024 defines a kyber instance with a very high security level.
func NewKyber1024() *Kyber {
return &Kyber{
Name: "Kyber1024",
params: ¶meters{
K: 4,
ETA1: 2,
DU: 11,
DV: 5,
SIZEPK: 1568,
SIZESK: 3168,
SIZEPKESK: 1536,
SIZEC: 4*352 + 160,
}}
}
//NewKyberUnsafe is a skeleton function to be used for research purposes when wanting to use a kyber instance with parameters that differ from the recommended ones.
func NewKyberUnsafe(n, k, q, eta1, et2, du, dv int) *Kyber {
return &Kyber{
Name: "Custom Kyber",
params: ¶meters{},
}
} | crystals-kyber/params.go | 0.673406 | 0.412648 | params.go | starcoder |
package cruncher
import (
"container/heap"
"fmt"
"io"
"math"
"sort"
)
const (
// InitialRemedianSize is the number of entries pre-allocated for maintaining
// the median
InitialRemedianSize = 4
)
// IntStats contains all the stats accumulated. It's best to
// maintain references only to the IntStats once the accumulation is
// complete and remove references to Accumulator.
type IntStats struct {
// Smallest valued added
Min int64
// Largest value added
Max int64
// Number of entries added
Count int64
// Mean is computed using a total / count it may be subject to overflow
Mean float64
// Median is an approximation using the Remedian technicque
Median int64
// FrequencyDistribution contains the count of occurances within a bucket
FrequencyDistribution []int64
// BucketSize contains the range of values within a bucket
BucketSize int64
// FrequencyDistributionStartingValue is the starting value for the
// frequency distribution. Distributions don't have to start at zero
FrequencyDistributionStartingValue int64
// OutlierBefore is the number of occurances lower than FrequencyDistributionStartingValue
OutlierBefore int64
// OutlierAfter is the number of occurances higher than the largest bucket
OutlierAfter int64
// Frequency
ValueFrequency map[int64]int64
}
// Accumulator maintains the transient state collected when accomulating
// statistics on a set of data. The results are available GetStats
type Accumulator struct {
intStats IntStats
remedians [][]int64
total int64
appoximationWindow int
buckets int
}
// NewAccumulator allocates an accumulator that collects statistics on data added.
// appoximationWindow is the amount of data to sample before computing
// the min and max for the frequency distribution. This
// value is also used to compute the median. Larger values require more
// memory but may be required if data values are not
// randomly distributed.
// buckets are the number of groups in the frequency distribution
func NewAccumulator(appoximationWindow, buckets int) *Accumulator {
a := new(Accumulator)
a.appoximationWindow = appoximationWindow
a.remedians = make([][]int64, 0, InitialRemedianSize)
a.buckets = buckets
return a
}
// Add adds a value to the data set to be summarized. Add is typically a constant
// time operation but may periodically include some iteration to update some
// statistics.
func (a *Accumulator) Add(value int64) {
// Adjust Min and Max
if a.intStats.Count == 0 {
a.intStats.Max = value
a.intStats.Min = value
a.intStats.ValueFrequency = make(map[int64]int64)
} else {
if a.intStats.Max < value {
a.intStats.Max = value
} else if a.intStats.Min > value {
a.intStats.Min = value
}
}
// Adjust Counts and Totals
a.intStats.Count++
a.total += value
// Update frequency distribution
count := a.intStats.Count
// One time configure Frequency Distribution
if len(a.intStats.FrequencyDistribution) > 0 {
a.incrementFrequencyDistribution(value)
} else if count == int64(a.appoximationWindow) {
a.initializeFrequencyDistribution()
}
// Must do this last so the full set of values is available
a.pushMedianValue(0, value)
// Count frequencies but don't count more than a.appoximationWindow
valueCount, present := a.intStats.ValueFrequency[value]
if present {
a.intStats.ValueFrequency[value] = valueCount + 1
} else if len(a.intStats.ValueFrequency) < a.appoximationWindow {
a.intStats.ValueFrequency[value] = 1
}
}
func (a *Accumulator) initializeFrequencyDistribution() {
a.intStats.OutlierAfter = 0
a.intStats.OutlierBefore = 0
a.intStats.FrequencyDistribution = make([]int64, a.buckets)
a.intStats.FrequencyDistributionStartingValue = a.intStats.Min
diff := a.intStats.Max - a.intStats.Min
a.intStats.BucketSize = int64(math.Ceil(float64(diff+1) / float64(a.buckets)))
for _, v := range a.remedians[0] {
a.incrementFrequencyDistribution(int64(v))
}
}
func (a *Accumulator) incrementFrequencyDistribution(value int64) (offset int) {
// Update bucket value
offset = int(math.Floor((float64(value-a.intStats.FrequencyDistributionStartingValue) / float64(a.intStats.BucketSize))))
// Handle out of bounds
if offset < 0 {
a.intStats.OutlierBefore++
} else if offset >= len(a.intStats.FrequencyDistribution) {
a.intStats.OutlierAfter++
} else {
// Increment bucket
a.intStats.FrequencyDistribution[offset]++
}
return offset
}
type int64arr []int64
func (a int64arr) Len() int { return len(a) }
func (a int64arr) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a int64arr) Less(i, j int) bool { return a[i] < a[j] }
func (a *Accumulator) pushMedianValue(offset int, value int64) (computed bool, min, max, median int64) {
if len(a.remedians) <= offset {
a.remedians = append(a.remedians, make([]int64, 0, a.appoximationWindow))
}
a.remedians[offset] = append(a.remedians[offset], value)
if medianLength := len(a.remedians[offset]); a.appoximationWindow < medianLength {
min, max, median = computeMedian(a.remedians[offset])
computed = true
a.pushMedianValue(offset+1, median)
a.remedians[offset] = a.remedians[offset][:0]
}
return computed, min, max, median
}
func computeMedian(values []int64) (min, max, median int64) {
sort.Sort(int64arr(values))
l := len(values)
return values[0], values[l-1], values[l/2]
}
// Summarize computes the frequency distribution and median
// calculation on the data samples that haven't been summarized
// yet.
func (a *Accumulator) Summarize() {
if a.intStats.Count < int64(a.appoximationWindow) {
a.initializeFrequencyDistribution()
}
a.intStats.Mean = float64(a.total) / float64(a.intStats.Count)
for i := len(a.remedians) - 1; i >= 0; i-- {
_, _, a.intStats.Median = computeMedian(a.remedians[i])
return
}
}
type pairHeap []Pair
func (h pairHeap) Len() int { return len(h) }
func (h pairHeap) Less(i, j int) bool { return h[i].Frequency < h[j].Frequency }
func (h pairHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
func (h *pairHeap) Push(x interface{}) {
*h = append(*h, x.(Pair))
}
func (h *pairHeap) Pop() interface{} {
old := *h
n := len(old)
x := old[n-1]
*h = old[0 : n-1]
return x
}
// GetTermFrequency returns the most frequently used terms. This is an
// Approximation. If the first term does not appear within the
// first approximationWindow data set then it will be omitted from the results
func (is IntStats) GetTermFrequency(topN int) PairList {
h := &pairHeap{}
heap.Init(h)
// Create heap of the topN most frequent terms
for k, f := range is.ValueFrequency {
if h.Len() < topN {
heap.Push(h, Pair{k, f})
} else if (*h)[0].Frequency < f {
heap.Pop(h)
heap.Push(h, Pair{k, f})
}
}
// Copy them to a list
pl := make(PairList, h.Len(), h.Len())
for i := h.Len() - 1; i >= 0; i-- {
pl[i] = (*h)[0]
heap.Pop(h)
}
return pl
}
// Pair provides a touple of the value provide and the frequency of the values use
type Pair struct {
Value int64
Frequency int64
}
// PairList is an array of Pair's
type PairList []Pair
// GetStats provides the current stats accumulated. If the data set continues to
// accumulate the accumulator update the results however,
// The copy returned will not be impacted.
func (a *Accumulator) GetStats() IntStats {
a.Summarize()
return a.intStats
}
// Print an ascii formatted human readable version of the summarized data
func (a *Accumulator) Print(w io.Writer) {
a.Summarize()
a.intStats.Print(w)
}
// Print outputs all the the acquired data about the accumulated values.
func (is IntStats) Print(w io.Writer) {
is.PrintSummary(w)
fmt.Println()
is.PrintFrequencyDistribution(w)
fmt.Println()
fmt.Println()
is.PrintValueFrequency(w, 5)
}
// PrintValueFrequency prints out the most frequent values in most
// to least frequent order.
func (is IntStats) PrintValueFrequency(w io.Writer, topValues int) {
if is.Count > 0 {
fmt.Fprintf(w, "= Top Value Frequency ==========\n")
for i, pair := range is.GetTermFrequency(topValues) {
fmt.Fprintf(w, "%2d. %8d :%8d (%4.2f%%)\n", i+1, pair.Value, pair.Frequency,
100.0*float64(pair.Frequency)/float64(is.Count))
}
}
}
// PrintFrequencyDistribution provides a count of the number of values within each equally
// sized bucket. Additionally, if the approximation window didn't capture all the possible values
// the range between the min and max and the frequency distribution are provided.
func (is IntStats) PrintFrequencyDistribution(w io.Writer) {
fmt.Fprintf(w, "= Distribution (size: %d number: %d) ====\n", is.BucketSize, len(is.FrequencyDistribution))
if is.OutlierBefore > 0 {
fmt.Fprintf(w, "%8d - %8d :%8d (%4.2f%%)**\n", is.Min, is.FrequencyDistributionStartingValue-1,
is.OutlierBefore, 100.0*float64(is.OutlierBefore)/float64(is.Count))
}
for key, value := range is.FrequencyDistribution {
fmt.Fprintf(w, "%8d - %8d :%8d (%4.2f%%)\n",
(is.FrequencyDistributionStartingValue)+(is.BucketSize*int64(key)),
((is.FrequencyDistributionStartingValue)+(is.BucketSize*(int64(key)+1)))-1, value,
100.0*float64(value)/float64(is.Count))
}
if is.OutlierAfter > 0 {
fmt.Fprintf(w, "%8d - %8d :%8d (%4.2f%%)**\n",
is.FrequencyDistributionStartingValue+(is.BucketSize*int64(len(is.FrequencyDistribution)))+1,
is.Max, is.OutlierAfter, 100.0*float64(is.OutlierAfter)/float64(is.Count))
}
}
// PrintSummary prints the min, max, mean, count and median
func (is IntStats) PrintSummary(w io.Writer) {
fmt.Fprintf(w, "= Summary ======================\n")
fmt.Fprintf(w, "%-8s %12d\n", "Min", is.Min)
fmt.Fprintf(w, "%-8s %12d\n", "Max", is.Max)
fmt.Fprintf(w, "%-8s %12d\n", "Count", is.Count)
fmt.Fprintf(w, "%-8s %16.3f\n", "Mean", is.Mean)
fmt.Fprintf(w, "%-8s %12d\n", "Median", is.Median)
} | cruncher.go | 0.700075 | 0.555435 | cruncher.go | starcoder |
package types
import (
"math"
"strconv"
)
// Vector3 is a three-dimensional Euclidean vector.
type Vector3 struct {
X, Y, Z float32
}
// NewVector3 returns a vector initialized with the given components.
func NewVector3(x, y, z float64) Vector3 {
return Vector3{X: float32(x), Y: float32(y), Z: float32(z)}
}
// NewVector3FromFace returns the vector that corresponds to the given Face.
func NewVector3FromFace(normal Face) Vector3 {
switch normal {
case FaceRight:
return Vector3{X: 1, Y: 0, Z: 0}
case FaceTop:
return Vector3{X: 0, Y: 1, Z: 0}
case FaceBack:
return Vector3{X: 0, Y: 0, Z: 1}
case FaceLeft:
return Vector3{X: -1, Y: 0, Z: 0}
case FaceBottom:
return Vector3{X: 0, Y: -1, Z: 0}
case FaceFront:
return Vector3{X: 0, Y: 0, Z: -1}
}
return Vector3{}
}
// NewVector3FromAxis returns the vector that corresponds to the given Axis.
func NewVector3FromAxis(axis Axis) Vector3 {
switch axis {
case AxisX:
return Vector3{X: 1, Y: 0, Z: 0}
case AxisY:
return Vector3{X: 0, Y: 1, Z: 0}
case AxisZ:
return Vector3{X: 0, Y: 0, Z: 1}
}
return Vector3{}
}
// Magnitude returns the length of the vector.
func (v Vector3) Magnitude() float64 {
return math.Sqrt(float64(v.X*v.X + v.Y*v.Y + v.Z*v.Z))
}
// Unit returns the vector with the same direction and a length of 1.
func (v Vector3) Unit() Vector3 {
m := float32(v.Magnitude())
return Vector3{X: v.X / m, Y: v.Y / m, Z: v.Z / m}
}
// Lerp returns a Vector3 linearly interpolated from the Vector3 to *goal*
// according to *alpha*, which has an interval of [0, 1].
func (v Vector3) Lerp(goal Vector3, alpha float64) Vector3 {
a := float32(alpha)
na := 1 - a
return Vector3{
X: na*v.X + a*goal.X,
Y: na*v.Y + a*goal.Y,
Z: na*v.Z + a*goal.Z,
}
}
// Dot returns the dot product of two vectors.
func (v Vector3) Dot(op Vector3) float64 {
return float64(v.X*op.X + v.Y*op.Y + v.Z*op.Z)
}
// Cross returns the cross product of two vectors.
func (v Vector3) Cross(op Vector3) Vector3 {
return Vector3{
v.Y*op.Z - v.Z*op.Y,
v.Z*op.X - v.X*op.Z,
v.X*op.Y - v.Y*op.X,
}
}
// FuzzyEq returns whether the two vectors are approximately equal.
func (v Vector3) FuzzyEq(op Vector3, epsilon float64) bool {
switch {
case epsilon == 0:
return v == op
case epsilon < 0:
// Default.
epsilon = 1e-5
}
x := v.X - op.X
y := v.Y - op.Y
z := v.Z - op.Z
return x*x+y*y+z*z <= float32(epsilon)
}
// Add returns the sum of two vectors.
func (v Vector3) Add(op Vector3) Vector3 {
return Vector3{X: v.X + op.X, Y: v.Y + op.Y, Z: v.Z + op.Z}
}
// Sub returns the difference of two vectors.
func (v Vector3) Sub(op Vector3) Vector3 {
return Vector3{X: v.X - op.X, Y: v.Y - op.Y, Z: v.Z - op.Z}
}
// Mul returns the product of two vectors.
func (v Vector3) Mul(op Vector3) Vector3 {
return Vector3{X: v.X * op.X, Y: v.Y * op.Y, Z: v.Z * op.Z}
}
// Div returns the quotient of two vectors.
func (v Vector3) Div(op Vector3) Vector3 {
return Vector3{X: v.X / op.X, Y: v.Y / op.Y, Z: v.Z / op.Z}
}
// MulN returns the vector with each component multiplied by a number.
func (v Vector3) MulN(op float64) Vector3 {
return Vector3{X: v.X * float32(op), Y: v.Y * float32(op), Z: v.Z * float32(op)}
}
// DivN returns the vector with each component divided by a number.
func (v Vector3) DivN(op float64) Vector3 {
return Vector3{X: v.X / float32(op), Y: v.Y / float32(op), Z: v.Z / float32(op)}
}
// Neg returns the negation of the vector.
func (v Vector3) Neg() Vector3 {
return Vector3{X: -v.X, Y: -v.Y, Z: -v.Z}
}
// Type returns a string that identifies the type.
func (Vector3) Type() string {
return "Vector3"
}
// String returns a human-readable string representation of the value.
func (v Vector3) String() string {
var b []byte
b = strconv.AppendFloat(b, float64(v.X), 'g', -1, 32)
b = append(b, ", "...)
b = strconv.AppendFloat(b, float64(v.Y), 'g', -1, 32)
b = append(b, ", "...)
b = strconv.AppendFloat(b, float64(v.Z), 'g', -1, 32)
return string(b)
}
// Copy returns a copy of the value.
func (v Vector3) Copy() PropValue {
return v
} | Vector3.go | 0.930545 | 0.904144 | Vector3.go | starcoder |
package influxql
import (
"encoding/binary"
"errors"
"fmt"
"hash/fnv"
"sort"
"strings"
"time"
)
// DB represents an interface to the underlying storage.
type DB interface {
// Returns a list of series data ids matching a name and tags.
MatchSeries(name string, tags map[string]string) []uint32
// Returns a slice of tag values for a series.
SeriesTagValues(seriesID uint32, keys []string) []string
// Returns the id and data type for a series field.
// Returns id of zero if not a field.
Field(name, field string) (fieldID uint8, typ DataType)
// Returns an iterator given a series data id, field id, & field data type.
CreateIterator(id uint32, fieldID uint8, typ DataType, min, max time.Time, interval time.Duration) Iterator
}
// Planner represents an object for creating execution plans.
type Planner struct {
// The underlying storage that holds series and field meta data.
DB DB
// Returns the current time. Defaults to time.Now().
Now func() time.Time
}
// NewPlanner returns a new instance of Planner.
func NewPlanner(db DB) *Planner {
return &Planner{
DB: db,
Now: time.Now,
}
}
func (p *Planner) Plan(stmt *SelectStatement) (*Executor, error) {
// Create the executor.
e := &Executor{
db: p.DB,
stmt: stmt,
processors: make([]processor, len(stmt.Fields)),
}
// Fold conditional.
now := p.Now()
stmt.Condition = Fold(stmt.Condition, &now)
// Extract the time range.
min, max := TimeRange(stmt.Condition)
if max.IsZero() {
max = now
}
if max.Before(min) {
return nil, fmt.Errorf("invalid time range: %s - %s", min.Format(DateTimeFormat), max.Format(DateTimeFormat))
}
e.min, e.max = min, max
// Determine group by interval.
interval, tags, err := p.normalizeDimensions(stmt.Dimensions)
if err != nil {
return nil, err
}
e.interval, e.tags = interval, tags
// Generate a processor for each field.
for i, f := range stmt.Fields {
p, err := p.planField(e, f)
if err != nil {
return nil, err
}
e.processors[i] = p
}
return e, nil
}
// normalizeDimensions extacts the time interval, if specified.
// Returns all remaining dimensions.
func (p *Planner) normalizeDimensions(dimensions Dimensions) (time.Duration, []string, error) {
// Ignore if there are no dimensions.
if len(dimensions) == 0 {
return 0, nil, nil
}
// If the first dimension is a "time(duration)" then extract the duration.
if call, ok := dimensions[0].Expr.(*Call); ok && strings.ToLower(call.Name) == "time" {
// Make sure there is exactly one argument.
if len(call.Args) != 1 {
return 0, nil, errors.New("time dimension expected one argument")
}
// Ensure the argument is a duration.
lit, ok := call.Args[0].(*DurationLiteral)
if !ok {
return 0, nil, errors.New("time dimension must have one duration argument")
}
return lit.Val, dimensionKeys(dimensions[1:]), nil
}
return 0, dimensionKeys(dimensions), nil
}
// planField returns a processor for field.
func (p *Planner) planField(e *Executor, f *Field) (processor, error) {
return p.planExpr(e, f.Expr)
}
// planExpr returns a processor for an expression.
func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {
switch expr := expr.(type) {
case *VarRef:
panic("TODO")
case *Call:
return p.planCall(e, expr)
case *BinaryExpr:
return p.planBinaryExpr(e, expr)
case *ParenExpr:
return p.planExpr(e, expr.Expr)
case *NumberLiteral:
return newLiteralProcessor(expr.Val), nil
case *StringLiteral:
return newLiteralProcessor(expr.Val), nil
case *BooleanLiteral:
return newLiteralProcessor(expr.Val), nil
case *TimeLiteral:
return newLiteralProcessor(expr.Val), nil
case *DurationLiteral:
return newLiteralProcessor(expr.Val), nil
}
panic("unreachable")
}
// planCall generates a processor for a function call.
func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {
// Ensure there is a single argument.
if len(c.Args) != 1 {
return nil, fmt.Errorf("expected one argument for %s()", c.Name)
}
// Ensure the argument is a variable reference.
ref, ok := c.Args[0].(*VarRef)
if !ok {
return nil, fmt.Errorf("expected field argument in %s()", c.Name)
}
// Extract the substatement for the call.
sub, err := e.stmt.Substatement(ref)
if err != nil {
return nil, err
}
name := sub.Source.(*Measurement).Name
// Extract tags from conditional.
tags := make(map[string]string)
condition, err := p.extractTags(name, sub.Condition, tags)
if err != nil {
return nil, err
}
sub.Condition = condition
// Find field.
fname := strings.TrimPrefix(ref.Val, name+".")
fieldID, typ := e.db.Field(name, fname)
if fieldID == 0 {
return nil, fmt.Errorf("field not found: %s.%s", name, fname)
}
// Generate a reducer for the given function.
r := newReducer(e)
r.stmt = sub
// Retrieve a list of series data ids.
seriesIDs := p.DB.MatchSeries(name, tags)
// Generate mappers for each id.
r.mappers = make([]*mapper, len(seriesIDs))
for i, seriesID := range seriesIDs {
m := newMapper(e, seriesID, fieldID, typ)
m.min, m.max = e.min.UnixNano(), e.max.UnixNano()
m.interval = int64(e.interval)
m.key = append(make([]byte, 8), marshalStrings(p.DB.SeriesTagValues(seriesID, e.tags))...)
r.mappers[i] = m
}
// Set the appropriate reducer function.
switch strings.ToLower(c.Name) {
case "count":
r.fn = reduceSum
for _, m := range r.mappers {
m.fn = mapCount
}
case "sum":
r.fn = reduceSum
for _, m := range r.mappers {
m.fn = mapSum
}
default:
return nil, fmt.Errorf("function not found: %q", c.Name)
}
return r, nil
}
// planBinaryExpr generates a processor for a binary expression.
// A binary expression represents a join operator between two processors.
func (p *Planner) planBinaryExpr(e *Executor, expr *BinaryExpr) (processor, error) {
// Create processor for LHS.
lhs, err := p.planExpr(e, expr.LHS)
if err != nil {
return nil, fmt.Errorf("lhs: %s", err)
}
// Create processor for RHS.
rhs, err := p.planExpr(e, expr.RHS)
if err != nil {
return nil, fmt.Errorf("rhs: %s", err)
}
// Combine processors.
return newBinaryExprEvaluator(e, expr.Op, lhs, rhs), nil
}
// extractTags extracts a tag key/value map from a statement.
// Extracted tags are removed from the statement.
func (p *Planner) extractTags(name string, expr Expr, tags map[string]string) (Expr, error) {
// TODO: Refactor into a walk-like Replace().
switch expr := expr.(type) {
case *BinaryExpr:
// If the LHS is a variable ref then check for tag equality.
if lhs, ok := expr.LHS.(*VarRef); ok && expr.Op == EQ {
return p.extractBinaryExprTags(name, expr, lhs, expr.RHS, tags)
}
// If the RHS is a variable ref then check for tag equality.
if rhs, ok := expr.RHS.(*VarRef); ok && expr.Op == EQ {
return p.extractBinaryExprTags(name, expr, rhs, expr.LHS, tags)
}
// Recursively process LHS.
lhs, err := p.extractTags(name, expr.LHS, tags)
if err != nil {
return nil, err
}
expr.LHS = lhs
// Recursively process RHS.
rhs, err := p.extractTags(name, expr.RHS, tags)
if err != nil {
return nil, err
}
expr.RHS = rhs
return expr, nil
case *ParenExpr:
e, err := p.extractTags(name, expr.Expr, tags)
if err != nil {
return nil, err
}
expr.Expr = e
return expr, nil
default:
return expr, nil
}
}
// extractBinaryExprTags extracts a tag key/value map from a statement.
func (p *Planner) extractBinaryExprTags(name string, expr Expr, ref *VarRef, value Expr, tags map[string]string) (Expr, error) {
// Ignore if the value is not a string literal.
lit, ok := value.(*StringLiteral)
if !ok {
return expr, nil
}
// Extract the key and remove the measurement prefix.
key := strings.TrimPrefix(ref.Val, name+".")
// If tag is already filtered then return error.
if _, ok := tags[key]; ok {
return nil, fmt.Errorf("duplicate tag filter: %s.%s", name, key)
}
// Add tag to the filter.
tags[key] = lit.Val
// Return nil to remove the expression.
return nil, nil
}
// Executor represents the implementation of Executor.
// It executes all reducers and combines their result into a row.
type Executor struct {
db DB // source database
stmt *SelectStatement // original statement
processors []processor // per-field processors
min, max time.Time // time range
interval time.Duration // group by duration
tags []string // group by tag keys
}
// Execute begins execution of the query and returns a channel to receive rows.
func (e *Executor) Execute() (<-chan *Row, error) {
// Initialize processors.
for _, p := range e.processors {
p.start()
}
// Create output channel and stream data in a separate goroutine.
out := make(chan *Row, 0)
go e.execute(out)
return out, nil
}
// execute runs in a separate separate goroutine and streams data from processors.
func (e *Executor) execute(out chan *Row) {
// TODO: Support multi-value rows.
// Initialize map of rows by encoded tagset.
rows := make(map[string]*Row)
// Combine values from each processor.
loop:
for {
// Retrieve values from processors and write them to the approprite
// row based on their tagset.
for i, p := range e.processors {
// Retrieve data from the processor.
m, ok := <-p.C()
if !ok {
break loop
}
// Set values on returned row.
for k, v := range m {
// Extract timestamp and tag values from key.
b := []byte(k)
timestamp := int64(binary.BigEndian.Uint64(b[0:8]))
// Lookup row values and populate data.
values := e.createRowValuesIfNotExists(rows, e.processors[0].name(), b[8:], timestamp)
values[i+1] = v
}
}
}
// Normalize rows and values.
// This converts the timestamps from nanoseconds to microseconds.
a := make(Rows, 0, len(rows))
for _, row := range rows {
for _, values := range row.Values {
values[0] = values[0].(int64) / int64(time.Microsecond)
}
a = append(a, row)
}
sort.Sort(a)
// Send rows to the channel.
for _, row := range a {
out <- row
}
// Mark the end of the output channel.
close(out)
}
// creates a new value set if one does not already exist for a given tagset + timestamp.
func (e *Executor) createRowValuesIfNotExists(rows map[string]*Row, name string, tagset []byte, timestamp int64) []interface{} {
// TODO: Add "name" to lookup key.
// Find row by tagset.
var row *Row
if row = rows[string(tagset)]; row == nil {
row = &Row{Name: name}
// Create tag map.
row.Tags = make(map[string]string)
for i, v := range unmarshalStrings(tagset) {
row.Tags[e.tags[i]] = v
}
// Create column names.
row.Columns = make([]string, 1, len(e.stmt.Fields)+1)
row.Columns[0] = "time"
for i, f := range e.stmt.Fields {
name := f.Name()
if name == "" {
name = fmt.Sprintf("col%d", i)
}
row.Columns = append(row.Columns, name)
}
// Save to lookup.
rows[string(tagset)] = row
}
// If no values exist or last value doesn't match the timestamp then create new.
if len(row.Values) == 0 || row.Values[len(row.Values)-1][0] != timestamp {
values := make([]interface{}, len(e.processors)+1)
values[0] = timestamp
row.Values = append(row.Values, values)
}
return row.Values[len(row.Values)-1]
}
// dimensionKeys returns a list of tag key names for the dimensions.
// Each dimension must be a VarRef.
func dimensionKeys(dimensions Dimensions) (a []string) {
for _, d := range dimensions {
a = append(a, d.Expr.(*VarRef).Val)
}
return
}
// mapper represents an object for processing iterators.
type mapper struct {
executor *Executor // parent executor
seriesID uint32 // series id
fieldID uint8 // field id
typ DataType // field data type
itr Iterator // series iterator
min, max int64 // time range
interval int64 // group by interval
key []byte // encoded timestamp + dimensional values
fn mapFunc // map function
c chan map[string]interface{}
done chan chan struct{}
}
// newMapper returns a new instance of mapper.
func newMapper(e *Executor, seriesID uint32, fieldID uint8, typ DataType) *mapper {
return &mapper{
executor: e,
seriesID: seriesID,
fieldID: fieldID,
typ: typ,
c: make(chan map[string]interface{}, 0),
done: make(chan chan struct{}, 0),
}
}
// start begins processing the iterator.
func (m *mapper) start() {
m.itr = m.executor.db.CreateIterator(m.seriesID, m.fieldID, m.typ,
m.executor.min, m.executor.max, m.executor.interval)
go m.run()
}
// stop stops the mapper.
func (m *mapper) stop() { syncClose(m.done) }
// C returns the streaming data channel.
func (m *mapper) C() <-chan map[string]interface{} { return m.c }
// run executes the map function against the iterator.
func (m *mapper) run() {
for m.itr.NextIterval() {
m.fn(m.itr, m)
}
close(m.c)
}
// emit sends a value to the mapper's output channel.
func (m *mapper) emit(key int64, value interface{}) {
// Encode the timestamp to the beginning of the key.
binary.BigEndian.PutUint64(m.key, uint64(key))
// OPTIMIZE: Collect emit calls and flush all at once.
m.c <- map[string]interface{}{string(m.key): value}
}
// mapFunc represents a function used for mapping iterators.
type mapFunc func(Iterator, *mapper)
// mapCount computes the number of values in an iterator.
func mapCount(itr Iterator, m *mapper) {
n := 0
for k, _ := itr.Next(); k != 0; k, _ = itr.Next() {
n++
}
m.emit(itr.Time(), float64(n))
}
// mapSum computes the summation of values in an iterator.
func mapSum(itr Iterator, m *mapper) {
n := float64(0)
for k, v := itr.Next(); k != 0; k, v = itr.Next() {
n += v.(float64)
}
m.emit(itr.Time(), n)
}
// processor represents an object for joining reducer output.
type processor interface {
start()
stop()
name() string
C() <-chan map[string]interface{}
}
// reducer represents an object for processing mapper output.
// Implements processor.
type reducer struct {
executor *Executor // parent executor
stmt *SelectStatement // substatement
mappers []*mapper // child mappers
fn reduceFunc // reduce function
c chan map[string]interface{}
done chan chan struct{}
}
// newReducer returns a new instance of reducer.
func newReducer(e *Executor) *reducer {
return &reducer{
executor: e,
c: make(chan map[string]interface{}, 0),
done: make(chan chan struct{}, 0),
}
}
// start begins streaming values from the mappers and reducing them.
func (r *reducer) start() {
for _, m := range r.mappers {
m.start()
}
go r.run()
}
// stop stops the reducer.
func (r *reducer) stop() {
for _, m := range r.mappers {
m.stop()
}
syncClose(r.done)
}
// C returns the streaming data channel.
func (r *reducer) C() <-chan map[string]interface{} { return r.c }
// name returns the source name.
func (r *reducer) name() string { return r.stmt.Source.(*Measurement).Name }
// run runs the reducer loop to read mapper output and reduce it.
func (r *reducer) run() {
loop:
for {
// Combine all data from the mappers.
data := make(map[string][]interface{})
for _, m := range r.mappers {
kv, ok := <-m.C()
if !ok {
break loop
}
for k, v := range kv {
data[k] = append(data[k], v)
}
}
// Reduce each key.
for k, v := range data {
r.fn(k, v, r)
}
}
// Mark the channel as complete.
close(r.c)
}
// emit sends a value to the reducer's output channel.
func (r *reducer) emit(key string, value interface{}) {
r.c <- map[string]interface{}{key: value}
}
// reduceFunc represents a function used for reducing mapper output.
type reduceFunc func(string, []interface{}, *reducer)
// reduceSum computes the sum of values for each key.
func reduceSum(key string, values []interface{}, r *reducer) {
var n float64
for _, v := range values {
n += v.(float64)
}
r.emit(key, n)
}
// binaryExprEvaluator represents a processor for combining two processors.
type binaryExprEvaluator struct {
executor *Executor // parent executor
lhs, rhs processor // processors
op Token // operation
c chan map[string]interface{}
done chan chan struct{}
}
// newBinaryExprEvaluator returns a new instance of binaryExprEvaluator.
func newBinaryExprEvaluator(e *Executor, op Token, lhs, rhs processor) *binaryExprEvaluator {
return &binaryExprEvaluator{
executor: e,
op: op,
lhs: lhs,
rhs: rhs,
c: make(chan map[string]interface{}, 0),
done: make(chan chan struct{}, 0),
}
}
// start begins streaming values from the lhs/rhs processors
func (e *binaryExprEvaluator) start() {
e.lhs.start()
e.rhs.start()
go e.run()
}
// stop stops the processor.
func (e *binaryExprEvaluator) stop() {
e.lhs.stop()
e.rhs.stop()
syncClose(e.done)
}
// C returns the streaming data channel.
func (e *binaryExprEvaluator) C() <-chan map[string]interface{} { return e.c }
// name returns the source name.
func (e *binaryExprEvaluator) name() string { return "" }
// run runs the processor loop to read subprocessor output and combine it.
func (e *binaryExprEvaluator) run() {
for {
// Read LHS value.
lhs, ok := <-e.lhs.C()
if !ok {
break
}
// Read RHS value.
rhs, ok := <-e.rhs.C()
if !ok {
break
}
// Merge maps.
m := make(map[string]interface{})
for k, v := range lhs {
m[k] = e.eval(v, rhs[k])
}
for k, v := range rhs {
// Skip value if already processed in lhs loop.
if _, ok := m[k]; ok {
continue
}
m[k] = e.eval(float64(0), v)
}
// Return value.
e.c <- m
}
// Mark the channel as complete.
close(e.c)
}
// eval evaluates two values using the evaluator's operation.
func (e *binaryExprEvaluator) eval(lhs, rhs interface{}) interface{} {
switch e.op {
case ADD:
return lhs.(float64) + rhs.(float64)
case SUB:
return lhs.(float64) - rhs.(float64)
case MUL:
return lhs.(float64) * rhs.(float64)
case DIV:
rhs := rhs.(float64)
if rhs == 0 {
return float64(0)
}
return lhs.(float64) / rhs
default:
// TODO: Validate operation & data types.
panic("invalid operation: " + e.op.String())
}
}
// literalProcessor represents a processor that continually sends a literal value.
type literalProcessor struct {
val interface{}
c chan map[string]interface{}
done chan chan struct{}
}
// newLiteralProcessor returns a literalProcessor for a given value.
func newLiteralProcessor(val interface{}) *literalProcessor {
return &literalProcessor{
val: val,
c: make(chan map[string]interface{}, 0),
done: make(chan chan struct{}, 0),
}
}
// C returns the streaming data channel.
func (p *literalProcessor) C() <-chan map[string]interface{} { return p.c }
// process continually returns a literal value with a "0" key.
func (p *literalProcessor) start() { go p.run() }
// run executes the processor loop.
func (p *literalProcessor) run() {
for {
select {
case ch := <-p.done:
close(ch)
return
case p.c <- map[string]interface{}{"": p.val}:
}
}
}
// stop stops the processor from sending values.
func (p *literalProcessor) stop() { syncClose(p.done) }
// name returns the source name.
func (p *literalProcessor) name() string { return "" }
// syncClose closes a "done" channel and waits for a response.
func syncClose(done chan chan struct{}) {
ch := make(chan struct{}, 0)
done <- ch
<-ch
}
// Iterator represents a forward-only iterator over a set of points.
// The iterator groups points together in interval sets.
type Iterator interface {
// Next returns the next value from the iterator.
Next() (key int64, value interface{})
// NextIterval moves to the next iterval. Returns true unless EOF.
NextIterval() bool
// Time returns start time of the current interval.
Time() int64
// Interval returns the group by duration.
Interval() time.Duration
}
// Row represents a single row returned from the execution of a statement.
type Row struct {
Name string `json:"name,omitempty"`
Tags map[string]string `json:"tags,omitempty"`
Columns []string `json:"columns"`
Values [][]interface{} `json:"values,omitempty"`
Err error `json:"err,omitempty"`
}
// tagsHash returns a hash of tag key/value pairs.
func (r *Row) tagsHash() uint64 {
h := fnv.New64a()
keys := r.tagsKeys()
for _, k := range keys {
h.Write([]byte(k))
h.Write([]byte(r.Tags[k]))
}
return h.Sum64()
}
// tagKeys returns a sorted list of tag keys.
func (r *Row) tagsKeys() []string {
a := make([]string, len(r.Tags))
for k := range r.Tags {
a = append(a, k)
}
sort.Strings(a)
return a
}
// Rows represents a list of rows that can be sorted consistently by name/tag.
type Rows []*Row
func (p Rows) Len() int { return len(p) }
func (p Rows) Less(i, j int) bool {
// Sort by name first.
if p[i].Name != p[j].Name {
return p[i].Name < p[j].Name
}
// Sort by tag set hash. Tags don't have a meaningful sort order so we
// just compute a hash and sort by that instead. This allows the tests
// to receive rows in a predictable order every time.
return p[i].tagsHash() < p[j].tagsHash()
}
func (p Rows) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
// marshalStrings encodes an array of strings into a byte slice.
func marshalStrings(a []string) (ret []byte) {
for _, s := range a {
// Create a slice for len+data
b := make([]byte, 2+len(s))
binary.BigEndian.PutUint16(b[0:2], uint16(len(s)))
copy(b[2:], s)
// Append it to the full byte slice.
ret = append(ret, b...)
}
return
}
// unmarshalStrings decodes a byte slice into an array of strings.
func unmarshalStrings(b []byte) (ret []string) {
for {
// If there's no more data then exit.
if len(b) == 0 {
return
}
// Decode size + data.
n := binary.BigEndian.Uint16(b[0:2])
ret = append(ret, string(b[2:n+2]))
// Move the byte slice forward and retry.
b = b[n+2:]
}
} | influxql/engine.go | 0.715623 | 0.447883 | engine.go | starcoder |
package main
import (
"sort"
"strconv"
"strings"
)
type Pair struct {
key int
value int
}
type PairList []Pair
func (p PairList) Len() int { return len(p) }
func (p PairList) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
func (p PairList) Less(i, j int) bool { return p[j].value < p[i].value } // Less is actually more likely
// FindOptimalPosition finds the optimal position to move all crabs to assuming a cost of 1 fuel cell per move
// This method assumes, based on the fuel cost the optimal solution will be at a position where one set of crabs do not move
// input: a comma seperated list of crab positions.
// Returns the optimal position and the cost.
func FindOptimalPosition(input string) (int, int) {
data := strings.Split(input, ",")
mapping := make(map[int]int, len(data))
for _, v := range data {
x, _ := strconv.Atoi(v)
mapping[x]++
}
values := make(PairList, len(mapping))
i := 0
for k, v := range mapping {
values[i] = Pair{k, v}
i++
}
sort.Sort(values)
bestPos := -1
bestCount := -1
for _, pair := range values {
sum := 0
for _, pair2 := range values {
sum += (Max(pair.key, pair2.key) - Min(pair.key, pair2.key)) * pair2.value
}
if bestCount == -1 || sum < bestCount {
bestCount = sum
bestPos = pair.key
}
}
return bestPos, bestCount
}
// FindOptimalPositionCostly Finds the optimal position to move all crabs to assuming a cost of n+1 per move where n is the number of
// positions already moved. E.g. the first move costs 1, the second 3, the third 6,
// This method assumes the optimal position will be somewhere between the min and max of all starting positions.
// input: a comma seperated list of crab positions.
// Returns the optimal position and the cost.
func FindOptimalPositionCostly(input string) (int, int) {
data := strings.Split(input, ",")
mapping := make(map[int]int, len(data))
minX := -1
maxX := -1
for _, v := range data {
x, _ := strconv.Atoi(v)
if minX == -1 || x < minX {
minX = x
}
if maxX < x {
maxX = x
}
mapping[x]++
}
bestPos := -1
bestCount := -1
for i := minX; i <= maxX; i++ {
sum := 0
for key, value := range mapping {
diff := (Max(i, key) - Min(i, key))
cost := (float32(diff+1) / float32(2)) * float32(diff)
sum += int(cost * float32(value))
}
// println("Cost of ", pair.key, "is", sum)
if bestCount == -1 || sum < bestCount {
bestCount = sum
bestPos = i
}
}
return bestPos, bestCount
} | day7.go | 0.629205 | 0.464051 | day7.go | starcoder |
package raymarcher
import (
"math"
"time"
)
var (
NoPixel = D3{
X: math.Inf(1),
Y: math.Inf(1),
Z: math.Inf(1),
}
)
// Marcher is a ray-marcher which generates a 3D image.
type Marcher struct {
Epsilon float64
MaxSteps int
MaxDepth float64
W int
H int
World SDF
CameraPosition D3
Up D3
Target D3
}
// Pixel is the result of a ray march.
type Pixel struct {
X int
Y int
Position D3
}
// New creates a Marcher with default parameters.
func New() *Marcher {
return &Marcher{
Epsilon: 0.01,
MaxSteps: 5,
MaxDepth: 20,
W: 300,
H: 300,
World: Empty,
CameraPosition: D3{
X: 5,
Y: 0,
Z: 0,
},
Up: D3{0.0, 1.0, 0.0},
Target: D3{0.0, 0.0, 0.0},
}
}
// March calculates the position (and distance) at which a ray collides with
// some geometry. If the ray hits nothing, the distance is positive infinity.
func (m *Marcher) March(origin, r D3) D3 {
var next D3
var distance float64 = 0.0
var totalDistance float64 = 0.0
var steps int = 0
for {
// We hit nothing.
if totalDistance >= m.MaxDepth || steps >= m.MaxSteps {
return NoPixel
}
next = origin.Add(r.Mul(distance))
distance = m.World(next)
totalDistance += distance
// We hit something.
if distance < m.Epsilon {
break
}
steps++
}
return next
}
// RayDirection calculates the direction of ray of light for a given pixel.
func (m *Marcher) RayDirection(x, y int) D3 {
dir := m.Target.Minus(m.CameraPosition).Normalize()
// right := dir.Right()
// up := dir.Up()
right := D3{0, 0, 1} // TODO Don't hardcode :D
up := D3{0, 1, 0}
// Clamp to from -1.0 to 1.0 in local space
mulX := -1.0 + (2.0 * (float64(x) / float64(m.W)))
mulY := -1.0 + (2.0 * (float64(y) / float64(m.H)))
// Map from screen-space to local-space
offsetX := right.Mul(mulX)
offsetY := up.Mul(mulY)
ray := dir
ray = ray.Add(offsetX)
ray = ray.Add(offsetY)
return ray.Normalize()
}
// Pixels produces the march algorithm output for all pixels continually
// until quit.
func (m *Marcher) Pixels(c chan Pixel, tick <-chan time.Time,
quit chan struct{}) {
for {
select {
case <-quit:
break
case <-tick:
for y := 0; y < m.H; y++ {
for x := 0; x < m.W; x++ {
c <- Pixel{
X: x,
Y: y,
Position: m.March(m.CameraPosition,
m.RayDirection(x, y)),
}
}
}
}
}
}
// Empty returns true if a pixel hit nothing.
func (p *Pixel) Empty() bool {
return math.IsInf(p.Position.X, 0)
} | raymarcher/raymarcher.go | 0.667256 | 0.523116 | raymarcher.go | starcoder |
package main
import (
"fmt"
"math"
rl "github.com/gen2brain/raylib-go/raylib"
)
const MAX_INSTANCES = 100000
func main() {
var (
screenWidth = int32(800) // Framebuffer width
screenHeight = int32(450) // Framebuffer height
fps = 60 // Frames per second
speed = 30 // Speed of jump animation
groups = 2 // Count of separate groups jumping around
amp = float32(10) // Maximum amplitude of jump
variance = float32(0.8) // Global variance in jump height
loop = float32(0.0) // Individual cube's computed loop timer
textPositionY int32 = 300
framesCounter = 0
)
rl.SetConfigFlags(rl.FlagMsaa4xHint) // Enable Multi Sampling Anti Aliasing 4x (if available)
rl.InitWindow(screenWidth, screenHeight, "raylib [shaders] example - mesh instancing")
// Define the camera to look into our 3d world
camera := rl.Camera{
Position: rl.NewVector3(-125.0, 125.0, -125.0),
Target: rl.NewVector3(0.0, 0.0, 0.0),
Up: rl.NewVector3(0.0, 1.0, 0.0),
Fovy: 45.0,
Projection: rl.CameraPerspective,
}
cube := rl.GenMeshCube(1.0, 1.0, 1.0)
rotations := make([]rl.Matrix, MAX_INSTANCES) // Rotation state of instances
rotationsInc := make([]rl.Matrix, MAX_INSTANCES) // Per-frame rotation animation of instances
translations := make([]rl.Matrix, MAX_INSTANCES) // Locations of instances
// Scatter random cubes around
for i := 0; i < MAX_INSTANCES; i++ {
x := float32(rl.GetRandomValue(-50, 50))
y := float32(rl.GetRandomValue(-50, 50))
z := float32(rl.GetRandomValue(-50, 50))
translations[i] = rl.MatrixTranslate(x, y, z)
x = float32(rl.GetRandomValue(0, 360))
y = float32(rl.GetRandomValue(0, 360))
z = float32(rl.GetRandomValue(0, 360))
axis := rl.Vector3Normalize(rl.NewVector3(x, y, z))
angle := float32(rl.GetRandomValue(0, 10)) * rl.Deg2rad
rotationsInc[i] = rl.MatrixRotate(axis, angle)
rotations[i] = rl.MatrixIdentity()
}
transforms := make([]rl.Matrix, MAX_INSTANCES)
shader := rl.LoadShader("glsl330/base_lighting_instanced.vs", "glsl330/lighting.fs")
shader.UpdateLocation(rl.LocMatrixMvp, rl.GetShaderLocation(shader, "mvp"))
shader.UpdateLocation(rl.LocVectorView, rl.GetShaderLocation(shader, "viewPos"))
shader.UpdateLocation(rl.LocMatrixModel, rl.GetShaderLocationAttrib(shader, "instanceTransform"))
// ambient light level
ambientLoc := rl.GetShaderLocation(shader, "ambient")
rl.SetShaderValue(shader, ambientLoc, []float32{0.2, 0.2, 0.2, 1.0}, rl.ShaderUniformVec4)
NewLight(LightTypeDirectional, rl.NewVector3(50.0, 50.0, 0.0), rl.Vector3Zero(), rl.White, shader)
material := rl.LoadMaterialDefault()
material.Shader = shader
mmap := material.GetMap(rl.MapDiffuse)
mmap.Color = rl.Red
rl.SetCameraMode(camera, rl.CameraOrbital)
rl.SetTargetFPS(int32(fps))
for !rl.WindowShouldClose() {
// Update
//----------------------------------------------------------------------------------
textPositionY = 300
framesCounter++
if rl.IsKeyDown(rl.KeyUp) {
amp += 0.5
}
if rl.IsKeyDown(rl.KeyDown) {
if amp <= 1 {
amp = 1
} else {
amp -= 1
}
}
if rl.IsKeyDown(rl.KeyLeft) {
if variance < 0 {
variance = 0
} else {
variance -= 0.01
}
}
if rl.IsKeyDown(rl.KeyRight) {
if variance > 1 {
variance = 1
} else {
variance += 0.01
}
}
if rl.IsKeyDown(rl.KeyOne) {
groups = 1
}
if rl.IsKeyDown(rl.KeyTwo) {
groups = 2
}
if rl.IsKeyDown(rl.KeyThree) {
groups = 3
}
if rl.IsKeyDown(rl.KeyFour) {
groups = 4
}
if rl.IsKeyDown(rl.KeyFive) {
groups = 5
}
if rl.IsKeyDown(rl.KeySix) {
groups = 6
}
if rl.IsKeyDown(rl.KeySeven) {
groups = 7
}
if rl.IsKeyDown(rl.KeyEight) {
groups = 8
}
if rl.IsKeyDown(rl.KeyNine) {
groups = 9
}
if rl.IsKeyDown(rl.KeyW) {
groups = 7
amp = 25
speed = 18
variance = float32(0.70)
}
if rl.IsKeyDown(rl.KeyEqual) {
if float32(speed) <= float32(fps)*0.25 {
speed = int(float32(fps) * 0.25)
} else {
speed = int(float32(speed) * 0.95)
}
}
if rl.IsKeyDown(rl.KeyKpAdd) {
if float32(speed) <= float32(fps)*0.25 {
speed = int(float32(fps) * 0.25)
} else {
speed = int(float32(speed) * 0.95)
}
}
if rl.IsKeyDown(rl.KeyMinus) {
speed = int(math.Max(float64(speed)*1.02, float64(speed)+1))
}
if rl.IsKeyDown(rl.KeyKpSubtract) {
speed = int(math.Max(float64(speed)*1.02, float64(speed)+1))
}
// Update the light shader with the camera view position
rl.SetShaderValue(shader, shader.GetLocation(rl.LocVectorView),
[]float32{camera.Position.X, camera.Position.Y, camera.Position.Z}, rl.ShaderUniformVec3)
// Apply per-instance transformations
for i := 0; i < MAX_INSTANCES; i++ {
rotations[i] = rl.MatrixMultiply(rotations[i], rotationsInc[i])
transforms[i] = rl.MatrixMultiply(rotations[i], translations[i])
// Get the animation cycle's framesCounter for this instance
loop = float32((framesCounter+int(float32(i%groups)/float32(groups)*float32(speed)))%speed) / float32(speed)
// Calculate the y according to loop cycle
y := float32(math.Sin(float64(loop)*rl.Pi*2)) * amp *
((1 - variance) + (float32(variance) * float32(i%(groups*10)) / float32(groups*10)))
// Clamp to floor
if y < 0 {
y = 0
}
transforms[i] = rl.MatrixMultiply(transforms[i], rl.MatrixTranslate(0.0, y, 0.0))
}
rl.UpdateCamera(&camera) // Update camera
//----------------------------------------------------------------------------------
// Draw
//----------------------------------------------------------------------------------
rl.BeginDrawing()
{
rl.ClearBackground(rl.RayWhite)
rl.BeginMode3D(camera)
//rl.DrawMesh(cube, material, rl.MatrixIdentity())
rl.DrawMeshInstanced(cube, material, transforms, MAX_INSTANCES)
rl.EndMode3D()
rl.DrawText("A CUBE OF DANCING CUBES!", 490, 10, 20, rl.Maroon)
rl.DrawText("PRESS KEYS:", 10, textPositionY, 20, rl.Black)
textPositionY += 25
rl.DrawText("1 - 9", 10, textPositionY, 10, rl.Black)
rl.DrawText(": Number of groups", 50, textPositionY, 10, rl.Black)
rl.DrawText(fmt.Sprintf(": %d", groups), 160, textPositionY, 10, rl.Black)
textPositionY += 15
rl.DrawText("UP", 10, textPositionY, 10, rl.Black)
rl.DrawText(": increase amplitude", 50, textPositionY, 10, rl.Black)
rl.DrawText(fmt.Sprintf(": %.2f", amp), 160, textPositionY, 10, rl.Black)
textPositionY += 15
rl.DrawText("DOWN", 10, textPositionY, 10, rl.Black)
rl.DrawText(": decrease amplitude", 50, textPositionY, 10, rl.Black)
textPositionY += 15
rl.DrawText("LEFT", 10, textPositionY, 10, rl.Black)
rl.DrawText(": decrease variance", 50, textPositionY, 10, rl.Black)
rl.DrawText(fmt.Sprintf(": %.2f", variance), 160, textPositionY, 10, rl.Black)
textPositionY += 15
rl.DrawText("RIGHT", 10, textPositionY, 10, rl.Black)
rl.DrawText(": increase variance", 50, textPositionY, 10, rl.Black)
textPositionY += 15
rl.DrawText("+/=", 10, textPositionY, 10, rl.Black)
rl.DrawText(": increase speed", 50, textPositionY, 10, rl.Black)
rl.DrawText(fmt.Sprintf(": %d = %f loops/sec", speed, float32(fps)/float32(speed)), 160, textPositionY, 10, rl.Black)
textPositionY += 15
rl.DrawText("-", 10, textPositionY, 10, rl.Black)
rl.DrawText(": decrease speed", 50, textPositionY, 10, rl.Black)
textPositionY += 15
rl.DrawText("W", 10, textPositionY, 10, rl.Black)
rl.DrawText(": Wild setup!", 50, textPositionY, 10, rl.Black)
rl.DrawFPS(10, 10)
}
rl.EndDrawing()
//----------------------------------------------------------------------------------
}
// De-Initialization
//--------------------------------------------------------------------------------------
rl.CloseWindow() // Close window and OpenGL context
//--------------------------------------------------------------------------------------
} | examples/shaders/mesh_instancing/main.go | 0.684897 | 0.438785 | main.go | starcoder |
package treenode
import (
"fmt"
"strconv"
"strings"
)
// TreeNode Definition for a binary tree node.
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
// // 中序遍历
// func MiddleOrder(tn *TreeNode) string {
// if tn.Left != nil {
// MiddleOrder(tn.Left)
// }
// }
/*
Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node's value equals the given value. Return the subtree rooted with that node. If such node doesn't exist, you should return NULL.
For example：
Given the tree:
4
/ \
2 7
/ \
1 3
And the value to search: 2
You should return this subtree:
2
/ \
1 3
In the example above, if we want to search the value 5, since there is no node with value 5, we should return NULL.
Note that an empty tree is represented by NULL, therefore you would see the expected output (serialized tree format) as [], not null.
*/
func searchBST(root *TreeNode, val int) *TreeNode {
if root == nil {
return root
}
if root.Val == val {
return root
}
if root.Val > val {
if root.Left == nil {
return nil
}
return searchBST(root.Left, val)
}
if root.Right == nil {
return nil
}
return searchBST(root.Right, val)
}
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/17/solve-problems-recursively/535/
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its depth = 3.
*/
func maxDepth(root *TreeNode) int {
if root == nil {
return 0
}
if root.Left == nil && root.Right == nil {
return 1
}
ldepth := maxDepth(root.Left)
rdepth := maxDepth(root.Right)
if ldepth > rdepth {
return ldepth + 1
}
return rdepth + 1
}
// GenerateTrees .
/*
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.
Example:
Input: 3
Output:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
Explanation:
The above output corresponds to the 5 unique BST's shown below:
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ \
2 1 2 3
// 插入顺序
// 1,3,2
// 3,2,1
// 3,1,2
// 2,1,3
// 2,3,1 和2,1,3结果一样
// 1,2,3
*/
func GenerateTrees(n int) []*TreeNode {
if n == 0 {
return nil
}
if n == 1 {
return []*TreeNode{&TreeNode{Val: 1}}
}
var allTree []*TreeNode
vals := make([]int, n)
for i := 0; i < n; i++ {
vals[i] = i + 1
}
for i := 0; i < n; i++ {
head := &TreeNode{Val: vals[i]}
allTree = insertTreeArr(allTree, head, vals[:i], vals[i+1:])
}
return allTree
}
func insertTreeArr(allTree []*TreeNode, head *TreeNode, left, right []int) []*TreeNode {
if head == nil {
return allTree
}
if len(left) == 0 && len(right) == 0 {
return allTree
}
if len(left) <= 1 && len(right) <= 1 {
InsertTreeBatch(head, left...)
InsertTreeBatch(head, right...)
allTree = append(allTree, head)
return allTree
}
headTemp := CopyTree(head)
for i, v := range left {
headLeft := CopyTree(headTemp)
InsertTree(headLeft, v)
allTree = insertTreeArr(allTree, headLeft, left[:i], left[i+1:])
}
head = headTemp
for i, v := range right {
headRight := CopyTree(head)
InsertTree(headRight, v)
allTree = insertTreeArr(allTree, headRight, right[:i], right[i+1:])
}
return allTree
}
// InsertTreeBatch . 批量插入元素
func InsertTreeBatch(tree *TreeNode, vals ...int) {
for _, v := range vals {
InsertTree(tree, v)
}
}
// InsertTree . 单个插入元素
func InsertTree(tree *TreeNode, value int) *TreeNode {
if tree == nil {
return tree
}
for tree != nil {
switch {
case tree.Val > value:
if tree.Left == nil {
tree.Left = &TreeNode{
Val: value,
}
return tree.Left
}
tree = tree.Left
case tree.Val < value:
if tree.Right == nil {
tree.Right = &TreeNode{
Val: value,
}
return tree.Right
}
tree = tree.Right
default:
// 相等
return tree
}
}
// 表示已经存在该值
return nil
}
// CopyTree . treenode的复制
func CopyTree(src *TreeNode) *TreeNode {
if src == nil {
return nil
}
dst := &TreeNode{Val: src.Val}
dst.Right = CopyTree(src.Right)
dst.Left = CopyTree(src.Left)
return dst
}
// Copy . treenode的复制
func (tn *TreeNode) Copy() *TreeNode {
if tn == nil {
return nil
}
dst := &TreeNode{Val: tn.Val}
dst.Right = tn.Right.Copy()
dst.Left = tn.Left.Copy()
return dst
}
// IsValidBST .
func IsValidBST(root *TreeNode) bool {
return isValidBST(root)
}
func isValidBST(root *TreeNode) bool {
list := inOrderTree(root, nil)
if len(list) <= 1 {
return true
}
for i := 1; i < len(list); i++ {
if list[i-1].Val >= list[i].Val {
return false
}
}
return true
}
// 中序遍历root
func inOrderTree(root *TreeNode, list []*TreeNode) []*TreeNode {
if root == nil {
return list
}
list = inOrderTree(root.Left, list)
list = append(list, root)
list = inOrderTree(root.Right, list)
return list
}
// leetcode最优解
func isValidBST2(root *TreeNode) bool {
return isValid(root, nil, nil)
}
func isValid(root, l, r *TreeNode) bool {
if root == nil {
return true
}
left, right := true, true
if l != nil {
left = l.Val < root.Val
}
if r != nil {
right = root.Val < r.Val
}
return left && right && isValid(root.Left, l, root) && isValid(root.Right, root, r)
}
// IsSameTree .
/**
Given two binary trees, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
Example 1:
Input: 1 1
/ \ / \
2 3 2 3
[1,2,3], [1,2,3]
Output: true
Example 2:
Input: 1 1
/ \
2 2
[1,2], [1,null,2]
Output: false
Example 3:
Input: 1 1
/ \ / \
2 1 1 2
[1,2,1], [1,1,2]
Output: false
*/
func IsSameTree(p *TreeNode, q *TreeNode) bool {
return isSameTree(p, q)
}
func isSameTree(p *TreeNode, q *TreeNode) bool {
if p != nil && q != nil && p.Val != q.Val {
return false
}
if p == nil && q == nil {
return true
}
if (p == nil && q != nil) || (p != nil && q == nil) {
return false
}
return isSameTree(p.Left, q.Left) && isSameTree(p.Right, q.Right)
}
// InorderTraversal .
/*
# https://leetcode.com/explore/learn/card/recursion-ii/503/recursion-to-iteration/2774/
Given a binary tree, return the inorder traversal of its nodes' values.
Example:
Input: [1,null,2,3]
1
\
2
/
3
Output: [1,3,2]
Follow up: Recursive solution is trivial, could you do it iteratively?
*/
func InorderTraversal(root *TreeNode) []int {
return inorderTraversal(root)
}
func inorderTraversal(root *TreeNode) []int {
return inorderTree(root, nil)
}
func inorderTree(root *TreeNode, vals []int) []int {
if root == nil {
return vals
}
vals = inorderTree(root.Left, vals)
vals = append(vals, root.Val)
vals = inorderTree(root.Right, vals)
return vals
}
// LevelOrder .
/*
# https://leetcode.com/explore/learn/card/recursion-ii/503/recursion-to-iteration/2784/
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
*/
func LevelOrder(root *TreeNode) [][]int {
return levelOrder(root)
}
func levelOrder(root *TreeNode) [][]int {
if root == nil {
return nil
}
vals := [][]int{[]int{root.Val}}
return levelOrderTree(root.Left, root.Right, vals, 1)
}
func levelOrderTree(left, right *TreeNode, vals [][]int, level int) [][]int {
if left == nil && right == nil {
return vals
}
if level >= len(vals) {
vals = append(vals, []int{})
}
if left != nil {
vals[level] = append(vals[level], left.Val)
vals = levelOrderTree(left.Left, left.Right, vals, level+1)
}
if right != nil {
vals[level] = append(vals[level], right.Val)
vals = levelOrderTree(right.Left, right.Right, vals, level+1)
}
return vals
}
// PreorderTraversal .
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/134/traverse-a-tree/928/
Given a binary tree, return the preorder traversal of its nodes' values.
Example:
Input: [1,null,2,3]
1
\
2
/
3
Output: [1,2,3]
Follow up: Recursive solution is trivial, could you do it iteratively?
*/
func PreorderTraversal(root *TreeNode) []int {
return preorderTraversal(root)
}
func preorderTraversal(root *TreeNode) []int {
return preorderTree(root, nil)
}
func preorderTree(root *TreeNode, src []int) []int {
if root == nil {
return src
}
src = append(src, root.Val)
src = preorderTree(root.Left, src)
src = preorderTree(root.Right, src)
return src
}
// PostorderTraversal .
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/134/traverse-a-tree/930/
Given a binary tree, return the postorder traversal of its nodes' values.
Example:
Input: [1,null,2,3]
1
\
2
/
3
Output: [3,2,1]
Follow up: Recursive solution is trivial, could you do it iteratively?
*/
func PostorderTraversal(root *TreeNode) []int {
return postorderTraversal(root)
}
func postorderTraversal(root *TreeNode) []int {
return postorderTree(root, nil)
}
func postorderTree(root *TreeNode, src []int) []int {
if root == nil {
return src
}
src = postorderTree(root.Left, src)
src = postorderTree(root.Right, src)
src = append(src, root.Val)
return src
}
// IsSymmetric .
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/17/solve-problems-recursively/536/
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
1
/ \
2 2
/ \ / \
3 4 4 3
But the following [1,2,2,null,3,null,3] is not:
1
/ \
2 2
\ \
3 3
Follow up: Solve it both recursively and iteratively.
*/
func IsSymmetric(root *TreeNode) bool {
return IsSymmetric(root)
}
func isSymmetric(root *TreeNode) bool {
if root == nil {
return true
}
return isSymmetricTree(root.Left, root.Right)
}
func isSymmetricTree(p *TreeNode, q *TreeNode) bool {
if p != nil && q != nil && p.Val != q.Val {
return false
}
if p == nil && q == nil {
return true
}
if (p == nil && q != nil) || (p != nil && q == nil) {
return false
}
return isSymmetricTree(p.Left, q.Right) && isSymmetricTree(p.Right, q.Left)
}
// HasPathSum .
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/17/solve-problems-recursively/537/
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
Note: A leaf is a node with no children.
Example:
Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ \
7 2 1
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.
*/
func HasPathSum(root *TreeNode, sum int) bool {
return hasPathSum(root, sum)
}
func hasPathSum(root *TreeNode, sum int) bool {
return hasPathSumTree(root, sum, 0)
}
func hasPathSumTree(root *TreeNode, sumTarget, sumNow int) bool {
if root == nil {
return false
}
sumNow += root.Val
// 必须是叶子节点
if sumNow == sumTarget && root.Left == nil && root.Right == nil {
return true
}
return hasPathSumTree(root.Left, sumTarget, sumNow) || hasPathSumTree(root.Right, sumTarget, sumNow)
}
// BuildTreeInPost .
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/133/conclusion/942/
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
For example, given
inorder = [9,3,15,20,7]
postorder = [9,15,7,20,3]
Return the following binary tree:
3
/ \
9 20
/ \
15 7
*/
func BuildTreeInPost(inorder []int, postorder []int) *TreeNode {
return buildTreeInPost(inorder, postorder)
}
func buildTreeInPost(inorder []int, postorder []int) *TreeNode {
if len(inorder) == 0 {
return nil
}
var root *TreeNode
postPos := len(postorder) - 1
root = &TreeNode{Val: postorder[postPos]}
for inPos := 0; inPos < len(inorder); inPos++ {
if postorder[postPos] == inorder[inPos] {
// inorder中inPos左边是左子树
root.Left = buildTreeInPost(inorder[:inPos], postorder[:inPos])
// inorder中inPos右边是右子树
root.Right = buildTreeInPost(inorder[inPos+1:], postorder[inPos:postPos])
// 找到了就退出此次循环
break
}
}
return root
}
// BuildTreePreIn .
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/133/conclusion/943/
Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
For example, given
preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
Return the following binary tree:
3
/ \
9 20
/ \
15 7
*/
func BuildTreePreIn(preorder []int, inorder []int) *TreeNode {
return buildTreePreIn(preorder, inorder)
}
func buildTreePreIn(preorder []int, inorder []int) *TreeNode {
if len(inorder) == 0 {
return nil
}
var root *TreeNode
prePos := 0
root = &TreeNode{Val: preorder[prePos]}
for inPos := 0; inPos < len(inorder); inPos++ {
if preorder[prePos] == inorder[inPos] {
// inorder中inPos左边是左子树
root.Left = buildTreePreIn(preorder[prePos+1:inPos+1], inorder[:inPos])
// inorder中inPos右边是右子树
root.Right = buildTreePreIn(preorder[inPos+1:], inorder[inPos+1:])
// 找到了就退出此次循环
break
}
}
return root
}
// LowestCommonAncestor .
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/133/conclusion/932/
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
Given the following binary tree: root = [3,5,1,6,2,0,8,null,null,7,4]
3
/ \
/ \
5 1
/ \ / \
6 2 0 8
/ \
7 4
Example 1:
Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
Output: 3
Explanation: The LCA of nodes 5 and 1 is 3.
Example 2:
Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
Output: 5
Explanation: The LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.
Note:
All of the nodes' values will be unique.
p and q are different and both values will exist in the binary tree.
*/
func LowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
return lowestCommonAncestor(root, p, q)
}
func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
// 查看p是否包含q
if isContain := contain(p, q); isContain {
return p
}
// 查看q是否包含p
if isContain := contain(q, p); isContain {
return q
}
// 寻找p的父节点集合
pHead := p
var pHeads []*TreeNode
for pHead != root {
pHead = findHead(root, root, pHead)
pHeads = append(pHeads, pHead)
}
// 寻找q的父节点集合
qHead := q
var qHeads []*TreeNode
for qHead != root {
qHead = findHead(root, root, qHead)
qHeads = append(qHeads, qHead)
}
// 倒序找出最小公共父节点
var minLen int = len(pHeads)
if len(pHeads) > len(qHeads) {
minLen = len(qHeads)
}
for i := 0; i < minLen; i++ {
if pHeads[len(pHeads)-1-i] != qHeads[len(qHeads)-1-i] {
return pHeads[len(pHeads)-1-i+1]
}
}
if len(pHeads) > len(qHeads) {
return qHeads[0]
}
return pHeads[0]
}
func contain(p, q *TreeNode) bool {
if p == nil {
return false
}
if p.Val == q.Val {
return true
}
return contain(p.Left, q) || contain(p.Right, q)
}
func findHead(parent, tree, target *TreeNode) *TreeNode {
if !contain(tree, target) {
return nil
}
if tree.Val == target.Val {
return parent
}
if r := findHead(tree, tree.Left, target); r != nil {
return r
}
return findHead(tree, tree.Right, target)
}
/*Leetcode上的一个优解*/
func findLCA(root, p, q *TreeNode) *TreeNode {
if root == nil || root == p || root == q {
return root
}
// 分别找到p,q在左右子树中的位置，为l,r
l, r := findLCA(root.Left, p, q), findLCA(root.Right, p, q)
// 分别位于两边子树
if l != nil && r != nil {
return root
}
// 均位于左子树
if l != nil {
return l
}
// 均位于右子树
return r
}
/*
# https://leetcode.com/explore/learn/card/data-structure-tree/133/conclusion/995/
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
Example:
You may serialize the following tree:
1
/ \
2 3
/ \
4 5
as "[1,2,3,null,null,4,5]"
Clarification: The above format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.
*/
// 思路：值（左子树（左子树，右子树），右子树（左子树，右子树））
/*
1
/ \
2 3
/ \ / \
4 5 6 7
// Serialize1: 1(2,3(4,5))
// Serialize2: 1(2(4,5),3(6,7))
*/
// Codec .
type Codec struct {
nodeSplit string // 节点分割符
leftSplit string // 与rightSplit配对
rightSplit string // 与leftSplit配对
}
// Constructor .
func Constructor() Codec {
return Codec{nodeSplit: ",", leftSplit: "(", rightSplit: ")"}
}
// Serialize . a tree to a single string.
func (this *Codec) Serialize(root *TreeNode) string {
return this.serialize(root)
}
func (this *Codec) serialize(root *TreeNode) string {
if root == nil {
return ""
}
leftStr := this.serialize(root.Left)
rightStr := this.serialize(root.Right)
var nodeStr string
switch {
case leftStr == "" && rightStr == "":
nodeStr = fmt.Sprintf("%d", root.Val)
case leftStr != "" && rightStr == "":
nodeStr = fmt.Sprintf("%d%s%s%s%s", root.Val, this.leftSplit, leftStr, this.nodeSplit, this.rightSplit)
case leftStr == "" && rightStr != "":
nodeStr = fmt.Sprintf("%d%s%s%s%s", root.Val, this.leftSplit, this.nodeSplit, rightStr, this.rightSplit)
default:
nodeStr = fmt.Sprintf("%d%s%s%s%s%s", root.Val, this.leftSplit, leftStr, this.nodeSplit, rightStr, this.rightSplit)
}
return nodeStr
}
// Deserializes your encoded data to tree.
func (this *Codec) Deserialize(data string) *TreeNode {
return this.deserialize(data)
}
func (this *Codec) deserialize(data string) *TreeNode {
if data == "" {
return nil
}
val, err := strconv.Atoi(data)
if err == nil {
return &TreeNode{Val: val}
}
// 寻找第一个leftSplit
firstSplit := strings.Index(data, this.leftSplit)
if firstSplit < 0 {
return nil
}
subStr := data[firstSplit+1 : len(data)-1]
// 寻找分割点povit
var povit, splitCount int
for i, v := range subStr {
if string(v) == this.nodeSplit && splitCount == 0 {
povit = i
break
}
if string(v) == this.leftSplit {
splitCount++
continue
}
if string(v) == this.rightSplit {
splitCount--
if splitCount == 0 {
if i == len(subStr)-1 {
povit = i
} else {
povit = i + 1
}
break
}
}
}
// 提取出head值，并解析左子树和右子树
val, err = strconv.Atoi(data[:firstSplit])
if err != nil {
panic("not standard string")
}
root := &TreeNode{Val: val}
leftNode, rightNode := subStr[:povit], subStr[povit+1:]
root.Left = this.deserialize(leftNode)
root.Right = this.deserialize(rightNode)
return root
}
/*
# https://leetcode.com/explore/interview/card/top-interview-questions-medium/108/trees-and-graphs/787/
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its zigzag level order traversal as:
[
[3],
[20,9],
[15,7]
]
*/
func ZigzagLevelOrder(root *TreeNode) [][]int {
return zigzagLevelOrder(root)
}
func zigzagLevelOrder(root *TreeNode) [][]int {
return zigzagLevelOrderImpl(root, 0, nil)
}
func zigzagLevelOrderImpl(root *TreeNode, level int, result [][]int) [][]int {
if root == nil {
return result
}
if len(result) > level {
if level%2 != 0 {
result[level] = append([]int{root.Val}, result[level]...)
} else {
result[level] = append(result[level], root.Val)
}
} else {
result = append(result, []int{root.Val})
}
result = zigzagLevelOrderImpl(root.Left, level+1, result)
result = zigzagLevelOrderImpl(root.Right, level+1, result)
return result
} | treenode/node.go | 0.618665 | 0.544256 | node.go | starcoder |
package imageutil
import (
"image"
"runtime"
"sync"
)
// RP is a rectangle processor, any function that accepts a single
// image.Rectangle value as an argument.
type RP func(image.Rectangle)
// PP is a point processor, any function that accepts a single image.Point
// value as an argument.
type PP func(image.Point)
// noopRP is an RP that does nothing. It's defined as a variable to allow for
// compairability.
var (
noopRP = func(image.Rectangle) {}
)
// ConcurrentRP wraps a given RP in a Go routine and the necessary WaitGroup
// operations to ensure that completion can be tracked.
func ConcurrentRP(w *sync.WaitGroup, rp RP) RP {
return func(rect image.Rectangle) {
w.Add(1)
go func() {
rp(rect)
w.Done()
}()
}
}
// PointsRP returns a RP that runs a given PP at each point within an input
// rectangle starting at a given offset and seperated by the
// given horizontal and vertical stride.
func PointsRP(offset image.Point, strideH, strideV int, pp PP) RP {
if strideH <= 0 || strideV <= 0 || offset.X < 0 || offset.Y < 0 {
return noopRP
}
return func(rect image.Rectangle) {
origin := rect.Min.Add(offset)
for y := origin.Y; y < rect.Max.Y; y += strideH {
for x := origin.X; x < rect.Max.X; x += strideV {
pp(image.Pt(x, y))
}
}
}
}
// AllPointsRP returns a RP that runs a given PP at every point within an
// input rectangle.
func AllPointsRP(pp PP) RP {
return PointsRP(image.Pt(0, 0), 1, 1, pp)
}
// RowsRP returns a RP that devides an input rectangle into rows of a given
// hight and calls the provided RP on each. The last row proccessed will be
// any remainder and may not be of the given height.
func RowsRP(height int, rp RP) RP {
if height <= 0 {
return noopRP
}
return func(rect image.Rectangle) {
// Process all but the last row.
y := rect.Min.Y
for ; y < rect.Max.Y-height; y += height {
rp(image.Rect(rect.Min.X, y, rect.Max.X, y+height))
}
// Process the last row.
rp(image.Rect(rect.Min.X, y, rect.Max.X, rect.Max.Y))
}
}
// ColumnsRP returns a RP that devides an input rectangle into columns of a
// given width and calls the provided RP on each. The last column proccessed
// will be any remainder and may not be of the given width.
func ColumnsRP(width int, rp RP) RP {
// If the specified column width is zero, there's nothing to do.
if width <= 0 {
return noopRP
}
return func(rect image.Rectangle) {
// Process all but the last column.
x := rect.Min.X
for ; x < rect.Max.X-width; x += width {
rp(image.Rect(x, rect.Min.Y, x+width, rect.Max.Y))
}
// Process the last column.
rp(image.Rect(x, rect.Min.Y, rect.Max.X, rect.Max.Y))
}
}
// NRowsRP calls the given RP on each of n horizontal rectangles that span the
// input rectangle.
func NRowsRP(n int, rp RP) RP {
if n <= 0 {
return noopRP
}
return func(rect image.Rectangle) {
height := (rect.Dy() + n - 1) / n
RowsRP(height, rp)(rect)
}
}
// NColumnsRP calls the given RP on each of n vertical rectangles that span the
// input rectangle.
func NColumnsRP(n int, rp RP) RP {
if n <= 0 {
return noopRP
}
return func(rect image.Rectangle) {
width := (rect.Dx() + n - 1) / n
ColumnsRP(width, rp)(rect)
}
}
// NRectanglesRP calls the given RP on each of n horizontal or vertical
// rectangles that span the input rectangle.
func NRectanglesRP(n int, rp RP) RP {
if n <= 0 {
return noopRP
}
return func(rect image.Rectangle) {
if rect.Dx() > rect.Dy() {
NColumnsRP(n, rp)(rect)
} else {
NRowsRP(n, rp)(rect)
}
}
}
// QuickRowsRP calls the given RP concurrently on each of GOMAXPROCS
// horizontal rectangles that span the input rectangle.
func QuickRowsRP(rp RP) RP {
gomaxprocs := runtime.GOMAXPROCS(-1)
if gomaxprocs == 1 {
return rp
}
return func(rect image.Rectangle) {
// Create a new wait group and defer the wait.
var w sync.WaitGroup
defer w.Wait()
// Wrap the processor with an asynchronous processor.
rp = ConcurrentRP(&w, rp)
// Wrap the processor with a set count rows processor.
rp = NRowsRP(gomaxprocs, rp)
// Call the processor on the entire bounds.
rp(rect)
}
}
// QuickColumnsRP calls the given RP concurrently on each of GOMAXPROCS
// vertical rectangles that span the input rectangle.
func QuickColumnsRP(rp RP) RP {
gomaxprocs := runtime.GOMAXPROCS(-1)
if gomaxprocs == 1 {
return rp
}
return func(rect image.Rectangle) {
// Create a new wait group and defer the wait.
var w sync.WaitGroup
defer w.Wait()
// Wrap the processor with an asynchronous processor.
rp = ConcurrentRP(&w, rp)
// Wrap the processor with a set count columns processor.
rp = NColumnsRP(gomaxprocs, rp)
// Call the processor on the entire bounds.
rp(rect)
}
}
// QuickRP calls the given RP concurrently on each of GOMAXPROCS horizontal or
// vertical rectangles that span the input rectangle.
func QuickRP(rp RP) RP {
return func(rect image.Rectangle) {
if rect.Dx() > rect.Dy() {
QuickColumnsRP(rp)(rect)
} else {
QuickRowsRP(rp)(rect)
}
}
} | rectangle.go | 0.827863 | 0.693259 | rectangle.go | starcoder |
package machine
// ExecuteInstruction ...
func ExecuteInstruction(computer Machine, instructionInstance Instruction) {
switch instructionInstance.Opcode {
case LoadConstantOpcode:
constant := instructionInstance.Parameters[0]
registerIndex := instructionInstance.Parameters[1]
computer.Registers[registerIndex] = constant
case LoadMemoryOpcode:
memoryIndex := instructionInstance.Parameters[0]
registerIndex := instructionInstance.Parameters[1]
computer.Registers[registerIndex] = computer.Memory[memoryIndex]
case StoreConstantOpcode:
constant := instructionInstance.Parameters[0]
memoryIndex := instructionInstance.Parameters[1]
computer.Memory[memoryIndex] = constant
case StoreMemoryOpcode:
registerIndex := instructionInstance.Parameters[0]
memoryIndex := instructionInstance.Parameters[1]
computer.Memory[memoryIndex] = computer.Registers[registerIndex]
case AdditionOpcode, SubtractionOpcode,
MultiplicationOpcode, DivisionOpcode, ModuloOpcode:
leftRegisterIndex := instructionInstance.Parameters[0]
leftOperand := computer.Registers[leftRegisterIndex]
rightRegisterIndex := instructionInstance.Parameters[1]
rightOperand := computer.Registers[rightRegisterIndex]
result := 0
switch instructionInstance.Opcode {
case AdditionOpcode:
result = leftOperand + rightOperand
case SubtractionOpcode:
result = leftOperand - rightOperand
case MultiplicationOpcode:
result = leftOperand * rightOperand
case DivisionOpcode:
result = leftOperand / rightOperand
case ModuloOpcode:
result = leftOperand % rightOperand
}
resultRegisterIndex := instructionInstance.Parameters[2]
computer.Registers[resultRegisterIndex] = result
case JumpOpcode:
ExecuteJumpInstruction(computer, instructionInstance, 0)
case JumpIfNegativeOpcode, JumpIfZeroOpcode, JumpIfPositiveOpcode:
registerIndex := instructionInstance.Parameters[0]
operand := computer.Registers[registerIndex]
isSuccessful := false
switch instructionInstance.Opcode {
case JumpIfNegativeOpcode:
isSuccessful = operand < 0
case JumpIfZeroOpcode:
isSuccessful = operand == 0
case JumpIfPositiveOpcode:
isSuccessful = operand > 0
}
if isSuccessful {
ExecuteJumpInstruction(computer, instructionInstance, 1)
}
}
}
// ExecuteJumpInstruction ...
func ExecuteJumpInstruction(
computer Machine,
instructionInstance Instruction,
addressParameterIndex int,
) {
nextIPRegisterValue := instructionInstance.Parameters[addressParameterIndex]
// subtract the instruction length to compensate for increasing
// the instruction pointer register in the ExecuteMachine function
nextIPRegisterValue = nextIPRegisterValue - instructionInstance.Len()
computer.SetIPRegisterValue(nextIPRegisterValue)
} | execute_instruction.go | 0.604049 | 0.446555 | execute_instruction.go | starcoder |
package gafit
import (
"fmt"
"math"
"strings"
"gonum.org/v1/gonum/mat"
)
// Dataset is a type that represents a linear model
type Dataset struct {
X *mat.Dense
Y *mat.VecDense
// ColNames gives the name of the "feature" stored in each column of X
ColNames []string
TargetName string
}
// Copy returns a copy of the dataset
func (data Dataset) Copy() Dataset {
var X *mat.Dense
var Y *mat.VecDense
if data.X != nil {
X = mat.DenseCopyOf(data.X)
}
if data.Y != nil {
Y = mat.VecDenseCopyOf(data.Y)
}
names := make([]string, len(data.ColNames))
copy(names, data.ColNames)
return Dataset{
X: X,
Y: Y,
TargetName: data.TargetName,
ColNames: names,
}
}
// IsEqual returns true if the two dataseta are equal
func (data Dataset) IsEqual(other Dataset) bool {
tol := 1e-6
return matrixEqual(data.X, other.X, tol) &&
vectorEqual(data.Y, other.Y, tol) &&
allEqualString(data.ColNames, other.ColNames)
}
// NumFeatures return the number of features
func (data Dataset) NumFeatures() int {
_, c := data.X.Dims()
return c
}
// NumData returns the number of datapoints
func (data Dataset) NumData() int {
r, _ := data.X.Dims()
return r
}
// IncludedFeatures returns the features being included according to the
// passed indicator. 1: feature is included, 0: feature is not included
func (data Dataset) IncludedFeatures(indicator []int) []string {
names := []string{}
for i := range indicator {
if indicator[i] == 1 {
names = append(names, data.ColNames[i])
}
}
return names
}
// Submatrix returns a submatrix corresponding to columns given
func (data Dataset) Submatrix(names []string) *mat.Dense {
idxMap := make(map[string]int)
for i, n := range data.ColNames {
idxMap[n] = i
}
// Check that all names exist
for _, n := range names {
if _, ok := idxMap[n]; !ok {
msg := fmt.Sprintf("Name %s is not a feature in this dataset\n", n)
panic(msg)
}
}
S := mat.NewDense(data.NumData(), len(names), nil)
for i, n := range names {
for j := 0; j < data.NumData(); j++ {
S.Set(j, i, data.X.At(j, idxMap[n]))
}
}
return S
}
// Dot perform dot product between X and a sparse coefficient vector
// given as a map of strings, where the key is a column name
func (data Dataset) Dot(coeff map[string]float64) *mat.VecDense {
coeffVec := mat.NewVecDense(data.NumFeatures(), nil)
for i, key := range data.ColNames {
if v, ok := coeff[key]; ok {
coeffVec.SetVec(i, v)
}
}
res := mat.NewVecDense(data.NumData(), nil)
res.MulVec(data.X, coeffVec)
return res
}
// Columns return the column numbers of all features where <pattern> is part of the name
func (data Dataset) Columns(pattern string) []int {
cols := []int{}
for i, c := range data.ColNames {
if strings.Contains(c, pattern) {
cols = append(cols, i)
}
}
return cols
}
// AddPoly return a new dataset where polynomial versions of the passed columns are inserted
func AddPoly(cols []int, data Dataset, order int) Dataset {
if order < 2 {
return data
}
numExtraCols := (order - 1) * len(cols)
dataCpy := data.Copy()
rows, origNumCols := dataCpy.X.Dims()
Xnew := dataCpy.X.Grow(0, numExtraCols).(*mat.Dense)
col := origNumCols
for _, c := range cols {
for power := 2; power < order+1; power++ {
for row := 0; row < rows; row++ {
Xnew.Set(row, col, math.Pow(Xnew.At(row, c), float64(power)))
}
name := fmt.Sprintf("%sp%d", data.ColNames[c], power)
dataCpy.ColNames = append(dataCpy.ColNames, name)
col++
}
}
dataCpy.X = Xnew
return dataCpy
} | gafit/dataset.go | 0.729231 | 0.581541 | dataset.go | starcoder |
package h231
// Row of data table.
type Row struct {
ID string
Description string
Comment string
}
// Table of data.
type Table struct {
ID string
Name string
Row []Row
}
// TableLookup provides valid values for field types.
var TableLookup = map[string]Table{
`0001`: {ID: `0001`, Name: `Sex`, Row: []Row{
{ID: `F`, Description: `Female`},
{ID: `M`, Description: `Male`},
{ID: `O`, Description: `Other`},
{ID: `U`, Description: `Unknown`}}},
`0002`: {ID: `0002`, Name: `Marital status`, Row: []Row{
{ID: `A`, Description: `Separated`},
{ID: `D`, Description: `Divorced`},
{ID: `M`, Description: `Married`},
{ID: `S`, Description: `Single`},
{ID: `W`, Description: `Widowed`}}},
`0003`: {ID: `0003`, Name: `Event type`, Row: []Row{
{ID: `A01`, Description: `ADT/ACK - Admit/visit notification`},
{ID: `A02`, Description: `ADT/ACK - Transfer a patient`},
{ID: `A03`, Description: `ADT/ACK - Discharge/end visit`},
{ID: `A04`, Description: `ADT/ACK - Register a patient`},
{ID: `A05`, Description: `ADT/ACK - Pre-admit a patient`},
{ID: `A06`, Description: `ADT/ACK - Change an outpatient to an inpatient`},
{ID: `A07`, Description: `ADT/ACK - Change an inpatient to an outpatient`},
{ID: `A08`, Description: `ADT/ACK - Update patient information`},
{ID: `A09`, Description: `ADT/ACK - Patient departing - tracking`},
{ID: `A10`, Description: `ADT/ACK - Patient arriving - tracking`},
{ID: `A11`, Description: `ADT/ACK - Cancel admit/visit notification`},
{ID: `A12`, Description: `ADT/ACK - Cancel transfer`},
{ID: `A13`, Description: `ADT/ACK - Cancel discharge/end visit`},
{ID: `A14`, Description: `ADT/ACK - Pending admit`},
{ID: `A15`, Description: `ADT/ACK - Pending transfer`},
{ID: `A16`, Description: `ADT/ACK - Pending discharge`},
{ID: `A17`, Description: `ADT/ACK - Swap patients`},
{ID: `A18`, Description: `ADT/ACK - Merge patient information`},
{ID: `A19`, Description: `QRY/ADR - Patient query`},
{ID: `A20`, Description: `ADT/ACK - Bed status update`},
{ID: `A21`, Description: `ADT/ACK - Patient goes on a leave of absence`},
{ID: `A22`, Description: `ADT/ACK - Patient returns from a leave of absence`},
{ID: `A23`, Description: `ADT/ACK - Delete a patient record`},
{ID: `A24`, Description: `ADT/ACK - Link patient information`},
{ID: `A25`, Description: `ADT/ACK - Cancel pending discharge`},
{ID: `A26`, Description: `ADT/ACK - Cancel pending transfer`},
{ID: `A27`, Description: `ADT/ACK - Cancel pending admit`},
{ID: `A28`, Description: `ADT/ACK - Add person information`},
{ID: `A29`, Description: `ADT/ACK - Delete person information`},
{ID: `A30`, Description: `ADT/ACK - Merge person information`},
{ID: `A31`, Description: `ADT/ACK - Update person information`},
{ID: `A32`, Description: `ADT/ACK - Cancel patient arriving - tracking`},
{ID: `A33`, Description: `ADT/ACK - Cancel patient departing - tracking`},
{ID: `A34`, Description: `ADT/ACK - Merge patient information - patient ID only`},
{ID: `A35`, Description: `ADT/ACK - Merge patient information - account number only`},
{ID: `A36`, Description: `ADT/ACK - Merge patient information - patient ID and account number`},
{ID: `A37`, Description: `ADT/ACK - Unlink patient information`},
{ID: `A38`, Description: `ADT/ACK - Cancel pre-admit`},
{ID: `A39`, Description: `ADT/ACK - Merge person- patient ID`},
{ID: `A40`, Description: `ADT/ACK - Merge patient - patient identifier list`},
{ID: `A41`, Description: `ADT/ACK - Merge account - patient account number`},
{ID: `A42`, Description: `ADT/ACK - Merge visit - visit number`},
{ID: `A43`, Description: `ADT/ACK - Move patient information - patient identifier list`},
{ID: `A44`, Description: `ADT/ACK - Move account information - patient account number`},
{ID: `A45`, Description: `ADT/ACK - Move visit information - visit number`},
{ID: `A46`, Description: `ADT/ACK - Change patient ID`},
{ID: `A47`, Description: `ADT/ACK - Change patient identifier list`},
{ID: `A48`, Description: `ADT/ACK - Change alternate patient ID`},
{ID: `A49`, Description: `ADT/ACK - Change patient account number`},
{ID: `A50`, Description: `ADT/ACK - Change visit number`},
{ID: `A51`, Description: `ADT/ACK - Change alternate visit ID`},
{ID: `C01`, Description: `CRM - Register a patient on a clinical trial`},
{ID: `C02`, Description: `CRM - Cancel a patient registration on clinical trial (for clerical mistakes only)`},
{ID: `C03`, Description: `CRM - Correct/update registration information`},
{ID: `C04`, Description: `CRM - Patient has gone off a clinical trial`},
{ID: `C05`, Description: `CRM - Patient enters phase of clinical trial`},
{ID: `C06`, Description: `CRM - Cancel patient entering a phase (clerical mistake)`},
{ID: `C07`, Description: `CRM - Correct/update phase information`},
{ID: `C08`, Description: `CRM - Patient has gone off phase of clinical trial`},
{ID: `C09`, Description: `CSU - Automated time intervals for reporting, like monthly`},
{ID: `C10`, Description: `CSU - Patient completes the clinical trial`},
{ID: `C11`, Description: `CSU - Patient completes a phase of the clinical trial`},
{ID: `C12`, Description: `CSU - Update/correction of patient order/result information`},
{ID: `CNQ`, Description: `QRY/EQQ/SPQ/VQQ/RQQ - Cancel query`},
{ID: `I01`, Description: `RQI/RPI - Request for insurance information`},
{ID: `I02`, Description: `RQI/RPL - Request/receipt of patient selection display list`},
{ID: `I03`, Description: `RQI/RPR - Request/receipt of patient selection list`},
{ID: `I04`, Description: `RQD/RPI - Request for patient demographic data`},
{ID: `I05`, Description: `RQC/RCI - Request for patient clinical information`},
{ID: `I06`, Description: `RQC/RCL - Request/receipt of clinical data listing`},
{ID: `I07`, Description: `PIN/ACK - Unsolicited insurance information`},
{ID: `I08`, Description: `RQA/RPA - Request for treatment authorization information`},
{ID: `I09`, Description: `RQA/RPA - Request for modification to an authorization`},
{ID: `I10`, Description: `RQA/RPA - Request for resubmission of an authorization`},
{ID: `I11`, Description: `RQA/RPA - Request for cancellation of an authorization`},
{ID: `I12`, Description: `REF/RRI - Patient referral`},
{ID: `I13`, Description: `REF/RRI - Modify patient referral`},
{ID: `I14`, Description: `REF/RRI - Cancel patient referral`},
{ID: `I15`, Description: `REF/RRI - Request patient referral status`},
{ID: `M01`, Description: `MFN/MFK - Master file not otherwise specified (for backward compatibility only)`},
{ID: `M02`, Description: `MFN/MFK - Master file - staff practitioner`},
{ID: `M03`, Description: `MFN/MFK - Master file - test/observation (for backward compatibility only) `},
{ID: `M04`, Description: `MFN/MFK - Master files charge description`},
{ID: `M05`, Description: `MFN/MFK - Patient location master file`},
{ID: `M06`, Description: `MFN/MFK - Clinical study with phases and schedules master file`},
{ID: `M07`, Description: `MFN/MFK - Clinical study without phases but with schedules master file`},
{ID: `M08`, Description: `MFN/MFK - Test/observation (numeric) master file`},
{ID: `M09`, Description: `MFN/MFK - Test/observation (categorical) master file`},
{ID: `M10`, Description: `MFN/MFK - Test /observation batteries master file`},
{ID: `M11`, Description: `MFN/MFK - Test/calculated observations master file`},
{ID: `O01`, Description: `ORM - Order message (also RDE, RDS, RGV, RAS)`},
{ID: `O02`, Description: `ORR - Order response (also RRE, RRD, RRG, RRA)`},
{ID: `P01`, Description: `BAR/ACK - Add patient accounts`},
{ID: `P02`, Description: `BAR/ACK - Purge patient accounts`},
{ID: `P03`, Description: `DFT/ACK - Post detail financial transaction`},
{ID: `P04`, Description: `QRY/DSP - Generate bill and A/R statements`},
{ID: `P05`, Description: `BAR/ACK - Update account`},
{ID: `P06`, Description: `BAR/ACK - End account`},
{ID: `P07`, Description: `PEX - Unsolicited initial individual product experience report`},
{ID: `P08`, Description: `PEX - Unsolicited update individual product experience report`},
{ID: `P09`, Description: `SUR - Summary product experience report`},
{ID: `PC1`, Description: `PPR - PC/ problem add`},
{ID: `PC2`, Description: `PPR - PC/ problem update`},
{ID: `PC3`, Description: `PPR - PC/ problem delete`},
{ID: `PC4`, Description: `QRY - PC/ problem query`},
{ID: `PC5`, Description: `PRR - PC/ problem response`},
{ID: `PC6`, Description: `PGL - PC/ goal add`},
{ID: `PC7`, Description: `PGL - PC/ goal update`},
{ID: `PC8`, Description: `PGL - PC/ goal delete`},
{ID: `PC9`, Description: `QRY - PC/ goal query`},
{ID: `PCA`, Description: `PPV - PC/ goal response`},
{ID: `PCB`, Description: `PPP - PC/ pathway (problem-oriented) add`},
{ID: `PCC`, Description: `PPP - PC/ pathway (problem-oriented) update`},
{ID: `PCD`, Description: `PPP - PC/ pathway (problem-oriented) delete`},
{ID: `PCE`, Description: `QRY - PC/ pathway (problem-oriented) query`},
{ID: `PCF`, Description: `PTR - PC/ pathway (problem-oriented) query response`},
{ID: `PCG`, Description: `PPG - PC/ pathway (goal-oriented) add`},
{ID: `PCH`, Description: `PPG - PC/ pathway (goal-oriented) update`},
{ID: `PCJ`, Description: `PPG - PC/ pathway (goal-oriented) delete`},
{ID: `PCK`, Description: `QRY - PC/ pathway (goal-oriented) query`},
{ID: `PCL`, Description: `PPT - PC/ pathway (goal-oriented) query response`},
{ID: `Q01`, Description: `QRY/DSR - Query sent for immediate response`},
{ID: `Q02`, Description: `QRY/QCK - Query sent for deferred response`},
{ID: `Q03`, Description: `DSR/ACK - Deferred response to a query`},
{ID: `Q04`, Description: `EQQ - Embedded query language query`},
{ID: `Q05`, Description: `UDM/ACK - Unsolicited display update message`},
{ID: `Q06`, Description: `OSQ/OSR - Query for order status`},
{ID: `Q07`, Description: `VQQ - Virtual table query`},
{ID: `Q08`, Description: `SPQ - Stored procedure request`},
{ID: `Q09`, Description: `RQQ - event replay query`},
{ID: `R01`, Description: `ORU/ACK - Unsolicited transmission of an observation message`},
{ID: `R02`, Description: `QRY - Query for results of observation`},
{ID: `R03`, Description: `QRY/DSR Display-oriented results, query/unsol. update (for backward compatibility only)`},
{ID: `R04`, Description: `ORF - Response to query; transmission of requested observation`},
{ID: `R05`, Description: `QRY/DSR - query for display results`},
{ID: `R06`, Description: `UDM - unsolicited update/display results`},
{ID: `R07`, Description: `EDR - enhanced display response`},
{ID: `R08`, Description: `TBR - tabular data response`},
{ID: `R09`, Description: `ERP - event replay response`},
{ID: `R0R`, Description: `R0R - Pharmacy prescription order query response`},
{ID: `RAR`, Description: `RAR - Pharmacy administration information query response`},
{ID: `RDR`, Description: `RDR - Pharmacy dispense information query response`},
{ID: `RER`, Description: `RER - Pharmacy encoded order information query response`},
{ID: `RGR`, Description: `RGR - Pharmacy dose information query response`},
{ID: `S01`, Description: `SRM/SRR - Request new appointment booking`},
{ID: `S02`, Description: `SRM/SRR - Request appointment rescheduling`},
{ID: `S03`, Description: `SRM/SRR - Request appointment modification`},
{ID: `S04`, Description: `SRM/SRR - Request appointment cancellation`},
{ID: `S05`, Description: `SRM/SRR - Request appointment discontinuation`},
{ID: `S06`, Description: `SRM/SRR - Request appointment deletion`},
{ID: `S07`, Description: `SRM/SRR - Request addition of service/resource on appointment`},
{ID: `S08`, Description: `SRM/SRR - Request modification of service/resource on appointment`},
{ID: `S09`, Description: `SRM/SRR - Request cancellation of service/resource on appointment`},
{ID: `S10`, Description: `SRM/SRR - Request discontinuation of service/resource on appointment`},
{ID: `S11`, Description: `SRM/SRR - Request deletion of service/resource on appointment`},
{ID: `S12`, Description: `SIU/ACK - Notification of new appointment booking`},
{ID: `S13`, Description: `SIU/ACK - Notification of appointment rescheduling`},
{ID: `S14`, Description: `SIU/ACK - Notification of appointment modification`},
{ID: `S15`, Description: `SIU/ACK - Notification of appointment cancellation`},
{ID: `S16`, Description: `SIU/ACK - Notification of appointment discontinuation`},
{ID: `S17`, Description: `SIU/ACK - Notification of appointment deletion`},
{ID: `S18`, Description: `SIU/ACK - Notification of addition of service/resource on appointment`},
{ID: `S19`, Description: `SIU/ACK - Notification of modification of service/resource on appointment`},
{ID: `S20`, Description: `SIU/ACK - Notification of cancellation of service/resource on appointment`},
{ID: `S21`, Description: `SIU/ACK - Notification of discontinuation of service/resource on appointment`},
{ID: `S22`, Description: `SIU/ACK - Notification of deletion of service/resource on appointment`},
{ID: `S23`, Description: `SIU/ACK - Notification of blocked schedule time slot(s)`},
{ID: `S24`, Description: `SIU/ACK - Notification of opened (“unblockedâ€) schedule time slot(s)`},
{ID: `S25`, Description: `SQM/SQR - Schedule query message and response`},
{ID: `S26`, Description: `SIU/ACK Notification that patient did not show up for schedule appointment`},
{ID: `T01`, Description: `MDM/ACK - Original document notification`},
{ID: `T02`, Description: `MDM/ACK - Original document notification and content`},
{ID: `T03`, Description: `MDM/ACK - Document status change notification`},
{ID: `T04`, Description: `MDM/ACK - Document status change notification and content`},
{ID: `T05`, Description: `MDM/ACK - Document addendum notification`},
{ID: `T06`, Description: `MDM/ACK - Document addendum notification and content`},
{ID: `T07`, Description: `MDM/ACK - Document edit notification`},
{ID: `T08`, Description: `MDM/ACK - Document edit notification and content`},
{ID: `T09`, Description: `MDM/ACK - Document replacement notification`},
{ID: `T10`, Description: `MDM/ACK - Document replacement notification and content`},
{ID: `T11`, Description: `MDM/ACK - Document cancel notification`},
{ID: `T12`, Description: `QRY/DOC - Document query`},
{ID: `V01`, Description: `VXQ - Query for vaccination record`},
{ID: `V02`, Description: `VXX - Response to vaccination query returning multiple PID matches`},
{ID: `V03`, Description: `VXR - Vaccination record response`},
{ID: `V04`, Description: `VXU - Unsolicited vaccination record update`},
{ID: `W01`, Description: `ORU - Waveform result, unsolicited transmission of requested information`},
{ID: `W02`, Description: `QRF - Waveform result, response to query`}}},
`0004`: {ID: `0004`, Name: `Patient class`, Row: []Row{
{ID: `B`, Description: `Obstetrics`},
{ID: `E`, Description: `Emergency`},
{ID: `I`, Description: `Inpatient`},
{ID: `O`, Description: `Outpatient`},
{ID: `P`, Description: `Preadmit`},
{ID: `R`, Description: `Recurring patient`}}},
`0005`: {ID: `0005`, Name: `Race`, Row: []Row{}},
`0006`: {ID: `0006`, Name: `Religion`, Row: []Row{}},
`0007`: {ID: `0007`, Name: `Admission type`, Row: []Row{
{ID: `A`, Description: `Accident`},
{ID: `E`, Description: `Emergency`},
{ID: `L`, Description: `Labor and Delivery`},
{ID: `R`, Description: `Routine`}}},
`0008`: {ID: `0008`, Name: `Acknowledgment code`, Row: []Row{
{ID: `AA`, Description: `Original mode: Application Accept - Enhanced mode: Application acknowledgment: Accept`},
{ID: `AE`, Description: `Original mode: Application Error - Enhanced mode: Application acknowledgment: Error`},
{ID: `AR`, Description: `Original mode: Application Reject - Enhanced mode: Application acknowledgment: Reject`},
{ID: `CA`, Description: `Enhanced mode: Accept acknowledgment: Commit Accept`},
{ID: `CE`, Description: `Enhanced mode: Accept acknowledgment: Commit Error`},
{ID: `CR`, Description: `Enhanced mode: Accept acknowledgment: Commit Reject`}}},
`0009`: {ID: `0009`, Name: `Ambulatory status`, Row: []Row{
{ID: `A0`, Description: `No functional limitations`},
{ID: `A1`, Description: `Ambulates with assistive device`},
{ID: `A2`, Description: `Wheelchair/stretcher bound`},
{ID: `A3`, Description: `Comatose; non-responsive`},
{ID: `A4`, Description: `Disoriented`},
{ID: `A5`, Description: `Vision impaired`},
{ID: `A6`, Description: `Hearing impaired`},
{ID: `A7`, Description: `Speech impaired`},
{ID: `A8`, Description: `Non-English speaking`},
{ID: `A9`, Description: `Functional level unknown`},
{ID: `B1`, Description: `Oxygen therapy`},
{ID: `B2`, Description: `Special equipment (tubes, IVs, catheters)`},
{ID: `B3`, Description: `Amputee`},
{ID: `B4`, Description: `Mastectomy`},
{ID: `B5`, Description: `Paraplegic`},
{ID: `B6`, Description: `Pregnant`}}},
`0010`: {ID: `0010`, Name: `Physician ID`, Row: []Row{}},
`0017`: {ID: `0017`, Name: `Transaction type`, Row: []Row{
{ID: `AJ`, Description: `Adjustment`},
{ID: `CD`, Description: `Credit`},
{ID: `CG`, Description: `Charge`},
{ID: `PY`, Description: `Payment`}}},
`0018`: {ID: `0018`, Name: `Patient type`, Row: []Row{}},
`0019`: {ID: `0019`, Name: `Anesthesia code`, Row: []Row{}},
`0021`: {ID: `0021`, Name: `Bad debt agency code`, Row: []Row{}},
`0022`: {ID: `0022`, Name: `Billing status`, Row: []Row{}},
`0023`: {ID: `0023`, Name: `Admit source`, Row: []Row{
{ID: `1`, Description: `Physician referral`},
{ID: `2`, Description: `Clinic referral`},
{ID: `3`, Description: `HMO referral`},
{ID: `4`, Description: `Transfer from a hospital`},
{ID: `5`, Description: `Transfer from a skilled nursing facility`},
{ID: `6`, Description: `Transfer from another health care facility`},
{ID: `7`, Description: `Emergency room`},
{ID: `8`, Description: `Court/law enforcement`},
{ID: `9`, Description: `Information not available`}}},
`0024`: {ID: `0024`, Name: `Fee schedule`, Row: []Row{}},
`0027`: {ID: `0027`, Name: `Priority`, Row: []Row{
{ID: `A`, Description: `As soon as possible (a priority lower than stat)`},
{ID: `P`, Description: `Preoperative (to be done prior to surgery)`},
{ID: `R`, Description: `Routine`},
{ID: `S`, Description: `Stat (do immediately)`},
{ID: `T`, Description: `Timing critical (do as near as possible to requested time)`}}},
`0032`: {ID: `0032`, Name: `Charge/price indicator`, Row: []Row{}},
`0038`: {ID: `0038`, Name: `Order status`, Row: []Row{
{ID: `A`, Description: `Some, but not all, results available`},
{ID: `CA`, Description: `Order was canceled`},
{ID: `CM`, Description: `Order is completed`},
{ID: `DC`, Description: `Order was discontinued`},
{ID: `ER`, Description: `Error, order not found`},
{ID: `HD`, Description: `Order is on hold`},
{ID: `IP`, Description: `In process, unspecified`},
{ID: `RP`, Description: `Order has been replaced`},
{ID: `SC`, Description: `In process, scheduled`}}},
`0042`: {ID: `0042`, Name: `Company plan code`, Row: []Row{}},
`0043`: {ID: `0043`, Name: `Condition code`, Row: []Row{
{ID: `01`, Description: `Military service related`},
{ID: `02`, Description: `Condition is employment related`},
{ID: `03`, Description: `Patient covered by insurance not reflected here`},
{ID: `04`, Description: `HMO enrollee`},
{ID: `05`, Description: `Lien has been filed`},
{ID: `06`, Description: `ESRD patient in first 18 months of entitlement covered by employer group health insurance`},
{ID: `07`, Description: `Treatment of non-terminal condition for hospice patient`},
{ID: `08`, Description: `Beneficiary would not provide information concerning other insurance coverage`},
{ID: `09`, Description: `Neither patient nor spouse is employed`},
{ID: `10`, Description: `Patient and/or spouse is employed but no EGHP exists`},
{ID: `11`, Description: `Disabled beneficiary but no LGHP`},
{ID: `12 ... 16`, Description: `Payer codes.`},
{ID: `18`, Description: `Maiden name retained`},
{ID: `19`, Description: `Child retains mother's name`},
{ID: `20`, Description: `Beneficiary requested billing`},
{ID: `21`, Description: `Billing for Denial Notice`},
{ID: `26`, Description: `VA eligible patient chooses to receive services in a Medicare certified facility`},
{ID: `27`, Description: `Patient referred to a sole community hospital for a diagnostic laboratory test`},
{ID: `28`, Description: `Patient and/or spouse's EGHP is secondary to Medicare`},
{ID: `29`, Description: `Disabled beneficiary and/or family member's LGHP is secondary to Medicare`},
{ID: `31`, Description: `Patient is student (full time-day)`},
{ID: `32`, Description: `Patient is student (cooperative/work study program)`},
{ID: `33`, Description: `Patient is student (full time-night)`},
{ID: `34`, Description: `Patient is student (Part time)`},
{ID: `36`, Description: `General care patient in a special unit`},
{ID: `37`, Description: `Ward accommodation as patient request`},
{ID: `38`, Description: `Semi-private room not available`},
{ID: `39`, Description: `Private room medically necessary`},
{ID: `40`, Description: `Same day transfer`},
{ID: `41`, Description: `Partial hospitalization`},
{ID: `46`, Description: `Non-availability statement on file`},
{ID: `48`, Description: `Psychiatric residential treatment centers for children and adolescents`},
{ID: `55`, Description: `SNF bed not available`},
{ID: `56`, Description: `Medical appropriateness`},
{ID: `57`, Description: `SNF readmission`},
{ID: `60`, Description: `Day outlier`},
{ID: `61`, Description: `Cost outlier`},
{ID: `62`, Description: `Payer code`},
{ID: `66`, Description: `Provider does not wish cost outlier payment`},
{ID: `67`, Description: `Beneficiary elects not to use life time reserve (LTR) days`},
{ID: `68`, Description: `Beneficiary elects to use life time reserve (LTR) days`},
{ID: `70`, Description: `Self-administered EPO`},
{ID: `71`, Description: `Full care in unit`},
{ID: `72`, Description: `Self-care in unit`},
{ID: `73`, Description: `Self-care training`},
{ID: `74`, Description: `Home`},
{ID: `75`, Description: `Home - 100% reimbursement`},
{ID: `76`, Description: `Back-up in facility dialysis`},
{ID: `77`, Description: `Provider accepts or is obligated/required due to a contractual arrangement or law to accept payment by a primary payer as payment in full`},
{ID: `78`, Description: `New coverage not implemented by HMO`},
{ID: `79`, Description: `Corf services provided off-site`},
{ID: `80`, Description: `Pregnant`}}},
`0044`: {ID: `0044`, Name: `Contract code`, Row: []Row{}},
`0045`: {ID: `0045`, Name: `Courtesy code`, Row: []Row{}},
`0046`: {ID: `0046`, Name: `Credit rating`, Row: []Row{}},
`0048`: {ID: `0048`, Name: `What subject filter`, Row: []Row{
{ID: `ADV`, Description: `Advice/diagnosis`},
{ID: `ANU`, Description: `Nursing unit lookup (returns patients in beds, excluding empty beds)`},
{ID: `APA`, Description: `Account number query, return matching visit`},
{ID: `APM`, Description: `Medical record number query, returns visits for a medical record number`},
{ID: `APN`, Description: `Patient name lookup`},
{ID: `APP`, Description: `Physician lookup`},
{ID: `ARN`, Description: `Nursing unit lookup (returns patients in beds, including empty beds)`},
{ID: `CAN`, Description: `Cancel. Used to cancel a query`},
{ID: `DEM`, Description: `Demographics`},
{ID: `FIN`, Description: `Financial`},
{ID: `GOL`, Description: `Goals`},
{ID: `MRI`, Description: `Most recent inpatient`},
{ID: `MRO`, Description: `Most recent outpatient`},
{ID: `NCK`, Description: `Network clock`},
{ID: `NSC`, Description: `Network status change`},
{ID: `NST`, Description: `Network statistic`},
{ID: `ORD`, Description: `Order`},
{ID: `OTH`, Description: `Other`},
{ID: `PRB`, Description: `Problems`},
{ID: `PRO`, Description: `Procedure`},
{ID: `RAR`, Description: `Pharmacy administration information`},
{ID: `RDR`, Description: `Pharmacy dispense information`},
{ID: `RER`, Description: `Pharmacy encoded order information`},
{ID: `RES`, Description: `Result`},
{ID: `RGR`, Description: `Pharmacy give information`},
{ID: `ROR`, Description: `Pharmacy prescription information`},
{ID: `SAL`, Description: `All schedule related information, including open slots, booked slots, blocked slots`},
{ID: `SBK`, Description: `Booked slots on the identified schedule`},
{ID: `SBL`, Description: `Blocked slots on the identified schedule`},
{ID: `SOP`, Description: `Open slots on the identified schedule`},
{ID: `SSA`, Description: `Time slots available for a single appointment`},
{ID: `SSR`, Description: `Time slots available for a recurring appointment`},
{ID: `STA`, Description: `Status`},
{ID: `VXI`, Description: `Vaccine Information`}}},
`0049`: {ID: `0049`, Name: `Department code`, Row: []Row{}},
`0050`: {ID: `0050`, Name: `Accident code`, Row: []Row{}},
`0051`: {ID: `0051`, Name: `Diagnosis code`, Row: []Row{}},
`0052`: {ID: `0052`, Name: `Diagnosis type`, Row: []Row{
{ID: `A`, Description: `Admitting`},
{ID: `F`, Description: `Final`},
{ID: `W`, Description: `Working`}}},
`0053`: {ID: `0053`, Name: `Diagnosis Coding Method`, Row: []Row{}},
`0055`: {ID: `0055`, Name: `Diagnosis related group`, Row: []Row{}},
`0056`: {ID: `0056`, Name: `DRG grouper review code`, Row: []Row{}},
`0059`: {ID: `0059`, Name: `Consent code`, Row: []Row{}},
`0061`: {ID: `0061`, Name: `Check digit scheme`, Row: []Row{
{ID: `ISO`, Description: `ISO 7064: 1983`},
{ID: `M10`, Description: `Mod 10 algorithm`},
{ID: `M11`, Description: `Mod 11 algorithm`},
{ID: `NPI`, Description: `Check digit algorithm in the US National Provider Identifier`}}},
`0062`: {ID: `0062`, Name: `Event reason`, Row: []Row{
{ID: `01`, Description: `Patient request`},
{ID: `02`, Description: `Physician order`},
{ID: `03`, Description: `Census management`}}},
`0063`: {ID: `0063`, Name: `Relationship`, Row: []Row{}},
`0064`: {ID: `0064`, Name: `Financial class`, Row: []Row{}},
`0065`: {ID: `0065`, Name: `Specimen action code`, Row: []Row{
{ID: `A`, Description: `Add ordered tests to the existing specimen`},
{ID: `G`, Description: `Generated order; reflex order`},
{ID: `L`, Description: `Lab to obtain specimen from patient`},
{ID: `O`, Description: `Specimen obtained by service other than Lab`},
{ID: `P`, Description: `Pending specimen; Order sent prior to delivery`},
{ID: `R`, Description: `Revised order`},
{ID: `S`, Description: `Schedule the tests specified below`}}},
`0066`: {ID: `0066`, Name: `Employment status`, Row: []Row{}},
`0068`: {ID: `0068`, Name: `Guarantor type`, Row: []Row{}},
`0069`: {ID: `0069`, Name: `Hospital service`, Row: []Row{}},
`0070`: {ID: `0070`, Name: `Specimen source codes`, Row: []Row{
{ID: `ABS`, Description: `Abscess`},
{ID: `AMN`, Description: `Amniotic fluid`},
{ID: `ASP`, Description: `Aspirate`},
{ID: `BBL`, Description: `Blood bag`},
{ID: `BDY`, Description: `Whole body`},
{ID: `BIFL`, Description: `Bile fluid`},
{ID: `BLD`, Description: `Whole blood`},
{ID: `BLDA`, Description: `Blood arterial`},
{ID: `BLDC`, Description: `Blood capillary`},
{ID: `BLDV`, Description: `Blood venous`},
{ID: `BON`, Description: `Bone`},
{ID: `BPH`, Description: `Basophils`},
{ID: `BPU`, Description: `Blood product unit`},
{ID: `BRN`, Description: `Burn`},
{ID: `BRO`, Description: `Bronchial`},
{ID: `BRTH`, Description: `Breath (use EXHLD)`},
{ID: `CALC`, Description: `Calculus (=Stone)`},
{ID: `CBLD`, Description: `Cord blood`},
{ID: `CDM`, Description: `Cardiac muscle`},
{ID: `CNJT`, Description: `Conjunctiva`},
{ID: `CNL`, Description: `Cannula`},
{ID: `COL`, Description: `Colostrum`},
{ID: `CSF`, Description: `Cerebral spinal fluid`},
{ID: `CTP`, Description: `Catheter tip`},
{ID: `CUR`, Description: `Curettage`},
{ID: `CVM`, Description: `Cervical mucus`},
{ID: `CVX`, Description: `Cervix`},
{ID: `CYST`, Description: `Cyst`},
{ID: `DIAF`, Description: `Dialysis fluid`},
{ID: `DOSE`, Description: `Dose med or substance`},
{ID: `DRN`, Description: `Drain`},
{ID: `DUFL`, Description: `Duodenal fluid`},
{ID: `EAR`, Description: `Ear`},
{ID: `EARW`, Description: `Ear wax (cerumen)`},
{ID: `ELT`, Description: `Electrode`},
{ID: `ENDC`, Description: `Endocardium`},
{ID: `ENDM`, Description: `Endometrium`},
{ID: `EOS`, Description: `Eosinophils`},
{ID: `EXHLD`, Description: `Exhaled gas (=breath)`},
{ID: `EYE`, Description: `Eye`},
{ID: `FIB`, Description: `Fibroblasts`},
{ID: `FIST`, Description: `Fistula`},
{ID: `FLT`, Description: `Filter`},
{ID: `FLU`, Description: `Body fluid, unsp`},
{ID: `GAS`, Description: `Gas`},
{ID: `GAST`, Description: `Gastric fluid/contents`},
{ID: `GEN`, Description: `Genital`},
{ID: `GENC`, Description: `Genital cervix`},
{ID: `GENL`, Description: `Genital lochia`},
{ID: `GENV`, Description: `Genital vaginal`},
{ID: `HAR`, Description: `Hair`},
{ID: `IHG`, Description: `Inhaled Gas`},
{ID: `ISLT`, Description: `Isolate`},
{ID: `IT`, Description: `Intubation tube`},
{ID: `LAM`, Description: `Lamella`},
{ID: `LIQ`, Description: `Liquid NOS`},
{ID: `LN`, Description: `Line`},
{ID: `LNA`, Description: `Line arterial`},
{ID: `LNV`, Description: `Line venous`},
{ID: `LYM`, Description: `Lymphocytes`},
{ID: `MAC`, Description: `Macrophages`},
{ID: `MAR`, Description: `Marrow`},
{ID: `MBLD`, Description: `Menstrual blood`},
{ID: `MEC`, Description: `Meconium`},
{ID: `MILK`, Description: `Breast milk`},
{ID: `MLK`, Description: `Milk`},
{ID: `NAIL`, Description: `Nail`},
{ID: `NOS`, Description: `Nose (nasal passage)`},
{ID: `ORH`, Description: `Other`},
{ID: `PAFL`, Description: `Pancreatic fluid`},
{ID: `PAT`, Description: `Patient`},
{ID: `PLAS`, Description: `Plasma`},
{ID: `PLB`, Description: `Plasma bag`},
{ID: `PLC`, Description: `Placenta`},
{ID: `PLR`, Description: `Pleural fluid (thoracentesis fld)`},
{ID: `PMN`, Description: `Polymorphonuclear neutrophils`},
{ID: `PPP`, Description: `Platelet poor plasma`},
{ID: `PRP`, Description: `Platelet rich plasma`},
{ID: `PRT`, Description: `Peritoneal fluid /ascites`},
{ID: `PUS`, Description: `Pus`},
{ID: `RBC`, Description: `Erythrocytes`},
{ID: `RT`, Description: `Route of medicine`},
{ID: `SAL`, Description: `Saliva`},
{ID: `SEM`, Description: `Seminal fluid`},
{ID: `SER`, Description: `Serum`},
{ID: `SKM`, Description: `Skeletal muscle`},
{ID: `SKN`, Description: `Skin`},
{ID: `SNV`, Description: `Synovial fluid (Joint fluid)`},
{ID: `SPRM`, Description: `Spermatozoa`},
{ID: `SPT`, Description: `Sputum`},
{ID: `SPTC`, Description: `Sputum - coughed`},
{ID: `SPTT`, Description: `Sputum - tracheal aspirate`},
{ID: `STL`, Description: `Stool = Fecal`},
{ID: `STON`, Description: `Stone (use CALC)`},
{ID: `SWT`, Description: `Sweat`},
{ID: `TEAR`, Description: `Tears`},
{ID: `THRB`, Description: `Thrombocyte (platelet)`},
{ID: `THRT`, Description: `Throat`},
{ID: `TISG`, Description: `Tissue gall bladder`},
{ID: `TISPL`, Description: `Tissue placenta`},
{ID: `TISS`, Description: `Tissue`},
{ID: `TISU`, Description: `Tissue ulcer`},
{ID: `TLGI`, Description: `Tissue large intestine`},
{ID: `TLNG`, Description: `Tissue lung`},
{ID: `TSMI`, Description: `Tissue small intestine`},
{ID: `TUB`, Description: `Tube NOS`},
{ID: `ULC`, Description: `Ulcer`},
{ID: `UMB`, Description: `Umbilical blood`},
{ID: `UMED`, Description: `Unknown medicine`},
{ID: `UR`, Description: `Urine`},
{ID: `URC`, Description: `Urine clean catch`},
{ID: `URNS`, Description: `Urine sediment`},
{ID: `URT`, Description: `Urine catheter`},
{ID: `URTH`, Description: `Urethra`},
{ID: `USUB`, Description: `Unknown substance`},
{ID: `VOM`, Description: `Vomitus`},
{ID: `WAT`, Description: `Water`},
{ID: `WBC`, Description: `Leukocytes`},
{ID: `WICK`, Description: `Wick`},
{ID: `WND`, Description: `Wound`},
{ID: `WNDA`, Description: `Wound abscess`},
{ID: `WNDD`, Description: `Wound drainage`},
{ID: `WNDE`, Description: `Wound exudate`},
{ID: `XXX`, Description: `To be specified in another part of the 422.3.10070message`}}},
`0072`: {ID: `0072`, Name: `Insurance plan ID`, Row: []Row{}},
`0073`: {ID: `0073`, Name: `Interest rate code`, Row: []Row{}},
`0074`: {ID: `0074`, Name: `Diagnostic service section ID`, Row: []Row{
{ID: `AU`, Description: `Audiology`},
{ID: `BG`, Description: `Blood gases`},
{ID: `BLB`, Description: `Blood bank`},
{ID: `CH`, Description: `Chemistry`},
{ID: `CP`, Description: `Cytopathology`},
{ID: `CT`, Description: `CAT scan`},
{ID: `CTH`, Description: `Cardiac catheterization`},
{ID: `CUS`, Description: `Cardiac Ultrasound`},
{ID: `EC`, Description: `Electrocardiac (e.g. EKG, EEC, Holter)`},
{ID: `EN`, Description: `Electroneuro (EEG, EMG, EP, PSG)`},
{ID: `HM`, Description: `Hematology`},
{ID: `ICU`, Description: `Bedside ICU Monitoring`},
{ID: `IMM`, Description: `Immunology`},
{ID: `LAB`, Description: `Laboratory`},
{ID: `MB`, Description: `Microbiology`},
{ID: `MCB`, Description: `Mycobacteriology`},
{ID: `MYC`, Description: `Mycology`},
{ID: `NMR`, Description: `Nuclear magnetic resonance`},
{ID: `NMS`, Description: `Nuclear medicine scan`},
{ID: `NRS`, Description: `Nursing service measures`},
{ID: `OSL`, Description: `Outside Lab`},
{ID: `OT`, Description: `Occupational Therapy`},
{ID: `OTH`, Description: `Other`},
{ID: `OUS`, Description: `OB Ultrasound`},
{ID: `PF`, Description: `Pulmonary function`},
{ID: `PHR`, Description: `Pharmacy`},
{ID: `PHY`, Description: `Physician (Hx. Dx, admission note, etc.l)`},
{ID: `PT`, Description: `Physical Therapy`},
{ID: `RAD`, Description: `Radiology`},
{ID: `RC`, Description: `Respiratory Care (therapy)`},
{ID: `RT`, Description: `Radiation therapy`},
{ID: `RUS`, Description: `Radiology ultrasound`},
{ID: `RX`, Description: `Radiograph`},
{ID: `SP`, Description: `Surgidal Pathology`},
{ID: `SR`, Description: `Serology`},
{ID: `TX`, Description: `Toxicology`},
{ID: `VR`, Description: `Virology`},
{ID: `VUS`, Description: `Vascular Ultrasound`},
{ID: `XRC`, Description: `Cineradiograph`}}},
`0076`: {ID: `0076`, Name: `Message type`, Row: []Row{
{ID: `ACK`, Description: `General acknowledgment message`},
{ID: `ADR`, Description: `ADT response`},
{ID: `ADT`, Description: `ADT message`},
{ID: `ARD`, Description: `Ancillary RPT (display) (for backward compatibility only)`},
{ID: `BAR`, Description: `Add/change billing account`},
{ID: `CRM`, Description: `Clinical study registration`},
{ID: `CSU`, Description: `Unsolicited clinical study data`},
{ID: `DFT`, Description: `Detail financial transaction`},
{ID: `DOC`, Description: `Document query`},
{ID: `DSR`, Description: `Display response`},
{ID: `EDR`, Description: `Enhanced display response`},
{ID: `EQQ`, Description: `Embedded query language query`},
{ID: `ERP`, Description: `Event replay response`},
{ID: `MCF`, Description: `Delayed acknowledgment`},
{ID: `MDM`, Description: `Documentation message`},
{ID: `MFD`, Description: `Master files delayed application acknowledgment`},
{ID: `MFK`, Description: `Master files application acknowledgment`},
{ID: `MFN`, Description: `Master files notification`},
{ID: `MFQ`, Description: `Master files query`},
{ID: `MFR`, Description: `Master files query response`},
{ID: `NMD`, Description: `Network management data`},
{ID: `NMQ`, Description: `Network management query`},
{ID: `NMR`, Description: `Network management response`},
{ID: `ORF`, Description: `Observ. result/record response`},
{ID: `ORM`, Description: `Order message`},
{ID: `ORR`, Description: `Order acknowledgment message`},
{ID: `ORU`, Description: `Observ result/unsolicited`},
{ID: `OSQ`, Description: `Order status query`},
{ID: `OSR`, Description: `Order status response`},
{ID: `PEX`, Description: `Product experience`},
{ID: `PGL`, Description: `Patient goal`},
{ID: `PIN`, Description: `Patient insurance information`},
{ID: `PPG`, Description: `Patient pathway (goal-oriented) message`},
{ID: `PPP`, Description: `Patient pathway (problem-oriented) message`},
{ID: `PPR`, Description: `Patient problem`},
{ID: `PPT`, Description: `Patient pathway (goal oriented) response`},
{ID: `PPV`, Description: `Patient goal response`},
{ID: `PRR`, Description: `Patient problem response`},
{ID: `PTR`, Description: `Patient pathway (problem-oriented) response`},
{ID: `QCK`, Description: `Query general acknowledgment`},
{ID: `QRY`, Description: `Query, original mode`},
{ID: `RAR`, Description: `Pharmacy administration information`},
{ID: `RAS`, Description: `Pharmacy administration message`},
{ID: `RCI`, Description: `Return clinical information`},
{ID: `RCL`, Description: `Return clinical list`},
{ID: `RDE`, Description: `Pharmacy encoded order message`},
{ID: `RDR`, Description: `Pharmacy dispense information`},
{ID: `RDS`, Description: `Pharmacy dispense message`},
{ID: `REF`, Description: `Patient referral`},
{ID: `RER`, Description: `Pharmacy encoded order information`},
{ID: `RGR`, Description: `Pharmacy dose information`},
{ID: `RGV`, Description: `Pharmacy give message`},
{ID: `ROR`, Description: `Pharmacy prescription order response`},
{ID: `RPA`, Description: `Return patient authorization`},
{ID: `RPI`, Description: `Return patient information`},
{ID: `RPL`, Description: `Return patient display list`},
{ID: `RPR`, Description: `Return patient list`},
{ID: `RQA`, Description: `Request patient authorization`},
{ID: `RQC`, Description: `Request clinical information`},
{ID: `RQI`, Description: `Request patient information`},
{ID: `RQP`, Description: `Request patient demographics`},
{ID: `RQQ`, Description: `Event replay query`},
{ID: `RRA`, Description: `Pharmacy administration acknowledgment`},
{ID: `RRD`, Description: `Pharmacy dispense acknowledgment`},
{ID: `RRE`, Description: `Pharmacy encoded order acknowledgment`},
{ID: `RRG`, Description: `Pharmacy give acknowledgment`},
{ID: `RRI`, Description: `Return patient referral`},
{ID: `SIU`, Description: `Schedule information unsolicited`},
{ID: `SPQ`, Description: `Stored procedure request`},
{ID: `SQM`, Description: `Schedule query`},
{ID: `SQR`, Description: `Schedule query response`},
{ID: `SRM`, Description: `Schedule request`},
{ID: `SRR`, Description: `Scheduled request response`},
{ID: `SUR`, Description: `Summary product experience report`},
{ID: `TBR`, Description: `Tabular data response`},
{ID: `UDM`, Description: `Unsolicited display message`},
{ID: `VQQ`, Description: `Virtual table query`},
{ID: `VXQ`, Description: `Query for vaccination record`},
{ID: `VXR`, Description: `Vaccination query record response`},
{ID: `VXU`, Description: `Unsolicited vaccination record update`},
{ID: `VXX`, Description: `Vaccination query response with multiple PID matches`}}},
`0078`: {ID: `0078`, Name: `Abnormal flags`, Row: []Row{
{ID: `<`, Description: `Below absolute low-off instrument scale`},
{ID: `>`, Description: `Above absolute high-off instrument scale`},
{ID: `A`, Description: `Abnormal (applies to non-numeric results)`},
{ID: `AA`, Description: `Very abnormal (applies to non-numeric units, analogous to panic limits for numeric units)`},
{ID: `B`, Description: `Better--use when direction not relevant`},
{ID: `D`, Description: `Significant change down`},
{ID: `H`, Description: `Above high normal`},
{ID: `HH`, Description: `Above upper panic limits`},
{ID: `I`, Description: `Intermediate. Indicates for microbiology susceptibilities only.`},
{ID: `L`, Description: `Below low normal`},
{ID: `LL`, Description: `Below lower panic limits`},
{ID: `MS`, Description: `Moderately susceptible. Indicates for microbiology susceptibilities only.`},
{ID: `N`, Description: `Normal (applies to non-numeric results)`},
{ID: `null`, Description: `No range defined, or normal ranges don't apply`},
{ID: `R`, Description: `Resistant. Indicates for microbiology susceptibilities only.`},
{ID: `S`, Description: `Susceptible. Indicates for microbiology susceptibilities only.`},
{ID: `U`, Description: `Significant change up`},
{ID: `VS`, Description: `Very susceptible. Indicates for microbiology susceptibilities only.`},
{ID: `W`, Description: `Worse--use when direction not relevant`}}},
`0080`: {ID: `0080`, Name: `Nature of abnormal testing`, Row: []Row{
{ID: `A`, Description: `An age-based population`},
{ID: `N`, Description: `None - generic normal range`},
{ID: `R`, Description: `A race-based population`},
{ID: `S`, Description: `A sex-based population`}}},
`0083`: {ID: `0083`, Name: `Outlier type`, Row: []Row{
{ID: `C`, Description: `Outlier cost`},
{ID: `D`, Description: `Outlier days`}}},
`0084`: {ID: `0084`, Name: `Performed by`, Row: []Row{}},
`0085`: {ID: `0085`, Name: `Observation result status codes interpretation`, Row: []Row{
{ID: `C`, Description: `Record coming over is a correction and thus replaces a final result`},
{ID: `D`, Description: `Deletes the OBX record`},
{ID: `F`, Description: `Final results; Can only be changed with a corrected result.`},
{ID: `I`, Description: `Specimen in lab; results pending`},
{ID: `N`, Description: `Not asked; used to affirmatively document that the observation identified in the OBX was not sought when the universal service ID in OBR-4 implies that it would be sought.`},
{ID: `O`, Description: `Order detail description only (no result)`},
{ID: `P`, Description: `Preliminary results`},
{ID: `R`, Description: `Results entered -- not verified`},
{ID: `S`, Description: `Partial results`},
{ID: `U`, Description: `Results status change to final without retransmitting results already sent as ‘preliminary.’ E.g., radiology changes status from preliminary to final`},
{ID: `W`, Description: `Post original as wrong, e.g., transmitted for wrong patient`},
{ID: `X`, Description: `Results cannot be obtained for this observation`}}},
`0086`: {ID: `0086`, Name: `Plan Type`, Row: []Row{}},
`0087`: {ID: `0087`, Name: `Pre-admit test indicator`, Row: []Row{}},
`0088`: {ID: `0088`, Name: `Procedure code`, Row: []Row{}},
`0089`: {ID: `0089`, Name: `Procedure Coding Method`, Row: []Row{}},
`0091`: {ID: `0091`, Name: `Query priority`, Row: []Row{
{ID: `D`, Description: `Deferred`},
{ID: `I`, Description: `Immediate`}}},
`0092`: {ID: `0092`, Name: `Re-admission indicator`, Row: []Row{
{ID: `R`, Description: `Readmission`}}},
`0093`: {ID: `0093`, Name: `Release information`, Row: []Row{
{ID: `N`, Description: `No`},
{ID: `Y`, Description: `Yes`}}},
`0098`: {ID: `0098`, Name: `Type of agreement`, Row: []Row{
{ID: `M`, Description: `Maternity`},
{ID: `S`, Description: `Standard`},
{ID: `U`, Description: `Unified`}}},
`0099`: {ID: `0099`, Name: `VIP indicator`, Row: []Row{}},
`0100`: {ID: `0100`, Name: `When to charge`, Row: []Row{
{ID: `D`, Description: `On discharge`},
{ID: `O`, Description: `On receipt of order`},
{ID: `R`, Description: `At time service is completed`},
{ID: `S`, Description: `At time service is started`},
{ID: `T`, Description: `At a designated date/time`}}},
`0102`: {ID: `0102`, Name: `Delayed Acknowledgment Type`, Row: []Row{
{ID: `D`, Description: `Message received, stored for later processing`},
{ID: `F`, Description: `acknowledgment after processing`}}},
`0103`: {ID: `0103`, Name: `Processing ID`, Row: []Row{
{ID: `D`, Description: `Debugging`},
{ID: `P`, Description: `Production`},
{ID: `T`, Description: `Training`}}},
`0104`: {ID: `0104`, Name: `Version ID`, Row: []Row{
{ID: `2.0`, Description: `Release 2.0`, Comment: `September 1988`},
{ID: `2.0D`, Description: `Demo 2.0`, Comment: `October 1988`},
{ID: `2.1`, Description: `Release 2. 1`, Comment: `March 1990`},
{ID: `2.2`, Description: `Release 2.2`, Comment: `December 1994`},
{ID: `2.3`, Description: `Release 2.3`, Comment: `March 1997`},
{ID: `2.3.1`, Description: `Release 2.3.1`},
{ID: `2.3.2`, Description: `Release 2.3.2`}}},
`0105`: {ID: `0105`, Name: `Source of comment`, Row: []Row{
{ID: `L`, Description: `Ancillary (filler) department is source of comment`},
{ID: `O`, Description: `Other system is source of comment`},
{ID: `P`, Description: `Orderer (placer) is source of comment`}}},
`0106`: {ID: `0106`, Name: `Query/response format code`, Row: []Row{
{ID: `D`, Description: `Response is in display format`},
{ID: `R`, Description: `Response is in record-oriented format`},
{ID: `T`, Description: `Response is in tabular format`}}},
`0107`: {ID: `0107`, Name: `Deferred response type`, Row: []Row{
{ID: `B`, Description: `Before the Date/Time specified`},
{ID: `L`, Description: `Later than the Date/Time specified`}}},
`0108`: {ID: `0108`, Name: `Query results level`, Row: []Row{
{ID: `O`, Description: `Order plus order status`},
{ID: `R`, Description: `Results without bulk text`},
{ID: `S`, Description: `Status only`},
{ID: `T`, Description: `Full results`}}},
`0109`: {ID: `0109`, Name: `Report priority`, Row: []Row{
{ID: `R`, Description: `Routine`},
{ID: `S`, Description: `Stat`}}},
`0110`: {ID: `0110`, Name: `Transfer to bad debt code`, Row: []Row{}},
`0111`: {ID: `0111`, Name: `Delete account code`, Row: []Row{}},
`0112`: {ID: `0112`, Name: `Discharge disposition`, Row: []Row{
{ID: `01`, Description: `Discharged to home or self care (routine discharge)`},
{ID: `02`, Description: `Discharged/transferred to another short term general hospital for inpatient care`},
{ID: `03`, Description: `Discharged/transferred to skilled nursing facility (SNF)`},
{ID: `04`, Description: `Discharged/transferred to an intermediate care facility (ICF)`},
{ID: `05`, Description: `Discharged/transferred to another type of institution for inpatient care or referred for outpatient services to another institution`},
{ID: `06`, Description: `Discharged/transferred to home under care of organized home health service organization`},
{ID: `07`, Description: `Left against medical advice or discontinued care`},
{ID: `08`, Description: `Discharged/transferred to home under care of Home IV provider`},
{ID: `09`, Description: `Admitted as an inpatient to this hospital`},
{ID: `10`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `11`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `12`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `13`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `14`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `15`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `16`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `17`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `18`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `19`, Description: `Discharge to be defined at state level, if necessary`},
{ID: `20`, Description: `Expired`},
{ID: `21`, Description: `Expired to be defined at state level, if necessary`},
{ID: `22`, Description: `Expired to be defined at state level, if necessary`},
{ID: `23`, Description: `Expired to be defined at state level, if necessary`},
{ID: `24`, Description: `Expired to be defined at state level, if necessary`},
{ID: `25`, Description: `Expired to be defined at state level, if necessary`},
{ID: `26`, Description: `Expired to be defined at state level, if necessary`},
{ID: `27`, Description: `Expired to be defined at state level, if necessary`},
{ID: `28`, Description: `Expired to be defined at state level, if necessary`},
{ID: `29`, Description: `Expired to be defined at state level, if necessary`},
{ID: `30`, Description: `Still patient or expected to return for outpatient services`},
{ID: `31`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `32`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `33`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `34`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `35`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `36`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `37`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `38`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `39`, Description: `Still patient to be defined at state level, if necessary`},
{ID: `40`, Description: `Expired at home`},
{ID: `41`, Description: `Expired in a medical facility; e.g., hospital, SNF, ICF, or free standing hospice`},
{ID: `42`, Description: `Expired - place unknown`}}},
`0113`: {ID: `0113`, Name: `Discharged to location`, Row: []Row{}},
`0114`: {ID: `0114`, Name: `Diet type`, Row: []Row{}},
`0115`: {ID: `0115`, Name: `Servicing facility`, Row: []Row{}},
`0116`: {ID: `0116`, Name: `Bed status`, Row: []Row{
{ID: `C`, Description: `Closed`},
{ID: `H`, Description: `Housekeeping`},
{ID: `I`, Description: `Isolated`},
{ID: `K`, Description: `Contaminated`},
{ID: `O`, Description: `Occupied`},
{ID: `U`, Description: `Unoccupied`}}},
`0117`: {ID: `0117`, Name: `Account status`, Row: []Row{}},
`0118`: {ID: `0118`, Name: `Major diagnostic category`, Row: []Row{}},
`0119`: {ID: `0119`, Name: `Order control codes`, Row: []Row{
{ID: `AF`, Description: `Order refill request approval`, Comment: `AF is a response back from the placer authorizing a refill or quantity of refills`},
{ID: `CA`, Description: `Cancel order request`, Comment: `A cancellation is a request not to do a previously ordered service. Confirmation of the cancellation request is provided by the filler, e.g., a message with an ORC-1-order control value of CR`},
{ID: `CH`, Description: `Child order`, Comment: `The parent (PA) and child (CH) order control codes allow the spawning of “child” orders from a “parent” order without changing the parent (original order). `},
{ID: `CN`, Description: `Combined result`},
{ID: `CR`, Description: `Canceled as requested`},
{ID: `DC`, Description: `Discontinue order request`, Comment: `A discontinue request code is used to stop an ongoing ordered service. It is not the same as a cancellation request, which is used in an attempt to prevent an order from happening`},
{ID: `DE`, Description: `Data Errors`},
{ID: `DF`, Description: `Order refill request denied`, Comment: `DF indicates that the placer will not authorize refills for the order. The order control code reason may be used to indicate the reason for the request denial. `},
{ID: `FU`, Description: `Order refilled or unsolicited`, Comment: `FU notifies the placer that the filler issued a refill for the order at the patient’s request. `},
{ID: `HD`, Description: `Hold order request`},
{ID: `HR`, Description: `On hold as requested`},
{ID: `LI`, Description: `Link order to patient care message`},
{ID: `NA`, Description: `Number assigned`, Comment: `The number assigned code allows the “other” application to notify the filler application of the newly-assigned filler order number. ORC-1-order control contains value of NA, ORC-2-placer order number (from the ORC with the SN value), and the newly-assigned filler order number`},
{ID: `NW`, Description: `New Order`},
{ID: `OC`, Description: `Order canceled`},
{ID: `OD`, Description: `Order discontinued`},
{ID: `OE`, Description: `Order released`},
{ID: `OF`, Description: `Order refilled as requested`, Comment: `OF directly responds to the placer system’s request for a refill `},
{ID: `OH`, Description: `Order held`},
{ID: `OK`, Description: `Order accepted and OK`},
{ID: `OR`, Description: `Released as requested`},
{ID: `PA`, Description: `Parent order`, Comment: `The parent (PA) and child (CH) order control codes allow the spawning of “child” orders from a “parent” order without changing the parent (original order). `},
{ID: `RE`, Description: `Observations to follow`, Comment: `The observations-to-follow code is used to transmit patient-specific information with an order. An order detail segment (e.g., OBR) can be followed by one or more observation segments (OBX). Any observation that can be transmitted in an ORU message can be transmitted with this mechanism. When results are transmitted with an order, the results should immediately follow the order or orders that they support`},
{ID: `RF`, Description: `Refill order request`, Comment: `RF accommodates requests by both the filler or the placer. The filler may be requesting refill authorization from the placer. A placer system may be requesting a refill to be done by the filler system`},
{ID: `RL`, Description: `Release previous hold`},
{ID: `RO`, Description: `Replacement order`, Comment: `The replacement order code is sent by the filler application to another application indicating the exact replacement ordered service. It is used with the RP and RU order control codes as described above`},
{ID: `RP`, Description: `Order replace request`, Comment: `The order replace request code permits the order filler to replace one or more new orders with one or more new orders, at the request of the placer application`},
{ID: `RQ`, Description: `Replaced as requested`},
{ID: `RR`, Description: `Request received`, Comment: `Left in for backward compatibility. In the current version it is equivalent to an accept acknowledgment. The request-received code indicates that an order message has been received and will be processed later. The order has not yet undergone the processing that would permit a more exact response`},
{ID: `RU`, Description: `Replaced unsolicited`, Comment: `The unsolicited replacement code permits the filler application to notify another application without being requested from the placer application`},
{ID: `SC`, Description: `Status changed`},
{ID: `SN`, Description: `Send order number`},
{ID: `SR`, Description: `Response to send order status request`},
{ID: `SS`, Description: `Send order status request`},
{ID: `UA`, Description: `Unable to accept order`, Comment: `An unable-to-accept code is used when a new order cannot be accepted by the filler. Possible reasons include requesting a prescription for a drug which the patient is allergic to or for an order which requires certain equipment resources which are not available such that the order cannot be filled. Note that this is different from the communication level acceptance as defined within the MSA segment`},
{ID: `UC`, Description: `Unable to cancel`, Comment: `An unable-to-cancel code is used when the ordered service is at a point that it cannot be canceled by the filler or when local rules prevent cancellation by the filler. The use of this code is dependent on the value of ORC-6-response flag`},
{ID: `UF`, Description: `Unable to refill`, Comment: `UF indicates an application level denial by the filler system to an authorized refill request`},
{ID: `UH`, Description: `Unable to put on hold`},
{ID: `UM`, Description: `Unable to replace`},
{ID: `UN`, Description: `Unlink order from patient care message`},
{ID: `UR`, Description: `Unable to release`},
{ID: `UX`, Description: `Unable to change`},
{ID: `XO`, Description: `Change order request`},
{ID: `XR`, Description: `Changed as requested`},
{ID: `XX`, Description: `Order changed or unsolicited`}}},
`0121`: {ID: `0121`, Name: `Response flag`, Row: []Row{
{ID: `D`, Description: `Same as R, also other associated segments`},
{ID: `E`, Description: `Report exceptions only`},
{ID: `F`, Description: `Same as D, plus confirmations explicitly`},
{ID: `N`, Description: `Only the MSA segment is returned`},
{ID: `R`, Description: `Same as E, also Replacement and Parent-Child`}}},
`0122`: {ID: `0122`, Name: `Charge type`, Row: []Row{
{ID: `CH`, Description: `Charge`},
{ID: `CO`, Description: `Contract`},
{ID: `CR`, Description: `Credit`},
{ID: `DP`, Description: `Department`},
{ID: `GR`, Description: `Grant`},
{ID: `NC`, Description: `No Charge`},
{ID: `PC`, Description: `Professional`},
{ID: `RS`, Description: `Research`}}},
`0123`: {ID: `0123`, Name: `Result status`, Row: []Row{
{ID: `A`, Description: `Some, but not all results available`},
{ID: `C`, Description: `Correction to results`},
{ID: `F`, Description: `Final results; results stored and verified. Can only be changed with a corrected result.`},
{ID: `I`, Description: `No results available; specimen received procedure incomplete`},
{ID: `O`, Description: `Order received; specimen not yet received`},
{ID: `P`, Description: `Preliminary: A verified early result is available final results not yet obtained`},
{ID: `R`, Description: `Results stored; not yet verified`},
{ID: `S`, Description: `No results available; procedure scheduled but not done`},
{ID: `X`, Description: `No results available; Order canceled.`},
{ID: `Y`, Description: `No order on record for this test. (Used only on queries)`},
{ID: `Z`, Description: `No record of this patient. (Used only on queries)`}}},
`0124`: {ID: `0124`, Name: `Transportation mode`, Row: []Row{
{ID: `CART`, Description: `Cart - patient travels on cart or gurney`},
{ID: `PORT`, Description: `The examining device goes to patient’s location`},
{ID: `WALK`, Description: `Patient walks to diagnostic service`},
{ID: `WHLC`, Description: `Wheelchair`}}},
`0125`: {ID: `0125`, Name: `Value type`, Row: []Row{
{ID: `AD`, Description: `Address`},
{ID: `CE`, Description: `Coded Entry`},
{ID: `CF`, Description: `Coded Element With Formatted Values`},
{ID: `CK`, Description: `Composite ID With Check Digit`},
{ID: `CN`, Description: `Composite ID And Name`},
{ID: `CP`, Description: `Composite Price`},
{ID: `CX`, Description: `Extended Composite ID With Check Digit`},
{ID: `DT`, Description: `Date`},
{ID: `ED`, Description: `Encapsulated Data`},
{ID: `FT`, Description: `Formatted Text (Display)`},
{ID: `ID`, Description: `Coded Value`},
{ID: `MO`, Description: `Money`},
{ID: `NM`, Description: `Numeric`},
{ID: `PN`, Description: `Person Name`},
{ID: `RP`, Description: `Reference Pointer`},
{ID: `SN`, Description: `Structured Numeric`},
{ID: `ST`, Description: `String Data.`},
{ID: `TM`, Description: `Time`},
{ID: `TN`, Description: `Telephone Number`},
{ID: `TS`, Description: `Time Stamp (Date & Time)`},
{ID: `TX`, Description: `Text Data (Display)`},
{ID: `XAD`, Description: `Extended Address`},
{ID: `XCN`, Description: `Extended Composite Name And Number For Persons`},
{ID: `XON`, Description: `Extended Composite Name And Number For Organizations`},
{ID: `XPN`, Description: `Extended Person Name`},
{ID: `XTN`, Description: `Extended Telecommunications Number`}}},
`0127`: {ID: `0127`, Name: `Allergy type`, Row: []Row{
{ID: `DA`, Description: `Drug allergy`},
{ID: `FA`, Description: `Food allergy`},
{ID: `MA`, Description: `Miscellaneous allergy`},
{ID: `MC`, Description: `Miscellaneous contraindication`}}},
`0128`: {ID: `0128`, Name: `Allergy severity`, Row: []Row{
{ID: `MI`, Description: `Mild`},
{ID: `MO`, Description: `Moderate`},
{ID: `SV`, Description: `Severe`}}},
`0129`: {ID: `0129`, Name: `Accommodation code`, Row: []Row{}},
`0130`: {ID: `0130`, Name: `Visit user code`, Row: []Row{}},
`0131`: {ID: `0131`, Name: `Contact role`, Row: []Row{}},
`0132`: {ID: `0132`, Name: `Transaction code`, Row: []Row{}},
`0135`: {ID: `0135`, Name: `Assignment of benefits`, Row: []Row{
{ID: `M`, Description: `Modified assignment`},
{ID: `N`, Description: `No`},
{ID: `Y`, Description: `Yes`}}},
`0136`: {ID: `0136`, Name: `Yes/no indicator`, Row: []Row{
{ID: `N`, Description: `No`},
{ID: `Y`, Description: `Yes`}}},
`0137`: {ID: `0137`, Name: `Mail claim party`, Row: []Row{
{ID: `E`, Description: `Employer`},
{ID: `G`, Description: `Guarantor`},
{ID: `I`, Description: `Insurance company`},
{ID: `O`, Description: `Other`},
{ID: `P`, Description: `Patient`}}},
`0139`: {ID: `0139`, Name: `Employer information data`, Row: []Row{}},
`0140`: {ID: `0140`, Name: `Military service`, Row: []Row{
{ID: `NATO`, Description: `North Atlantic Treaty Organization`},
{ID: `NOAA`, Description: `National Oceanic and Atmospheric Administration`},
{ID: `USA`, Description: `U.S. Army`},
{ID: `USAF`, Description: `U.S. Air Force`},
{ID: `USCG`, Description: `U.S. Coast Guard`},
{ID: `USMC`, Description: `U.S. Marines`},
{ID: `USN`, Description: `U.S. Navy`},
{ID: `USPHS`, Description: `U.S. Public Health Service`}}},
`0141`: {ID: `0141`, Name: `Military rank/grade`, Row: []Row{
{ID: `E1`, Description: `Enlisted`},
{ID: `E2`, Description: `Enlisted`},
{ID: `E3`, Description: `Enlisted`},
{ID: `E4`, Description: `Enlisted`},
{ID: `E5`, Description: `Enlisted`},
{ID: `E6`, Description: `Enlisted`},
{ID: `E7`, Description: `Enlisted`},
{ID: `E8`, Description: `Enlisted`},
{ID: `E9`, Description: `Enlisted`},
{ID: `O1`, Description: `Officers`},
{ID: `O10`, Description: `Officers`},
{ID: `O2`, Description: `Officers`},
{ID: `O3`, Description: `Officers`},
{ID: `O4`, Description: `Officers`},
{ID: `O5`, Description: `Officers`},
{ID: `O6`, Description: `Officers`},
{ID: `O7`, Description: `Officers`},
{ID: `O8`, Description: `Officers`},
{ID: `O9`, Description: `Officers`},
{ID: `W1`, Description: `Warrant Officers`},
{ID: `W2`, Description: `Warrant Officers`},
{ID: `W3`, Description: `Warrant Officers`},
{ID: `W4`, Description: `Warrant Officers`}}},
`0142`: {ID: `0142`, Name: `Military status`, Row: []Row{
{ID: `ACT`, Description: `Active duty`},
{ID: `DEC`, Description: `Deceased`},
{ID: `RET`, Description: `Retired`}}},
`0143`: {ID: `0143`, Name: `Non-covered insurance code`, Row: []Row{}},
`0144`: {ID: `0144`, Name: `Eligibility source`, Row: []Row{
{ID: `1`, Description: `Insurance company`},
{ID: `2`, Description: `Employer`},
{ID: `3`, Description: `Insured presented policy`},
{ID: `4`, Description: `Insured presented card`},
{ID: `5`, Description: `Signed statement on file`},
{ID: `6`, Description: `Verbal information`},
{ID: `7`, Description: `None`}}},
`0145`: {ID: `0145`, Name: `Room type`, Row: []Row{
{ID: `2ICU`, Description: `Second intensive care unit`},
{ID: `2PRI`, Description: `Second private room`},
{ID: `2SPR`, Description: `Second semi-private room`},
{ID: `ICU`, Description: `Intensive care unit`},
{ID: `PRI`, Description: `Private room`},
{ID: `SPR`, Description: `Semi-private room`}}},
`0146`: {ID: `0146`, Name: `Amount type`, Row: []Row{
{ID: `DF`, Description: `Differential`},
{ID: `LM`, Description: `Limit`},
{ID: `PC`, Description: `Percentage`},
{ID: `RT`, Description: `Rate`},
{ID: `UL`, Description: `Unlimited`}}},
`0147`: {ID: `0147`, Name: `Policy type`, Row: []Row{
{ID: `2ANC`, Description: `Second ancillary`},
{ID: `2MMD`, Description: `Second major medical`},
{ID: `3MMD`, Description: `Third major medical`},
{ID: `ANC`, Description: `Ancillary`},
{ID: `MMD`, Description: `Major medical`}}},
`0148`: {ID: `0148`, Name: `Penalty type`, Row: []Row{
{ID: `AT`, Description: `Currency amount`},
{ID: `PC`, Description: `Percentage`}}},
`0149`: {ID: `0149`, Name: `Day type`, Row: []Row{
{ID: `AP`, Description: `Approved`},
{ID: `DE`, Description: `Denied`},
{ID: `PE`, Description: `Pending`}}},
`0150`: {ID: `0150`, Name: `Pre-certification patient type`, Row: []Row{
{ID: `ER`, Description: `Emergency`},
{ID: `IPE`, Description: `Inpatient elective`},
{ID: `OPE`, Description: `Outpatient elective`},
{ID: `UR`, Description: `Urgent`}}},
`0151`: {ID: `0151`, Name: `Second opinion status`, Row: []Row{}},
`0152`: {ID: `0152`, Name: `Second opinion documentation received`, Row: []Row{}},
`0153`: {ID: `0153`, Name: `Value code`, Row: []Row{
{ID: `01`, Description: `Most common semi-private rate`},
{ID: `02`, Description: `Hospital has no semi-private rooms`},
{ID: `04`, Description: `Inpatient professional component charges which are combined billed`},
{ID: `05`, Description: `Professional component included in charges and also billed separate to carrier`},
{ID: `06`, Description: `Medicare blood deductible`},
{ID: `08`, Description: `Medicare life time reserve amount in the first calendar year`},
{ID: `09`, Description: `Medicare co-insurance amount in the first calendar year`},
{ID: `10`, Description: `Lifetime reserve amount in the second calendar year`},
{ID: `11`, Description: `Co-insurance amount in the second calendar year`},
{ID: `12`, Description: `Working aged beneficiary/spouse with employer group health plan`},
{ID: `13`, Description: `ESRD beneficiary in a Medicare coordination period with an employer group health plan`},
{ID: `14`, Description: `No Fault including auto/other`},
{ID: `15`, Description: `Worker's Compensation`},
{ID: `16`, Description: `PHS, or other federal agency`},
{ID: `17`, Description: `Payer code`},
{ID: `21`, Description: `Catastrophic`},
{ID: `22`, Description: `Surplus`},
{ID: `23`, Description: `Recurring monthly incode`},
{ID: `24`, Description: `Medicaid rate code`},
{ID: `30`, Description: `Pre-admission testing`},
{ID: `31`, Description: `Patient liability amount`},
{ID: `37`, Description: `Pints of blood furnished`},
{ID: `38`, Description: `Blood deductible pints`},
{ID: `39`, Description: `Pints of blood replaced`},
{ID: `40`, Description: `New coverage not implemented by HMO (for inpatient service only)`},
{ID: `41`, Description: `Black lung`},
{ID: `42`, Description: `VA`},
{ID: `43`, Description: `Disabled beneficiary under age 64 with LGHP`},
{ID: `44`, Description: `Amount provider agreed to accept from primary payer when this amount is less than charges but higher than payment received,, then a Medicare secondary payment is due`},
{ID: `45`, Description: `Accident hour`},
{ID: `46`, Description: `Number of grace days`},
{ID: `47`, Description: `Any liability insurance`},
{ID: `48`, Description: `Hemoglobin reading`},
{ID: `49`, Description: `Hematocrit reading`},
{ID: `50`, Description: `Physical therapy visits`},
{ID: `51`, Description: `Occupational therapy visits`},
{ID: `52`, Description: `Speech therapy visits`},
{ID: `53`, Description: `Cardiac rehab visits`},
{ID: `56`, Description: `Skilled nurse - home visit hours`},
{ID: `57`, Description: `Home health aide - home visit hours`},
{ID: `58`, Description: `Arterial blood gas`},
{ID: `59`, Description: `Oxygen saturation`},
{ID: `60`, Description: `HHA branch MSA`},
{ID: `67`, Description: `Peritoneal dialysis`},
{ID: `68`, Description: `EPO-drug`},
{ID: `70 ... 72`, Description: `Payer codes`},
{ID: `75 ... 79`, Description: `Payer codes`},
{ID: `80`, Description: `Psychiatric visits`},
{ID: `81`, Description: `Visits subject to co-payment`},
{ID: `A1`, Description: `Deductible payer A`},
{ID: `A2`, Description: `Coinsurance payer A`},
{ID: `A3`, Description: `Estimated responsibility payer A`},
{ID: `X0`, Description: `Service excluded on primary policy`},
{ID: `X4`, Description: `Supplemental coverage`}}},
`0155`: {ID: `0155`, Name: `Accept/application acknowledgment conditions`, Row: []Row{
{ID: `AL`, Description: `Always`},
{ID: `ER`, Description: `Error/reject conditions only`},
{ID: `NE`, Description: `Never`},
{ID: `SU`, Description: `Successful completion only`}}},
`0156`: {ID: `0156`, Name: `Which date/time qualifier`, Row: []Row{
{ID: `ANY`, Description: `Any date/time within a range`},
{ID: `COL`, Description: `Collection date/time, equivalent to film or sample collection date/time`},
{ID: `ORD`, Description: `Order date/time`},
{ID: `RCT`, Description: `Specimen receipt date/time, receipt of specimen in filling ancillary (Lab)`},
{ID: `REP`, Description: `Report date/time, report date/time at filing ancillary (i.e., Lab)`},
{ID: `SCHED`, Description: `Schedule date/time`}}},
`0157`: {ID: `0157`, Name: `Which date/time status qualifier`, Row: []Row{
{ID: `ANY`, Description: `Any status`},
{ID: `CFN`, Description: `Current final value, whether final or corrected`},
{ID: `COR`, Description: `Corrected only (no final with corrections)`},
{ID: `FIN`, Description: `Final only (no corrections)`},
{ID: `PRE`, Description: `Preliminary`},
{ID: `REP`, Description: `Report completion date/time`}}},
`0158`: {ID: `0158`, Name: `Date/time selection qualifier`, Row: []Row{
{ID: `1ST`, Description: `First value within range`},
{ID: `ALL`, Description: `All values within the range`},
{ID: `LST`, Description: `Last value within the range`},
{ID: `REV`, Description: `All values within the range returned in reverse chronological order (This is the default if not otherwise specified.)`}}},
`0159`: {ID: `0159`, Name: `Diet code specification type`, Row: []Row{
{ID: `D`, Description: `Diet`},
{ID: `P`, Description: `Preference`},
{ID: `S`, Description: `Supplement`}}},
`0160`: {ID: `0160`, Name: `Tray type`, Row: []Row{
{ID: `EARLY`, Description: `Early tray`},
{ID: `GUEST`, Description: `Guest tray`},
{ID: `LATE`, Description: `Late tray`},
{ID: `MSG`, Description: `Tray message only`},
{ID: `NO`, Description: `No tray`}}},
`0161`: {ID: `0161`, Name: `Allow substitution`, Row: []Row{
{ID: `G`, Description: `Allow generic substitutions.`},
{ID: `N`, Description: `Substitutions are NOT authorized. (This is the default - null.)`},
{ID: `T`, Description: `Allow therapeutic substitutions`}}},
`0162`: {ID: `0162`, Name: `Route of administration`, Row: []Row{
{ID: `AP`, Description: `Apply Externally`},
{ID: `B`, Description: `Buccal`},
{ID: `DT`, Description: `Dental`},
{ID: `EP`, Description: `Epidural`},
{ID: `ET`, Description: `Endotrachial Tube`},
{ID: `GTT`, Description: `Gastronomy Tube`},
{ID: `GU`, Description: `GU Irrigant`},
{ID: `IA`, Description: `Intra-arterial`},
{ID: `IB`, Description: `Intrabursal`},
{ID: `IC`, Description: `Intracardiac`},
{ID: `ICV`, Description: `Intracervical (uterus)`},
{ID: `ID`, Description: `Intradermal`},
{ID: `IH`, Description: `Inhalation`},
{ID: `IHA`, Description: `Intrahepatic Artery`},
{ID: `IMR`, Description: `Immerse (Soak) Body Part`},
{ID: `IU`, Description: `Intrauterine`},
{ID: `MM`, Description: `Mucous Membrane`},
{ID: `MTH`, Description: `Mouth/Throat`},
{ID: `NG`, Description: `Nasogastric`},
{ID: `NP`, Description: `Nasal Prongs`},
{ID: `NS`, Description: `Nasal`},
{ID: `NT`, Description: `Nasotrachial Tube`},
{ID: `OP`, Description: `Ophthalmic`},
{ID: `OT`, Description: `Otic`},
{ID: `OTH`, Description: `Other/Miscellaneous`},
{ID: `PF`, Description: `Perfusion`},
{ID: `PO`, Description: `Oral`},
{ID: `PR`, Description: `Rectal`},
{ID: `RM`, Description: `Rebreather Mask`},
{ID: `SC`, Description: `Subcutaneous`},
{ID: `SD`, Description: `Soaked Dressing`},
{ID: `SL`, Description: `Sublingual`},
{ID: `TD`, Description: `Transdermal`},
{ID: `TL`, Description: `Translingual`},
{ID: `TP`, Description: `Topical`},
{ID: `TRA`, Description: `Tracheostomy`},
{ID: `UR`, Description: `Urethral`},
{ID: `VG`, Description: `Vaginal`},
{ID: `VM`, Description: `Ventimask`},
{ID: `WND`, Description: `Wound`}}},
`0163`: {ID: `0163`, Name: `Administrative Site`, Row: []Row{
{ID: `BE`, Description: `Bilateral Ears`},
{ID: `BN`, Description: `Bilateral Nares`},
{ID: `BU`, Description: `Buttock`},
{ID: `CT`, Description: `Chest Tube`},
{ID: `LA`, Description: `Left Arm`},
{ID: `LAC`, Description: `Left Anterior Chest`},
{ID: `LACF`, Description: `Left Antecubital Fossa`},
{ID: `LD`, Description: `Left Deltoid`},
{ID: `LE`, Description: `Left Ear`},
{ID: `LEJ`, Description: `Left External Jugular`},
{ID: `LF`, Description: `Left Foot`},
{ID: `LG`, Description: `Left Gluteus Medius`},
{ID: `LH`, Description: `Left Hand`},
{ID: `LIJ`, Description: `Left Internal Jugular`},
{ID: `LLAQ`, Description: `Left Lower Abd Quadrant`},
{ID: `LLFA`, Description: `Left Lower Forearm`},
{ID: `LMFA`, Description: `Left Mid Forearm`},
{ID: `LN`, Description: `Left Naris`},
{ID: `LPC`, Description: `Left Posterior Chest`},
{ID: `LSC`, Description: `Left Subclavian`},
{ID: `LT`, Description: `Left Thigh`},
{ID: `LUA`, Description: `Left Upper Arm`},
{ID: `LUAQ`, Description: `Left Upper Abd Quadrant`},
{ID: `LUFA`, Description: `Left Upper Forearm`},
{ID: `LVG`, Description: `Left Ventragluteal`},
{ID: `LVL`, Description: `Left Vastus Lateralis`},
{ID: `NB`, Description: `Nebulized`},
{ID: `OD`, Description: `Right Eye`},
{ID: `OS`, Description: `Left Eye`},
{ID: `OU`, Description: `Bilateral Eyes`},
{ID: `PA`, Description: `Perianal`},
{ID: `PERIN`, Description: `Perineal`},
{ID: `RA`, Description: `Right Arm`},
{ID: `RAC`, Description: `Right Anterior Chest`},
{ID: `RACF`, Description: `Right Antecubital Fossa`},
{ID: `RD`, Description: `Right Deltoid`},
{ID: `RE`, Description: `Right Ear`},
{ID: `REJ`, Description: `Right External Jugular`},
{ID: `RF`, Description: `Right Foot`},
{ID: `RG`, Description: `Right Gluteus Medius`},
{ID: `RH`, Description: `Right Hand`},
{ID: `RIJ`, Description: `Right Internal Jugular`},
{ID: `RLAQ`, Description: `Rt Lower Abd Quadrant`},
{ID: `RLFA`, Description: `Right Lower Forearm`},
{ID: `RMFA`, Description: `Right Mid Forearm`},
{ID: `RN`, Description: `Right Naris`},
{ID: `RPC`, Description: `Right Posterior Chest`},
{ID: `RSC`, Description: `Right Subclavian`},
{ID: `RT`, Description: `Right Thigh`},
{ID: `RUA`, Description: `Right Upper Arm`},
{ID: `RUAQ`, Description: `Right Upper Abd Quadrant`},
{ID: `RUFA`, Description: `Right Upper Forearm`},
{ID: `RVG`, Description: `Right Ventragluteal`},
{ID: `RVL`, Description: `Right Vastus Lateralis`}}},
`0164`: {ID: `0164`, Name: `Administration device`, Row: []Row{
{ID: `AP`, Description: `Applicator`},
{ID: `BT`, Description: `Buretrol`},
{ID: `HL`, Description: `Heparin Lock`},
{ID: `IPPB`, Description: `IPPB`},
{ID: `IVP`, Description: `IV Pump`},
{ID: `IVS`, Description: `IV Soluset`},
{ID: `MI`, Description: `Metered Inhaler`},
{ID: `NEB`, Description: `Nebulizer`},
{ID: `PCA`, Description: `PCA Pump`}}},
`0165`: {ID: `0165`, Name: `Administration method`, Row: []Row{
{ID: `CH`, Description: `Chew`},
{ID: `DI`, Description: `Dissolve`},
{ID: `DU`, Description: `Dust`},
{ID: `IF`, Description: `Infiltrate`},
{ID: `IR`, Description: `Irrigate`},
{ID: `IS`, Description: `Insert`},
{ID: `IVP`, Description: `IV Push`},
{ID: `IVPB`, Description: `IV Piggyback`},
{ID: `NB`, Description: `Nebulized`},
{ID: `PF`, Description: `Perfuse`},
{ID: `PT`, Description: `Pain`},
{ID: `SH`, Description: `Shampoo`},
{ID: `SO`, Description: `Soak`},
{ID: `WA`, Description: `Wash`},
{ID: `WI`, Description: `Wipe`}}},
`0166`: {ID: `0166`, Name: `RX component type`, Row: []Row{
{ID: `A`, Description: `Additive`},
{ID: `B`, Description: `Base`}}},
`0167`: {ID: `0167`, Name: `Substitution status`, Row: []Row{
{ID: `0`, Description: `No product selection indicated`},
{ID: `1`, Description: `Substitution not allowed by prescriber`},
{ID: `2`, Description: `Substitution allowed - patient requested product dispensed`},
{ID: `3`, Description: `Substitution allowed - pharmacist selected product dispensed`},
{ID: `4`, Description: `Substitution allowed - generic drug not in stock`},
{ID: `5`, Description: `Substitution allowed - brand drug dispensed as a generic`},
{ID: `7`, Description: `Substitution not allowed - brand drug mandated by law`},
{ID: `8`, Description: `Substitution allowed - generic drug not available in marketplace`},
{ID: `G`, Description: `A generic substitution was dispensed.`},
{ID: `N`, Description: `No substitute was dispensed. This is equivalent to the default (null) value.`},
{ID: `T`, Description: `A therapeutic substitution was dispensed.`}}},
`0168`: {ID: `0168`, Name: `Processing priority`, Row: []Row{
{ID: `A`, Description: `As soon as possible (a priority lower than stat)`},
{ID: `B`, Description: `Do at bedside or portable (may be used with other codes)`},
{ID: `C`, Description: `Measure continuously (e.g., arterial line blood pressure)`},
{ID: `P`, Description: `Preoperative (to be done prior to surgery)`},
{ID: `R`, Description: `Routine`},
{ID: `S`, Description: `Stat (do immediately)`},
{ID: `T`, Description: `Timing critical (do as near as possible to requested time)`}}},
`0169`: {ID: `0169`, Name: `Reporting priority`, Row: []Row{
{ID: `C`, Description: `Call back results`},
{ID: `R`, Description: `Rush reporting`}}},
`0170`: {ID: `0170`, Name: `Derived specimen`, Row: []Row{
{ID: `C`, Description: `Child Observation`},
{ID: `N`, Description: `Not Applicable`},
{ID: `P`, Description: `Parent Observation`}}},
`0171`: {ID: `0171`, Name: `Citizenship`, Row: []Row{}},
`0172`: {ID: `0172`, Name: `Veterans military status`, Row: []Row{}},
`0173`: {ID: `0173`, Name: `Coordination of benefits`, Row: []Row{
{ID: `CO`, Description: `Coordination`},
{ID: `IN`, Description: `Independent`}}},
`0174`: {ID: `0174`, Name: `Nature of test/observation`, Row: []Row{
{ID: `A`, Description: `Atomic test/observation (test code or treatment code)`},
{ID: `C`, Description: `Single observation calculated via a rule or formula from other independent observations (e.g., Alveolar--arterial ratio, cardiac output)`},
{ID: `F`, Description: `Functional procedure that may consist of one or more interrelated measures (e.g., glucose tolerance test, creatine clearance), usually done at different times and/or on different specimens`},
{ID: `P`, Description: `Profile or battery consisting of many independent atomic observations (e.g., SMA12, electrolytes), usually done at one instrument on one specimen`},
{ID: `S`, Description: `Superset--a set of batteries or procedures ordered under a single code unit but processed as separate batteries (e.g., routines = CBC, UA, electrolytes) This set indicates that the code being described is used to order multiple test/observation batteries. For example, a client who routinely orders a CBC, a differential, and a thyroxine as an outpatient profile might use a single, special code to order all three test batteries, instead of having to submit three separate order codes.`}}},
`0175`: {ID: `0175`, Name: `Master file identifier code`, Row: []Row{
{ID: `CDM`, Description: `Charge description master file`},
{ID: `CM0`, Description: `Clinical study master`},
{ID: `CM1`, Description: `Clinical study phase master`},
{ID: `CM2`, Description: `Clinical study Data Schedule Master`},
{ID: `LOC`, Description: `Location master file`},
{ID: `OM1`, Description: `Observation test master file segments`},
{ID: `OM2`, Description: `Observation test master file segments`},
{ID: `OM3`, Description: `Observation test master file segments`},
{ID: `OM4`, Description: `Observation test master file segments`},
{ID: `OM5`, Description: `Observation test master file segments`},
{ID: `OM6`, Description: `Observation test master file segments`},
{ID: `PRA`, Description: `Practitioner master file`},
{ID: `STF`, Description: `Staff master file`}}},
`0177`: {ID: `0177`, Name: `Confidentiality code`, Row: []Row{
{ID: `AID`, Description: `AIDS patient`},
{ID: `EMP`, Description: `Employee`},
{ID: `ETH`, Description: `Alcohol/drug treatment patient`},
{ID: `HIV`, Description: `HIV(+) patient`},
{ID: `PSY`, Description: `Psychiatric patient`},
{ID: `R`, Description: `Restricted`},
{ID: `U`, Description: `Usual control`},
{ID: `UWM`, Description: `Unwed mother`},
{ID: `V`, Description: `Very restricted`},
{ID: `VIP`, Description: `Very important person or celebrity`}}},
`0178`: {ID: `0178`, Name: `File level event code`, Row: []Row{
{ID: `REP`, Description: `Replace current version of this master file with the version contained in this message`},
{ID: `UPD`, Description: `Change file records as defined in the record-level event codes for each record that follows`}}},
`0179`: {ID: `0179`, Name: `Response level`, Row: []Row{
{ID: `AL`, Description: `Always. All MFA segments (whether denoting errors or not) must be returned via the application-level acknowledgment message`},
{ID: `ER`, Description: `Error/Reject conditions only. Only MFA segments denoting errors must be returned via the application-level acknowledgment for this message`},
{ID: `NE`, Description: `Never. No application-level response needed`},
{ID: `SU`, Description: `Success. Only MFA segments denoting success must be returned via the application-level acknowledgment for this message`}}},
`0180`: {ID: `0180`, Name: `Record Level Event Code `, Row: []Row{
{ID: `MAC`, Description: `Reactivate`, Comment: `Reactivate deactivated record`},
{ID: `MAD`, Description: `Add`, Comment: `Add record to master file`},
{ID: `MDC`, Description: `Deactivate`, Comment: `Deactivate: discontinue using record in master file, but do not delete from database`},
{ID: `MDL`, Description: `Delete`, Comment: `Delete record from master file`},
{ID: `MUP`, Description: `Update`, Comment: `Update record for master file`}}},
`0181`: {ID: `0181`, Name: `MFN record-level error return`, Row: []Row{
{ID: `S`, Description: `Successful posting of the record defined by the MFE segment`},
{ID: `U`, Description: `Unsuccessful posting of the record defined by the MFE segment`}}},
`0182`: {ID: `0182`, Name: `Staff Type`, Row: []Row{}},
`0183`: {ID: `0183`, Name: `Active/Inactive`, Row: []Row{
{ID: `A`, Description: `Active staff`},
{ID: `I`, Description: `Inactive staff`}}},
`0184`: {ID: `0184`, Name: `Department`, Row: []Row{}},
`0185`: {ID: `0185`, Name: `Preferred method of contact`, Row: []Row{
{ID: `B`, Description: `Beeper Number`},
{ID: `C`, Description: `Cellular Phone Number`},
{ID: `E`, Description: `E-Mail Address (Not In TN Format)`},
{ID: `F`, Description: `FAX Number`},
{ID: `H`, Description: `Home Phone Number`},
{ID: `O`, Description: `Office Phone Number`}}},
`0186`: {ID: `0186`, Name: `Practitioner Category`, Row: []Row{}},
`0187`: {ID: `0187`, Name: `Provider billing`, Row: []Row{
{ID: `I`, Description: `Institution bills for provider`},
{ID: `P`, Description: `Provider does own billing`}}},
`0188`: {ID: `0188`, Name: `Operator ID`, Row: []Row{}},
`0189`: {ID: `0189`, Name: `Ethnic group`, Row: []Row{}},
`0190`: {ID: `0190`, Name: `Address type`, Row: []Row{
{ID: `B`, Description: `Firm/Business`},
{ID: `BA`, Description: `Bad address`},
{ID: `BDL`, Description: `Birth delivery location (address where birth occurred)`},
{ID: `BR`, Description: `Residence at birth (home address at time of birth)`},
{ID: `C`, Description: `Current Or Temporary`},
{ID: `F`, Description: `Country Of Origin`},
{ID: `H`, Description: `Home`},
{ID: `L`, Description: `Legal Address`},
{ID: `M`, Description: `Mailing`},
{ID: `N`, Description: `Birth (nee) (birth address, not otherwise specified)`},
{ID: `O`, Description: `Office`},
{ID: `P`, Description: `Permanent`},
{ID: `RH`, Description: `Registry home. Refers to the information system, typically managed by a public health agency, that stores patient information such as immunization histories or cancer data, regardless of where the patient obtains services.`}}},
`0191`: {ID: `0191`, Name: `Type of referenced data`, Row: []Row{
{ID: `AP`, Description: `Other application data, typically uninterpreted binary data`, Comment: `(new with HL7 v 2.3)`},
{ID: `Application`, Description: `Other application data, typically uninterpreted binary data`, Comment: `(HL7 V2.3 and later)`},
{ID: `AU`, Description: `Audio data`, Comment: `(new with HL7 v 2.3)`},
{ID: `Audio`, Description: `Audio data`, Comment: `(HL7 V2.3 and later)`},
{ID: `FT`, Description: `Formatted text`, Comment: `(HL7 V2.2 only)`},
{ID: `FT`, Description: `Formatted text`},
{ID: `IM`, Description: `Image data`, Comment: `(new with HL7 v 2.3)`},
{ID: `Image`, Description: `Image data`, Comment: `(HL7 V2.3 and later)`},
{ID: `NS`, Description: `Non-scanned image`, Comment: `(HL7 V2.2 only)`},
{ID: `NS`, Description: `Non-scanned image`},
{ID: `SD`, Description: `Scanned document`, Comment: `(HL7 V2.2 only)`},
{ID: `SI`, Description: `Scanned image`, Comment: `(HL7 V2.2 only)`},
{ID: `SI`, Description: `Scanned image`},
{ID: `TEXT`, Description: `Machine readable text document`, Comment: `(HL7 V2.3.1 and later)`},
{ID: `TX`, Description: `Machine readable text document`, Comment: `(HL7 V2.2 only)`},
{ID: `TX`, Description: `Machine readable text document`}}},
`0193`: {ID: `0193`, Name: `Amount class`, Row: []Row{
{ID: `AT`, Description: `Amount`},
{ID: `LM`, Description: `Limit`},
{ID: `PC`, Description: `Percentage`},
{ID: `UL`, Description: `Unlimited`}}},
`0200`: {ID: `0200`, Name: `Name type`, Row: []Row{
{ID: `A`, Description: `Alias Name`},
{ID: `B`, Description: `Name at Birth`},
{ID: `C`, Description: `Adopted Name`},
{ID: `D`, Description: `Display Name`},
{ID: `L`, Description: `Legal Name`},
{ID: `M`, Description: `Maiden Name`},
{ID: `P`, Description: `Name of Partner/Spouse`},
{ID: `S`, Description: `Coded Pseudo-Name to ensure anonymity`},
{ID: `T`, Description: `Tribal/Community Name`},
{ID: `U`, Description: `Unspecified`}}},
`0201`: {ID: `0201`, Name: `Telecommunication use code`, Row: []Row{
{ID: `ASN`, Description: `Answering Service Number`},
{ID: `BPN`, Description: `Beeper Number`},
{ID: `EMR`, Description: `Emergency Number`},
{ID: `NET`, Description: `Network (email) Address`},
{ID: `ORN`, Description: `Other Residence Number`},
{ID: `PRN`, Description: `Primary Residence Number`},
{ID: `VHN`, Description: `Vacation Home Number`},
{ID: `WPN`, Description: `Work Number`}}},
`0202`: {ID: `0202`, Name: `Telecommunication equipment type`, Row: []Row{
{ID: `BP`, Description: `Beeper`},
{ID: `CP`, Description: `Cellular Phone`},
{ID: `FX`, Description: `Fax`},
{ID: `Internet`, Description: `Internet Address: Use Only If TelecommunicationUse Code Is NET`},
{ID: `MD`, Description: `Modem`},
{ID: `PH`, Description: `Telephone`},
{ID: `X.400`, Description: `X.400 email address: Use Only If TelecommunicationUse Code Is NET`}}},
`0203`: {ID: `0203`, Name: `Identifier type`, Row: []Row{
{ID: `AM`, Description: `American Express`},
{ID: `AN`, Description: `Account number`},
{ID: `BR`, Description: `Birth registry number`},
{ID: `DI`, Description: `Diners Club card`},
{ID: `DL`, Description: `Drivers license number`},
{ID: `DN`, Description: `Doctor number`},
{ID: `DS`, Description: `Discover Card`},
{ID: `EI`, Description: `Employee number`},
{ID: `EN`, Description: `Employer number`},
{ID: `FI`, Description: `Facility ID`},
{ID: `GI`, Description: `Guarantor internal identifier`},
{ID: `GN`, Description: `Guarantor external identifier`},
{ID: `LN`, Description: `License number`},
{ID: `LR`, Description: `Local Registry ID`},
{ID: `MA`, Description: `Medicaid number`},
{ID: `MC`, Description: `Medicare number`},
{ID: `MR`, Description: `Medical record number`},
{ID: `MS`, Description: `MasterCard`},
{ID: `NE`, Description: `National employer identifier`},
{ID: `NH`, Description: `National Health Plan Identifier`},
{ID: `NI`, Description: `National unique individual identifier`},
{ID: `NNxxx`, Description: `National Person Identifier where the xxx is the ISO table 3166 3-character (alphabetic) country code`},
{ID: `NPI`, Description: `National provider identifier`},
{ID: `PI`, Description: `Patient internal identifier`},
{ID: `PN`, Description: `Person number`},
{ID: `PRN`, Description: `Provider number`},
{ID: `PT`, Description: `Patient external identifier`},
{ID: `RR`, Description: `Railroad Retirement number`},
{ID: `RRI`, Description: `Regional registry ID`},
{ID: `SL`, Description: `State license`},
{ID: `SR`, Description: `State registry ID`},
{ID: `SS`, Description: `Social Security number`},
{ID: `U`, Description: `Unspecified`},
{ID: `UPIN`, Description: `Medicare/HCFAs Universal Physician Identification numbers`},
{ID: `VN`, Description: `Visit number`},
{ID: `VS`, Description: `VISA`},
{ID: `WC`, Description: `WIC identifier`},
{ID: `XX`, Description: `Organization identifier`}}},
`0204`: {ID: `0204`, Name: `Organizational name type`, Row: []Row{
{ID: `A`, Description: `Alias name`},
{ID: `D`, Description: `Display name`},
{ID: `L`, Description: `Legal name`},
{ID: `SL`, Description: `Stock exchange listing name`}}},
`0205`: {ID: `0205`, Name: `Price type`, Row: []Row{
{ID: `AP`, Description: `administrative price or handling fee`},
{ID: `DC`, Description: `direct unit cost`},
{ID: `IC`, Description: `indirect unit cost`},
{ID: `PF`, Description: `professional fee for performing provider`},
{ID: `TF`, Description: `technology fee for use of equipment`},
{ID: `TP`, Description: `total price`},
{ID: `UP`, Description: `unit price, may be based on length of procedure or service`}}},
`0206`: {ID: `0206`, Name: `Segment action code`, Row: []Row{
{ID: `A`, Description: `Add/Insert`},
{ID: `D`, Description: `Delete`},
{ID: `U`, Description: `Update`}}},
`0207`: {ID: `0207`, Name: `Processing mode`, Row: []Row{
{ID: ``, Description: `Not present (the default, meaning current processing)`},
{ID: `a`, Description: `Archive`},
{ID: `i`, Description: `Initial load`},
{ID: `r`, Description: `Restore from archive`}}},
`0208`: {ID: `0208`, Name: `Query response status`, Row: []Row{
{ID: `AE`, Description: `Application error`},
{ID: `AR`, Description: `Application reject`},
{ID: `NF`, Description: `No data found, no errors`},
{ID: `OK`, Description: `Data found, no errors (this is the default)`}}},
`0209`: {ID: `0209`, Name: `Relational operator`, Row: []Row{
{ID: `CT`, Description: `Contains`},
{ID: `EQ`, Description: `Equal`},
{ID: `GE`, Description: `Greater than or equal`},
{ID: `GN`, Description: `Generic`},
{ID: `GT`, Description: `Greater than`},
{ID: `LE`, Description: `Less than or equal`},
{ID: `LT`, Description: `Less than`},
{ID: `NE`, Description: `Not Equal`}}},
`0210`: {ID: `0210`, Name: `Relational conjunction`, Row: []Row{
{ID: `AND`, Description: `Default`},
{ID: `OR`}}},
`0211`: {ID: `0211`, Name: `Alternate character sets`, Row: []Row{
{ID: `8859/1`, Description: `The printable characters from the ISO 8859/1 Character set`},
{ID: `8859/2`, Description: `The printable characters from the ISO 8859/2 Character set`},
{ID: `8859/3`, Description: `The printable characters from the ISO 8859/3 Character set`},
{ID: `8859/4`, Description: `The printable characters from the ISO 8859/4 Character set`},
{ID: `8859/5`, Description: `The printable characters from the ISO 8859/5 Character set`},
{ID: `8859/6`, Description: `The printable characters from the ISO 8859/6 Character set`},
{ID: `8859/7`, Description: `The printable characters from the ISO 8859/7 Character set`},
{ID: `8859/8`, Description: `The printable characters from the ISO 8859/8 Character set`},
{ID: `8859/9`, Description: `The printable characters from the ISO 8859/9 Character set`},
{ID: `ASCII`, Description: `The printable 7-bit ASCII character set. (This is the default if this field is omitted)`},
{ID: `ISO IR14`, Description: `Code for Information Exchange (one byte)(JIS X 02011976). Note that the code contains a space, i.e. "ISO IR14".`},
{ID: `ISO IR159`, Description: `Code of the supplementary Japanese Graphic Character set for information interchange (JIS X 0212-1990), Note that the code contains a space, i.e. "ISO IR159".`},
{ID: `ISO IR87`, Description: `Code for the Japanese Graphic Character set for information interchange (JIS X 0208-1990), Note that the code contains a space, i.e. "ISO IR87".`},
{ID: `UNICODE`, Description: `The world wide character standard from ISO/IEC 10646-1-1993[3]`}}},
`0212`: {ID: `0212`, Name: `Nationality`, Row: []Row{}},
`0213`: {ID: `0213`, Name: `Purge status`, Row: []Row{
{ID: `D`, Description: `The visit is marked for deletion and the user cannot enter new data against it.`},
{ID: `I`, Description: `The visit is marked inactive and the user cannot enter new data against it.`},
{ID: `P`, Description: `Marked for purge. User is no longer able to update the visit.`}}},
`0214`: {ID: `0214`, Name: `Special program codes`, Row: []Row{}},
`0215`: {ID: `0215`, Name: `Publicity code`, Row: []Row{}},
`0216`: {ID: `0216`, Name: `Patient status code`, Row: []Row{}},
`0217`: {ID: `0217`, Name: `Visit priority code`, Row: []Row{}},
`0218`: {ID: `0218`, Name: `Patient charge adjustment`, Row: []Row{}},
`0219`: {ID: `0219`, Name: `Recurring service`, Row: []Row{}},
`0220`: {ID: `0220`, Name: `Living arrangement`, Row: []Row{
{ID: `A`, Description: `Alone`},
{ID: `F`, Description: `Family`},
{ID: `I`, Description: `Institution`},
{ID: `R`, Description: `Relative`},
{ID: `S`, Description: `Spouse Only`},
{ID: `U`, Description: `Unknown`}}},
`0222`: {ID: `0222`, Name: `Contact reason`, Row: []Row{}},
`0223`: {ID: `0223`, Name: `Living dependency`, Row: []Row{
{ID: `CB`, Description: `Common Bath`},
{ID: `D`, Description: `Spouse dependent`},
{ID: `M`, Description: `Medical Supervision Required`},
{ID: `S`, Description: `Small children`},
{ID: `WU`, Description: `Walk up`}}},
`0224`: {ID: `0224`, Name: `Transport arranged`, Row: []Row{
{ID: `A`, Description: `Arranged`},
{ID: `N`, Description: `Not Arranged`},
{ID: `U`, Description: `Unknown`}}},
`0225`: {ID: `0225`, Name: `Escort required`, Row: []Row{
{ID: `N`, Description: `Not Required`},
{ID: `R`, Description: `Required`},
{ID: `U`, Description: `Unknown`}}},
`0227`: {ID: `0227`, Name: `Manufacturers of vaccines`, Row: []Row{
{ID: `AB`, Description: `Abbott Laboratories`},
{ID: `AD`, Description: `Adams Laboratories`},
{ID: `ALP`, Description: `Alpha Therapeutic Corporation`},
{ID: `AR`, Description: `Armour (Inactive - use CEN)`},
{ID: `AVI`, Description: `Aviron`},
{ID: `BA`, Description: `Baxter Healthcare Corporation`},
{ID: `BAY`, Description: `Bayer Corporation (includes Miles, Inc. and Cutter Laboratories)`},
{ID: `BP`, Description: `Berna Products (Inactive - use BPC)`},
{ID: `BPC`, Description: `Berna Products Corporation (includes Swiss Serum and Vaccine Institute Berna)`},
{ID: `CEN`, Description: `Centeon L.L.C. (includes Armour Pharmaceutical Company)`},
{ID: `CHI`, Description: `Chiron Corporation`},
{ID: `CON`, Description: `Connaught (inactive - use PMC)`},
{ID: `EVN`, Description: `Evans Medical Limited`},
{ID: `GRE`, Description: `Greer Laboratories, Inc.`},
{ID: `IAG`, Description: `Immuno International AG`},
{ID: `IM`, Description: `Merieux (inactive - Use PMC)`},
{ID: `IUS`, Description: `Immuno-US, Inc.`},
{ID: `JPN`, Description: `The Research Foundation for Microbial Diseases of Osaka University (BIKEN)`},
{ID: `KGC`, Description: `Korea Green Cross Corporation`},
{ID: `LED`, Description: `Lederle (inactive - use WAL)`},
{ID: `MA`, Description: `Massachusetts Public Health Biologic Laboratories)`},
{ID: `MED`, Description: `Medimmune, Inc.`},
{ID: `MIL`, Description: `Miles (inactive - use BAY)`},
{ID: `MIP`, Description: `Michigan Biologic Products Institute`},
{ID: `MSD`, Description: `Merck & Co., Inc.`},
{ID: `NAB`, Description: `NABI (formerly North American Biologicals, Inc.)`},
{ID: `NAV`, Description: `North American Vaccine, Inc.`},
{ID: `NOV`, Description: `Novartis Pharmaceutical Corporation`},
{ID: `NYB`, Description: `New York Blood Center`},
{ID: `ORT`, Description: `Ortho Diagnostic Systems, Inc.`},
{ID: `OTC`, Description: `Organon Teknika Corporation`},
{ID: `OTH`, Description: `Other`},
{ID: `PD`, Description: `Parkdale Pharmaceuticals (formerly Parke-Davis)`},
{ID: `PMC`, Description: `Pasteur Merieux Connaught (includes Connaught Laboratories and Pasteur Merieux)`},
{ID: `PRX`, Description: `Praxis Biologics (inactive - use WAL)`},
{ID: `SCL`, Description: `Sclavo, Inc.`},
{ID: `SI`, Description: `Swiss Serum and Vaccine Inst. (inactive - use BPC)`},
{ID: `SKB`, Description: `SmithKline Beecham`},
{ID: `UNK`, Description: `Unknown manufacturer`},
{ID: `USA`, Description: `United States Army Medical Research and Materiel Command`},
{ID: `WA`, Description: `Wyeth-Ayerst (inactive - use WAL)`},
{ID: `WAL`, Description: `Wyeth-Ayerst (includes Wyeth-Lederle Vaccines and Pediatrics, Wyeth Laboratories, Lederle Laboratories, and Praxis Biologics)`}}},
`0228`: {ID: `0228`, Name: `Diagnosis classification`, Row: []Row{
{ID: `C`, Description: `Consultation`},
{ID: `D`, Description: `Diagnosis`},
{ID: `I`, Description: `Invasive procedure not classified elsewhere (I.V., catheter, etc.)`},
{ID: `M`, Description: `Medication (antibiotic)`},
{ID: `O`, Description: `Other`},
{ID: `R`, Description: `Radiological scheduling (not using ICDA codes)`},
{ID: `S`, Description: `Sign and symptom`},
{ID: `T`, Description: `Tissue diagnosis`}}},
`0229`: {ID: `0229`, Name: `DRG payor`, Row: []Row{
{ID: `C`, Description: `Champus`},
{ID: `G`, Description: `Managed Care Organization`},
{ID: `M`, Description: `Medicare`}}},
`0230`: {ID: `0230`, Name: `Procedure functional type`, Row: []Row{
{ID: `A`, Description: `Anesthesia`},
{ID: `D`, Description: `Diagnostic procedure`},
{ID: `I`, Description: `Invasive procedure not classified elsewhere (e.g., IV, catheter, etc.)`},
{ID: `P`, Description: `Procedure for treatment (therapeutic, including operations)`}}},
`0231`: {ID: `0231`, Name: `Student status`, Row: []Row{
{ID: `F`, Description: `Full-time student`},
{ID: `N`, Description: `Not a student`},
{ID: `P`, Description: `Part-time student`}}},
`0232`: {ID: `0232`, Name: `Insurance company contact reason`, Row: []Row{
{ID: `01`, Description: `Medicare claim status`},
{ID: `02`, Description: `Medicaid claim status`},
{ID: `03`, Description: `Name/address change`}}},
`0233`: {ID: `0233`, Name: `Non-concur code/description`, Row: []Row{}},
`0234`: {ID: `0234`, Name: `Report timing`, Row: []Row{
{ID: `10D`, Description: `10 day report`},
{ID: `15D`, Description: `15 day report`},
{ID: `30D`, Description: `30 day report`},
{ID: `3D`, Description: `3 day report`},
{ID: `7D`, Description: `7 day report`},
{ID: `AD`, Description: `Additional information`},
{ID: `CO`, Description: `Correction`},
{ID: `DE`, Description: `Device evaluation`},
{ID: `PD`, Description: `Periodic`},
{ID: `RQ`, Description: `Requested information`}}},
`0235`: {ID: `0235`, Name: `Report source`, Row: []Row{
{ID: `C`, Description: `Clinical trial`},
{ID: `D`, Description: `Database/registry/poison control center`},
{ID: `E`, Description: `Distributor`},
{ID: `H`, Description: `Health professional`},
{ID: `L`, Description: `Literature`},
{ID: `M`, Description: `Manufacturer/marketing authority holder`},
{ID: `N`, Description: `Non-healthcare professional`},
{ID: `O`, Description: `Other`},
{ID: `P`, Description: `Patient`},
{ID: `R`, Description: `Regulatory agency`}}},
`0236`: {ID: `0236`, Name: `Event reported to`, Row: []Row{
{ID: `D`, Description: `Distributor`},
{ID: `L`, Description: `Local facility/user facility`},
{ID: `M`, Description: `Manufacturer`},
{ID: `R`, Description: `Regulatory agency`}}},
`0237`: {ID: `0237`, Name: `Event qualification`, Row: []Row{
{ID: `A`, Description: `Abuse`},
{ID: `B`, Description: `Unexpected beneficial effect`},
{ID: `D`, Description: `Dependency`},
{ID: `I`, Description: `Interaction`},
{ID: `L`, Description: `Lack of expect therapeutic effect`},
{ID: `M`, Description: `Misuse`},
{ID: `O`, Description: `Overdose`},
{ID: `W`, Description: `Drug withdrawal`}}},
`0238`: {ID: `0238`, Name: `Event seriousness`, Row: []Row{
{ID: `N`, Description: `No`},
{ID: `S`, Description: `Significant`},
{ID: `Y`, Description: `Yes`}}},
`0239`: {ID: `0239`, Name: `Event expected`, Row: []Row{
{ID: `N`, Description: `No`},
{ID: `U`, Description: `Unknown`},
{ID: `Y`, Description: `Yes`}}},
`0240`: {ID: `0240`, Name: `Event consequence`, Row: []Row{
{ID: `C`, Description: `Congenital anomaly/birth defect`},
{ID: `D`, Description: `Death`},
{ID: `H`, Description: `Caused hospitalized`},
{ID: `I`, Description: `Incapacity which is significant, persistent or permanent`},
{ID: `J`, Description: `Disability which is significant, persistent or permanent`},
{ID: `L`, Description: `Life threatening`},
{ID: `O`, Description: `Other`},
{ID: `P`, Description: `Prolonged hospitalization`},
{ID: `R`, Description: `Required intervention to prevent permanent impairment/damage`}}},
`0241`: {ID: `0241`, Name: `Patient outcome`, Row: []Row{
{ID: `D`, Description: `Died`},
{ID: `F`, Description: `Fully recovered`},
{ID: `N`, Description: `Not recovering/unchanged`},
{ID: `R`, Description: `Recovering`},
{ID: `S`, Description: `Sequelae`},
{ID: `U`, Description: `Unknown`},
{ID: `W`, Description: `Worsening`}}},
`0242`: {ID: `0242`, Name: `Primary observer’s qualification`, Row: []Row{
{ID: `C`, Description: `Health care consumer/patient`},
{ID: `H`, Description: `Other health professional`},
{ID: `L`, Description: `Lawyer/attorney`},
{ID: `M`, Description: `Mid-level professional (nurse, nurse practitioner, physician's assistant)`},
{ID: `O`, Description: `Other non-health professional`},
{ID: `P`, Description: `Physician (osteopath, homeopath)`},
{ID: `R`, Description: `Pharmacist`}}},
`0243`: {ID: `0243`, Name: `Identity may be divulged`, Row: []Row{
{ID: `N`, Description: `No`},
{ID: `NA`, Description: `Not applicable`},
{ID: `Y`, Description: `Yes`}}},
`0244`: {ID: `0244`, Name: `Single use device`, Row: []Row{}},
`0245`: {ID: `0245`, Name: `Product problem`, Row: []Row{}},
`0246`: {ID: `0246`, Name: `Product available for inspection`, Row: []Row{}},
`0247`: {ID: `0247`, Name: `Status of evaluation`, Row: []Row{
{ID: `A`, Description: `Evaluation anticipated, but not yet begun`},
{ID: `C`, Description: `Product received in condition which made analysis impossible`},
{ID: `D`, Description: `Product discarded -- unable to follow up`},
{ID: `I`, Description: `Product remains implanted -- unable to follow up`},
{ID: `K`, Description: `Problem already known, no evaluation necessary`},
{ID: `O`, Description: `Other`},
{ID: `P`, Description: `Evaluation in progress`},
{ID: `Q`, Description: `Product under quarantine -- unable to follow up`},
{ID: `R`, Description: `Product under recall/corrective action`},
{ID: `U`, Description: `Product unavailable for follow up investigation`},
{ID: `X`, Description: `Product not made by company`},
{ID: `Y`, Description: `Evaluation completed`}}},
`0248`: {ID: `0248`, Name: `Product source`, Row: []Row{
{ID: `A`, Description: `Actual product involved in incident was evaluated`},
{ID: `L`, Description: `A product from the same lot as the actual product involved was evaluated`},
{ID: `N`, Description: `A product from a controlled/non-related inventory was evaluated`},
{ID: `R`, Description: `A product from a reserve sample was evaluated`}}},
`0249`: {ID: `0249`, Name: `Generic product`, Row: []Row{}},
`0250`: {ID: `0250`, Name: `Relatedness assessment`, Row: []Row{
{ID: `H`, Description: `Highly probable`},
{ID: `I`, Description: `Improbable`},
{ID: `M`, Description: `Moderately probable`},
{ID: `N`, Description: `Not related`},
{ID: `S`, Description: `Somewhat probable`}}},
`0251`: {ID: `0251`, Name: `Action taken in response to the event`, Row: []Row{
{ID: `DI`, Description: `Product dose or frequency of use increased`},
{ID: `DR`, Description: `Product dose or frequency of use reduced`},
{ID: `N`, Description: `None`},
{ID: `OT`, Description: `Other`},
{ID: `WP`, Description: `Product withdrawn permanently`},
{ID: `WT`, Description: `Product withdrawn temporarily`}}},
`0252`: {ID: `0252`, Name: `Causality observations`, Row: []Row{
{ID: `AW`, Description: `Abatement of event after product withdrawn`},
{ID: `BE`, Description: `Event recurred after product reintroduced`},
{ID: `DR`, Description: `Dose response observed`},
{ID: `EX`, Description: `Alternative explanations for the event available`},
{ID: `IN`, Description: `Event occurred after product introduced`},
{ID: `LI`, Description: `Literature reports association of product with event`},
{ID: `OE`, Description: `Occurrence of event was confirmed by objective evidence`},
{ID: `OT`, Description: `Other`},
{ID: `PL`, Description: `Effect observed when patient receives placebo`},
{ID: `SE`, Description: `Similar events in past for this patient`},
{ID: `TC`, Description: `Toxic levels of product documented in blood or body fluids`}}},
`0253`: {ID: `0253`, Name: `Indirect exposure mechanism`, Row: []Row{
{ID: `B`, Description: `Breast milk`},
{ID: `F`, Description: `Father`},
{ID: `O`, Description: `Other`},
{ID: `P`, Description: `Transplacental`},
{ID: `X`, Description: `Blood product`}}},
`0254`: {ID: `0254`, Name: `Kind of quantity`, Row: []Row{
{ID: `ABS`, Description: `Absorbance`},
{ID: `ACNC`, Description: `Concentration, Arbitrary Substance`},
{ID: `ACT`, Description: `*Activity`},
{ID: `APER`, Description: `Appearance`},
{ID: `ARB`, Description: `*Arbitrary`},
{ID: `AREA`, Description: `Area`},
{ID: `ASPECT`, Description: `Aspect`},
{ID: `CACT`, Description: `*Catalytic Activity`},
{ID: `CCNT`, Description: `*Catalytic Content`},
{ID: `CCRTO`, Description: `Catalytic Concentration Ratio`},
{ID: `CFR`, Description: `*Catalytic Fraction`},
{ID: `CLAS`, Description: `Class`},
{ID: `CNC`, Description: `*Catalytic Concentration`},
{ID: `CNST`, Description: `*Constant`},
{ID: `COEF`, Description: `*Coefficient`},
{ID: `COLOR`, Description: `Color`},
{ID: `CONS`, Description: `Consistency`},
{ID: `CRAT`, Description: `*Catalytic Rate`},
{ID: `CRTO`, Description: `Catalytic Ratio`},
{ID: `DEN`, Description: `Density`},
{ID: `DEV`, Description: `Device`},
{ID: `DIFF`, Description: `*Difference`},
{ID: `ELAS`, Description: `Elasticity`},
{ID: `ELPOT`, Description: `Electrical Potential (Voltage)`},
{ID: `ELRAT`, Description: `Electrical current (amperage)`},
{ID: `ELRES`, Description: `Electrical Resistance`},
{ID: `ENGR`, Description: `Energy`},
{ID: `ENT`, Description: `*Entitic`},
{ID: `ENTCAT`, Description: `*Entitic Catalytic Activity`},
{ID: `ENTNUM`, Description: `*Entitic Number`},
{ID: `ENTSUB`, Description: `*Entitic Substance of Amount`},
{ID: `ENTVOL`, Description: `*Entitic Volume`},
{ID: `EQL`, Description: `Equilibrium`},
{ID: `FORCE`, Description: `Mechanical force`},
{ID: `FREQ`, Description: `Frequency`},
{ID: `IMP`, Description: `Impression/ interpretation of study`},
{ID: `KINV`, Description: `*Kinematic Viscosity`},
{ID: `LEN`, Description: `Length`},
{ID: `LINC`, Description: `*Length Increment`},
{ID: `LIQ`, Description: `*Liquefaction`},
{ID: `MASS`, Description: `*Mass`},
{ID: `MCNC`, Description: `*Mass Concentration`},
{ID: `MCNT`, Description: `Mass Content`},
{ID: `MCRTO`, Description: `*Mass Concentration Ratio`},
{ID: `MFR`, Description: `*Mass Fraction`},
{ID: `MGFLUX`, Description: `Magnetic flux`},
{ID: `MINC`, Description: `*Mass Increment`},
{ID: `MORPH`, Description: `Morphology`},
{ID: `MOTIL`, Description: `Motility`},
{ID: `MRAT`, Description: `*Mass Rate`},
{ID: `MRTO`, Description: `*Mass Ratio`},
{ID: `NCNC`, Description: `*Number Concentration`},
{ID: `NCNT`, Description: `*Number Content`},
{ID: `NFR`, Description: `*Number Fraction`},
{ID: `NRTO`, Description: `*Number Ratio`},
{ID: `NUM`, Description: `*Number`},
{ID: `OD`, Description: `Optical density`},
{ID: `OSMOL`, Description: `*Osmolality`},
{ID: `PRES`, Description: `*Pressure (Partial)`},
{ID: `PRID`, Description: `Presence/Identity/Existence`},
{ID: `PWR`, Description: `Power (wattage)`},
{ID: `RANGE`, Description: `*Ranges`},
{ID: `RATIO`, Description: `*Ratios`},
{ID: `RCRLTM`, Description: `*Reciprocal Relative Time`},
{ID: `RDEN`, Description: `*Relative Density`},
{ID: `REL`, Description: `*Relative`},
{ID: `RLMCNC`, Description: `*Relative Mass Concentration`},
{ID: `RLSCNC`, Description: `*Relative Substance Concentration`},
{ID: `RLTM`, Description: `*Relative Time`},
{ID: `SATFR`, Description: `*Saturation Fraction`},
{ID: `SCNC`, Description: `*Substance Concentration`},
{ID: `SCNCIN`, Description: `*Substance Concentration Increment`},
{ID: `SCNT`, Description: `*Substance Content`},
{ID: `SCNTR`, Description: `*Substance Content Rate`},
{ID: `SCRTO`, Description: `*Substance Concentration Ratio`},
{ID: `SFR`, Description: `*Substance Fraction`},
{ID: `SHAPE`, Description: `Shape`},
{ID: `SMELL`, Description: `Smell`},
{ID: `SRAT`, Description: `*Substance Rate`},
{ID: `SRTO`, Description: `*Substance Ratio`},
{ID: `SUB`, Description: `*Substance Amount`},
{ID: `SUSC`, Description: `*Susceptibility`},
{ID: `TASTE`, Description: `Taste`},
{ID: `TEMP`, Description: `*Temperature`},
{ID: `TEMPDF`, Description: `*Temperature Difference`},
{ID: `TEMPIN`, Description: `*Temperature Increment`},
{ID: `THRMCNC`, Description: `*Threshold Mass Concentration`},
{ID: `THRSCNC`, Description: `*Threshold Substance Concentration`},
{ID: `TIME`, Description: `*Time (e.g. seconds)`},
{ID: `TITR`, Description: `*Dilution Factor (Titer)`},
{ID: `TMDF`, Description: `*Time Difference`},
{ID: `TMSTP`, Description: `*Time Stamp -- Date and Time`},
{ID: `TRTO`, Description: `*Time Ratio`},
{ID: `TYPE`, Description: `*Type`},
{ID: `VCNT`, Description: `*Volume Content`},
{ID: `VEL`, Description: `*Velocity`},
{ID: `VELRT`, Description: `*Velocity Ratio`},
{ID: `VFR`, Description: `*Volume Fraction`},
{ID: `VISC`, Description: `*Viscosity`},
{ID: `VOL`, Description: `*Volume`},
{ID: `VRAT`, Description: `*Volume Rate`},
{ID: `VRTO`, Description: `*Volume Ratio`}}},
`0255`: {ID: `0255`, Name: `Duration categories`, Row: []Row{
{ID: `* (star)`, Description: `Life of the "unit." Used for blood products.`},
{ID: `12H`, Description: `12 hours`},
{ID: `1H`, Description: `1 hour`},
{ID: `1L`, Description: `1 months (30 days)`},
{ID: `1W`, Description: `1 week`},
{ID: `2.5H`, Description: `2½ hours`},
{ID: `24H`, Description: `24 hours`},
{ID: `2D`, Description: `2 days`},
{ID: `2H`, Description: `2 hours`},
{ID: `2L`, Description: `2 months`},
{ID: `2W`, Description: `2 weeks`},
{ID: `30M`, Description: `30 minutes`},
{ID: `3D`, Description: `3 days`},
{ID: `3H`, Description: `3 hours`},
{ID: `3L`, Description: `3 months`},
{ID: `3W`, Description: `3 weeks`},
{ID: `4D`, Description: `4 days`},
{ID: `4H`, Description: `4 hours`},
{ID: `4W`, Description: `4 weeks`},
{ID: `5D`, Description: `5 days`},
{ID: `5H`, Description: `5 hours`},
{ID: `6D`, Description: `6 days`},
{ID: `6H`, Description: `6 hours`},
{ID: `7H`, Description: `7 hours`},
{ID: `8H`, Description: `8 hours`},
{ID: `PT`, Description: `To identify measures at a point in time. This is a synonym for "spot" or "random" as applied to urine measurements.`}}},
`0258`: {ID: `0258`, Name: `Relationship modifier`, Row: []Row{
{ID: `BPU`, Description: `Blood product unit`},
{ID: `CONTROL`, Description: `Control`},
{ID: `DONOR`, Description: `Donor`},
{ID: `PATIENT`, Description: `Patient`}}},
`0259`: {ID: `0259`, Name: `Modality`, Row: []Row{
{ID: `AS`, Description: `Angioscopy`},
{ID: `BS`, Description: `Biomagnetic imaging`},
{ID: `CD`, Description: `Color flow doppler`},
{ID: `CP`, Description: `Colposcopy`},
{ID: `CR`, Description: `Computed radiography`},
{ID: `CS`, Description: `Cystoscopy`},
{ID: `CT`, Description: `Computed tomography`},
{ID: `DD`, Description: `Duplex doppler`},
{ID: `DG`, Description: `Diapanography`},
{ID: `DM`, Description: `Digital microscopy`},
{ID: `EC`, Description: `Echocardiography`},
{ID: `ES`, Description: `Endoscopy`},
{ID: `FA`, Description: `Fluorescein angiography`},
{ID: `FS`, Description: `Fundoscopy`},
{ID: `LP`, Description: `Laparoscopy`},
{ID: `LS`, Description: `Laser surface scan`},
{ID: `MA`, Description: `Magnetic resonance angiography`},
{ID: `MS`, Description: `Magnetic resonance spectroscopy`},
{ID: `NM`, Description: `Nuclear Medicine (radioisotope study)`},
{ID: `OT`, Description: `Other`},
{ID: `PT`, Description: `Positron emission tomography (PET)`},
{ID: `RF`, Description: `Radio fluoroscopy`},
{ID: `ST`, Description: `Single photon emission computed tomography (SPECT)`},
{ID: `TG`, Description: `Thermography`},
{ID: `US`, Description: `Ultrasound`},
{ID: `XA`, Description: `X-ray Angiography`}}},
`0260`: {ID: `0260`, Name: `Patient location type`, Row: []Row{
{ID: `B`, Description: `Bed`},
{ID: `C`, Description: `Clinic`},
{ID: `D`, Description: `Department`},
{ID: `E`, Description: `Exam Room`},
{ID: `L`, Description: `Other Location`},
{ID: `N`, Description: `Nursing Unit`},
{ID: `O`, Description: `Operating Room`},
{ID: `R`, Description: `Room`}}},
`0261`: {ID: `0261`, Name: `Location equipment`, Row: []Row{
{ID: `EEG`, Description: `Electro-Encephalogram`},
{ID: `EKG`, Description: `Electro-Cardiogram`},
{ID: `INF`, Description: `Infusion pump`},
{ID: `IVP`, Description: `IV pump`},
{ID: `OXY`, Description: `Oxygen`},
{ID: `SUC`, Description: `Suction`},
{ID: `VEN`, Description: `Ventilator`},
{ID: `VIT`, Description: `Vital signs monitor`}}},
`0264`: {ID: `0264`, Name: `Location department`, Row: []Row{}},
`0265`: {ID: `0265`, Name: `Specialty type`, Row: []Row{
{ID: `ALC`, Description: `Allergy`},
{ID: `AMB`, Description: `Ambulatory`},
{ID: `CAN`, Description: `Cancer`},
{ID: `CAR`, Description: `Coronary/cardiac care`},
{ID: `CCR`, Description: `Critical care`},
{ID: `CHI`, Description: `Chiropractic`},
{ID: `EDI`, Description: `Education`},
{ID: `EMR`, Description: `Emergency`},
{ID: `FPC`, Description: `Family planning`},
{ID: `INT`, Description: `Intensive care`},
{ID: `ISO`, Description: `Isolation`},
{ID: `NAT`, Description: `Naturopathic`},
{ID: `NBI`, Description: `Newborn, nursery, infants`},
{ID: `OBG`, Description: `Obstetrics, gynecology`},
{ID: `OBS`, Description: `Observation`},
{ID: `OTH`, Description: `Other specialty`},
{ID: `PED`, Description: `Pediatrics`},
{ID: `PHY`, Description: `General/family practice`},
{ID: `PIN`, Description: `Pediatric/neonatal intensive care`},
{ID: `PPS`, Description: `Pediatric psychiatric`},
{ID: `PRE`, Description: `Pediatric rehabilitation`},
{ID: `PSI`, Description: `Psychiatric intensive care`},
{ID: `PSY`, Description: `Psychiatric`},
{ID: `REH`, Description: `Rehabilitation`},
{ID: `SUR`, Description: `Surgery`},
{ID: `WIC`, Description: `Walk-in clinic`}}},
`0267`: {ID: `0267`, Name: `Days of the week`, Row: []Row{
{ID: `FRI`, Description: `Friday`},
{ID: `MON`, Description: `Monday`},
{ID: `SAT`, Description: `Saturday`},
{ID: `SUN`, Description: `Sunday`},
{ID: `THU`, Description: `Thursday`},
{ID: `TUE`, Description: `Tuesday`},
{ID: `WED`, Description: `Wednesday`}}},
`0268`: {ID: `0268`, Name: `Override`, Row: []Row{
{ID: `A`, Description: `Override allowed`},
{ID: `R`, Description: `Override required`},
{ID: `X`, Description: `Override not allowed`}}},
`0269`: {ID: `0269`, Name: `Charge on indicator`, Row: []Row{
{ID: `O`, Description: `Charge on Order`},
{ID: `R`, Description: `Charge on Result`}}},
`0270`: {ID: `0270`, Name: `Document type`, Row: []Row{
{ID: `AR`, Description: `Autopsy report`},
{ID: `CD`, Description: `Cardiodiagnostics`},
{ID: `CN`, Description: `Consultation`},
{ID: `DI`, Description: `Diagnostic imaging`},
{ID: `DS`, Description: `Discharge summary`},
{ID: `ED`, Description: `Emergency department report`},
{ID: `HP`, Description: `History and physical examination`},
{ID: `OP`, Description: `Operative report`},
{ID: `PC`, Description: `Psychiatric consultation`},
{ID: `PH`, Description: `Psychiatric history and physical examination`},
{ID: `PN`, Description: `Procedure note`},
{ID: `PR`, Description: `Progress note`},
{ID: `SP`, Description: `Surgical pathology`},
{ID: `TS`, Description: `Transfer summary`}}},
`0271`: {ID: `0271`, Name: `Document completion status`, Row: []Row{
{ID: `AU`, Description: `Authenticated`},
{ID: `DI`, Description: `Dictated`},
{ID: `DO`, Description: `Documented`},
{ID: `IN`, Description: `Incomplete`},
{ID: `IP`, Description: `In Progress`},
{ID: `LA`, Description: `Legally authenticated`},
{ID: `PA`, Description: `Pre-authenticated`}}},
`0272`: {ID: `0272`, Name: `Document confidentiality status`, Row: []Row{
{ID: `R`, Description: `Restricted`},
{ID: `U`, Description: `Usual control`},
{ID: `V`, Description: `Very restricted`}}},
`0273`: {ID: `0273`, Name: `Document availability status`, Row: []Row{
{ID: `AV`, Description: `Available for patient care`},
{ID: `CA`, Description: `Deleted`},
{ID: `OB`, Description: `Obsolete`},
{ID: `UN`, Description: `Unavailable for patient care`}}},
`0275`: {ID: `0275`, Name: `Document storage status`, Row: []Row{
{ID: `AA`, Description: `Active and archived`},
{ID: `AC`, Description: `Active`},
{ID: `AR`, Description: `Archived (not active)`},
{ID: `PU`, Description: `Purged`}}},
`0276`: {ID: `0276`, Name: `Appointment reason codes`, Row: []Row{
{ID: `Checkup`, Description: `A routine check-up, such as an annual physical`},
{ID: `Emergency`, Description: `Emergency appointment`},
{ID: `Followup`, Description: `A follow up visit from a previous appointment`},
{ID: `Routine`, Description: `Routine appointment - default if not valued`},
{ID: `Walkin`, Description: `A previously unscheduled walk-in visit`}}},
`0277`: {ID: `0277`, Name: `Appointment type codes`, Row: []Row{
{ID: `Complete`, Description: `A request to add a completed appointment, used to maintain records of completed appointments`},
{ID: `Normal`, Description: `Routine schedule request type - default if not valued`},
{ID: `Tentative`, Description: `A request for a tentative (e.g., penciled in) appointment`}}},
`0278`: {ID: `0278`, Name: `Filler status codes`, Row: []Row{
{ID: `Blocked`, Description: `The indicated time slot(s) is(are) blocked`},
{ID: `Booked`, Description: `The indicated appointment is booked`},
{ID: `Cancelled`, Description: `T7he indicated appointment was stopped from occurring (canceled prior to starting)`},
{ID: `Complete`, Description: `The indicated appointment has completed normally (was not discontinued, canceled, or deleted)`},
{ID: `Dc`, Description: `The indicated appointment was discontinued (DC'ed while in progress, discontinued parent appointment, or discontinued child appointment)`},
{ID: `Deleted`, Description: `The indicated appointment was deleted from the filler application`},
{ID: `Overbook`, Description: `The appointment has been confirmed; however it is confirmed in an overbooked state`},
{ID: `Pending`, Description: `Appointment has not yet been confirmed`},
{ID: `Started`, Description: `The indicated appointment has begun and is currently in progress`},
{ID: `Waitlist`, Description: `Appointment has been placed on a waiting list for a particular slot, or set of slots`}}},
`0279`: {ID: `0279`, Name: `Allow substitution codes`, Row: []Row{
{ID: `Confirm`, Description: `Contact the Placer Contact Person prior to making any substitutions of this resource`},
{ID: `No`, Description: `Substitution of this resource is not allowed`},
{ID: `Notify`, Description: `Notify the Placer Contact Person, through normal institutional procedures, that a substitution of this resource has been made`},
{ID: `Yes`, Description: `Substitution of this resource is allowed`}}},
`0280`: {ID: `0280`, Name: `Referral priority`, Row: []Row{
{ID: `A`, Description: `ASAP`},
{ID: `R`, Description: `Routine`},
{ID: `S`, Description: `STAT`}}},
`0281`: {ID: `0281`, Name: `Referral type`, Row: []Row{
{ID: `Hom`, Description: `Home Care`},
{ID: `Lab`, Description: `Laboratory`},
{ID: `Med`, Description: `Medical`},
{ID: `Psy`, Description: `Psychiatric`},
{ID: `Rad`, Description: `Radiology`},
{ID: `Skn`, Description: `Skilled Nursing`}}},
`0282`: {ID: `0282`, Name: `Referral disposition`, Row: []Row{
{ID: `AM`, Description: `Assume Management`},
{ID: `RP`, Description: `Return Patient After Evaluation`},
{ID: `SO`, Description: `Second Opinion`},
{ID: `WR`, Description: `Send Written Report`}}},
`0283`: {ID: `0283`, Name: `Referral status`, Row: []Row{
{ID: `A`, Description: `Accepted`},
{ID: `E`, Description: `Expired`},
{ID: `P`, Description: `Pending`},
{ID: `R`, Description: `Rejected`}}},
`0284`: {ID: `0284`, Name: `Referral category`, Row: []Row{
{ID: `A`, Description: `Ambulatory`},
{ID: `E`, Description: `Emergency`},
{ID: `I`, Description: `Inpatient`},
{ID: `O`, Description: `Outpatient`}}},
`0285`: {ID: `0285`, Name: `Insurance company ID codes`, Row: []Row{}},
`0286`: {ID: `0286`, Name: `Provider role`, Row: []Row{
{ID: `CP`, Description: `Consulting Provider`},
{ID: `PP`, Description: `Primary Care Provider`},
{ID: `RP`, Description: `Referring Provider`},
{ID: `RT`, Description: `Referred to Provider`}}},
`0287`: {ID: `0287`, Name: `Problem/goal action code`, Row: []Row{
{ID: `AD`, Description: `ADD`},
{ID: `CO`, Description: `CORRECT`},
{ID: `DE`, Description: `DELETE`},
{ID: `LI`, Description: `LINK`},
{ID: `UC`, Description: `UNCHANGED *`},
{ID: `UN`, Description: `UNLINK`},
{ID: `UP`, Description: `UPDATE`}}},
`0288`: {ID: `0288`, Name: `Census tract`, Row: []Row{}},
`0289`: {ID: `0289`, Name: `County code`, Row: []Row{}},
`0292`: {ID: `0292`, Name: `Vaccines administered`, Row: []Row{
{ID: `1`, Description: `DTP`},
{ID: `10`, Description: `IPV`},
{ID: `11`, Description: `Pertussis`},
{ID: `12`, Description: `Diphtheria antitoxin`},
{ID: `13`, Description: `TIG`},
{ID: `14`, Description: `IG, NOS`},
{ID: `15`, Description: `Influenza-split (incl. purified surface antigen)`},
{ID: `16`, Description: `Influenza-whole`},
{ID: `17`, Description: `Hib, NOS`},
{ID: `18`, Description: `Rabies, intramuscular injection`},
{ID: `19`, Description: `BCG`},
{ID: `2`, Description: `OPV`},
{ID: `20`, Description: `DTaP`},
{ID: `21`, Description: `Varicella`},
{ID: `22`, Description: `DTP-Hib`},
{ID: `23`, Description: `Plague`},
{ID: `24`, Description: `Anthrax`},
{ID: `25`, Description: `Typhoid-oral`},
{ID: `26`, Description: `Cholera`},
{ID: `27`, Description: `Botulinum antitoxin`},
{ID: `28`, Description: `DT(pediatric)`},
{ID: `29`, Description: `CMVIG`},
{ID: `3`, Description: `MMR`},
{ID: `30`, Description: `HBIG`},
{ID: `31`, Description: `Hep A, pediatric, NOS`},
{ID: `32`, Description: `Meningococcal`},
{ID: `33`, Description: `Pneumococcal`},
{ID: `34`, Description: `RIG`},
{ID: `35`, Description: `Tetanus toxoid`},
{ID: `36`, Description: `VZIG`},
{ID: `37`, Description: `Yellow fever`},
{ID: `38`, Description: `Rubella/Mumps`},
{ID: `39`, Description: `Japanese encephalitis`},
{ID: `4`, Description: `M/R`},
{ID: `40`, Description: `Rabies, intradermal injection`},
{ID: `41`, Description: `Typhoid-parenteral`},
{ID: `42`, Description: `Hep B, adolescent/high risk infant`},
{ID: `43`, Description: `Hep B, adult`},
{ID: `44`, Description: `Hep B, dialysis`},
{ID: `45`, Description: `Hep B, NOS`},
{ID: `46`, Description: `Hib (PRP-D)`},
{ID: `47`, Description: `Hib (HbOC)`},
{ID: `48`, Description: `Hib (PRP-T)`},
{ID: `49`, Description: `Hib (PRP-OMP)`},
{ID: `5`, Description: `Measles`},
{ID: `50`, Description: `DtaP-Hib`},
{ID: `51`, Description: `Hib-Hep B`},
{ID: `52`, Description: `Hep A - adult`},
{ID: `53`, Description: `Typhoid, parenteral, AKD (U.S. military)`},
{ID: `54`, Description: `Adenovirus, type 4`},
{ID: `55`, Description: `Adenovirus, type 7`},
{ID: `56`, Description: `Dengue fever`},
{ID: `57`, Description: `Hantavirus`},
{ID: `58`, Description: `Hep C`},
{ID: `59`, Description: `Hep E`},
{ID: `6`, Description: `Rubella`},
{ID: `60`, Description: `Herpes simplex 2`},
{ID: `61`, Description: `HIV`},
{ID: `62`, Description: `HPV`},
{ID: `63`, Description: `Junin virus`},
{ID: `64`, Description: `Leishmaniasis`},
{ID: `65`, Description: `Leprosy`},
{ID: `66`, Description: `Lyme disease`},
{ID: `67`, Description: `Malaria`},
{ID: `68`, Description: `Melanoma`},
{ID: `69`, Description: `Parainfluenza-3`},
{ID: `7`, Description: `Mumps`},
{ID: `70`, Description: `Q fever`},
{ID: `71`, Description: `RSV-IGIV`},
{ID: `72`, Description: `Rheumatic fever`},
{ID: `73`, Description: `Rift Valley fever`},
{ID: `74`, Description: `Rotavirus`},
{ID: `75`, Description: `Smallpox`},
{ID: `76`, Description: `Staphylococcus bacterio lysate`},
{ID: `77`, Description: `Tick-borne encephalitis`},
{ID: `78`, Description: `Tularemia vaccine`},
{ID: `79`, Description: `Vaccinia immune globulin`},
{ID: `8`, Description: `Hep B, adolescent or pediatric`},
{ID: `80`, Description: `VEE, live`},
{ID: `81`, Description: `VEE, inactivated`},
{ID: `82`, Description: `Adenovirus, NOS`},
{ID: `83`, Description: `Hep A, ped/adol, 2 dose`},
{ID: `84`, Description: `Hep A, ped/adol, 3 dose`},
{ID: `85`, Description: `Hep A, NOS`},
{ID: `86`, Description: `IG`},
{ID: `87`, Description: `IGIV`},
{ID: `88`, Description: `Influenza, NOS`},
{ID: `89`, Description: `Polio, NOS`},
{ID: `9`, Description: `Td (Adult)`},
{ID: `90`, Description: `Rabies, NOS`},
{ID: `91`, Description: `Typhoid, NOS`},
{ID: `92`, Description: `VEE, NOS`}}},
`0293`: {ID: `0293`, Name: `Billing category`, Row: []Row{}},
`0294`: {ID: `0294`, Name: `Time selection criteria parameter class codes`, Row: []Row{
{ID: `FRI`, Description: `An indicator that Friday is or is not preferred for the day on which the appointment will occur. OK = Preferred appointment day NO = Day is not preferred`},
{ID: `MON`, Description: `An indicator that Monday is or is not preferred for the day on which the appointment will occur. OK = Preferred appointment day NO = Day is not preferred`},
{ID: `PREFEND`, Description: `The preferred end time for the appointment request, service or resource. Any legal time specification in the format HHMM, using 24-hour clock notation`},
{ID: `PREFSTART`, Description: `The preferred start time for the appointment request, service or resource. Any legal time specification in the format HHMM, using 24-hour clock notation`},
{ID: `SAT`, Description: `An indicator that Saturday is or is not preferred for the day on which the appointment will occur. OK = Preferred appointment day NO = Day is not preferred`},
{ID: `SUN`, Description: `An indicator that Sunday is or is not preferred for the day on which the appointment will occur. OK = Preferred appointment day NO = Day is not preferred`},
{ID: `THU`, Description: `An indicator that Thursday is or is not preferred for the day on which the appointment will occur. OK = Preferred appointment day NO = Day is not preferred`},
{ID: `TUE`, Description: `An indicator that Tuesday is or is not preferred for the day on which the appointment will occur. OK = Preferred appointment day NO = Day is not preferred`},
{ID: `WED`, Description: `An indicator that Wednesday is or is not preferred for the day on which the appointment will occur. OK = Preferred appointment day NO = Day is not preferred`}}},
`0295`: {ID: `0295`, Name: `Handicap`, Row: []Row{}},
`0296`: {ID: `0296`, Name: `Primary language`, Row: []Row{}},
`0297`: {ID: `0297`, Name: `CN ID source`, Row: []Row{}},
`0298`: {ID: `0298`, Name: `CP range type`, Row: []Row{
{ID: `F`, Description: `Flat-rate. Apply the entire price to this interval, do not pro-rate the price if the full interval has not occurred/been consumed `},
{ID: `P`, Description: `Pro-rate. Apply this price to this interval, pro-rated by whatever portion of the interval has occurred/been consumed `}}},
`0300`: {ID: `0300`, Name: `Namespace ID`, Row: []Row{}},
`0301`: {ID: `0301`, Name: `Universal ID type`, Row: []Row{
{ID: `DNS`, Description: `An Internet dotted name. Either in ASCII or as integers`},
{ID: `GUID`, Description: `Same as UUID`},
{ID: `HCD`, Description: `The CEN Healthcare Coding Scheme Designator. (Identifiers used in DICOM follow this assignment scheme.) `},
{ID: `HL7`, Description: `Reserved for future HL7 registration schemes`},
{ID: `ISO`, Description: `An International Standards Organization Object Identifier`},
{ID: `L`, Description: `These are reserved for locally defined coding schemes`},
{ID: `M`, Description: `These are reserved for locally defined coding schemes`},
{ID: `N`, Description: `These are reserved for locally defined coding schemes`},
{ID: `Random`, Description: `Usually a base64 encoded string of random bits. The uniqueness depends on the length of the bits. Mail systems often generate ASCII string "unique names," from a combination of random bits and system names. Obviously, such identifiers will not be constrained to the base64 character set `},
{ID: `UUID`, Description: `The DCE Universal Unique Identifier `},
{ID: `x400`, Description: `An X.400 MHS format identifier`},
{ID: `x500`, Description: `An X.500 directory name`}}},
`0302`: {ID: `0302`, Name: `Point of care`, Row: []Row{}},
`0303`: {ID: `0303`, Name: `Room`, Row: []Row{}},
`0304`: {ID: `0304`, Name: `Bed`, Row: []Row{}},
`0305`: {ID: `0305`, Name: `Person location type`, Row: []Row{}},
`0306`: {ID: `0306`, Name: `Location status`, Row: []Row{}},
`0307`: {ID: `0307`, Name: `Building`, Row: []Row{}},
`0308`: {ID: `0308`, Name: `Floor`, Row: []Row{}},
`0309`: {ID: `0309`, Name: `Coverage type`, Row: []Row{
{ID: `B`, Description: `Both hospital and physician`},
{ID: `H`, Description: `Hospital/institutional`},
{ID: `P`, Description: `Physician/professional`}}},
`0311`: {ID: `0311`, Name: `Job status`, Row: []Row{
{ID: `O`, Description: `Other`},
{ID: `P`, Description: `Permanent`},
{ID: `T`, Description: `Temporary`},
{ID: `U`, Description: `Unknown`}}},
`0312`: {ID: `0312`, Name: `Policy scope`, Row: []Row{}},
`0313`: {ID: `0313`, Name: `Policy source`, Row: []Row{}},
`0315`: {ID: `0315`, Name: `Living will`, Row: []Row{
{ID: `F`, Description: `Yes, patient has a living will but it is not on file`},
{ID: `I`, Description: `No, patient does not have a living will but information was provided`},
{ID: `N`, Description: `No, patient does not have a living will and no information was provided`},
{ID: `U`, Description: `Unknown`},
{ID: `Y`, Description: `Yes, patient has a living will`}}},
`0316`: {ID: `0316`, Name: `Organ donor`, Row: []Row{
{ID: `F`, Description: `Yes, patient is a donor, but card is not on file`},
{ID: `I`, Description: `No, patient does not have a living will but information was provided`},
{ID: `U`, Description: `Unknown`},
{ID: `Y`, Description: `Yes, patient is a donor and card is on file`}}},
`0319`: {ID: `0319`, Name: `Department cost center`, Row: []Row{}},
`0320`: {ID: `0320`, Name: `Item natural account code`, Row: []Row{}},
`0321`: {ID: `0321`, Name: `Dispense method`, Row: []Row{
{ID: `AD`, Description: `Automatic Dispensing`},
{ID: `F`, Description: `Floor Stock`},
{ID: `TR`, Description: `Traditional`},
{ID: `UD`, Description: `Unit Dose`}}},
`0322`: {ID: `0322`, Name: `Completion status`, Row: []Row{
{ID: `CP`, Description: `Complete`},
{ID: `NA`, Description: `Not Administered`},
{ID: `PA`, Description: `Partially Administered`},
{ID: `RE`, Description: `Refused`}}},
`0323`: {ID: `0323`, Name: `Action Code`, Row: []Row{
{ID: `A`, Description: `Add`},
{ID: `D`, Description: `Delete`},
{ID: `U`, Description: `Update`}}},
`0324`: {ID: `0324`, Name: `Location characteristic ID`, Row: []Row{
{ID: `GEN`, Description: `Gender of patient(s)`},
{ID: `IMP`, Description: `Implant: can be used for radiation implant patients`},
{ID: `INF`, Description: `Infectious disease: this location can be used for isolation`},
{ID: `LCR`, Description: `Level of care`},
{ID: `LIC`, Description: `Licensed`},
{ID: `OVR`, Description: `Overflow`},
{ID: `PRL`, Description: `Privacy level: indicating the level of private versus non-private room`},
{ID: `SET`, Description: `Bed is set up`},
{ID: `SHA`, Description: `Shadow: a temporary holding location that does not physically exist`},
{ID: `SMK`, Description: `Smoking`},
{ID: `STF`, Description: `Bed is staffed`},
{ID: `TEA`, Description: `Teaching location`}}},
`0325`: {ID: `0325`, Name: `Location relationship ID`, Row: []Row{
{ID: `ALI`, Description: `Location Alias(es)`},
{ID: `DTY`, Description: `Nearest dietary`},
{ID: `LAB`, Description: `Nearest lab`},
{ID: `LB2`, Description: `Second lab`},
{ID: `PAR`, Description: `Parent location`},
{ID: `RX`, Description: `Nearest pharmacy`},
{ID: `RX2`, Description: `Second pharmacy`}}},
`0326`: {ID: `0326`, Name: `Visit indicator`, Row: []Row{
{ID: `A`, Description: `Account level (default)`},
{ID: `V`, Description: `Visit level`}}},
`0327`: {ID: `0327`, Name: `Job code/class`, Row: []Row{}},
`0328`: {ID: `0328`, Name: `Employee classification`, Row: []Row{}},
`0329`: {ID: `0329`, Name: `Quantity method`, Row: []Row{
{ID: `A`, Description: `Actual count`},
{ID: `E`, Description: `Estimated (see comment)`}}},
`0330`: {ID: `0330`, Name: `Marketing basis`, Row: []Row{
{ID: `510E`, Description: `510 (K) exempt`},
{ID: `510K`, Description: `510 (K)`},
{ID: `522S`, Description: `Post marketing study (522)`},
{ID: `PMA`, Description: `Premarketing authorization`},
{ID: `PRE`, Description: `Preamendment`},
{ID: `TXN`, Description: `Transitional`}}},
`0331`: {ID: `0331`, Name: `Facility type`, Row: []Row{
{ID: `A`, Description: `Agent for a foreign manufacturer`},
{ID: `D`, Description: `Distributor`},
{ID: `M`, Description: `Manufacturer`},
{ID: `U`, Description: `User`}}},
`0332`: {ID: `0332`, Name: `Network Source Type`, Row: []Row{
{ID: `A`, Description: `Accept`},
{ID: `I`, Description: `Initiate`}}},
`0333`: {ID: `0333`, Name: `Network change type`, Row: []Row{
{ID: `M`, Description: `Migrates to different CPU`},
{ID: `SD`, Description: `Shut down`},
{ID: `SU`, Description: `Start up`}}},
`0334`: {ID: `0334`, Name: `Disabled person`, Row: []Row{
{ID: `AP`, Description: `Associated party`},
{ID: `GT`, Description: `Guarantor`},
{ID: `IN`, Description: `Insured`},
{ID: `PT`, Description: `Patient`}}},
`0335`: {ID: `0335`, Name: `Repeat pattern`, Row: []Row{}},
`0336`: {ID: `0336`, Name: `Referral reason`, Row: []Row{}},
`0337`: {ID: `0337`, Name: `Certification status`, Row: []Row{
{ID: `C`, Description: `Certified`},
{ID: `E`, Description: `Eligible`}}},
`0338`: {ID: `0338`, Name: `Practitioner ID number type`, Row: []Row{
{ID: `CY`, Description: `County number`},
{ID: `DEA`, Description: `Drug Enforcement Agency no.`},
{ID: `GL`, Description: `General ledger number`},
{ID: `L&I`, Description: `Labor and industries number`},
{ID: `MCD`, Description: `Medicaid number`},
{ID: `MCR`, Description: `Medicare number`},
{ID: `QA`, Description: `QA number`},
{ID: `SL`, Description: `State license number`},
{ID: `TAX`, Description: `Tax ID number`},
{ID: `TRL`, Description: `Training license number`},
{ID: `UPIN`, Description: `Unique physician ID no.`}}},
`0339`: {ID: `0339`, Name: `Advanced beneficiary notice code`, Row: []Row{
{ID: `1`, Description: `Service is subject to medical necessity procedures`},
{ID: `2`, Description: `Patient has been informed of responsibility, and agrees to pay for service`},
{ID: `3`, Description: `Patient has been informed of responsibility, and asks that the payer be billed`},
{ID: `4`, Description: `Advanced Beneficiary Notice has not been signed`}}},
`0340`: {ID: `0340`, Name: `Procedure code modifier`, Row: []Row{}},
`0341`: {ID: `0341`, Name: `Guarantor credit rating code`, Row: []Row{}},
`0342`: {ID: `0342`, Name: `Dependent of military recipient`, Row: []Row{}},
`0343`: {ID: `0343`, Name: `Military handiciapped program`, Row: []Row{}},
`0344`: {ID: `0344`, Name: `Patient's relationship to insured`, Row: []Row{
{ID: `01`, Description: `Patient is insured`},
{ID: `02`, Description: `Spouse`},
{ID: `03`, Description: `Natural child/insured financial responsibility`},
{ID: `04`, Description: `Natural child/Insured does not have financial responsibility`},
{ID: `05`, Description: `Step child`},
{ID: `06`, Description: `Foster child`},
{ID: `07`, Description: `Ward of the court`},
{ID: `08`, Description: `Employee`},
{ID: `09`, Description: `Unknown`},
{ID: `10`, Description: `Handicapped dependent`},
{ID: `11`, Description: `Organ donor`},
{ID: `12`, Description: `Cadaver donor`},
{ID: `13`, Description: `Grandchild`},
{ID: `14`, Description: `Niece/nephew`},
{ID: `15`, Description: `Injured plaintiff`},
{ID: `16`, Description: `Sponsored dependent`},
{ID: `17`, Description: `Minor dependent of a minor dependent`},
{ID: `18`, Description: `Parent`},
{ID: `19`, Description: `Grandparent`}}},
`0345`: {ID: `0345`, Name: `Appeal reason`, Row: []Row{}},
`0346`: {ID: `0346`, Name: `Certification agency`, Row: []Row{}},
`0347`: {ID: `0347`, Name: `Auto accident state`, Row: []Row{}},
`0348`: {ID: `0348`, Name: `Special program indicator`, Row: []Row{
{ID: `01`, Description: `EPSDT-CHAP`},
{ID: `02`, Description: `Physically handicapped children's program`},
{ID: `03`, Description: `Special federal funding`},
{ID: `04`, Description: `Family planning`},
{ID: `05`, Description: `Disability`},
{ID: `06`, Description: `PPV/Medicare 100% payment`},
{ID: `07`, Description: `Induced abortion-danger to life`},
{ID: `08`, Description: `Induced abortion victim rape/incest`}}},
`0349`: {ID: `0349`, Name: `PSRO/UR approval indicator`, Row: []Row{
{ID: `1`, Description: `Approved by the PSRO/UR as billed`},
{ID: `2`, Description: `Automatic approval as billed based on focused review`},
{ID: `3`, Description: `Partial approval`},
{ID: `4`, Description: `Admission denied`},
{ID: `5`, Description: `Postpayment review applicable`}}},
`0350`: {ID: `0350`, Name: `Occurrence code`, Row: []Row{
{ID: `01`, Description: `Auto accident`},
{ID: `02`, Description: `No fault insurance involved-including auto accident/other`},
{ID: `03`, Description: `Accident/tort liability`},
{ID: `04`, Description: `Accident/employment related`},
{ID: `05`, Description: `Other accident`},
{ID: `06`, Description: `Crime victim`},
{ID: `09`, Description: `Start of infertility treatment cycle`},
{ID: `10`, Description: `Last menstrual period`},
{ID: `11`, Description: `Onset of symptoms/illness`},
{ID: `12`, Description: `Date of onset for a chronically dependent individual`},
{ID: `17`, Description: `Date outpatient occupational therapy plan established or last reviewed`},
{ID: `18`, Description: `Date of retirement patient/beneficiary`},
{ID: `19`, Description: `Date of retirement spouse`},
{ID: `20`, Description: `Guarantee of payment began`},
{ID: `21`, Description: `UR notice received`},
{ID: `22`, Description: `Date active care ended`},
{ID: `24`, Description: `Date insurance denied`},
{ID: `25`, Description: `Date benefits terminated by primary payor`},
{ID: `26`, Description: `Date SNF bed available`},
{ID: `27`, Description: `Date home health plan established`},
{ID: `28`, Description: `Spouse's date of birth`},
{ID: `29`, Description: `Date outpatient physical therapy plan established or last reviewed`},
{ID: `30`, Description: `Date outpatient speech pathology plan established or last reviewed`},
{ID: `31`, Description: `Date beneficiary notified of intent to bill (accommodations)`},
{ID: `32`, Description: `Date beneficiary notified of intent to bill (procedures or treatments)`},
{ID: `33`, Description: `First day of the Medicare coordination period for ESRD beneficiaries covered by EGHP`},
{ID: `34`, Description: `Date of election of extended care facilities`},
{ID: `35`, Description: `Date treatment started for P.T.`},
{ID: `36`, Description: `Date of inpatient hospital discharge for covered transplant patients`},
{ID: `37`, Description: `Date of inpatient hospital discharge for non-covered transplant patient`},
{ID: `40`, Description: `Scheduled date of admission`},
{ID: `41`, Description: `Date of first test for pre-admission testing`},
{ID: `42`, Description: `Date of discharge`},
{ID: `43`, Description: `Scheduled date of canceled surgery`},
{ID: `44`, Description: `Date treatment started for O.T.`},
{ID: `45`, Description: `Date treatment started for S.T.`},
{ID: `46`, Description: `Date treatment started for cardiac rehab.`},
{ID: `47 ... 49`, Description: `Payer codes`},
{ID: `50`, Description: `Date lien released`},
{ID: `51`, Description: `Date treatment started for psychiatric care`},
{ID: `70 ... 99`, Description: `Occurrence span codes and dates`},
{ID: `A1`, Description: `Birthdate - insured A`},
{ID: `A2`, Description: `Effective date - insured A policy`},
{ID: `A3`, Description: `Benefits exhausted payer A`}}},
`0351`: {ID: `0351`, Name: `Occurrence span`, Row: []Row{
{ID: `70`, Description: `Qualifying stay dates for SNF`},
{ID: `71`, Description: `Prior stay dates`},
{ID: `72`, Description: `First/last visit`},
{ID: `73`, Description: `Benefit eligibility period`},
{ID: `74`, Description: `Non-covered level of care`},
{ID: `75`, Description: `SNF level of care`},
{ID: `76`, Description: `Patient liability`},
{ID: `77`, Description: `Provider liability period`},
{ID: `78`, Description: `SNF prior stay dates`},
{ID: `79`, Description: `Payer code`},
{ID: `M0`, Description: `PRO/UR approved stay dates`}}},
`0354`: {ID: `0354`, Name: `Message structure`, Row: []Row{
{ID: `ADT_A01`, Description: `A01, A04, A05, A08, A13, A14, A28, A31`},
{ID: `ADT_A02`, Description: `A02, A21, A22, A23, A25, A26, A27, A29, A32, A33`},
{ID: `ADT_A03`, Description: `A03`},
{ID: `ADT_A06`, Description: `A06, A07`},
{ID: `ADT_A09`, Description: `A09, A10, A11, A15`},
{ID: `ADT_A12`, Description: `A12`},
{ID: `ADT_A16`, Description: `A16`},
{ID: `ADT_A17`, Description: `A17`},
{ID: `ADT_A18`, Description: `A18`},
{ID: `ADT_A20`, Description: `A20`},
{ID: `ADT_A24`, Description: `A24`},
{ID: `ADT_A28`, Description: `A28, A31`},
{ID: `ADT_A30`, Description: `A30, A34, A35, 136, A46, A47, A48, A49`},
{ID: `ADT_A37`, Description: `A37`},
{ID: `ADT_A38`, Description: `A38`},
{ID: `ADT_A39`, Description: `A39, A40, A41, A42`},
{ID: `ADT_A43`, Description: `A43, A44`},
{ID: `ADT_A45`, Description: `A45`},
{ID: `ADT_A50`, Description: `A50, A51`},
{ID: `ARD_A19`, Description: `A19`},
{ID: `BAR_P01`, Description: `P01, P05`},
{ID: `BAR_P02`, Description: `P02`},
{ID: `BAR_P06`, Description: `P06`},
{ID: `CRM_C01`, Description: `C01, C02, C03, C04, C05, C06, C07, C08`},
{ID: `CSU_C09`, Description: `C09, C10, C11, C12`},
{ID: `DFT_P03`, Description: `P03`},
{ID: `DOC_T12`, Description: `T12`},
{ID: `DSR_Q01`, Description: `Q01`},
{ID: `DSR_Q03`, Description: `Q03`},
{ID: `EDR_R07`, Description: `R07`},
{ID: `EQQ_Q04`, Description: `Q04`},
{ID: `ERP_R09`, Description: `R09`},
{ID: `MDM_T01`, Description: `T01, T03, T05, T07, T09, T11`},
{ID: `MDM_T02`, Description: `T02, T04, T06, T08, T10`},
{ID: `MFD_P09`, Description: `P09`},
{ID: `MFK_M01`, Description: `M01, M03, M05, M06, M07, M08, M09, M10, M11`},
{ID: `MFN_M01`, Description: `M01`},
{ID: `MFN_M02`, Description: `M02`},
{ID: `MFN_M03`, Description: `M03`},
{ID: `MFN_M05`, Description: `M05`},
{ID: `MFN_M06`, Description: `M06`},
{ID: `MFN_M07`, Description: `M07`},
{ID: `MFN_M08`, Description: `M08`},
{ID: `MFN_M09`, Description: `M09`},
{ID: `MFN_M10`, Description: `M10`},
{ID: `MFN_M11`, Description: `M11`},
{ID: `ORF_R02`, Description: `R02, R04`},
{ID: `ORM__O01`, Description: `O01`},
{ID: `ORM_Q06`, Description: `Q06`},
{ID: `ORR_O02`, Description: `O02`},
{ID: `ORR_Q06`, Description: `Q06`},
{ID: `ORU_R01`, Description: `R01`},
{ID: `ORU_W01`, Description: `W01`},
{ID: `OSQ_Q06`, Description: `Q06`},
{ID: `OSR_Q06`, Description: `Q06`},
{ID: `PEX_P07`, Description: `P07, P08`},
{ID: `PGL_PC6`, Description: `PC6, PC7, PC8`},
{ID: `PIN_107`, Description: `I07`},
{ID: `PPG_PCG`, Description: `PCC, PCH, PCJ`},
{ID: `PPP_PCB`, Description: `PCB, PCD`},
{ID: `PPR_PC1`, Description: `PC1, PC2, PC3`},
{ID: `PPT_PCL`, Description: `PCL`},
{ID: `PPV_PCA`, Description: `PCA`},
{ID: `PRR_PC5`, Description: `PC5`},
{ID: `PTR_PCF`, Description: `PCF`},
{ID: `QCK_Q02`, Description: `Q02`},
{ID: `QRY_A19`, Description: `A19`},
{ID: `QRY_PC4`, Description: `PC4, PC9, PCE, PCK`},
{ID: `QRY_Q01`, Description: `Q01`},
{ID: `QRY_Q02`, Description: `Q02`},
{ID: `QRY_R02`, Description: `R02, R04`},
{ID: `QRY_T12`, Description: `T12`},
{ID: `RAR_RAR`, Description: `RAR`},
{ID: `RAS_O01`, Description: `O01`},
{ID: `RAS_O02`, Description: `O022`},
{ID: `RCI_I05`, Description: `I05`},
{ID: `RCL_I06`, Description: `I06`},
{ID: `RDE_O01`, Description: `O01`},
{ID: `RDR_RDR`, Description: `RDR`},
{ID: `RDS_O01`, Description: `O01`},
{ID: `REF_I12`, Description: `I12, I13, I14, I15`},
{ID: `RER_RER`, Description: `RER`},
{ID: `RGR_RGR`, Description: `RGR`},
{ID: `RGV_O01`, Description: `O01`},
{ID: `RPA_I08`, Description: `I08, I09. I10, 1II`},
{ID: `RPI_I0I`, Description: `I01, I04`},
{ID: `RPL_I02`, Description: `I02`},
{ID: `RPR_I03`, Description: `I03`},
{ID: `RQA_I08`, Description: `I08, I09, I10, I11`},
{ID: `RQC_I05`, Description: `I05`},
{ID: `RQC_I06`, Description: `I06`},
{ID: `RQI_I0I`, Description: `I01, I02, I03`},
{ID: `RQP_I04`, Description: `I04`},
{ID: `RQQ_Q09`, Description: `Q09`},
{ID: `RRA_O02`, Description: `O02`},
{ID: `RRD_O02`, Description: `O02`},
{ID: `RRE_O01`, Description: `O01`},
{ID: `RRG_O02`, Description: `O02`},
{ID: `RRI_I12`, Description: `I12, I13, I14, I15`},
{ID: `RROR_ROR`, Description: `ROR`},
{ID: `SIIU_S12`, Description: `S12, S13, S14, S15, S16, S17, S18, S19, S20, S21, S22, S23, S24, S26`},
{ID: `SPQ_Q08`, Description: `Q08`},
{ID: `SQM_S25`, Description: `S25`},
{ID: `SQR_S25`, Description: `S25`},
{ID: `SRM_S01`, Description: `S01, S02, S03, S04, S05, S06, S07, S08, S09, S10, S11`},
{ID: `SRM_T12`, Description: `T12`},
{ID: `SRR_S01`, Description: `S01, S02, S03, S04, S05, S06, S07, S08, S09, S10, S11`},
{ID: `SRR_T12`, Description: `T12`},
{ID: `SUR_P09`, Description: `P09`},
{ID: `TBR_R09`, Description: `R09`},
{ID: `UDM_Q05`, Description: `Q05`},
{ID: `VQQ_Q07`, Description: `Q07`},
{ID: `VXQ_V01`, Description: `V01`},
{ID: `VXR_V03`, Description: `V03`},
{ID: `VXU_V04`, Description: `V04`},
{ID: `VXX_V02`, Description: `V02`}}},
`0355`: {ID: `0355`, Name: `Primary key value type`, Row: []Row{
{ID: `CE`, Description: `Coded element`},
{ID: `PL`, Description: `Person location`}}},
`0356`: {ID: `0356`, Name: `Alternate character set handling scheme`, Row: []Row{
{ID: `<null>`, Description: `This is the default, indicating that there is no character set switching occurring in this message.`},
{ID: `2.3`, Description: `The character set switching mode specified in HL7 2.3, sections 2.8.28.6.1, and 2.9.2. Note that the escape sequences used in this mode do not use the ASCII "esc" character. They are "HL7 escape sequences" as defined in HL7 2.3, sec. 2.9 as defined in ISO 2022-1994 (Also, note that sections 2.8.28.6.1and 2.9.2 in HL7 2.3 correspond to sections 2.8.31.6.1and 2.9.2 in HL7 2.4.)`},
{ID: `ISO 2022-1994`, Description: `This standard is titled "Information Technology - Character Code Structure and Extension Technique". This standard specifies an escape sequence from basic one byte character set to specified other character set, and vice versa. The escape sequence explicitly specifies what alternate character set to be evoked. Note that in this mode, the actual ASCII escape character is used as defined in the referenced ISO document. As noted in 1.6.1., escape sequences to/from alternate character set should occur within HL7 delimiters. In other words, HL7 delimiters are basic one byte characters only, and just before and just after delimiters, character encoding status should be the basic one byte set.`}}},
`0357`: {ID: `0357`, Name: `Message error condition codes`, Row: []Row{
{ID: `0`, Description: `Message accepted`, Comment: `Success. Optional, as the AA conveys success. Used for systems that must always return a status code.`},
{ID: `100`, Description: `Segment sequence error`, Comment: `The message segments were not in the proper order, or required segments are missing.`},
{ID: `101`, Description: `Required field missing`, Comment: `A required field is missing from a segment`},
{ID: `102`, Description: `Data type error`, Comment: `The field contained data of the wrong data type, e.g. an NM field contained "FOO".`},
{ID: `103`, Description: `Table value not found`, Comment: `A field of data type ID or IS was compared against the corresponding table, and no match was found.`},
{ID: `200`, Description: `Unsupported message type`, Comment: `The Message Type is not supported.`},
{ID: `201`, Description: `Unsupported event code`, Comment: `The Event Code is not supported.`},
{ID: `202`, Description: `Unsupported processing id`, Comment: `The Processing ID is not supported.`},
{ID: `203`, Description: `Unsupported version id`, Comment: `The Version ID is not supported.`},
{ID: `204`, Description: `Unknown key identifier`, Comment: `The ID of the patient, order, etc., was not found. Used for transactions other than additions, e.g. transfer of a non-existent patient.`},
{ID: `205`, Description: `Duplicate key identifier`, Comment: `The ID of the patient, order, etc., already exists. Used in response to addition transactions (Admit, New Order, etc.).`},
{ID: `206`, Description: `Application record locked`, Comment: `The transaction could not be performed at the application storage level, e.g. database locked.`},
{ID: `207`, Description: `Application internal error`, Comment: `A catchall for internal errors not explicitly covered by other codes.`}}},
`0359`: {ID: `0359`, Name: `Diagnosis priority`, Row: []Row{
{ID: `0`, Description: `Not included in diagnosis ranking`},
{ID: `1`, Description: `The primary diagnosis`},
{ID: `2`, Description: `For ranked secondary diagnoses`, Comment: `2 and higher`}}},
`0360`: {ID: `0360`, Name: `Degree`, Row: []Row{
{ID: `AA`, Description: `Associate of Arts`},
{ID: `AAS`, Description: `Associate of Applied Science`},
{ID: `ABA`, Description: `Associate of Business Administration`},
{ID: `AE`, Description: `Associate of Engineering`},
{ID: `AS`, Description: `Associate of Science`},
{ID: `BA`, Description: `Bachelor of Arts`},
{ID: `BBA`, Description: `Bachelor of Business Administration`},
{ID: `BE`, Description: `Bachelor or Engineering`},
{ID: `BFA`, Description: `Bachelor of Fine Arts`},
{ID: `BN`, Description: `Bachelor of Nursing`},
{ID: `BS`, Description: `Bachelor of Science`},
{ID: `BSL`, Description: `Bachelor of Science Law`},
{ID: `BT`, Description: `Bachelor of Theology`},
{ID: `CER`, Description: `Certificate`},
{ID: `DBA`, Description: `Doctor of Business Administration`},
{ID: `DED`, Description: `Doctor of Education`},
{ID: `DIP`, Description: `Diploma`},
{ID: `DO`, Description: `Doctor of Osteopathy`},
{ID: `HS`, Description: `High School Graduate`},
{ID: `JD`, Description: `Juris Doctor`},
{ID: `MA`, Description: `Master of Arts`},
{ID: `MBA`, Description: `Master of Business Administration`},
{ID: `MCE`, Description: `Master of Civil Engineering`},
{ID: `MD`, Description: `Doctor of Medicine`},
{ID: `MDI`, Description: `Master of Divinity`},
{ID: `ME`, Description: `Master of Engineering`},
{ID: `MED`, Description: `Master of Education`},
{ID: `MEE`, Description: `Master of Electrical Engineering`},
{ID: `MFA`, Description: `Master of Fine Arts`},
{ID: `MME`, Description: `Master of Mechanical Engineering`},
{ID: `MS`, Description: `Master of Science`},
{ID: `MSL`, Description: `Master of Science Law`},
{ID: `MT`, Description: `Master of Theology`},
{ID: `NG`, Description: `Non-Graduate`},
{ID: `PHD`, Description: `Doctor of Philosophy`},
{ID: `PHE`, Description: `Doctor of Engineering`},
{ID: `PHS`, Description: `Doctor of Science`},
{ID: `SEC`, Description: `Secretarial Certificate`},
{ID: `TS`, Description: `Trade School Graduate`}}},
`0361`: {ID: `0361`, Name: `Sending/receiving application`, Row: []Row{}},
`0362`: {ID: `0362`, Name: `Sending/receiving facility`, Row: []Row{}},
`0364`: {ID: `0364`, Name: `Comment type`, Row: []Row{
{ID: `1R`, Description: `Primary Reason`},
{ID: `2R`, Description: `Secondary Reason`},
{ID: `AI`, Description: `Ancillary Instructions,`},
{ID: `DR`, Description: `Duplicate/Interaction Reason`},
{ID: `GI`, Description: `General Instructions`},
{ID: `GR`, Description: `General Reason`},
{ID: `PI`, Description: `Patient Instructions`},
{ID: `RE`, Description: `Remark`}}},
`4000`: {ID: `4000`, Name: `Name/address representation`, Row: []Row{
{ID: `A`, Description: `Alphabetic (i.e., Default or some single-byte)`},
{ID: `I`, Description: `Ideographic (i.e., Kanji)`},
{ID: `P`, Description: `Phonetic (i.e., ASCII, Katakana, Hiragana, etc.)`}}},
`City`: {ID: `City`, Name: `City`, Row: []Row{
{ID: `Albuquerque`},
{ID: `Arlington`},
{ID: `Atlanta`},
{ID: `Austin`},
{ID: `Baltimore`},
{ID: `Boston`},
{ID: `Charlotte`},
{ID: `Chicago`},
{ID: `Cleveland`},
{ID: `Colorado Springs`},
{ID: `Columbus`},
{ID: `Dallas`},
{ID: `Denver`},
{ID: `Detroit`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Fresno`},
{ID: `Honolulu`},
{ID: `Houston`},
{ID: `Indianapolis`},
{ID: `Jacksonville`},
{ID: `Kansas City`},
{ID: `Las Vegas`},
{ID: `Long Beach`},
{ID: `Los Angeles`},
{ID: `Louisville-Jefferson County`},
{ID: `Memphis`},
{ID: `Mesa`},
{ID: `Miami`},
{ID: `Milwaukee`},
{ID: `Minneapolis`},
{ID: `Nashville-Davidson`},
{ID: `New York`},
{ID: `Oakland`},
{ID: `Oklahoma City`},
{ID: `Omaha`},
{ID: `Philadelphia`},
{ID: `Phoenix`},
{ID: `Portland`},
{ID: `Raleigh`},
{ID: `Sacramento`},
{ID: `San Antonio`},
{ID: `San Diego`},
{ID: `San Francisco`},
{ID: `San Jose`},
{ID: `Seattle`},
{ID: `Tucson`},
{ID: `Tulsa`},
{ID: `<NAME>`},
{ID: `Washington`}}},
`FirstName`: {ID: `FirstName`, Name: `<NAME>`, Row: []Row{
{ID: `Aaron`},
{ID: `Abby`},
{ID: `Abe`},
{ID: `Abel`},
{ID: `Abigail`},
{ID: `Abraham`},
{ID: `Ada`},
{ID: `Adam`},
{ID: `Addie`},
{ID: `Adela`},
{ID: `Adele`},
{ID: `Adolfo`},
{ID: `Adolph`},
{ID: `Adolphus`},
{ID: `Adrian`},
{ID: `Adrienne`},
{ID: `Agnes`},
{ID: `Agustin`},
{ID: `Aida`},
{ID: `Aileen`},
{ID: `Aimee`},
{ID: `Al`},
{ID: `Alan`},
{ID: `Alana`},
{ID: `Albert`},
{ID: `Alberta`},
{ID: `Alberto`},
{ID: `Alden`},
{ID: `Alejandro`},
{ID: `Aleta`},
{ID: `Aletha`},
{ID: `Alex`},
{ID: `Alexander`},
{ID: `Alexandra`},
{ID: `Alexis`},
{ID: `Alfonso`},
{ID: `Alfonzo`},
{ID: `Alford`},
{ID: `Alfred`},
{ID: `Alfreda`},
{ID: `Alfredo`},
{ID: `Alice`},
{ID: `Alicia`},
{ID: `Alisa`},
{ID: `Alison`},
{ID: `Allan`},
{ID: `Allen`},
{ID: `Allison`},
{ID: `Allyn`},
{ID: `Alma`},
{ID: `Alonzo`},
{ID: `Alphonse`},
{ID: `Alphonso`},
{ID: `Alta`},
{ID: `Althea`},
{ID: `Alton`},
{ID: `Alva`},
{ID: `Alvin`},
{ID: `Alyce`},
{ID: `Amanda`},
{ID: `Amber`},
{ID: `Amelia`},
{ID: `Amos`},
{ID: `Amy`},
{ID: `Ana`},
{ID: `Anderson`},
{ID: `Andre`},
{ID: `Andrea`},
{ID: `Andres`},
{ID: `Andrew`},
{ID: `Andy`},
{ID: `Angel`},
{ID: `Angela`},
{ID: `Angelia`},
{ID: `Angelina`},
{ID: `Angeline`},
{ID: `Angelita`},
{ID: `Angelo`},
{ID: `Angie`},
{ID: `Anita`},
{ID: `Ann`},
{ID: `Anna`},
{ID: `Anne`},
{ID: `Annemarie`},
{ID: `Annetta`},
{ID: `Annette`},
{ID: `Annie`},
{ID: `Annmarie`},
{ID: `Anthony`},
{ID: `Antionette`},
{ID: `Antoinette`},
{ID: `Anton`},
{ID: `Antonia`},
{ID: `Antonio`},
{ID: `April`},
{ID: `Archie`},
{ID: `Arden`},
{ID: `Arleen`},
{ID: `Arlen`},
{ID: `Arlene`},
{ID: `Arlie`},
{ID: `Armand`},
{ID: `Armando`},
{ID: `Arnold`},
{ID: `Arnulfo`},
{ID: `Art`},
{ID: `Arthur`},
{ID: `Artie`},
{ID: `Artis`},
{ID: `Arturo`},
{ID: `Ashley`},
{ID: `Athena`},
{ID: `Aubrey`},
{ID: `Audie`},
{ID: `Audrey`},
{ID: `August`},
{ID: `Augustine`},
{ID: `Augustus`},
{ID: `Aurelio`},
{ID: `Aurora`},
{ID: `Austin`},
{ID: `Ava`},
{ID: `Avery`},
{ID: `Avis`},
{ID: `Bambi`},
{ID: `Barbara`},
{ID: `Barbra`},
{ID: `Barney`},
{ID: `Barrett`},
{ID: `Barry`},
{ID: `Bart`},
{ID: `Barton`},
{ID: `Basil`},
{ID: `Beatrice`},
{ID: `Becky`},
{ID: `Belinda`},
{ID: `Ben`},
{ID: `Benedict`},
{ID: `Benita`},
{ID: `Benito`},
{ID: `Benjamin`},
{ID: `Bennett`},
{ID: `Bennie`},
{ID: `Benny`},
{ID: `Benton`},
{ID: `Bernadette`},
{ID: `Bernadine`},
{ID: `Bernard`},
{ID: `Bernice`},
{ID: `Bernie`},
{ID: `Berry`},
{ID: `Bert`},
{ID: `Bertha`},
{ID: `Bertram`},
{ID: `Beryl`},
{ID: `Bessie`},
{ID: `Beth`},
{ID: `Bethany`},
{ID: `Betsy`},
{ID: `Bette`},
{ID: `Bettie`},
{ID: `Betty`},
{ID: `Bettye`},
{ID: `Beulah`},
{ID: `Beverley`},
{ID: `Beverly`},
{ID: `Bill`},
{ID: `Billie`},
{ID: `Billy`},
{ID: `Blaine`},
{ID: `Blair`},
{ID: `Blake`},
{ID: `Blanca`},
{ID: `Blanche`},
{ID: `Blane`},
{ID: `Bob`},
{ID: `Bobbi`},
{ID: `Bobbie`},
{ID: `Bobby`},
{ID: `Bonita`},
{ID: `Bonnie`},
{ID: `Bonny`},
{ID: `Booker`},
{ID: `Boyce`},
{ID: `Boyd`},
{ID: `Brad`},
{ID: `Bradford`},
{ID: `Bradley`},
{ID: `Bradly`},
{ID: `Brady`},
{ID: `Brandon`},
{ID: `Brant`},
{ID: `Brenda`},
{ID: `Brendan`},
{ID: `Brent`},
{ID: `Bret`},
{ID: `Brett`},
{ID: `Brian`},
{ID: `Brice`},
{ID: `Bridget`},
{ID: `Britt`},
{ID: `Brooks`},
{ID: `Bruce`},
{ID: `Bruno`},
{ID: `Bryan`},
{ID: `Bryant`},
{ID: `Bryce`},
{ID: `Bryon`},
{ID: `Bud`},
{ID: `Buddy`},
{ID: `Buford`},
{ID: `Burl`},
{ID: `Burt`},
{ID: `Burton`},
{ID: `Buster`},
{ID: `Butch`},
{ID: `Byron`},
{ID: `Callie`},
{ID: `Calvin`},
{ID: `Cameron`},
{ID: `Camilla`},
{ID: `Camille`},
{ID: `Candace`},
{ID: `Candice`},
{ID: `Candy`},
{ID: `Cara`},
{ID: `Caren`},
{ID: `Carey`},
{ID: `Carey`},
{ID: `Carl`},
{ID: `Carla`},
{ID: `Carleen`},
{ID: `Carlene`},
{ID: `Carleton`},
{ID: `Carlo`},
{ID: `Carlos`},
{ID: `Carlotta`},
{ID: `Carlton`},
{ID: `Carmel`},
{ID: `Carmela`},
{ID: `Carmella`},
{ID: `Carmelo`},
{ID: `Carmen`},
{ID: `Carmine`},
{ID: `Carnell`},
{ID: `Carol`},
{ID: `Carole`},
{ID: `Carolina`},
{ID: `Caroline`},
{ID: `Carolyn`},
{ID: `Caron`},
{ID: `Carrie`},
{ID: `Carroll`},
{ID: `Carson`},
{ID: `Carter`},
{ID: `Cary`},
{ID: `Caryl`},
{ID: `Caryn`},
{ID: `Casey`},
{ID: `Cassandra`},
{ID: `Catharine`},
{ID: `Catherine`},
{ID: `Cathey`},
{ID: `Cathie`},
{ID: `Cathleen`},
{ID: `Cathrine`},
{ID: `Cathryn`},
{ID: `Cathy`},
{ID: `Cecelia`},
{ID: `Cecil`},
{ID: `Cecile`},
{ID: `Cecilia`},
{ID: `Cedric`},
{ID: `Celeste`},
{ID: `Celestine`},
{ID: `Celia`},
{ID: `Cesar`},
{ID: `Chad`},
{ID: `Charla`},
{ID: `Charleen`},
{ID: `Charlene`},
{ID: `Charles`},
{ID: `Charley`},
{ID: `Charlie`},
{ID: `Charlotte`},
{ID: `Charmaine`},
{ID: `Chauncey`},
{ID: `Cheri`},
{ID: `Cherie`},
{ID: `Cherri`},
{ID: `Cherrie`},
{ID: `Cherry`},
{ID: `Cheryl`},
{ID: `Cheryle`},
{ID: `Cheryll`},
{ID: `Chester`},
{ID: `Chip`},
{ID: `Chris`},
{ID: `Christa`},
{ID: `Christi`},
{ID: `Christian`},
{ID: `Christie`},
{ID: `Christina`},
{ID: `Christine`},
{ID: `Christophe`},
{ID: `Christopher`},
{ID: `Christy`},
{ID: `Chuck`},
{ID: `Cinda`},
{ID: `Cindi`},
{ID: `Cindy`},
{ID: `Clair`},
{ID: `Claire`},
{ID: `Clara`},
{ID: `Clare`},
{ID: `Clarence`},
{ID: `Clarice`},
{ID: `Clarissa`},
{ID: `Clark`},
{ID: `Clarke`},
{ID: `Claud`},
{ID: `Claude`},
{ID: `Claudette`},
{ID: `Claudia`},
{ID: `Clay`},
{ID: `Clayton`},
{ID: `Clement`},
{ID: `Cleo`},
{ID: `Cletus`},
{ID: `Cleve`},
{ID: `Cleveland`},
{ID: `Cliff`},
{ID: `Clifford`},
{ID: `Clifton`},
{ID: `Clint`},
{ID: `Clinton`},
{ID: `Clyde`},
{ID: `Cody`},
{ID: `Cole`},
{ID: `Coleen`},
{ID: `Coleman`},
{ID: `Colette`},
{ID: `Colin`},
{ID: `Colleen`},
{ID: `Collette`},
{ID: `Columbus`},
{ID: `Concetta`},
{ID: `Connie`},
{ID: `Connie`},
{ID: `Conrad`},
{ID: `Constance`},
{ID: `Consuelo`},
{ID: `Cora`},
{ID: `Cordell`},
{ID: `Corey`},
{ID: `Corine`},
{ID: `Corinne`},
{ID: `Corliss`},
{ID: `Cornelia`},
{ID: `Cornelius`},
{ID: `Cornell`},
{ID: `Corrine`},
{ID: `Cory`},
{ID: `Courtney`},
{ID: `Coy`},
{ID: `Craig`},
{ID: `Cris`},
{ID: `Cristina`},
{ID: `Cruz`},
{ID: `Crystal`},
{ID: `Curt`},
{ID: `Curtis`},
{ID: `Curtiss`},
{ID: `Cynthia`},
{ID: `Cyril`},
{ID: `Cyrus`},
{ID: `Daisy`},
{ID: `Dale`},
{ID: `Dallas`},
{ID: `Dalton`},
{ID: `Damian`},
{ID: `Damon`},
{ID: `Dan`},
{ID: `Dana`},
{ID: `Dane`},
{ID: `Danette`},
{ID: `Danial`},
{ID: `Daniel`},
{ID: `Danielle`},
{ID: `Danita`},
{ID: `Dann`},
{ID: `Danna`},
{ID: `Dannie`},
{ID: `Danny`},
{ID: `Dante`},
{ID: `Daphne`},
{ID: `Darcy`},
{ID: `Darell`},
{ID: `Daria`},
{ID: `Darius`},
{ID: `Darla`},
{ID: `Darleen`},
{ID: `Darlene`},
{ID: `Darnell`},
{ID: `Darold`},
{ID: `Darrel`},
{ID: `Darrell`},
{ID: `Darryl`},
{ID: `Darwin`},
{ID: `Daryl`},
{ID: `Daryle`},
{ID: `Dave`},
{ID: `Davey`},
{ID: `David`},
{ID: `Davie`},
{ID: `Davis`},
{ID: `Davy`},
{ID: `Dawn`},
{ID: `Dayna`},
{ID: `Dean`},
{ID: `Deana`},
{ID: `Deann`},
{ID: `Deanna`},
{ID: `Deanne`},
{ID: `Debbi`},
{ID: `Debbie`},
{ID: `Debbra`},
{ID: `Debby`},
{ID: `Debi`},
{ID: `Debora`},
{ID: `Deborah`},
{ID: `Debra`},
{ID: `Debrah`},
{ID: `Debroah`},
{ID: `Dee`},
{ID: `Deena`},
{ID: `Deidre`},
{ID: `Deirdre`},
{ID: `Del`},
{ID: `Delbert`},
{ID: `Delia`},
{ID: `Delilah`},
{ID: `Dell`},
{ID: `Della`},
{ID: `Delma`},
{ID: `Delmar`},
{ID: `Delmer`},
{ID: `Delois`},
{ID: `Delores`},
{ID: `Deloris`},
{ID: `Delphine`},
{ID: `Delton`},
{ID: `Demetrius`},
{ID: `Dena`},
{ID: `Denice`},
{ID: `Denis`},
{ID: `Denise`},
{ID: `Dennie`},
{ID: `Dennis`},
{ID: `Denny`},
{ID: `Denver`},
{ID: `Derek`},
{ID: `Derrell`},
{ID: `Derrick`},
{ID: `Desiree`},
{ID: `Desmond`},
{ID: `Dewayne`},
{ID: `Dewey`},
{ID: `Dewitt`},
{ID: `Dexter`},
{ID: `Dian`},
{ID: `Diana`},
{ID: `Diane`},
{ID: `Diann`},
{ID: `Dianna`},
{ID: `Dianne`},
{ID: `Dick`},
{ID: `Dickie`},
{ID: `Dina`},
{ID: `Dinah`},
{ID: `Dino`},
{ID: `Dirk`},
{ID: `Dixie`},
{ID: `Dollie`},
{ID: `Dolly`},
{ID: `Dolores`},
{ID: `Domenic`},
{ID: `Domingo`},
{ID: `Dominic`},
{ID: `Dominick`},
{ID: `Don`},
{ID: `Dona`},
{ID: `Donald`},
{ID: `Donell`},
{ID: `Donita`},
{ID: `Donn`},
{ID: `Donna`},
{ID: `Donnell`},
{ID: `Donnie`},
{ID: `Donny`},
{ID: `Donovan`},
{ID: `Dora`},
{ID: `Dorcas`},
{ID: `Doreen`},
{ID: `Dorene`},
{ID: `Doretha`},
{ID: `Dorian`},
{ID: `Dorinda`},
{ID: `Doris`},
{ID: `Dorothea`},
{ID: `Dorothy`},
{ID: `Dorsey`},
{ID: `Dorthy`},
{ID: `Dottie`},
{ID: `Doug`},
{ID: `Douglas`},
{ID: `Douglass`},
{ID: `Doyle`},
{ID: `Drew`},
{ID: `Duane`},
{ID: `Dudley`},
{ID: `Duke`},
{ID: `Duncan`},
{ID: `Dusty`},
{ID: `Duwayne`},
{ID: `Dwain`},
{ID: `Dwaine`},
{ID: `Dwayne`},
{ID: `Dwight`},
{ID: `Earl`},
{ID: `Earle`},
{ID: `Earlene`},
{ID: `Earline`},
{ID: `Earnest`},
{ID: `Earnestine`},
{ID: `Eartha`},
{ID: `Ed`},
{ID: `Eddie`},
{ID: `Eddy`},
{ID: `Edgar`},
{ID: `Edith`},
{ID: `Edmund`},
{ID: `Edna`},
{ID: `Eduardo`},
{ID: `Edward`},
{ID: `Edwardo`},
{ID: `Edwin`},
{ID: `Edwina`},
{ID: `Effie`},
{ID: `Efrain`},
{ID: `Eileen`},
{ID: `Elaine`},
{ID: `Elbert`},
{ID: `Eldon`},
{ID: `Eldridge`},
{ID: `Eleanor`},
{ID: `Elena`},
{ID: `Eli`},
{ID: `Elias`},
{ID: `Elijah`},
{ID: `Elisa`},
{ID: `Elisabeth`},
{ID: `Elise`},
{ID: `Eliseo`},
{ID: `Elissa`},
{ID: `Eliza`},
{ID: `Elizabeth`},
{ID: `Ella`},
{ID: `Ellen`},
{ID: `Elliot`},
{ID: `Elliott`},
{ID: `Ellis`},
{ID: `Elma`},
{ID: `Elmer`},
{ID: `Elmo`},
{ID: `Elnora`},
{ID: `Eloise`},
{ID: `Eloy`},
{ID: `Elroy`},
{ID: `Elsa`},
{ID: `Elsie`},
{ID: `Elton`},
{ID: `Elva`},
{ID: `Elvin`},
{ID: `Elvira`},
{ID: `Elvis`},
{ID: `Elwood`},
{ID: `Elyse`},
{ID: `Emanuel`},
{ID: `Emerson`},
{ID: `Emery`},
{ID: `Emil`},
{ID: `Emilio`},
{ID: `Emily`},
{ID: `Emma`},
{ID: `Emmanuel`},
{ID: `Emmett`},
{ID: `Emmitt`},
{ID: `Emory`},
{ID: `Enoch`},
{ID: `Enrique`},
{ID: `Eric`},
{ID: `Erica`},
{ID: `Erich`},
{ID: `Erick`},
{ID: `Erik`},
{ID: `Erin`},
{ID: `Erma`},
{ID: `Ernest`},
{ID: `Ernestine`},
{ID: `Ernesto`},
{ID: `Ernie`},
{ID: `Errol`},
{ID: `Ervin`},
{ID: `Erwin`},
{ID: `Esmeralda`},
{ID: `Esperanza`},
{ID: `Essie`},
{ID: `Esteban`},
{ID: `Estela`},
{ID: `Estella`},
{ID: `Estelle`},
{ID: `Ester`},
{ID: `Esther`},
{ID: `Ethel`},
{ID: `Etta`},
{ID: `Eugene`},
{ID: `Eugenia`},
{ID: `Eula`},
{ID: `Eunice`},
{ID: `Eva`},
{ID: `Evan`},
{ID: `Evangeline`},
{ID: `Eve`},
{ID: `Evelyn`},
{ID: `Everett`},
{ID: `Everette`},
{ID: `Ezra`},
{ID: `Faith`},
{ID: `Fannie`},
{ID: `Faron`},
{ID: `Farrell`},
{ID: `Fay`},
{ID: `Faye`},
{ID: `Federico`},
{ID: `Felecia`},
{ID: `Felicia`},
{ID: `Felipe`},
{ID: `Felix`},
{ID: `Felton`},
{ID: `Ferdinand`},
{ID: `Fern`},
{ID: `Fernando`},
{ID: `Fidel`},
{ID: `Fletcher`},
{ID: `Flora`},
{ID: `Florence`},
{ID: `Florine`},
{ID: `Floyd`},
{ID: `Forest`},
{ID: `Forrest`},
{ID: `Foster`},
{ID: `Fran`},
{ID: `Frances`},
{ID: `Francesca`},
{ID: `Francine`},
{ID: `Francis`},
{ID: `Francis`},
{ID: `Francisco`},
{ID: `Frank`},
{ID: `Frankie`},
{ID: `Franklin`},
{ID: `Franklyn`},
{ID: `Fred`},
{ID: `Freda`},
{ID: `Freddie`},
{ID: `Freddie`},
{ID: `Freddy`},
{ID: `Frederic`},
{ID: `Frederick`},
{ID: `Fredric`},
{ID: `Fredrick`},
{ID: `Freeman`},
{ID: `Freida`},
{ID: `Frieda`},
{ID: `Fritz`},
{ID: `Gabriel`},
{ID: `Gail`},
{ID: `Gail`},
{ID: `Gale`},
{ID: `Gale`},
{ID: `Galen`},
{ID: `Garland`},
{ID: `Garold`},
{ID: `Garrett`},
{ID: `Garry`},
{ID: `Garth`},
{ID: `Gary`},
{ID: `Gavin`},
{ID: `Gay`},
{ID: `Gaye`},
{ID: `Gayla`},
{ID: `Gayle`},
{ID: `Gaylon`},
{ID: `Gaylord`},
{ID: `Gearld`},
{ID: `Geary`},
{ID: `Gena`},
{ID: `Gene`},
{ID: `Geneva`},
{ID: `Genevieve`},
{ID: `Geoffrey`},
{ID: `George`},
{ID: `Georgette`},
{ID: `Georgia`},
{ID: `Georgina`},
{ID: `Gerald`},
{ID: `Geraldine`},
{ID: `Geralyn`},
{ID: `Gerard`},
{ID: `Gerardo`},
{ID: `Geri`},
{ID: `Gerri`},
{ID: `Gerry`},
{ID: `Gertrude`},
{ID: `Gil`},
{ID: `Gilbert`},
{ID: `Gilberto`},
{ID: `Gilda`},
{ID: `Giles`},
{ID: `Gina`},
{ID: `Ginger`},
{ID: `Gino`},
{ID: `Gisele`},
{ID: `Gladys`},
{ID: `Glen`},
{ID: `Glenda`},
{ID: `Glenn`},
{ID: `Glenna`},
{ID: `Glinda`},
{ID: `Gloria`},
{ID: `Glynn`},
{ID: `Goldie`},
{ID: `Gordon`},
{ID: `Grace`},
{ID: `Gracie`},
{ID: `Graciela`},
{ID: `Grady`},
{ID: `Graham`},
{ID: `Grant`},
{ID: `Greg`},
{ID: `Gregg`},
{ID: `Greggory`},
{ID: `Gregorio`},
{ID: `Gregory`},
{ID: `Greta`},
{ID: `Gretchen`},
{ID: `Grover`},
{ID: `Guadalupe`},
{ID: `Guadalupe`},
{ID: `Guillermo`},
{ID: `Gus`},
{ID: `Gustavo`},
{ID: `Guy`},
{ID: `Gwen`},
{ID: `Gwendolyn`},
{ID: `Hal`},
{ID: `Hank`},
{ID: `Hannah`},
{ID: `Hans`},
{ID: `Harlan`},
{ID: `Harley`},
{ID: `Harmon`},
{ID: `Harold`},
{ID: `Harriet`},
{ID: `Harriett`},
{ID: `Harris`},
{ID: `Harrison`},
{ID: `Harry`},
{ID: `Harvey`},
{ID: `Hattie`},
{ID: `Hayward`},
{ID: `Haywood`},
{ID: `Hazel`},
{ID: `Heather`},
{ID: `Hector`},
{ID: `Heidi`},
{ID: `Helen`},
{ID: `Helena`},
{ID: `Helene`},
{ID: `Henrietta`},
{ID: `Henry`},
{ID: `Herbert`},
{ID: `Heriberto`},
{ID: `Herman`},
{ID: `Herschel`},
{ID: `Hershel`},
{ID: `Hilary`},
{ID: `Hilda`},
{ID: `Hilton`},
{ID: `Hiram`},
{ID: `Hollis`},
{ID: `Hollis`},
{ID: `Holly`},
{ID: `Homer`},
{ID: `Hope`},
{ID: `Horace`},
{ID: `Hosea`},
{ID: `Houston`},
{ID: `Howard`},
{ID: `Hoyt`},
{ID: `Hubert`},
{ID: `Huey`},
{ID: `Hugh`},
{ID: `Hugo`},
{ID: `Humberto`},
{ID: `Ian`},
{ID: `Ida`},
{ID: `Ignacio`},
{ID: `Ike`},
{ID: `Ilene`},
{ID: `Imogene`},
{ID: `Ina`},
{ID: `Inez`},
{ID: `Ingrid`},
{ID: `Ira`},
{ID: `Irene`},
{ID: `Iris`},
{ID: `Irma`},
{ID: `Irvin`},
{ID: `Irving`},
{ID: `Irwin`},
{ID: `Isaac`},
{ID: `Isabel`},
{ID: `Isaiah`},
{ID: `Isiah`},
{ID: `Ismael`},
{ID: `Israel`},
{ID: `Issac`},
{ID: `Iva`},
{ID: `Ivan`},
{ID: `Ivory`},
{ID: `Ivy`},
{ID: `Jacalyn`},
{ID: `Jack`},
{ID: `Jackie`},
{ID: `Jacklyn`},
{ID: `Jackson`},
{ID: `Jacky`},
{ID: `Jacob`},
{ID: `Jacque`},
{ID: `Jacqueline`},
{ID: `Jacquelyn`},
{ID: `Jacques`},
{ID: `Jacquline`},
{ID: `Jaime`},
{ID: `Jake`},
{ID: `Jame`},
{ID: `James`},
{ID: `Jamie`},
{ID: `Jamie`},
{ID: `Jan`},
{ID: `Jana`},
{ID: `Jane`},
{ID: `Janeen`},
{ID: `Janell`},
{ID: `Janelle`},
{ID: `Janet`},
{ID: `Janette`},
{ID: `Janice`},
{ID: `Janie`},
{ID: `Janine`},
{ID: `Janis`},
{ID: `Jann`},
{ID: `Janna`},
{ID: `Jannette`},
{ID: `Jannie`},
{ID: `Jared`},
{ID: `Jarvis`},
{ID: `Jason`},
{ID: `Jasper`},
{ID: `Javier`},
{ID: `Jay`},
{ID: `Jaye`},
{ID: `Jayne`},
{ID: `Jean`},
{ID: `Jeanette`},
{ID: `Jeanie`},
{ID: `Jeanine`},
{ID: `Jeanne`},
{ID: `Jeannette`},
{ID: `Jeannie`},
{ID: `Jeannine`},
{ID: `Jed`},
{ID: `Jeff`},
{ID: `Jefferey`},
{ID: `Jefferson`},
{ID: `Jeffery`},
{ID: `Jeffry`},
{ID: `Jenifer`},
{ID: `Jennie`},
{ID: `Jennifer`},
{ID: `Jenny`},
{ID: `Jerald`},
{ID: `Jere`},
{ID: `Jeremiah`},
{ID: `Jeremy`},
{ID: `Jeri`},
{ID: `Jerilyn`},
{ID: `Jerold`},
{ID: `Jerome`},
{ID: `Jerri`},
{ID: `Jerrie`},
{ID: `Jerrold`},
{ID: `Jerry`},
{ID: `Jeryl`},
{ID: `Jess`},
{ID: `Jesse`},
{ID: `Jessica`},
{ID: `Jessie`},
{ID: `Jesus`},
{ID: `Jewel`},
{ID: `Jewell`},
{ID: `Jill`},
{ID: `Jim`},
{ID: `Jimmie`},
{ID: `Jimmy`},
{ID: `Jo`},
{ID: `Joan`},
{ID: `Joanie`},
{ID: `Joann`},
{ID: `Joanna`},
{ID: `Joanne`},
{ID: `Joaquin`},
{ID: `Jocelyn`},
{ID: `Jodi`},
{ID: `Jodie`},
{ID: `Jody`},
{ID: `Joe`},
{ID: `Joel`},
{ID: `Joellen`},
{ID: `Joesph`},
{ID: `Joette`},
{ID: `Joey`},
{ID: `Johanna`},
{ID: `John`},
{ID: `Johnathan`},
{ID: `Johnie`},
{ID: `Johnnie`},
{ID: `Johnny`},
{ID: `Joleen`},
{ID: `Jolene`},
{ID: `Jon`},
{ID: `Jonas`},
{ID: `Jonathan`},
{ID: `Jonathon`},
{ID: `Joni`},
{ID: `Jordan`},
{ID: `Jorge`},
{ID: `Jose`},
{ID: `Josefina`},
{ID: `Joseph`},
{ID: `Josephine`},
{ID: `Joshua`},
{ID: `Josie`},
{ID: `Joy`},
{ID: `Joyce`},
{ID: `Joycelyn`},
{ID: `Juan`},
{ID: `Juana`},
{ID: `Juanita`},
{ID: `Jude`},
{ID: `Judi`},
{ID: `Judith`},
{ID: `Judson`},
{ID: `Judy`},
{ID: `Jules`},
{ID: `Julia`},
{ID: `Julian`},
{ID: `Juliana`},
{ID: `Juliann`},
{ID: `Julianne`},
{ID: `Julie`},
{ID: `Juliet`},
{ID: `Juliette`},
{ID: `Julio`},
{ID: `Julius`},
{ID: `June`},
{ID: `Junior`},
{ID: `Justin`},
{ID: `Justine`},
{ID: `Kandy`},
{ID: `Karan`},
{ID: `Karen`},
{ID: `Kari`},
{ID: `Karin`},
{ID: `Karl`},
{ID: `Karla`},
{ID: `Karol`},
{ID: `Karon`},
{ID: `Karyn`},
{ID: `Kate`},
{ID: `Kathaleen`},
{ID: `Katharine`},
{ID: `Katherine`},
{ID: `Katheryn`},
{ID: `Kathi`},
{ID: `Kathie`},
{ID: `Kathleen`},
{ID: `Kathrine`},
{ID: `Kathryn`},
{ID: `Kathy`},
{ID: `Katie`},
{ID: `Katrina`},
{ID: `Kay`},
{ID: `Kaye`},
{ID: `Keith`},
{ID: `Kelley`},
{ID: `Kelly`},
{ID: `Kelly`},
{ID: `Kelvin`},
{ID: `Ken`},
{ID: `Kendall`},
{ID: `Kendra`},
{ID: `Kenneth`},
{ID: `Kennith`},
{ID: `Kenny`},
{ID: `Kent`},
{ID: `Kenton`},
{ID: `Kermit`},
{ID: `Kerri`},
{ID: `Kerry`},
{ID: `Kevan`},
{ID: `Keven`},
{ID: `Kevin`},
{ID: `Kim`},
{ID: `Kim`},
{ID: `Kimberlee`},
{ID: `Kimberley`},
{ID: `Kimberly`},
{ID: `King`},
{ID: `Kip`},
{ID: `Kirby`},
{ID: `Kirk`},
{ID: `Kirt`},
{ID: `Kit`},
{ID: `Kitty`},
{ID: `Kraig`},
{ID: `Kris`},
{ID: `Krista`},
{ID: `Kristen`},
{ID: `Kristi`},
{ID: `Kristie`},
{ID: `Kristin`},
{ID: `Kristina`},
{ID: `Kristine`},
{ID: `Kristy`},
{ID: `Kurt`},
{ID: `Kurtis`},
{ID: `Kyle`},
{ID: `Lacy`},
{ID: `Ladonna`},
{ID: `Lafayette`},
{ID: `Lamar`},
{ID: `Lamont`},
{ID: `Lana`},
{ID: `Lance`},
{ID: `Lane`},
{ID: `Lanette`},
{ID: `Lanny`},
{ID: `Larry`},
{ID: `Laura`},
{ID: `Laureen`},
{ID: `Laurel`},
{ID: `Lauren`},
{ID: `Laurence`},
{ID: `Laurene`},
{ID: `Lauretta`},
{ID: `Lauri`},
{ID: `Laurie`},
{ID: `Lavern`},
{ID: `Laverne`},
{ID: `Lavonne`},
{ID: `Lawanda`},
{ID: `Lawerence`},
{ID: `Lawrence`},
{ID: `Layne`},
{ID: `Lea`},
{ID: `Leah`},
{ID: `Leander`},
{ID: `Leann`},
{ID: `Leanna`},
{ID: `Leanne`},
{ID: `Lee`},
{ID: `Leeann`},
{ID: `Leigh`},
{ID: `Leila`},
{ID: `Lela`},
{ID: `Leland`},
{ID: `Lelia`},
{ID: `Lemuel`},
{ID: `Len`},
{ID: `Lena`},
{ID: `Lenard`},
{ID: `Lennie`},
{ID: `Lenny`},
{ID: `Lenora`},
{ID: `Lenore`},
{ID: `Leo`},
{ID: `Leola`},
{ID: `Leon`},
{ID: `Leona`},
{ID: `Leonard`},
{ID: `Leonardo`},
{ID: `Leroy`},
{ID: `Les`},
{ID: `Lesa`},
{ID: `Leslee`},
{ID: `Lesley`},
{ID: `Leslie`},
{ID: `Lessie`},
{ID: `Lester`},
{ID: `Leta`},
{ID: `Letha`},
{ID: `Leticia`},
{ID: `Letitia`},
{ID: `Levern`},
{ID: `Levi`},
{ID: `Levon`},
{ID: `Lewis`},
{ID: `Lex`},
{ID: `Libby`},
{ID: `Lila`},
{ID: `Lillian`},
{ID: `Lillie`},
{ID: `Lilly`},
{ID: `Lily`},
{ID: `Lincoln`},
{ID: `Linda`},
{ID: `Lindsay`},
{ID: `Lindsey`},
{ID: `Lindy`},
{ID: `Linnea`},
{ID: `Linwood`},
{ID: `Lionel`},
{ID: `Lisa`},
{ID: `Lise`},
{ID: `Lizabeth`},
{ID: `Lizzie`},
{ID: `Lloyd`},
{ID: `Logan`},
{ID: `Lois`},
{ID: `Lola`},
{ID: `Lolita`},
{ID: `Lon`},
{ID: `Lona`},
{ID: `Lonnie`},
{ID: `Lonny`},
{ID: `Lora`},
{ID: `Loraine`},
{ID: `Lorelei`},
{ID: `Loren`},
{ID: `Lorena`},
{ID: `Lorene`},
{ID: `Lorenzo`},
{ID: `Loretta`},
{ID: `Lori`},
{ID: `Lorie`},
{ID: `Lorin`},
{ID: `Lorinda`},
{ID: `Lorna`},
{ID: `Lorraine`},
{ID: `Lorri`},
{ID: `Lorrie`},
{ID: `Lottie`},
{ID: `Lou`},
{ID: `Louann`},
{ID: `Louella`},
{ID: `Louie`},
{ID: `Louis`},
{ID: `Louisa`},
{ID: `Louise`},
{ID: `Lourdes`},
{ID: `Lowell`},
{ID: `Loyd`},
{ID: `Lu`},
{ID: `Luann`},
{ID: `Luanne`},
{ID: `Lucia`},
{ID: `Lucille`},
{ID: `Lucinda`},
{ID: `Lucius`},
{ID: `Lucretia`},
{ID: `Lucy`},
{ID: `Luella`},
{ID: `Luis`},
{ID: `Luke`},
{ID: `Lula`},
{ID: `Lupe`},
{ID: `Luther`},
{ID: `Luz`},
{ID: `Lydia`},
{ID: `Lyle`},
{ID: `Lyman`},
{ID: `Lyn`},
{ID: `Lynda`},
{ID: `Lyndon`},
{ID: `Lynette`},
{ID: `Lynn`},
{ID: `Lynne`},
{ID: `Lynnette`},
{ID: `Lynwood`},
{ID: `Mabel`},
{ID: `Mable`},
{ID: `Mac`},
{ID: `Mack`},
{ID: `Madeleine`},
{ID: `Madeline`},
{ID: `Madelyn`},
{ID: `Madonna`},
{ID: `Mae`},
{ID: `Magdalena`},
{ID: `Maggie`},
{ID: `Major`},
{ID: `Malcolm`},
{ID: `Malinda`},
{ID: `Mamie`},
{ID: `Manuel`},
{ID: `Mara`},
{ID: `Marc`},
{ID: `Marcel`},
{ID: `Marcella`},
{ID: `Marci`},
{ID: `Marcia`},
{ID: `Marcie`},
{ID: `Marco`},
{ID: `Marcos`},
{ID: `Marcus`},
{ID: `Marcy`},
{ID: `Margaret`},
{ID: `Margarita`},
{ID: `Margarito`},
{ID: `Margery`},
{ID: `Margie`},
{ID: `Margo`},
{ID: `Margot`},
{ID: `Margret`},
{ID: `Marguerite`},
{ID: `Mari`},
{ID: `Maria`},
{ID: `Marian`},
{ID: `Mariann`},
{ID: `Marianna`},
{ID: `Marianne`},
{ID: `Maribeth`},
{ID: `Marie`},
{ID: `Marietta`},
{ID: `Marilee`},
{ID: `Marilyn`},
{ID: `Marilynn`},
{ID: `Marina`},
{ID: `Mario`},
{ID: `Marion`},
{ID: `Marita`},
{ID: `Marjorie`},
{ID: `Mark`},
{ID: `Marla`},
{ID: `Marlene`},
{ID: `Marlin`},
{ID: `Marlon`},
{ID: `Marlys`},
{ID: `Marsha`},
{ID: `Marshall`},
{ID: `Marta`},
{ID: `Martha`},
{ID: `Martin`},
{ID: `Martina`},
{ID: `Marty`},
{ID: `Marva`},
{ID: `Marvin`},
{ID: `Mary`},
{ID: `Maryann`},
{ID: `Maryanne`},
{ID: `Marybeth`},
{ID: `Maryellen`},
{ID: `Maryjane`},
{ID: `Maryjo`},
{ID: `Marylou`},
{ID: `Mason`},
{ID: `Mathew`},
{ID: `Matilda`},
{ID: `Matt`},
{ID: `Matthew`},
{ID: `Mattie`},
{ID: `Maura`},
{ID: `Maureen`},
{ID: `Maurice`},
{ID: `Mavis`},
{ID: `Max`},
{ID: `Maxine`},
{ID: `Maxwell`},
{ID: `May`},
{ID: `Maynard`},
{ID: `Mckinley`},
{ID: `Megan`},
{ID: `Mel`},
{ID: `Melanie`},
{ID: `Melba`},
{ID: `Melinda`},
{ID: `Melissa`},
{ID: `Melodee`},
{ID: `Melodie`},
{ID: `Melody`},
{ID: `Melva`},
{ID: `Melvin`},
{ID: `Mercedes`},
{ID: `Meredith`},
{ID: `Merle`},
{ID: `Merlin`},
{ID: `Merri`},
{ID: `Merrill`},
{ID: `Merry`},
{ID: `Mervin`},
{ID: `Meryl`},
{ID: `Michael`},
{ID: `Michal`},
{ID: `Michale`},
{ID: `Micheal`},
{ID: `Michel`},
{ID: `Michele`},
{ID: `Michelle`},
{ID: `Mickey`},
{ID: `Mickie`},
{ID: `Micky`},
{ID: `Migdalia`},
{ID: `Miguel`},
{ID: `Mike`},
{ID: `Mikel`},
{ID: `Milagros`},
{ID: `Milan`},
{ID: `Mildred`},
{ID: `Miles`},
{ID: `Milford`},
{ID: `Millard`},
{ID: `Millicent`},
{ID: `Millie`},
{ID: `Milo`},
{ID: `Milton`},
{ID: `Mimi`},
{ID: `Mindy`},
{ID: `Minerva`},
{ID: `Minnie`},
{ID: `Miriam`},
{ID: `Mitch`},
{ID: `Mitchel`},
{ID: `Mitchell`},
{ID: `Mitzi`},
{ID: `Moira`},
{ID: `Moises`},
{ID: `Mollie`},
{ID: `Molly`},
{ID: `Mona`},
{ID: `Monica`},
{ID: `Monique`},
{ID: `Monroe`},
{ID: `Monte`},
{ID: `Monty`},
{ID: `Morgan`},
{ID: `Morris`},
{ID: `Mose`},
{ID: `Moses`},
{ID: `Muriel`},
{ID: `Murphy`},
{ID: `Murray`},
{ID: `Myles`},
{ID: `Myra`},
{ID: `Myrna`},
{ID: `Myron`},
{ID: `Myrtle`},
{ID: `Nadine`},
{ID: `Nan`},
{ID: `Nanci`},
{ID: `Nancy`},
{ID: `Nanette`},
{ID: `Nannette`},
{ID: `Naomi`},
{ID: `Napoleon`},
{ID: `Natalie`},
{ID: `Nathan`},
{ID: `Nathaniel`},
{ID: `Neal`},
{ID: `Ned`},
{ID: `Nedra`},
{ID: `Neil`},
{ID: `Nelda`},
{ID: `Nellie`},
{ID: `Nelson`},
{ID: `Nettie`},
{ID: `Neva`},
{ID: `Newton`},
{ID: `Nicholas`},
{ID: `Nick`},
{ID: `Nicki`},
{ID: `Nickolas`},
{ID: `Nicky`},
{ID: `Nicolas`},
{ID: `Nicole`},
{ID: `Nikki`},
{ID: `Nina`},
{ID: `Nita`},
{ID: `Noah`},
{ID: `Noe`},
{ID: `Noel`},
{ID: `Noel`},
{ID: `Noemi`},
{ID: `Nola`},
{ID: `Nolan`},
{ID: `Nona`},
{ID: `Nora`},
{ID: `Norbert`},
{ID: `Noreen`},
{ID: `Norma`},
{ID: `Norman`},
{ID: `Normand`},
{ID: `Norris`},
{ID: `Odell`},
{ID: `Odessa`},
{ID: `Odis`},
{ID: `Ofelia`},
{ID: `Ola`},
{ID: `Olen`},
{ID: `Olga`},
{ID: `Olin`},
{ID: `Oliver`},
{ID: `Olivia`},
{ID: `Ollie`},
{ID: `Ollie`},
{ID: `Omar`},
{ID: `Opal`},
{ID: `Ophelia`},
{ID: `Ora`},
{ID: `Oralia`},
{ID: `Orlando`},
{ID: `Orval`},
{ID: `Orville`},
{ID: `Oscar`},
{ID: `Otha`},
{ID: `Otis`},
{ID: `Otto`},
{ID: `Owen`},
{ID: `Pablo`},
{ID: `Paige`},
{ID: `Pam`},
{ID: `Pamala`},
{ID: `Pamela`},
{ID: `Pamella`},
{ID: `Pasquale`},
{ID: `Pat`},
{ID: `Patrica`},
{ID: `Patrice`},
{ID: `Patricia`},
{ID: `Patrick`},
{ID: `Patsy`},
{ID: `Patti`},
{ID: `Pattie`},
{ID: `Patty`},
{ID: `Paul`},
{ID: `Paula`},
{ID: `Paulette`},
{ID: `Pauline`},
{ID: `Pearl`},
{ID: `Pearlie`},
{ID: `Pedro`},
{ID: `Peggie`},
{ID: `Peggy`},
{ID: `Penelope`},
{ID: `Pennie`},
{ID: `Penny`},
{ID: `Percy`},
{ID: `Perry`},
{ID: `Pete`},
{ID: `Peter`},
{ID: `Phil`},
{ID: `Philip`},
{ID: `Phoebe`},
{ID: `Phyllis`},
{ID: `Pierre`},
{ID: `Polly`},
{ID: `Porter`},
{ID: `Portia`},
{ID: `Preston`},
{ID: `Prince`},
{ID: `Priscilla`},
{ID: `Queen`},
{ID: `Quentin`},
{ID: `Quincy`},
{ID: `Quinton`},
{ID: `Rachael`},
{ID: `Rachel`},
{ID: `Rachelle`},
{ID: `Rae`},
{ID: `Rafael`},
{ID: `Raleigh`},
{ID: `Ralph`},
{ID: `Ramiro`},
{ID: `Ramon`},
{ID: `Ramona`},
{ID: `Rand`},
{ID: `Randal`},
{ID: `Randall`},
{ID: `Randel`},
{ID: `Randi`},
{ID: `Randle`},
{ID: `Randolf`},
{ID: `Randolph`},
{ID: `Randy`},
{ID: `Raphael`},
{ID: `Raquel`},
{ID: `Raul`},
{ID: `Ray`},
{ID: `Rayford`},
{ID: `Raymon`},
{ID: `Raymond`},
{ID: `Raymundo`},
{ID: `Reba`},
{ID: `Rebecca`},
{ID: `Rebekah`},
{ID: `Reed`},
{ID: `Regenia`},
{ID: `Reggie`},
{ID: `Regina`},
{ID: `Reginald`},
{ID: `Regis`},
{ID: `Reid`},
{ID: `Rena`},
{ID: `Renae`},
{ID: `Rene`},
{ID: `Renee`},
{ID: `Renita`},
{ID: `Reta`},
{ID: `Retha`},
{ID: `Reuben`},
{ID: `Reva`},
{ID: `Rex`},
{ID: `Reynaldo`},
{ID: `Reynold`},
{ID: `Rhea`},
{ID: `Rhett`},
{ID: `Rhoda`},
{ID: `Rhonda`},
{ID: `Ricardo`},
{ID: `Richard`},
{ID: `Rick`},
{ID: `Rickey`},
{ID: `Ricki`},
{ID: `Rickie`},
{ID: `Ricky`},
{ID: `Riley`},
{ID: `Rita`},
{ID: `Ritchie`},
{ID: `Rob`},
{ID: `Robbie`},
{ID: `Robbin`},
{ID: `Robbin`},
{ID: `Robby`},
{ID: `Robert`},
{ID: `Roberta`},
{ID: `Roberto`},
{ID: `Robin`},
{ID: `Robyn`},
{ID: `Rocco`},
{ID: `Rochelle`},
{ID: `Rock`},
{ID: `Rocky`},
{ID: `Rod`},
{ID: `Roderick`},
{ID: `Rodger`},
{ID: `Rodney`},
{ID: `Rodolfo`},
{ID: `Rodrick`},
{ID: `Rogelio`},
{ID: `Roger`},
{ID: `Rogers`},
{ID: `Roland`},
{ID: `Rolando`},
{ID: `Rolf`},
{ID: `Rolland`},
{ID: `Roman`},
{ID: `Romona`},
{ID: `Ron`},
{ID: `Rona`},
{ID: `Ronald`},
{ID: `Ronda`},
{ID: `Roni`},
{ID: `Ronna`},
{ID: `Ronnie`},
{ID: `Ronny`},
{ID: `Roosevelt`},
{ID: `Rory`},
{ID: `Rosa`},
{ID: `Rosalie`},
{ID: `Rosalind`},
{ID: `Rosalinda`},
{ID: `Rosalyn`},
{ID: `Rosanna`},
{ID: `Rosanne`},
{ID: `Rosario`},
{ID: `Roscoe`},
{ID: `Rose`},
{ID: `Roseann`},
{ID: `Roseanne`},
{ID: `Rosemarie`},
{ID: `Rosemary`},
{ID: `Rosendo`},
{ID: `Rosetta`},
{ID: `Rosie`},
{ID: `Rosita`},
{ID: `Roslyn`},
{ID: `Ross`},
{ID: `Rowena`},
{ID: `Rowland`},
{ID: `Roxane`},
{ID: `Roxann`},
{ID: `Roxanna`},
{ID: `Roxanne`},
{ID: `Roxie`},
{ID: `Roy`},
{ID: `Royal`},
{ID: `Royce`},
{ID: `Ruben`},
{ID: `Rubin`},
{ID: `Ruby`},
{ID: `Rudolfo`},
{ID: `Rudolph`},
{ID: `Rudy`},
{ID: `Rufus`},
{ID: `Russ`},
{ID: `Russel`},
{ID: `Russell`},
{ID: `Rusty`},
{ID: `Ruth`},
{ID: `Ruthie`},
{ID: `Ryan`},
{ID: `Sabrina`},
{ID: `Sadie`},
{ID: `Sallie`},
{ID: `Sally`},
{ID: `Salvador`},
{ID: `Salvatore`},
{ID: `Sam`},
{ID: `Sammie`},
{ID: `Sammy`},
{ID: `Samuel`},
{ID: `Sandi`},
{ID: `Sandra`},
{ID: `Sandy`},
{ID: `Sanford`},
{ID: `Santiago`},
{ID: `Santos`},
{ID: `Sara`},
{ID: `Sarah`},
{ID: `Saul`},
{ID: `Saundra`},
{ID: `Scot`},
{ID: `Scott`},
{ID: `Scottie`},
{ID: `Scotty`},
{ID: `Sean`},
{ID: `Selma`},
{ID: `Serena`},
{ID: `Sergio`},
{ID: `Seth`},
{ID: `Shane`},
{ID: `Shannon`},
{ID: `Sharen`},
{ID: `Shari`},
{ID: `Sharlene`},
{ID: `Sharon`},
{ID: `Sharron`},
{ID: `Shaun`},
{ID: `Shauna`},
{ID: `Shawn`},
{ID: `Sheila`},
{ID: `Sheilah`},
{ID: `Shelby`},
{ID: `Sheldon`},
{ID: `Shelia`},
{ID: `Shelley`},
{ID: `Shelly`},
{ID: `Shelton`},
{ID: `Sheree`},
{ID: `Sheri`},
{ID: `Sherie`},
{ID: `Sherman`},
{ID: `Sheron`},
{ID: `Sherree`},
{ID: `Sherri`},
{ID: `Sherrie`},
{ID: `Sherrill`},
{ID: `Sherry`},
{ID: `Sherryl`},
{ID: `Sherwood`},
{ID: `Sheryl`},
{ID: `Sheryll`},
{ID: `Shirlene`},
{ID: `Shirley`},
{ID: `Sidney`},
{ID: `Silas`},
{ID: `Silvia`},
{ID: `Simon`},
{ID: `Skip`},
{ID: `Solomon`},
{ID: `Sondra`},
{ID: `Sonia`},
{ID: `Sonja`},
{ID: `Sonny`},
{ID: `Sonya`},
{ID: `Sophia`},
{ID: `Sophie`},
{ID: `Spencer`},
{ID: `Stacey`},
{ID: `Stacy`},
{ID: `Stacy`},
{ID: `Stan`},
{ID: `Stanford`},
{ID: `Stanley`},
{ID: `Stanton`},
{ID: `Starla`},
{ID: `Stella`},
{ID: `Stephan`},
{ID: `Stephanie`},
{ID: `Stephen`},
{ID: `Sterling`},
{ID: `Stevan`},
{ID: `Steve`},
{ID: `Steven`},
{ID: `Stevie`},
{ID: `Stewart`},
{ID: `Stuart`},
{ID: `Sue`},
{ID: `Suellen`},
{ID: `Susan`},
{ID: `Susana`},
{ID: `Susanna`},
{ID: `Susanne`},
{ID: `Susie`},
{ID: `Suzan`},
{ID: `Suzann`},
{ID: `Suzanne`},
{ID: `Suzette`},
{ID: `Sybil`},
{ID: `Sydney`},
{ID: `Sylvester`},
{ID: `Sylvia`},
{ID: `Tad`},
{ID: `Talmadge`},
{ID: `Tamara`},
{ID: `Tami`},
{ID: `Tammy`},
{ID: `Tana`},
{ID: `Tanya`},
{ID: `Tara`},
{ID: `Taryn`},
{ID: `Taylor`},
{ID: `Ted`},
{ID: `Teddy`},
{ID: `Teena`},
{ID: `Tena`},
{ID: `Terence`},
{ID: `Teresa`},
{ID: `Terese`},
{ID: `Teressa`},
{ID: `Teri`},
{ID: `Terrance`},
{ID: `Terrell`},
{ID: `Terrence`},
{ID: `Terri`},
{ID: `Terrie`},
{ID: `Terry`},
{ID: `Thad`},
{ID: `Thaddeus`},
{ID: `Thea`},
{ID: `Theadore`},
{ID: `Thelma`},
{ID: `Theodis`},
{ID: `Theodore`},
{ID: `Theresa`},
{ID: `Therese`},
{ID: `Theron`},
{ID: `Thomas`},
{ID: `Thurman`},
{ID: `Tim`},
{ID: `Timmothy`},
{ID: `Timmy`},
{ID: `Timothy`},
{ID: `Tina`},
{ID: `Toby`},
{ID: `Tod`},
{ID: `Todd`},
{ID: `Tom`},
{ID: `Tomas`},
{ID: `Tommie`},
{ID: `Tommy`},
{ID: `Toney`},
{ID: `Toni`},
{ID: `Tonia`},
{ID: `Tony`},
{ID: `Tonya`},
{ID: `Tracey`},
{ID: `Tracy`},
{ID: `Travis`},
{ID: `Trena`},
{ID: `Trent`},
{ID: `Treva`},
{ID: `Tricia`},
{ID: `Trina`},
{ID: `Troy`},
{ID: `Trudy`},
{ID: `Truman`},
{ID: `Twila`},
{ID: `Twyla`},
{ID: `Ty`},
{ID: `Tyler`},
{ID: `Tyrone`},
{ID: `Ulysses`},
{ID: `Ursula`},
{ID: `Val`},
{ID: `Valarie`},
{ID: `Valentine`},
{ID: `Valeria`},
{ID: `Valerie`},
{ID: `Valorie`},
{ID: `Van`},
{ID: `Vance`},
{ID: `Vanessa`},
{ID: `Vaughn`},
{ID: `Velda`},
{ID: `Velma`},
{ID: `Venita`},
{ID: `Vera`},
{ID: `Vern`},
{ID: `Verna`},
{ID: `Verne`},
{ID: `Vernell`},
{ID: `Vernell`},
{ID: `Vernita`},
{ID: `Vernon`},
{ID: `Veronica`},
{ID: `Vicente`},
{ID: `Vickey`},
{ID: `Vicki`},
{ID: `Vickie`},
{ID: `Vicky`},
{ID: `Victor`},
{ID: `Victoria`},
{ID: `Vikki`},
{ID: `Vince`},
{ID: `Vincent`},
{ID: `Viola`},
{ID: `Violet`},
{ID: `Virgie`},
{ID: `Virgil`},
{ID: `Virginia`},
{ID: `Vito`},
{ID: `Vivian`},
{ID: `Von`},
{ID: `Vonda`},
{ID: `Wade`},
{ID: `Walker`},
{ID: `Wallace`},
{ID: `Wally`},
{ID: `Walter`},
{ID: `Wanda`},
{ID: `Ward`},
{ID: `Wardell`},
{ID: `Warner`},
{ID: `Warren`},
{ID: `Waymon`},
{ID: `Wayne`},
{ID: `Weldon`},
{ID: `Wendell`},
{ID: `Wendy`},
{ID: `Wesley`},
{ID: `Wilbert`},
{ID: `Wilbur`},
{ID: `Wilburn`},
{ID: `Wiley`},
{ID: `Wilford`},
{ID: `Wilfred`},
{ID: `Wilfredo`},
{ID: `Will`},
{ID: `Willa`},
{ID: `Willard`},
{ID: `William`},
{ID: `Williams`},
{ID: `Willie`},
{ID: `Willis`},
{ID: `Wilma`},
{ID: `Wilmer`},
{ID: `Wilson`},
{ID: `Wilton`},
{ID: `Winford`},
{ID: `Winfred`},
{ID: `Winifred`},
{ID: `Winona`},
{ID: `Winston`},
{ID: `Woodrow`},
{ID: `Woody`},
{ID: `Wyatt`},
{ID: `Xavier`},
{ID: `Yolanda`},
{ID: `Yvette`},
{ID: `Yvonne`},
{ID: `Zachary`},
{ID: `Zane`},
{ID: `Zelda`},
{ID: `Zelma`},
{ID: `Zoe`}}},
`ISO3166`: {ID: `ISO3166`, Name: `Country Codes`, Row: []Row{
{ID: `ABW`, Description: `Aruba`},
{ID: `AFG`, Description: `Afghanistan`},
{ID: `AGO`, Description: `Angola`},
{ID: `AIA`, Description: `Anguilla`},
{ID: `ALA`, Description: `Aland Islands`},
{ID: `ALB`, Description: `Albania`},
{ID: `AND`, Description: `Andorra`},
{ID: `ARE`, Description: `United Arab Emirates`},
{ID: `ARG`, Description: `Argentina`},
{ID: `ARM`, Description: `Armenia`},
{ID: `ASM`, Description: `American Samoa`},
{ID: `ATA`, Description: `Antarctica`},
{ID: `ATF`, Description: `French Southern Territories`},
{ID: `ATG`, Description: `Antigua and Barbuda`},
{ID: `AUS`, Description: `Australia`},
{ID: `AUT`, Description: `Austria`},
{ID: `AZE`, Description: `Azerbaijan`},
{ID: `BDI`, Description: `Burundi`},
{ID: `BEL`, Description: `Belgium`},
{ID: `BEN`, Description: `Benin`},
{ID: `BES`, Description: `Bonaire, Sint Eustatius and Saba`},
{ID: `BFA`, Description: `Burkina Faso`},
{ID: `BGD`, Description: `Bangladesh`},
{ID: `BGR`, Description: `Bulgaria`},
{ID: `BHR`, Description: `Bahrain`},
{ID: `BHS`, Description: `Bahamas`},
{ID: `BIH`, Description: `Bosnia and Herzegovina`},
{ID: `BLM`, Description: `Saint Barthélemy`},
{ID: `BLR`, Description: `Belarus`},
{ID: `BLZ`, Description: `Belize`},
{ID: `BMU`, Description: `Bermuda`},
{ID: `BOL`, Description: `Bolivia (Plurinational State of)`},
{ID: `BRA`, Description: `Brazil`},
{ID: `BRB`, Description: `Barbados`},
{ID: `BRN`, Description: `Brunei Darussalam`},
{ID: `BTN`, Description: `Bhutan`},
{ID: `BVT`, Description: `Bouvet Island`},
{ID: `BWA`, Description: `Botswana`},
{ID: `CAF`, Description: `Central African Republic`},
{ID: `CAN`, Description: `Canada`},
{ID: `CCK`, Description: `Cocos (Keeling) Islands`},
{ID: `CHE`, Description: `Switzerland`},
{ID: `CHL`, Description: `Chile`},
{ID: `CHN`, Description: `China`},
{ID: `CIV`, Description: `Côte d'Ivoire`},
{ID: `CMR`, Description: `Cameroon`},
{ID: `COD`, Description: `Congo, Democratic Republic of the`},
{ID: `COG`, Description: `Congo`},
{ID: `COK`, Description: `Cook Islands`},
{ID: `COL`, Description: `Colombia`},
{ID: `COM`, Description: `Comoros`},
{ID: `CPV`, Description: `Cabo Verde`},
{ID: `CRI`, Description: `Costa Rica`},
{ID: `CUB`, Description: `Cuba`},
{ID: `CUW`, Description: `Curaçao`},
{ID: `CXR`, Description: `Christmas Island`},
{ID: `CYM`, Description: `Cayman Islands`},
{ID: `CYP`, Description: `Cyprus`},
{ID: `CZE`, Description: `Czechia`},
{ID: `DEU`, Description: `Germany`},
{ID: `DJI`, Description: `Djibouti`},
{ID: `DMA`, Description: `Dominica`},
{ID: `DNK`, Description: `Denmark`},
{ID: `DOM`, Description: `Dominican Republic`},
{ID: `DZA`, Description: `Algeria`},
{ID: `ECU`, Description: `Ecuador`},
{ID: `EGY`, Description: `Egypt`},
{ID: `ERI`, Description: `Eritrea`},
{ID: `ESH`, Description: `Western Sahara`},
{ID: `ESP`, Description: `Spain`},
{ID: `EST`, Description: `Estonia`},
{ID: `ETH`, Description: `Ethiopia`},
{ID: `FIN`, Description: `Finland`},
{ID: `FJI`, Description: `Fiji`},
{ID: `FLK`, Description: `Falkland Islands (Malvinas)`},
{ID: `FRA`, Description: `France`},
{ID: `FRO`, Description: `Faroe Islands`},
{ID: `FSM`, Description: `Micronesia (Federated States of)`},
{ID: `GAB`, Description: `Gabon`},
{ID: `GBR`, Description: `United Kingdom of Great Britain and Northern Ireland`},
{ID: `GEO`, Description: `Georgia`},
{ID: `GGY`, Description: `Guernsey`},
{ID: `GHA`, Description: `Ghana`},
{ID: `GIB`, Description: `Gibraltar`},
{ID: `GIN`, Description: `Guinea`},
{ID: `GLP`, Description: `Guadeloupe`},
{ID: `GMB`, Description: `Gambia`},
{ID: `GNB`, Description: `Guinea-Bissau`},
{ID: `GNQ`, Description: `Equatorial Guinea`},
{ID: `GRC`, Description: `Greece`},
{ID: `GRD`, Description: `Grenada`},
{ID: `GRL`, Description: `Greenland`},
{ID: `GTM`, Description: `Guatemala`},
{ID: `GUF`, Description: `French Guiana`},
{ID: `GUM`, Description: `Guam`},
{ID: `GUY`, Description: `Guyana`},
{ID: `HKG`, Description: `Hong Kong`},
{ID: `HMD`, Description: `Heard Island and McDonald Islands`},
{ID: `HND`, Description: `Honduras`},
{ID: `HRV`, Description: `Croatia`},
{ID: `HTI`, Description: `Haiti`},
{ID: `HUN`, Description: `Hungary`},
{ID: `IDN`, Description: `Indonesia`},
{ID: `IMN`, Description: `Isle of Man`},
{ID: `IND`, Description: `India`},
{ID: `IOT`, Description: `British Indian Ocean Territory`},
{ID: `IRL`, Description: `Ireland`},
{ID: `IRN`, Description: `Iran (Islamic Republic of)`},
{ID: `IRQ`, Description: `Iraq`},
{ID: `ISL`, Description: `Iceland`},
{ID: `ISR`, Description: `Israel`},
{ID: `ITA`, Description: `Italy`},
{ID: `JAM`, Description: `Jamaica`},
{ID: `JEY`, Description: `Jersey`},
{ID: `JOR`, Description: `Jordan`},
{ID: `JPN`, Description: `Japan`},
{ID: `KAZ`, Description: `Kazakhstan`},
{ID: `KEN`, Description: `Kenya`},
{ID: `KGZ`, Description: `Kyrgyzstan`},
{ID: `KHM`, Description: `Cambodia`},
{ID: `KIR`, Description: `Kiribati`},
{ID: `KNA`, Description: `Saint Kitts and Nevis`},
{ID: `KOR`, Description: `Korea, Republic of`},
{ID: `KWT`, Description: `Kuwait`},
{ID: `LAO`, Description: `Lao People's Democratic Republic`},
{ID: `LBN`, Description: `Lebanon`},
{ID: `LBR`, Description: `Liberia`},
{ID: `LBY`, Description: `Libya`},
{ID: `LCA`, Description: `Saint Lucia`},
{ID: `LIE`, Description: `Liechtenstein`},
{ID: `LKA`, Description: `Sri Lanka`},
{ID: `LSO`, Description: `Lesotho`},
{ID: `LTU`, Description: `Lithuania`},
{ID: `LUX`, Description: `Luxembourg`},
{ID: `LVA`, Description: `Latvia`},
{ID: `MAC`, Description: `Macao`},
{ID: `MAF`, Description: `Saint Martin (French part)`},
{ID: `MAR`, Description: `Morocco`},
{ID: `MCO`, Description: `Monaco`},
{ID: `MDA`, Description: `Moldova, Republic of`},
{ID: `MDG`, Description: `Madagascar`},
{ID: `MDV`, Description: `Maldives`},
{ID: `MEX`, Description: `Mexico`},
{ID: `MHL`, Description: `Marshall Islands`},
{ID: `MKD`, Description: `North Macedonia`},
{ID: `MLI`, Description: `Mali`},
{ID: `MLT`, Description: `Malta`},
{ID: `MMR`, Description: `Myanmar`},
{ID: `MNE`, Description: `Montenegro`},
{ID: `MNG`, Description: `Mongolia`},
{ID: `MNP`, Description: `Northern Mariana Islands`},
{ID: `MOZ`, Description: `Mozambique`},
{ID: `MRT`, Description: `Mauritania`},
{ID: `MSR`, Description: `Montserrat`},
{ID: `MTQ`, Description: `Martinique`},
{ID: `MUS`, Description: `Mauritius`},
{ID: `MWI`, Description: `Malawi`},
{ID: `MYS`, Description: `Malaysia`},
{ID: `MYT`, Description: `Mayotte`},
{ID: `NAM`, Description: `Namibia`},
{ID: `NCL`, Description: `New Caledonia`},
{ID: `NER`, Description: `Niger`},
{ID: `NFK`, Description: `Norfolk Island`},
{ID: `NGA`, Description: `Nigeria`},
{ID: `NIC`, Description: `Nicaragua`},
{ID: `NIU`, Description: `Niue`},
{ID: `NLD`, Description: `Netherlands`},
{ID: `NOR`, Description: `Norway`},
{ID: `NPL`, Description: `Nepal`},
{ID: `NRU`, Description: `Nauru`},
{ID: `NZL`, Description: `New Zealand`},
{ID: `OMN`, Description: `Oman`},
{ID: `PAK`, Description: `Pakistan`},
{ID: `PAN`, Description: `Panama`},
{ID: `PCN`, Description: `Pitcairn`},
{ID: `PER`, Description: `Peru`},
{ID: `PHL`, Description: `Philippines`},
{ID: `PLW`, Description: `Palau`},
{ID: `PNG`, Description: `Papua New Guinea`},
{ID: `POL`, Description: `Poland`},
{ID: `PRI`, Description: `Puerto Rico`},
{ID: `PRK`, Description: `Korea (Democratic People's Republic of)`},
{ID: `PRT`, Description: `Portugal`},
{ID: `PRY`, Description: `Paraguay`},
{ID: `PSE`, Description: `Palestine, State of`},
{ID: `PYF`, Description: `French Polynesia`},
{ID: `QAT`, Description: `Qatar`},
{ID: `REU`, Description: `Réunion`},
{ID: `ROU`, Description: `Romania`},
{ID: `RUS`, Description: `Russian Federation`},
{ID: `RWA`, Description: `Rwanda`},
{ID: `SAU`, Description: `Saudi Arabia`},
{ID: `SDN`, Description: `Sudan`},
{ID: `SEN`, Description: `Senegal`},
{ID: `SGP`, Description: `Singapore`},
{ID: `SGS`, Description: `South Georgia and the South Sandwich Islands`},
{ID: `SHN`, Description: `Saint Helena, Ascension and Tristan da Cunha`},
{ID: `SJM`, Description: `Svalbard and Jan Mayen`},
{ID: `SLB`, Description: `Solomon Islands`},
{ID: `SLE`, Description: `Sierra Leone`},
{ID: `SLV`, Description: `El Salvador`},
{ID: `SMR`, Description: `San Marino`},
{ID: `SOM`, Description: `Somalia`},
{ID: `SPM`, Description: `Saint Pierre and Miquelon`},
{ID: `SRB`, Description: `Serbia`},
{ID: `SSD`, Description: `South Sudan`},
{ID: `STP`, Description: `Sao Tome and Principe`},
{ID: `SUR`, Description: `Suriname`},
{ID: `SVK`, Description: `Slovakia`},
{ID: `SVN`, Description: `Slovenia`},
{ID: `SWE`, Description: `Sweden`},
{ID: `SWZ`, Description: `Eswatini`},
{ID: `SXM`, Description: `Sint Maarten (Dutch part)`},
{ID: `SYC`, Description: `Seychelles`},
{ID: `SYR`, Description: `Syrian Arab Republic`},
{ID: `TCA`, Description: `Turks and Caicos Islands`},
{ID: `TCD`, Description: `Chad`},
{ID: `TGO`, Description: `Togo`},
{ID: `THA`, Description: `Thailand`},
{ID: `TJK`, Description: `Tajikistan`},
{ID: `TKL`, Description: `Tokelau`},
{ID: `TKM`, Description: `Turkmenistan`},
{ID: `TLS`, Description: `Timor-Leste`},
{ID: `TON`, Description: `Tonga`},
{ID: `TTO`, Description: `Trinidad and Tobago`},
{ID: `TUN`, Description: `Tunisia`},
{ID: `TUR`, Description: `Turkey`},
{ID: `TUV`, Description: `Tuvalu`},
{ID: `TWN`, Description: `Taiwan, Province of China`},
{ID: `TZA`, Description: `Tanzania, United Republic of`},
{ID: `UGA`, Description: `Uganda`},
{ID: `UKR`, Description: `Ukraine`},
{ID: `UMI`, Description: `United States Minor Outlying Islands`},
{ID: `URY`, Description: `Uruguay`},
{ID: `USA`, Description: `United States of America`},
{ID: `UZB`, Description: `Uzbekistan`},
{ID: `VAT`, Description: `Holy See`},
{ID: `VCT`, Description: `Saint Vincent and the Grenadines`},
{ID: `VEN`, Description: `Venezuela (Bolivarian Republic of)`},
{ID: `VGB`, Description: `Virgin Islands (British)`},
{ID: `VIR`, Description: `Virgin Islands (U.S.)`},
{ID: `VNM`, Description: `Viet Nam`},
{ID: `VUT`, Description: `Vanuatu`},
{ID: `WLF`, Description: `Wallis and Futuna`},
{ID: `WSM`, Description: `Samoa`},
{ID: `YEM`, Description: `Yemen`},
{ID: `ZAF`, Description: `South Africa`},
{ID: `ZMB`, Description: `Zambia`},
{ID: `ZWE`, Description: `Zimbabwe`}}},
`ISO4217`: {ID: `ISO4217`, Name: `Currency Codes`, Row: []Row{
{ID: ``, Description: `No universal currency`},
{ID: `AED`, Description: `UAE Dirham`},
{ID: `AFN`, Description: `Afghani`},
{ID: `ALL`, Description: `Lek`},
{ID: `AMD`, Description: `Armenian Dram`},
{ID: `ANG`, Description: `Netherlands Antillean Guilder`},
{ID: `AOA`, Description: `Kwanza`},
{ID: `ARS`, Description: `Argentine Peso`},
{ID: `AUD`, Description: `Australian Dollar`},
{ID: `AWG`, Description: `Aruban Florin`},
{ID: `AZN`, Description: `Azerbaijan Manat`},
{ID: `BAM`, Description: `Convertible Mark`},
{ID: `BBD`, Description: `Barbados Dollar`},
{ID: `BDT`, Description: `Taka`},
{ID: `BGN`, Description: `Bulgarian Lev`},
{ID: `BHD`, Description: `Bahraini Dinar`},
{ID: `BIF`, Description: `Burundi Franc`},
{ID: `BMD`, Description: `Bermudian Dollar`},
{ID: `BND`, Description: `Brunei Dollar`},
{ID: `BOB`, Description: `Boliviano`},
{ID: `BOV`, Description: `Mvdol`},
{ID: `BRL`, Description: `Brazilian Real`},
{ID: `BSD`, Description: `Bahamian Dollar`},
{ID: `BTN`, Description: `Ngultrum`},
{ID: `BWP`, Description: `Pula`},
{ID: `BYN`, Description: `Belarusian Ruble`},
{ID: `BZD`, Description: `Belize Dollar`},
{ID: `CAD`, Description: `Canadian Dollar`},
{ID: `CDF`, Description: `Congolese Franc`},
{ID: `CHE`, Description: `WIR Euro`},
{ID: `CHF`, Description: `Swiss Franc`},
{ID: `CHW`, Description: `WIR Franc`},
{ID: `CLF`, Description: `Unidad de Fomento`},
{ID: `CLP`, Description: `Chilean Peso`},
{ID: `CNY`, Description: `Yuan Renminbi`},
{ID: `COP`, Description: `Colombian Peso`},
{ID: `COU`, Description: `Unidad de Valor Real`},
{ID: `CRC`, Description: `Costa Rican Colon`},
{ID: `CUC`, Description: `Peso Convertible`},
{ID: `CUP`, Description: `Cuban Peso`},
{ID: `CVE`, Description: `Cabo Verde Escudo`},
{ID: `CZK`, Description: `Czech Koruna`},
{ID: `DJF`, Description: `Djibouti Franc`},
{ID: `DKK`, Description: `Danish Krone`},
{ID: `DOP`, Description: `Dominican Peso`},
{ID: `DZD`, Description: `Algerian Dinar`},
{ID: `EGP`, Description: `Egyptian Pound`},
{ID: `ERN`, Description: `Nakfa`},
{ID: `ETB`, Description: `Ethiopian Birr`},
{ID: `EUR`, Description: `Euro`},
{ID: `FJD`, Description: `Fiji Dollar`},
{ID: `FKP`, Description: `Falkland Islands Pound`},
{ID: `GBP`, Description: `Pound Sterling`},
{ID: `GEL`, Description: `Lari`},
{ID: `GHS`, Description: `Ghana Cedi`},
{ID: `GIP`, Description: `Gibraltar Pound`},
{ID: `GMD`, Description: `Dalasi`},
{ID: `GNF`, Description: `Guinean Franc`},
{ID: `GTQ`, Description: `Quetzal`},
{ID: `GYD`, Description: `Guyana Dollar`},
{ID: `HKD`, Description: `Hong Kong Dollar`},
{ID: `HNL`, Description: `Lempira`},
{ID: `HRK`, Description: `Kuna`},
{ID: `HTG`, Description: `Gourde`},
{ID: `HUF`, Description: `Forint`},
{ID: `IDR`, Description: `Rupiah`},
{ID: `ILS`, Description: `New Israeli Sheqel`},
{ID: `INR`, Description: `Indian Rupee`},
{ID: `IQD`, Description: `Iraqi Dinar`},
{ID: `IRR`, Description: `Iranian Rial`},
{ID: `ISK`, Description: `Iceland Krona`},
{ID: `JMD`, Description: `Jamaican Dollar`},
{ID: `JOD`, Description: `Jordanian Dinar`},
{ID: `JPY`, Description: `Yen`},
{ID: `KES`, Description: `Kenyan Shilling`},
{ID: `KGS`, Description: `Som`},
{ID: `KHR`, Description: `Riel`},
{ID: `KMF`, Description: `Comorian Franc `},
{ID: `KPW`, Description: `North Korean Won`},
{ID: `KRW`, Description: `Won`},
{ID: `KWD`, Description: `Kuwaiti Dinar`},
{ID: `KYD`, Description: `Cayman Islands Dollar`},
{ID: `KZT`, Description: `Tenge`},
{ID: `LAK`, Description: `Lao Kip`},
{ID: `LBP`, Description: `Lebanese Pound`},
{ID: `LKR`, Description: `Sri Lanka Rupee`},
{ID: `LRD`, Description: `Liberian Dollar`},
{ID: `LSL`, Description: `Loti`},
{ID: `LYD`, Description: `Libyan Dinar`},
{ID: `MAD`, Description: `<NAME>`},
{ID: `MDL`, Description: `Moldovan Leu`},
{ID: `MGA`, Description: `Malagasy Ariary`},
{ID: `MKD`, Description: `Denar`},
{ID: `MMK`, Description: `Kyat`},
{ID: `MNT`, Description: `Tugrik`},
{ID: `MOP`, Description: `Pataca`},
{ID: `MRU`, Description: `Ouguiya`},
{ID: `MUR`, Description: `Mauritius Rupee`},
{ID: `MVR`, Description: `Rufiyaa`},
{ID: `MWK`, Description: `Malawi Kwacha`},
{ID: `MXN`, Description: `Mexican Peso`},
{ID: `MXV`, Description: `Mexican Unidad de Inversion (UDI)`},
{ID: `MYR`, Description: `Malaysian Ringgit`},
{ID: `MZN`, Description: `Mozambique Metical`},
{ID: `NAD`, Description: `Namibia Dollar`},
{ID: `NGN`, Description: `Naira`},
{ID: `NIO`, Description: `Cordoba Oro`},
{ID: `NOK`, Description: `Norwegian Krone`},
{ID: `NPR`, Description: `Nepalese Rupee`},
{ID: `NZD`, Description: `New Zealand Dollar`},
{ID: `OMR`, Description: `Rial Omani`},
{ID: `PAB`, Description: `Balboa`},
{ID: `PEN`, Description: `Sol`},
{ID: `PGK`, Description: `Kina`},
{ID: `PHP`, Description: `Philippine Peso`},
{ID: `PKR`, Description: `Pakistan Rupee`},
{ID: `PLN`, Description: `Zloty`},
{ID: `PYG`, Description: `Guarani`},
{ID: `QAR`, Description: `Qatari Rial`},
{ID: `RON`, Description: `Romanian Leu`},
{ID: `RSD`, Description: `Serbian Dinar`},
{ID: `RUB`, Description: `Russian Ruble`},
{ID: `RWF`, Description: `Rwanda Franc`},
{ID: `SAR`, Description: `Saudi Riyal`},
{ID: `SBD`, Description: `Solomon Islands Dollar`},
{ID: `SCR`, Description: `Seychelles Rupee`},
{ID: `SDG`, Description: `Sudanese Pound`},
{ID: `SEK`, Description: `Swedish Krona`},
{ID: `SGD`, Description: `Singapore Dollar`},
{ID: `SHP`, Description: `Saint Helena Pound`},
{ID: `SLL`, Description: `Leone`},
{ID: `SOS`, Description: `Somali Shilling`},
{ID: `SRD`, Description: `Surinam Dollar`},
{ID: `SSP`, Description: `South Sudanese Pound`},
{ID: `STN`, Description: `Dobra`},
{ID: `SVC`, Description: `El Salvador Colon`},
{ID: `SYP`, Description: `Syrian Pound`},
{ID: `SZL`, Description: `Lilangeni`},
{ID: `THB`, Description: `Baht`},
{ID: `TJS`, Description: `Somoni`},
{ID: `TMT`, Description: `Turkmenistan New Manat`},
{ID: `TND`, Description: `Tunisian Dinar`},
{ID: `TOP`, Description: `Pa’anga`},
{ID: `TRY`, Description: `Turkish Lira`},
{ID: `TTD`, Description: `Trinidad and Tobago Dollar`},
{ID: `TWD`, Description: `New Taiwan Dollar`},
{ID: `TZS`, Description: `Tanzanian Shilling`},
{ID: `UAH`, Description: `Hryvnia`},
{ID: `UGX`, Description: `Uganda Shilling`},
{ID: `USD`, Description: `US Dollar`},
{ID: `USN`, Description: `US Dollar (Next day)`},
{ID: `UYI`, Description: `Uruguay Peso en Unidades Indexadas (UI)`},
{ID: `UYU`, Description: `Peso Uruguayo`},
{ID: `UYW`, Description: `Unidad Previsional`},
{ID: `UZS`, Description: `Uzbekistan Sum`},
{ID: `VES`, Description: `Bolívar Soberano`},
{ID: `VND`, Description: `Dong`},
{ID: `VUV`, Description: `Vatu`},
{ID: `WST`, Description: `Tala`},
{ID: `XAF`, Description: `CFA Franc BEAC`},
{ID: `XAG`, Description: `Silver`},
{ID: `XAU`, Description: `Gold`},
{ID: `XBA`, Description: `Bond Markets Unit European Composite Unit (EURCO)`},
{ID: `XBB`, Description: `Bond Markets Unit European Monetary Unit (E.M.U.-6)`},
{ID: `XBC`, Description: `Bond Markets Unit European Unit of Account 9 (E.U.A.-9)`},
{ID: `XBD`, Description: `Bond Markets Unit European Unit of Account 17 (E.U.A.-17)`},
{ID: `XCD`, Description: `East Caribbean Dollar`},
{ID: `XDR`, Description: `SDR (Special Drawing Right)`},
{ID: `XOF`, Description: `CFA Franc BCEAO`},
{ID: `XPD`, Description: `Palladium`},
{ID: `XPF`, Description: `CFP Franc`},
{ID: `XPT`, Description: `Platinum`},
{ID: `XSU`, Description: `Sucre`},
{ID: `XTS`, Description: `Codes specifically reserved for testing purposes`},
{ID: `XUA`, Description: `ADB Unit of Account`},
{ID: `XXX`, Description: `The codes assigned for transactions where no currency is involved`},
{ID: `YER`, Description: `Yemeni Rial`},
{ID: `ZAR`, Description: `Rand`},
{ID: `ZMW`, Description: `Zambian Kwacha`},
{ID: `ZWL`, Description: `Zimbabwe Dollar`}}},
`LastName`: {ID: `LastName`, Name: `LastName`, Row: []Row{
{ID: `Abbott`},
{ID: `Acevedo`},
{ID: `Acosta`},
{ID: `Adams`},
{ID: `Adkins`},
{ID: `Aguilar`},
{ID: `Aguirre`},
{ID: `Albert`},
{ID: `Alexander`},
{ID: `Alford`},
{ID: `Allen`},
{ID: `Allison`},
{ID: `Alston`},
{ID: `Alvarado`},
{ID: `Alvarez`},
{ID: `Anderson`},
{ID: `Andrews`},
{ID: `Anthony`},
{ID: `Armstrong`},
{ID: `Arnold`},
{ID: `Ashley`},
{ID: `Atkins`},
{ID: `Atkinson`},
{ID: `Austin`},
{ID: `Avery`},
{ID: `Avila`},
{ID: `Ayala`},
{ID: `Ayers`},
{ID: `Bailey`},
{ID: `Baird`},
{ID: `Baker`},
{ID: `Baldwin`},
{ID: `Ball`},
{ID: `Ballard`},
{ID: `Banks`},
{ID: `Barber`},
{ID: `Barker`},
{ID: `Barlow`},
{ID: `Barnes`},
{ID: `Barnett`},
{ID: `Barr`},
{ID: `Barrera`},
{ID: `Barrett`},
{ID: `Barron`},
{ID: `Barry`},
{ID: `Bartlett`},
{ID: `Barton`},
{ID: `Bass`},
{ID: `Bates`},
{ID: `Battle`},
{ID: `Bauer`},
{ID: `Baxter`},
{ID: `Beach`},
{ID: `Bean`},
{ID: `Beard`},
{ID: `Beasley`},
{ID: `Beck`},
{ID: `Becker`},
{ID: `Bell`},
{ID: `Bender`},
{ID: `Benjamin`},
{ID: `Bennett`},
{ID: `Benson`},
{ID: `Bentley`},
{ID: `Benton`},
{ID: `Berg`},
{ID: `Berger`},
{ID: `Bernard`},
{ID: `Berry`},
{ID: `Best`},
{ID: `Bird`},
{ID: `Bishop`},
{ID: `Black`},
{ID: `Blackburn`},
{ID: `Blackwell`},
{ID: `Blair`},
{ID: `Blake`},
{ID: `Blanchard`},
{ID: `Blankenship`},
{ID: `Blevins`},
{ID: `Bolton`},
{ID: `Bond`},
{ID: `Bonner`},
{ID: `Booker`},
{ID: `Boone`},
{ID: `Booth`},
{ID: `Bowen`},
{ID: `Bowers`},
{ID: `Bowman`},
{ID: `Boyd`},
{ID: `Boyer`},
{ID: `Boyle`},
{ID: `Bradford`},
{ID: `Bradley`},
{ID: `Bradshaw`},
{ID: `Brady`},
{ID: `Branch`},
{ID: `Bray`},
{ID: `Brennan`},
{ID: `Brewer`},
{ID: `Bridges`},
{ID: `Briggs`},
{ID: `Bright`},
{ID: `Britt`},
{ID: `Brock`},
{ID: `Brooks`},
{ID: `Brown`},
{ID: `Browning`},
{ID: `Bruce`},
{ID: `Bryan`},
{ID: `Bryant`},
{ID: `Buchanan`},
{ID: `Buck`},
{ID: `Buckley`},
{ID: `Buckner`},
{ID: `Bullock`},
{ID: `Burch`},
{ID: `Burgess`},
{ID: `Burke`},
{ID: `Burks`},
{ID: `Burnett`},
{ID: `Burns`},
{ID: `Burris`},
{ID: `Burt`},
{ID: `Burton`},
{ID: `Bush`},
{ID: `Butler`},
{ID: `Byers`},
{ID: `Byrd`},
{ID: `Cabrera`},
{ID: `Cain`},
{ID: `Calderon`},
{ID: `Caldwell`},
{ID: `Calhoun`},
{ID: `Callahan`},
{ID: `Camacho`},
{ID: `Cameron`},
{ID: `Campbell`},
{ID: `Campos`},
{ID: `Cannon`},
{ID: `Cantrell`},
{ID: `Cantu`},
{ID: `Cardenas`},
{ID: `Carey`},
{ID: `Carlson`},
{ID: `Carney`},
{ID: `Carpenter`},
{ID: `Carr`},
{ID: `Carrillo`},
{ID: `Carroll`},
{ID: `Carson`},
{ID: `Carter`},
{ID: `Carver`},
{ID: `Case`},
{ID: `Casey`},
{ID: `Cash`},
{ID: `Castaneda`},
{ID: `Castillo`},
{ID: `Castro`},
{ID: `Cervantes`},
{ID: `Chambers`},
{ID: `Chan`},
{ID: `Chandler`},
{ID: `Chaney`},
{ID: `Chang`},
{ID: `Chapman`},
{ID: `Charles`},
{ID: `Chase`},
{ID: `Chavez`},
{ID: `Chen`},
{ID: `Cherry`},
{ID: `Christensen`},
{ID: `Christian`},
{ID: `Church`},
{ID: `Clark`},
{ID: `Clarke`},
{ID: `Clay`},
{ID: `Clayton`},
{ID: `Clements`},
{ID: `Clemons`},
{ID: `Cleveland`},
{ID: `Cline`},
{ID: `Cobb`},
{ID: `Cochran`},
{ID: `Coffey`},
{ID: `Cohen`},
{ID: `Cole`},
{ID: `Coleman`},
{ID: `Collier`},
{ID: `Collins`},
{ID: `Colon`},
{ID: `Combs`},
{ID: `Compton`},
{ID: `Conley`},
{ID: `Conner`},
{ID: `Conrad`},
{ID: `Contreras`},
{ID: `Conway`},
{ID: `Cook`},
{ID: `Cooke`},
{ID: `Cooley`},
{ID: `Cooper`},
{ID: `Copeland`},
{ID: `Cortez`},
{ID: `Cote`},
{ID: `Cotton`},
{ID: `Cox`},
{ID: `Craft`},
{ID: `Craig`},
{ID: `Crane`},
{ID: `Crawford`},
{ID: `Crosby`},
{ID: `Cross`},
{ID: `Cruz`},
{ID: `Cummings`},
{ID: `Cunningham`},
{ID: `Curry`},
{ID: `Curtis`},
{ID: `Dale`},
{ID: `Dalton`},
{ID: `Daniel`},
{ID: `Daniels`},
{ID: `Daugherty`},
{ID: `Davenport`},
{ID: `David`},
{ID: `Davidson`},
{ID: `Davis`},
{ID: `Dawson`},
{ID: `Day`},
{ID: `Dean`},
{ID: `Decker`},
{ID: `Dejesus`},
{ID: `Delacruz`},
{ID: `Delaney`},
{ID: `Deleon`},
{ID: `Delgado`},
{ID: `Dennis`},
{ID: `Diaz`},
{ID: `Dickerson`},
{ID: `Dickson`},
{ID: `Dillard`},
{ID: `Dillon`},
{ID: `Dixon`},
{ID: `Dodson`},
{ID: `Dominguez`},
{ID: `Donaldson`},
{ID: `Donovan`},
{ID: `Dorsey`},
{ID: `Dotson`},
{ID: `Douglas`},
{ID: `Downs`},
{ID: `Doyle`},
{ID: `Drake`},
{ID: `Dudley`},
{ID: `Duffy`},
{ID: `Duke`},
{ID: `Duncan`},
{ID: `Dunlap`},
{ID: `Dunn`},
{ID: `Duran`},
{ID: `Durham`},
{ID: `Dyer`},
{ID: `Eaton`},
{ID: `Edwards`},
{ID: `Elliott`},
{ID: `Ellis`},
{ID: `Ellison`},
{ID: `Emerson`},
{ID: `England`},
{ID: `English`},
{ID: `Erickson`},
{ID: `Espinoza`},
{ID: `Estes`},
{ID: `Estrada`},
{ID: `Evans`},
{ID: `Everett`},
{ID: `Ewing`},
{ID: `Farley`},
{ID: `Farmer`},
{ID: `Farrell`},
{ID: `Faulkner`},
{ID: `Ferguson`},
{ID: `Fernandez`},
{ID: `Ferrell`},
{ID: `Fields`},
{ID: `Figueroa`},
{ID: `Finch`},
{ID: `Finley`},
{ID: `Fischer`},
{ID: `Fisher`},
{ID: `Fitzgerald`},
{ID: `Fitzpatrick`},
{ID: `Fleming`},
{ID: `Fletcher`},
{ID: `Flores`},
{ID: `Flowers`},
{ID: `Floyd`},
{ID: `Flynn`},
{ID: `Foley`},
{ID: `Forbes`},
{ID: `Ford`},
{ID: `Foreman`},
{ID: `Foster`},
{ID: `Fowler`},
{ID: `Fox`},
{ID: `Francis`},
{ID: `Franco`},
{ID: `Frank`},
{ID: `Franklin`},
{ID: `Franks`},
{ID: `Frazier`},
{ID: `Frederick`},
{ID: `Freeman`},
{ID: `French`},
{ID: `Frost`},
{ID: `Fry`},
{ID: `Frye`},
{ID: `Fuentes`},
{ID: `Fuller`},
{ID: `Fulton`},
{ID: `Gaines`},
{ID: `Gallagher`},
{ID: `Gallegos`},
{ID: `Galloway`},
{ID: `Gamble`},
{ID: `Garcia`},
{ID: `Gardner`},
{ID: `Garner`},
{ID: `Garrett`},
{ID: `Garrison`},
{ID: `Garza`},
{ID: `Gates`},
{ID: `Gay`},
{ID: `Gentry`},
{ID: `George`},
{ID: `Gibbs`},
{ID: `Gibson`},
{ID: `Gilbert`},
{ID: `Giles`},
{ID: `Gill`},
{ID: `Gillespie`},
{ID: `Gilliam`},
{ID: `Gilmore`},
{ID: `Glass`},
{ID: `Glenn`},
{ID: `Glover`},
{ID: `Goff`},
{ID: `Golden`},
{ID: `Gomez`},
{ID: `Gonzales`},
{ID: `Gonzalez`},
{ID: `Good`},
{ID: `Goodman`},
{ID: `Goodwin`},
{ID: `Gordon`},
{ID: `Gould`},
{ID: `Graham`},
{ID: `Grant`},
{ID: `Graves`},
{ID: `Gray`},
{ID: `Green`},
{ID: `Greene`},
{ID: `Greer`},
{ID: `Gregory`},
{ID: `Griffin`},
{ID: `Griffith`},
{ID: `Grimes`},
{ID: `Gross`},
{ID: `Guerra`},
{ID: `Guerrero`},
{ID: `Guthrie`},
{ID: `Gutierrez`},
{ID: `Guy`},
{ID: `Guzman`},
{ID: `Hahn`},
{ID: `Hale`},
{ID: `Haley`},
{ID: `Hall`},
{ID: `Hamilton`},
{ID: `Hammond`},
{ID: `Hampton`},
{ID: `Hancock`},
{ID: `Haney`},
{ID: `Hansen`},
{ID: `Hanson`},
{ID: `Hardin`},
{ID: `Harding`},
{ID: `Hardy`},
{ID: `Harmon`},
{ID: `Harper`},
{ID: `Harrell`},
{ID: `Harrington`},
{ID: `Harris`},
{ID: `Harrison`},
{ID: `Hart`},
{ID: `Hartman`},
{ID: `Harvey`},
{ID: `Hatfield`},
{ID: `Hawkins`},
{ID: `Hayden`},
{ID: `Hayes`},
{ID: `Haynes`},
{ID: `Hays`},
{ID: `Head`},
{ID: `Heath`},
{ID: `Hebert`},
{ID: `Henderson`},
{ID: `Hendricks`},
{ID: `Hendrix`},
{ID: `Henry`},
{ID: `Hensley`},
{ID: `Henson`},
{ID: `Herman`},
{ID: `Hernandez`},
{ID: `Herrera`},
{ID: `Herring`},
{ID: `Hess`},
{ID: `Hester`},
{ID: `Hewitt`},
{ID: `Hickman`},
{ID: `Hicks`},
{ID: `Higgins`},
{ID: `Hill`},
{ID: `Hines`},
{ID: `Hinton`},
{ID: `Hobbs`},
{ID: `Hodge`},
{ID: `Hodges`},
{ID: `Hoffman`},
{ID: `Hogan`},
{ID: `Holcomb`},
{ID: `Holden`},
{ID: `Holder`},
{ID: `Holland`},
{ID: `Holloway`},
{ID: `Holman`},
{ID: `Holmes`},
{ID: `Holt`},
{ID: `Hood`},
{ID: `Hooper`},
{ID: `Hoover`},
{ID: `Hopkins`},
{ID: `Hopper`},
{ID: `Horn`},
{ID: `Horne`},
{ID: `Horton`},
{ID: `House`},
{ID: `Houston`},
{ID: `Howard`},
{ID: `Howe`},
{ID: `Howell`},
{ID: `Hubbard`},
{ID: `Huber`},
{ID: `Hudson`},
{ID: `Huff`},
{ID: `Huffman`},
{ID: `Hughes`},
{ID: `Hull`},
{ID: `Humphrey`},
{ID: `Hunt`},
{ID: `Hunter`},
{ID: `Hurley`},
{ID: `Hurst`},
{ID: `Hutchinson`},
{ID: `Hyde`},
{ID: `Ingram`},
{ID: `Irwin`},
{ID: `Jackson`},
{ID: `Jacobs`},
{ID: `Jacobson`},
{ID: `James`},
{ID: `Jarvis`},
{ID: `Jefferson`},
{ID: `Jenkins`},
{ID: `Jennings`},
{ID: `Jensen`},
{ID: `Jimenez`},
{ID: `Johns`},
{ID: `Johnson`},
{ID: `Johnston`},
{ID: `Jones`},
{ID: `Jordan`},
{ID: `Joseph`},
{ID: `Joyce`},
{ID: `Joyner`},
{ID: `Juarez`},
{ID: `Justice`},
{ID: `Kane`},
{ID: `Kaufman`},
{ID: `Keith`},
{ID: `Keller`},
{ID: `Kelley`},
{ID: `Kelly`},
{ID: `Kemp`},
{ID: `Kennedy`},
{ID: `Kent`},
{ID: `Kerr`},
{ID: `Key`},
{ID: `Kidd`},
{ID: `Kim`},
{ID: `King`},
{ID: `Kinney`},
{ID: `Kirby`},
{ID: `Kirk`},
{ID: `Kirkland`},
{ID: `Klein`},
{ID: `Kline`},
{ID: `Knapp`},
{ID: `Knight`},
{ID: `Knowles`},
{ID: `Knox`},
{ID: `Koch`},
{ID: `Kramer`},
{ID: `Lamb`},
{ID: `Lambert`},
{ID: `Lancaster`},
{ID: `Landry`},
{ID: `Lane`},
{ID: `Lang`},
{ID: `Langley`},
{ID: `Lara`},
{ID: `Larsen`},
{ID: `Larson`},
{ID: `Lawrence`},
{ID: `Lawson`},
{ID: `Le`},
{ID: `Leach`},
{ID: `Leblanc`},
{ID: `Lee`},
{ID: `Leon`},
{ID: `Leonard`},
{ID: `Lester`},
{ID: `Levine`},
{ID: `Levy`},
{ID: `Lewis`},
{ID: `Lindsay`},
{ID: `Lindsey`},
{ID: `Little`},
{ID: `Livingston`},
{ID: `Lloyd`},
{ID: `Logan`},
{ID: `Long`},
{ID: `Lopez`},
{ID: `Lott`},
{ID: `Love`},
{ID: `Lowe`},
{ID: `Lowery`},
{ID: `Lucas`},
{ID: `Luna`},
{ID: `Lynch`},
{ID: `Lynn`},
{ID: `Lyons`},
{ID: `Macdonald`},
{ID: `Macias`},
{ID: `Mack`},
{ID: `Madden`},
{ID: `Maddox`},
{ID: `Maldonado`},
{ID: `Malone`},
{ID: `Mann`},
{ID: `Manning`},
{ID: `Marks`},
{ID: `Marquez`},
{ID: `Marsh`},
{ID: `Marshall`},
{ID: `Martin`},
{ID: `Martinez`},
{ID: `Mason`},
{ID: `Massey`},
{ID: `Mathews`},
{ID: `Mathis`},
{ID: `Matthews`},
{ID: `Maxwell`},
{ID: `May`},
{ID: `Mayer`},
{ID: `Maynard`},
{ID: `Mayo`},
{ID: `Mays`},
{ID: `Mcbride`},
{ID: `Mccall`},
{ID: `Mccarthy`},
{ID: `Mccarty`},
{ID: `Mcclain`},
{ID: `Mcclure`},
{ID: `Mcconnell`},
{ID: `Mccormick`},
{ID: `Mccoy`},
{ID: `Mccray`},
{ID: `Mccullough`},
{ID: `Mcdaniel`},
{ID: `Mcdonald`},
{ID: `Mcdowell`},
{ID: `Mcfadden`},
{ID: `Mcfarland`},
{ID: `Mcgee`},
{ID: `Mcgowan`},
{ID: `Mcguire`},
{ID: `Mcintosh`},
{ID: `Mcintyre`},
{ID: `Mckay`},
{ID: `Mckee`},
{ID: `Mckenzie`},
{ID: `Mckinney`},
{ID: `Mcknight`},
{ID: `Mclaughlin`},
{ID: `Mclean`},
{ID: `Mcleod`},
{ID: `Mcmahon`},
{ID: `Mcmillan`},
{ID: `Mcneil`},
{ID: `Mcpherson`},
{ID: `Meadows`},
{ID: `Medina`},
{ID: `Mejia`},
{ID: `Melendez`},
{ID: `Melton`},
{ID: `Mendez`},
{ID: `Mendoza`},
{ID: `Mercado`},
{ID: `Mercer`},
{ID: `Merrill`},
{ID: `Merritt`},
{ID: `Meyer`},
{ID: `Meyers`},
{ID: `Michael`},
{ID: `Middleton`},
{ID: `Miles`},
{ID: `Miller`},
{ID: `Mills`},
{ID: `Miranda`},
{ID: `Mitchell`},
{ID: `Molina`},
{ID: `Monroe`},
{ID: `Montgomery`},
{ID: `Montoya`},
{ID: `Moody`},
{ID: `Moon`},
{ID: `Mooney`},
{ID: `Moore`},
{ID: `Morales`},
{ID: `Moran`},
{ID: `Moreno`},
{ID: `Morgan`},
{ID: `Morin`},
{ID: `Morris`},
{ID: `Morrison`},
{ID: `Morrow`},
{ID: `Morse`},
{ID: `Morton`},
{ID: `Moses`},
{ID: `Mosley`},
{ID: `Moss`},
{ID: `Mueller`},
{ID: `Mullen`},
{ID: `Mullins`},
{ID: `Munoz`},
{ID: `Murphy`},
{ID: `Murray`},
{ID: `Myers`},
{ID: `Nash`},
{ID: `Navarro`},
{ID: `Neal`},
{ID: `Nelson`},
{ID: `Newman`},
{ID: `Newton`},
{ID: `Nguyen`},
{ID: `Nichols`},
{ID: `Nicholson`},
{ID: `Nielsen`},
{ID: `Nieves`},
{ID: `Nixon`},
{ID: `Noble`},
{ID: `Noel`},
{ID: `Nolan`},
{ID: `Norman`},
{ID: `Norris`},
{ID: `Norton`},
{ID: `Nunez`},
{ID: `Obrien`},
{ID: `Ochoa`},
{ID: `Oconnor`},
{ID: `Odom`},
{ID: `Odonnell`},
{ID: `Oliver`},
{ID: `Olsen`},
{ID: `Olson`},
{ID: `Oneal`},
{ID: `Oneil`},
{ID: `Oneill`},
{ID: `Orr`},
{ID: `Ortega`},
{ID: `Ortiz`},
{ID: `Osborn`},
{ID: `Osborne`},
{ID: `Owen`},
{ID: `Owens`},
{ID: `Pace`},
{ID: `Pacheco`},
{ID: `Padilla`},
{ID: `Page`},
{ID: `Palmer`},
{ID: `Park`},
{ID: `Parker`},
{ID: `Parks`},
{ID: `Parrish`},
{ID: `Parsons`},
{ID: `Pate`},
{ID: `Patel`},
{ID: `Patrick`},
{ID: `Patterson`},
{ID: `Patton`},
{ID: `Paul`},
{ID: `Payne`},
{ID: `Pearson`},
{ID: `Peck`},
{ID: `Pena`},
{ID: `Pennington`},
{ID: `Perez`},
{ID: `Perkins`},
{ID: `Perry`},
{ID: `Peters`},
{ID: `Petersen`},
{ID: `Peterson`},
{ID: `Petty`},
{ID: `Phelps`},
{ID: `Phillips`},
{ID: `Pickett`},
{ID: `Pierce`},
{ID: `Pittman`},
{ID: `Pitts`},
{ID: `Pollard`},
{ID: `Poole`},
{ID: `Pope`},
{ID: `Porter`},
{ID: `Potter`},
{ID: `Potts`},
{ID: `Powell`},
{ID: `Powers`},
{ID: `Pratt`},
{ID: `Preston`},
{ID: `Price`},
{ID: `Prince`},
{ID: `Pruitt`},
{ID: `Puckett`},
{ID: `Pugh`},
{ID: `Quinn`},
{ID: `Ramirez`},
{ID: `Ramos`},
{ID: `Ramsey`},
{ID: `Randall`},
{ID: `Randolph`},
{ID: `Rasmussen`},
{ID: `Ratliff`},
{ID: `Ray`},
{ID: `Raymond`},
{ID: `Reed`},
{ID: `Reese`},
{ID: `Reeves`},
{ID: `Reid`},
{ID: `Reilly`},
{ID: `Reyes`},
{ID: `Reynolds`},
{ID: `Rhodes`},
{ID: `Rice`},
{ID: `Rich`},
{ID: `Richard`},
{ID: `Richards`},
{ID: `Richardson`},
{ID: `Richmond`},
{ID: `Riddle`},
{ID: `Riggs`},
{ID: `Riley`},
{ID: `Rios`},
{ID: `Rivas`},
{ID: `Rivera`},
{ID: `Rivers`},
{ID: `Roach`},
{ID: `Robbins`},
{ID: `Roberson`},
{ID: `Roberts`},
{ID: `Robertson`},
{ID: `Robinson`},
{ID: `Robles`},
{ID: `Rocha`},
{ID: `Rodgers`},
{ID: `Rodriguez`},
{ID: `Rodriquez`},
{ID: `Rogers`},
{ID: `Rojas`},
{ID: `Rollins`},
{ID: `Roman`},
{ID: `Romero`},
{ID: `Rosa`},
{ID: `Rosales`},
{ID: `Rosario`},
{ID: `Rose`},
{ID: `Ross`},
{ID: `Roth`},
{ID: `Rowe`},
{ID: `Rowland`},
{ID: `Roy`},
{ID: `Ruiz`},
{ID: `Rush`},
{ID: `Russell`},
{ID: `Russo`},
{ID: `Rutledg`},
{ID: `Ryan`},
{ID: `Salas`},
{ID: `Salazar`},
{ID: `Salinas`},
{ID: `Sampson`},
{ID: `Sanchez`},
{ID: `Sanders`},
{ID: `Sandoval`},
{ID: `Sanford`},
{ID: `Santana`},
{ID: `Santiago`},
{ID: `Santos`},
{ID: `Sargent`},
{ID: `Saunders`},
{ID: `Savage`},
{ID: `Sawyer`},
{ID: `Schmidt`},
{ID: `Schneider`},
{ID: `Schroeder`},
{ID: `Schultz`},
{ID: `Schwartz`},
{ID: `Scott`},
{ID: `Sears`},
{ID: `Sellers`},
{ID: `Serrano`},
{ID: `Sexton`},
{ID: `Shaffer`},
{ID: `Shannon`},
{ID: `Sharp`},
{ID: `Sharpe`},
{ID: `Shaw`},
{ID: `Shelton`},
{ID: `Shepard`},
{ID: `Shepherd`},
{ID: `Sheppard`},
{ID: `Sherman`},
{ID: `Shields`},
{ID: `Short`},
{ID: `Silva`},
{ID: `Simmons`},
{ID: `Simon`},
{ID: `Simpson`},
{ID: `Sims`},
{ID: `Singleton`},
{ID: `Skinner`},
{ID: `Slater`},
{ID: `Sloan`},
{ID: `Small`},
{ID: `Smith`},
{ID: `Snider`},
{ID: `Snow`},
{ID: `Snyder`},
{ID: `Solis`},
{ID: `Solomon`},
{ID: `Sosa`},
{ID: `Soto`},
{ID: `Sparks`},
{ID: `Spears`},
{ID: `Spence`},
{ID: `Spencer`},
{ID: `Stafford`},
{ID: `Stanley`},
{ID: `Stanton`},
{ID: `Stark`},
{ID: `Steele`},
{ID: `Stein`},
{ID: `Stephens`},
{ID: `Stephenson`},
{ID: `Stevens`},
{ID: `Stevenson`},
{ID: `Stewart`},
{ID: `Stokes`},
{ID: `Stone`},
{ID: `Stout`},
{ID: `Strickland`},
{ID: `Strong`},
{ID: `Stuart`},
{ID: `Suarez`},
{ID: `Sullivan`},
{ID: `Summers`},
{ID: `Sutton`},
{ID: `Swanson`},
{ID: `Sweeney`},
{ID: `Sweet`},
{ID: `Sykes`},
{ID: `Talley`},
{ID: `Tanner`},
{ID: `Tate`},
{ID: `Taylor`},
{ID: `Terrell`},
{ID: `Terry`},
{ID: `Thomas`},
{ID: `Thompson`},
{ID: `Thornton`},
{ID: `Tillman`},
{ID: `Todd`},
{ID: `Torres`},
{ID: `Townsend`},
{ID: `Tran`},
{ID: `Travis`},
{ID: `Trevino`},
{ID: `Trujillo`},
{ID: `Tucker`},
{ID: `Turner`},
{ID: `Tyler`},
{ID: `Tyson`},
{ID: `Underwood`},
{ID: `Valdez`},
{ID: `Valencia`},
{ID: `Valentine`},
{ID: `Valenzuela`},
{ID: `Vance`},
{ID: `Vang`},
{ID: `Vargas`},
{ID: `Vasquez`},
{ID: `Vaughan`},
{ID: `Vaughn`},
{ID: `Vazquez`},
{ID: `Vega`},
{ID: `Velasquez`},
{ID: `Velazquez`},
{ID: `Velez`},
{ID: `Villarreal`},
{ID: `Vincent`},
{ID: `Vinson`},
{ID: `Wade`},
{ID: `Wagner`},
{ID: `Walker`},
{ID: `Wall`},
{ID: `Wallace`},
{ID: `Waller`},
{ID: `Walls`},
{ID: `Walsh`},
{ID: `Walter`},
{ID: `Walters`},
{ID: `Walton`},
{ID: `Ward`},
{ID: `Ware`},
{ID: `Warner`},
{ID: `Warren`},
{ID: `Washington`},
{ID: `Waters`},
{ID: `Watkins`},
{ID: `Watson`},
{ID: `Watts`},
{ID: `Weaver`},
{ID: `Webb`},
{ID: `Weber`},
{ID: `Webster`},
{ID: `Weeks`},
{ID: `Weiss`},
{ID: `Welch`},
{ID: `Wells`},
{ID: `West`},
{ID: `Wheeler`},
{ID: `Whitaker`},
{ID: `White`},
{ID: `Whitehead`},
{ID: `Whitfield`},
{ID: `Whitley`},
{ID: `Whitney`},
{ID: `Wiggins`},
{ID: `Wilcox`},
{ID: `Wilder`},
{ID: `Wiley`},
{ID: `Wilkerson`},
{ID: `Wilkins`},
{ID: `Wilkinson`},
{ID: `William`},
{ID: `Williams`},
{ID: `Williamson`},
{ID: `Willis`},
{ID: `Wilson`},
{ID: `Winters`},
{ID: `Wise`},
{ID: `Witt`},
{ID: `Wolf`},
{ID: `Wolfe`},
{ID: `Wong`},
{ID: `Wood`},
{ID: `Woodard`},
{ID: `Woods`},
{ID: `Woodward`},
{ID: `Wooten`},
{ID: `Workman`},
{ID: `Wright`},
{ID: `Wyatt`},
{ID: `Wynn`},
{ID: `Yang`},
{ID: `Yates`},
{ID: `York`},
{ID: `Young`},
{ID: `Zamora`},
{ID: `Zimmerman`}}},
`OSD1`: {ID: `OSD1`, Name: `Sequence condition`, Row: []Row{
{ID: `C`, Description: `Repeating cycle of orders`},
{ID: `R`, Description: `Reserved for possible future use`},
{ID: `S`, Description: `Sequence conditions`}}},
`PhoneNumber`: {ID: `PhoneNumber`, Name: `Phone Number`, Row: []Row{
{ID: `(000)503-3290`},
{ID: `(002)912-8668`},
{ID: `(003)060-0974`},
{ID: `(003)791-2955`},
{ID: `(004)371-3089`},
{ID: `(004)706-7495`},
{ID: `(004)723-8271`},
{ID: `(007)105-2079`},
{ID: `(009)384-4587`},
{ID: `(009)489-2523`},
{ID: `(010)647-1327`},
{ID: `(013)691-1470`},
{ID: `(015)036-3156`},
{ID: `(015)289-6392`},
{ID: `(016)540-1454`},
{ID: `(017)070-6374`},
{ID: `(018)715-4178`},
{ID: `(019)139-0416`},
{ID: `(019)716-0500`},
{ID: `(020)194-0034`},
{ID: `(020)849-4973`},
{ID: `(021)223-4523`},
{ID: `(021)422-2184`},
{ID: `(022)869-2197`},
{ID: `(024)065-9119`},
{ID: `(025)904-1039`},
{ID: `(027)208-2365`},
{ID: `(027)475-6720`},
{ID: `(028)108-0238`},
{ID: `(029)036-7289`},
{ID: `(030)582-4128`},
{ID: `(031)269-4560`},
{ID: `(031)424-9609`},
{ID: `(032)815-6760`},
{ID: `(033)244-0726`},
{ID: `(033)438-4988`},
{ID: `(033)586-0374`},
{ID: `(034)111-9582`},
{ID: `(036)676-1372`},
{ID: `(038)211-1102`},
{ID: `(040)824-5847`},
{ID: `(043)065-6356`},
{ID: `(043)596-2806`},
{ID: `(043)823-2538`},
{ID: `(044)656-4942`},
{ID: `(046)348-4079`},
{ID: `(046)414-7849`},
{ID: `(047)109-9173`},
{ID: `(048)115-6190`},
{ID: `(051)838-9519`},
{ID: `(052)604-8044`},
{ID: `(052)921-2833`},
{ID: `(055)386-6569`},
{ID: `(055)432-4112`},
{ID: `(056)915-1096`},
{ID: `(056)992-2232`},
{ID: `(058)109-0276`},
{ID: `(058)864-2295`},
{ID: `(059)280-5179`},
{ID: `(059)520-5259`},
{ID: `(059)779-4344`},
{ID: `(060)858-5109`},
{ID: `(060)983-1989`},
{ID: `(061)516-4952`},
{ID: `(062)657-6469`},
{ID: `(063)155-1229`},
{ID: `(064)457-1271`},
{ID: `(065)373-0732`},
{ID: `(066)074-6490`},
{ID: `(069)230-1887`},
{ID: `(069)742-8257`},
{ID: `(069)754-9611`},
{ID: `(070)462-1205`},
{ID: `(072)395-1492`},
{ID: `(072)420-3523`},
{ID: `(075)489-1136`},
{ID: `(077)156-7343`},
{ID: `(077)541-2856`},
{ID: `(079)145-7971`},
{ID: `(080)664-4237`},
{ID: `(082)040-5891`},
{ID: `(082)195-4821`},
{ID: `(083)406-6723`},
{ID: `(083)483-5991`},
{ID: `(087)241-5023`},
{ID: `(088)489-8724`},
{ID: `(088)696-6852`},
{ID: `(089)811-1888`},
{ID: `(091)639-8297`},
{ID: `(092)966-3934`},
{ID: `(093)256-8654`},
{ID: `(095)672-4654`},
{ID: `(098)391-8341`},
{ID: `(098)416-8830`},
{ID: `(099)628-5848`},
{ID: `(102)709-6111`},
{ID: `(103)228-7215`},
{ID: `(103)262-0320`},
{ID: `(103)292-5439`},
{ID: `(104)622-7908`},
{ID: `(104)689-0166`},
{ID: `(105)615-5856`},
{ID: `(105)628-0336`},
{ID: `(105)702-0880`},
{ID: `(106)534-0914`},
{ID: `(107)732-2379`},
{ID: `(107)784-3345`},
{ID: `(108)819-9427`},
{ID: `(108)873-6082`},
{ID: `(109)347-7690`},
{ID: `(109)608-3776`},
{ID: `(109)916-7853`},
{ID: `(112)633-8283`},
{ID: `(112)752-0942`},
{ID: `(115)222-1944`},
{ID: `(115)889-6818`},
{ID: `(118)393-8780`},
{ID: `(118)762-1615`},
{ID: `(119)216-6501`},
{ID: `(119)977-7977`},
{ID: `(121)864-7287`},
{ID: `(122)091-6358`},
{ID: `(123)274-9613`},
{ID: `(123)685-2708`},
{ID: `(125)441-7663`},
{ID: `(126)225-8991`},
{ID: `(126)524-4596`},
{ID: `(130)091-2416`},
{ID: `(131)788-3073`},
{ID: `(134)894-6688`},
{ID: `(134)970-2755`},
{ID: `(135)450-8105`},
{ID: `(137)492-1205`},
{ID: `(138)060-1315`},
{ID: `(138)928-2523`},
{ID: `(139)030-1713`},
{ID: `(139)455-2779`},
{ID: `(139)474-6928`},
{ID: `(142)564-5602`},
{ID: `(143)433-3909`},
{ID: `(143)950-0817`},
{ID: `(146)704-7067`},
{ID: `(147)340-8591`},
{ID: `(148)412-5568`},
{ID: `(148)799-2429`},
{ID: `(150)058-4475`},
{ID: `(151)498-8566`},
{ID: `(151)902-0269`},
{ID: `(152)710-9598`},
{ID: `(152)906-3006`},
{ID: `(156)356-7137`},
{ID: `(157)024-3918`},
{ID: `(157)687-3493`},
{ID: `(157)927-8202`},
{ID: `(159)523-6517`},
{ID: `(160)068-4907`},
{ID: `(161)463-5188`},
{ID: `(162)153-7433`},
{ID: `(163)054-3027`},
{ID: `(163)458-5291`},
{ID: `(164)744-0036`},
{ID: `(164)909-3183`},
{ID: `(166)991-6655`},
{ID: `(167)082-3478`},
{ID: `(167)820-3863`},
{ID: `(168)304-0302`},
{ID: `(169)008-2343`},
{ID: `(169)355-2528`},
{ID: `(171)295-2312`},
{ID: `(171)894-0025`},
{ID: `(171)959-4074`},
{ID: `(173)456-3664`},
{ID: `(176)494-8246`},
{ID: `(176)680-7428`},
{ID: `(179)404-1075`},
{ID: `(180)432-8504`},
{ID: `(180)595-8939`},
{ID: `(181)156-2076`},
{ID: `(183)430-9688`},
{ID: `(185)639-4760`},
{ID: `(186)386-6132`},
{ID: `(186)592-2245`},
{ID: `(188)591-6136`},
{ID: `(189)710-4631`},
{ID: `(190)421-5552`},
{ID: `(192)073-0277`},
{ID: `(192)685-9015`},
{ID: `(199)210-7188`},
{ID: `(200)354-8721`},
{ID: `(202)217-5102`},
{ID: `(202)624-9486`},
{ID: `(202)866-6263`},
{ID: `(203)831-7337`},
{ID: `(205)499-3441`},
{ID: `(205)891-8016`},
{ID: `(207)308-2766`},
{ID: `(207)344-8223`},
{ID: `(208)187-3910`},
{ID: `(208)759-8568`},
{ID: `(209)732-3442`},
{ID: `(209)734-0145`},
{ID: `(210)534-7153`},
{ID: `(211)916-6352`},
{ID: `(211)971-2024`},
{ID: `(212)603-0058`},
{ID: `(212)821-6961`},
{ID: `(216)555-9335`},
{ID: `(218)988-1372`},
{ID: `(221)558-6885`},
{ID: `(223)293-9838`},
{ID: `(223)343-4132`},
{ID: `(224)088-3864`},
{ID: `(224)333-7890`},
{ID: `(226)093-3014`},
{ID: `(226)934-8448`},
{ID: `(228)057-2396`},
{ID: `(228)202-0426`},
{ID: `(228)273-1420`},
{ID: `(228)294-3872`},
{ID: `(228)828-3818`},
{ID: `(229)327-7533`},
{ID: `(231)145-1584`},
{ID: `(231)247-7563`},
{ID: `(232)714-2933`},
{ID: `(234)386-0989`},
{ID: `(234)815-7007`},
{ID: `(236)498-9009`},
{ID: `(238)335-3862`},
{ID: `(241)156-5823`},
{ID: `(245)535-3716`},
{ID: `(245)835-1382`},
{ID: `(248)993-0603`},
{ID: `(249)745-9320`},
{ID: `(251)321-5064`},
{ID: `(252)623-2197`},
{ID: `(253)291-2275`},
{ID: `(254)442-1760`},
{ID: `(255)809-0577`},
{ID: `(256)881-9253`},
{ID: `(257)051-5138`},
{ID: `(257)636-0217`},
{ID: `(258)316-0310`},
{ID: `(258)508-7852`},
{ID: `(258)833-9222`},
{ID: `(258)938-2039`},
{ID: `(259)342-4512`},
{ID: `(261)300-0096`},
{ID: `(267)112-7989`},
{ID: `(267)554-2469`},
{ID: `(268)922-4967`},
{ID: `(268)949-2505`},
{ID: `(270)546-9048`},
{ID: `(271)092-2658`},
{ID: `(273)430-7094`},
{ID: `(274)769-7713`},
{ID: `(276)877-7439`},
{ID: `(278)682-1772`},
{ID: `(279)163-0060`},
{ID: `(279)452-2109`},
{ID: `(280)698-2335`},
{ID: `(281)215-4807`},
{ID: `(281)544-8581`},
{ID: `(282)151-9460`},
{ID: `(282)306-2569`},
{ID: `(283)016-6536`},
{ID: `(286)743-1038`},
{ID: `(287)527-8113`},
{ID: `(287)889-1233`},
{ID: `(287)889-2501`},
{ID: `(288)817-0784`},
{ID: `(289)609-1858`},
{ID: `(289)870-8706`},
{ID: `(290)228-8981`},
{ID: `(291)201-8175`},
{ID: `(291)499-0374`},
{ID: `(291)627-6797`},
{ID: `(291)806-1698`},
{ID: `(291)982-9942`},
{ID: `(292)270-0243`},
{ID: `(292)824-1320`},
{ID: `(293)181-8432`},
{ID: `(294)850-2124`},
{ID: `(297)006-5022`},
{ID: `(298)340-7100`},
{ID: `(300)986-2736`},
{ID: `(301)434-3859`},
{ID: `(303)741-3296`},
{ID: `(304)296-8457`},
{ID: `(307)143-4944`},
{ID: `(307)683-8701`},
{ID: `(307)700-4692`},
{ID: `(308)991-5267`},
{ID: `(309)482-8110`},
{ID: `(309)548-7794`},
{ID: `(310)387-9193`},
{ID: `(310)440-8045`},
{ID: `(311)678-3486`},
{ID: `(313)077-0397`},
{ID: `(313)596-2652`},
{ID: `(314)797-3015`},
{ID: `(316)861-5772`},
{ID: `(318)522-4088`},
{ID: `(318)756-0731`},
{ID: `(319)972-9529`},
{ID: `(320)470-8698`},
{ID: `(323)679-5219`},
{ID: `(323)805-4742`},
{ID: `(323)861-8409`},
{ID: `(325)418-7973`},
{ID: `(325)938-7699`},
{ID: `(327)841-4635`},
{ID: `(328)109-9783`},
{ID: `(334)235-4488`},
{ID: `(334)686-5697`},
{ID: `(335)297-7433`},
{ID: `(336)833-0445`},
{ID: `(338)895-1370`},
{ID: `(338)965-6696`},
{ID: `(339)431-4537`},
{ID: `(339)947-4189`},
{ID: `(339)949-6401`},
{ID: `(341)603-5104`},
{ID: `(342)252-0512`},
{ID: `(342)325-2247`},
{ID: `(342)535-5615`},
{ID: `(342)773-1673`},
{ID: `(343)813-8373`},
{ID: `(346)818-8636`},
{ID: `(346)923-4272`},
{ID: `(347)249-5996`},
{ID: `(347)659-2569`},
{ID: `(347)813-6348`},
{ID: `(347)898-4726`},
{ID: `(348)105-2636`},
{ID: `(348)633-5659`},
{ID: `(349)834-7568`},
{ID: `(349)940-3903`},
{ID: `(350)551-1949`},
{ID: `(350)969-3384`},
{ID: `(351)521-8096`},
{ID: `(351)657-9527`},
{ID: `(351)920-9979`},
{ID: `(352)346-3192`},
{ID: `(352)572-3753`},
{ID: `(352)813-7699`},
{ID: `(353)571-9328`},
{ID: `(353)734-4437`},
{ID: `(357)206-3921`},
{ID: `(358)260-2906`},
{ID: `(358)443-3105`},
{ID: `(359)055-7442`},
{ID: `(359)660-2174`},
{ID: `(362)566-6872`},
{ID: `(363)696-5662`},
{ID: `(364)455-6039`},
{ID: `(365)618-1800`},
{ID: `(365)987-5723`},
{ID: `(366)745-5764`},
{ID: `(368)150-3525`},
{ID: `(369)675-0347`},
{ID: `(370)852-2804`},
{ID: `(371)457-3138`},
{ID: `(371)824-8676`},
{ID: `(372)873-9163`},
{ID: `(373)306-5227`},
{ID: `(374)472-6944`},
{ID: `(375)579-0962`},
{ID: `(377)342-9398`},
{ID: `(378)105-2471`},
{ID: `(378)221-9592`},
{ID: `(379)130-9890`},
{ID: `(379)211-6896`},
{ID: `(379)284-6108`},
{ID: `(381)263-3395`},
{ID: `(381)673-7468`},
{ID: `(383)601-1058`},
{ID: `(384)180-2584`},
{ID: `(384)938-6496`},
{ID: `(385)290-8460`},
{ID: `(385)833-6509`},
{ID: `(388)119-2749`},
{ID: `(388)258-1387`},
{ID: `(388)375-7301`},
{ID: `(390)978-2697`},
{ID: `(395)291-4430`},
{ID: `(395)878-6308`},
{ID: `(395)931-7094`},
{ID: `(399)054-4627`},
{ID: `(399)249-5648`},
{ID: `(400)147-2102`},
{ID: `(400)455-9848`},
{ID: `(400)470-4740`},
{ID: `(403)559-8817`},
{ID: `(404)385-2422`},
{ID: `(404)638-2932`},
{ID: `(405)145-0317`},
{ID: `(406)051-9985`},
{ID: `(406)176-2347`},
{ID: `(406)569-7233`},
{ID: `(407)155-6201`},
{ID: `(409)090-0084`},
{ID: `(409)346-6541`},
{ID: `(409)765-1451`},
{ID: `(410)625-4841`},
{ID: `(411)685-1825`},
{ID: `(411)738-3402`},
{ID: `(413)204-5839`},
{ID: `(414)665-3249`},
{ID: `(415)319-3966`},
{ID: `(415)766-6735`},
{ID: `(418)269-7776`},
{ID: `(418)866-9389`},
{ID: `(419)179-5498`},
{ID: `(419)296-0568`},
{ID: `(420)177-7801`},
{ID: `(421)803-5499`},
{ID: `(423)675-8558`},
{ID: `(424)220-4883`},
{ID: `(424)837-7127`},
{ID: `(425)394-7431`},
{ID: `(427)322-3615`},
{ID: `(428)559-6652`},
{ID: `(428)747-2642`},
{ID: `(429)719-2829`},
{ID: `(430)031-9275`},
{ID: `(431)695-8541`},
{ID: `(432)483-4111`},
{ID: `(433)897-2204`},
{ID: `(435)172-8495`},
{ID: `(436)428-3533`},
{ID: `(437)490-4436`},
{ID: `(438)418-6258`},
{ID: `(439)156-8045`},
{ID: `(439)520-0144`},
{ID: `(440)035-0301`},
{ID: `(440)661-3829`},
{ID: `(440)964-2847`},
{ID: `(443)208-7431`},
{ID: `(444)531-4151`},
{ID: `(447)867-1650`},
{ID: `(450)661-7337`},
{ID: `(451)445-3454`},
{ID: `(453)453-9496`},
{ID: `(453)742-6569`},
{ID: `(453)841-9597`},
{ID: `(454)612-4389`},
{ID: `(455)766-1641`},
{ID: `(456)344-1269`},
{ID: `(457)211-2990`},
{ID: `(458)744-9454`},
{ID: `(458)841-9455`},
{ID: `(460)923-4708`},
{ID: `(462)249-1126`},
{ID: `(462)769-7484`},
{ID: `(463)792-7207`},
{ID: `(463)793-0089`},
{ID: `(464)043-7396`},
{ID: `(466)020-8794`},
{ID: `(466)719-5502`},
{ID: `(467)695-5419`},
{ID: `(468)265-2733`},
{ID: `(469)504-0680`},
{ID: `(470)419-3270`},
{ID: `(470)974-5922`},
{ID: `(470)978-8523`},
{ID: `(471)551-4277`},
{ID: `(472)498-6104`},
{ID: `(474)092-0985`},
{ID: `(474)515-2118`},
{ID: `(477)355-7502`},
{ID: `(477)816-0873`},
{ID: `(478)951-7242`},
{ID: `(479)641-6937`},
{ID: `(481)890-6449`},
{ID: `(482)537-9094`},
{ID: `(482)608-1906`},
{ID: `(485)044-4689`},
{ID: `(485)878-2778`},
{ID: `(486)196-0236`},
{ID: `(487)361-9472`},
{ID: `(488)227-1192`},
{ID: `(490)363-1724`},
{ID: `(490)581-1683`},
{ID: `(491)056-2691`},
{ID: `(492)340-2105`},
{ID: `(493)449-9353`},
{ID: `(493)558-2330`},
{ID: `(495)881-8656`},
{ID: `(496)649-3490`},
{ID: `(498)483-6438`},
{ID: `(500)126-3629`},
{ID: `(502)541-6350`},
{ID: `(503)799-9651`},
{ID: `(504)400-5778`},
{ID: `(504)600-9630`},
{ID: `(506)518-9133`},
{ID: `(508)009-0311`},
{ID: `(513)843-8210`},
{ID: `(514)218-4313`},
{ID: `(514)463-7083`},
{ID: `(515)141-9299`},
{ID: `(516)059-4087`},
{ID: `(516)636-3997`},
{ID: `(517)643-3356`},
{ID: `(519)191-9417`},
{ID: `(523)165-7674`},
{ID: `(525)142-5695`},
{ID: `(525)580-0351`},
{ID: `(526)225-3999`},
{ID: `(526)368-4043`},
{ID: `(526)855-2737`},
{ID: `(527)675-6113`},
{ID: `(530)287-4456`},
{ID: `(530)814-1162`},
{ID: `(530)935-8616`},
{ID: `(531)134-1587`},
{ID: `(533)721-7542`},
{ID: `(533)885-1179`},
{ID: `(535)896-1109`},
{ID: `(536)040-4796`},
{ID: `(537)119-3022`},
{ID: `(539)327-4819`},
{ID: `(539)747-3658`},
{ID: `(541)644-7108`},
{ID: `(542)039-7083`},
{ID: `(544)333-8413`},
{ID: `(544)881-1615`},
{ID: `(547)205-1413`},
{ID: `(549)300-1441`},
{ID: `(549)328-2327`},
{ID: `(551)423-3511`},
{ID: `(551)901-6452`},
{ID: `(552)265-2807`},
{ID: `(553)748-3267`},
{ID: `(556)012-0350`},
{ID: `(556)666-4825`},
{ID: `(557)080-4887`},
{ID: `(557)413-6179`},
{ID: `(557)891-7243`},
{ID: `(558)110-5674`},
{ID: `(559)019-2177`},
{ID: `(560)398-2890`},
{ID: `(560)492-2803`},
{ID: `(560)824-4296`},
{ID: `(563)057-9593`},
{ID: `(563)135-7239`},
{ID: `(566)343-6158`},
{ID: `(567)343-3601`},
{ID: `(567)699-0964`},
{ID: `(567)955-4755`},
{ID: `(568)455-5518`},
{ID: `(569)485-1351`},
{ID: `(569)675-5592`},
{ID: `(572)256-5255`},
{ID: `(572)583-6670`},
{ID: `(572)599-8576`},
{ID: `(574)370-3785`},
{ID: `(574)448-6569`},
{ID: `(575)149-1800`},
{ID: `(575)519-6399`},
{ID: `(575)968-9030`},
{ID: `(576)008-9199`},
{ID: `(578)513-1672`},
{ID: `(578)513-3257`},
{ID: `(578)737-4341`},
{ID: `(580)561-3207`},
{ID: `(584)846-4230`},
{ID: `(586)302-0737`},
{ID: `(587)286-0462`},
{ID: `(588)157-6521`},
{ID: `(589)219-4327`},
{ID: `(590)382-0464`},
{ID: `(594)780-8689`},
{ID: `(595)171-4971`},
{ID: `(595)609-5113`},
{ID: `(595)742-1887`},
{ID: `(596)242-5986`},
{ID: `(596)787-1563`},
{ID: `(597)063-4595`},
{ID: `(597)704-7408`},
{ID: `(600)599-8053`},
{ID: `(601)292-0226`},
{ID: `(601)430-4410`},
{ID: `(602)386-1964`},
{ID: `(603)339-0991`},
{ID: `(603)454-5797`},
{ID: `(603)922-9921`},
{ID: `(605)166-2693`},
{ID: `(606)491-6899`},
{ID: `(608)159-1463`},
{ID: `(609)075-9738`},
{ID: `(610)258-6392`},
{ID: `(610)451-3175`},
{ID: `(616)084-5568`},
{ID: `(616)367-5125`},
{ID: `(616)591-9407`},
{ID: `(617)933-5027`},
{ID: `(619)384-5684`},
{ID: `(620)091-7168`},
{ID: `(620)848-0484`},
{ID: `(621)993-9659`},
{ID: `(622)021-5399`},
{ID: `(622)665-9770`},
{ID: `(623)551-5738`},
{ID: `(624)192-9953`},
{ID: `(624)330-3619`},
{ID: `(626)054-3967`},
{ID: `(627)966-9063`},
{ID: `(629)328-9582`},
{ID: `(629)426-8169`},
{ID: `(630)649-4087`},
{ID: `(630)688-7013`},
{ID: `(631)283-9658`},
{ID: `(631)861-0610`},
{ID: `(633)271-7066`},
{ID: `(634)767-7614`},
{ID: `(635)817-4500`},
{ID: `(636)019-9596`},
{ID: `(636)648-5663`},
{ID: `(637)469-1401`},
{ID: `(637)992-1529`},
{ID: `(640)532-7532`},
{ID: `(640)808-2950`},
{ID: `(643)406-5013`},
{ID: `(643)617-1328`},
{ID: `(643)815-7142`},
{ID: `(645)939-1884`},
{ID: `(646)330-7552`},
{ID: `(646)430-4425`},
{ID: `(646)757-9645`},
{ID: `(648)576-6542`},
{ID: `(649)281-5817`},
{ID: `(651)434-7877`},
{ID: `(651)855-5503`},
{ID: `(651)907-9152`},
{ID: `(652)201-1937`},
{ID: `(652)677-9302`},
{ID: `(653)913-3561`},
{ID: `(653)919-0290`},
{ID: `(654)214-0363`},
{ID: `(654)584-3638`},
{ID: `(655)628-3423`},
{ID: `(656)205-8838`},
{ID: `(658)186-0584`},
{ID: `(660)553-2359`},
{ID: `(660)614-6256`},
{ID: `(661)888-8175`},
{ID: `(662)918-0585`},
{ID: `(664)486-7933`},
{ID: `(664)644-0588`},
{ID: `(666)373-9068`},
{ID: `(666)610-9788`},
{ID: `(666)711-0630`},
{ID: `(666)936-4637`},
{ID: `(667)581-4428`},
{ID: `(667)794-5040`},
{ID: `(669)412-4853`},
{ID: `(671)377-1515`},
{ID: `(672)861-4357`},
{ID: `(673)209-2035`},
{ID: `(673)899-9851`},
{ID: `(674)824-2613`},
{ID: `(675)289-8662`},
{ID: `(677)434-0724`},
{ID: `(677)521-9206`},
{ID: `(678)508-7427`},
{ID: `(682)595-4806`},
{ID: `(683)223-0630`},
{ID: `(683)770-8839`},
{ID: `(684)935-4057`},
{ID: `(685)584-0855`},
{ID: `(686)066-5474`},
{ID: `(687)058-2573`},
{ID: `(687)113-9639`},
{ID: `(687)136-5457`},
{ID: `(688)233-4463`},
{ID: `(691)104-4382`},
{ID: `(691)327-7872`},
{ID: `(694)102-9428`},
{ID: `(698)008-9712`},
{ID: `(698)465-6001`},
{ID: `(698)651-7847`},
{ID: `(698)660-8633`},
{ID: `(698)879-0511`},
{ID: `(699)048-1691`},
{ID: `(701)753-9540`},
{ID: `(704)385-8282`},
{ID: `(705)269-7628`},
{ID: `(705)424-3598`},
{ID: `(705)895-5731`},
{ID: `(706)021-7859`},
{ID: `(707)357-8230`},
{ID: `(708)245-0694`},
{ID: `(708)907-9137`},
{ID: `(709)679-7726`},
{ID: `(710)315-6149`},
{ID: `(711)499-6820`},
{ID: `(712)182-2385`},
{ID: `(712)943-1067`},
{ID: `(713)078-7309`},
{ID: `(713)282-1103`},
{ID: `(713)888-1609`},
{ID: `(714)489-4836`},
{ID: `(714)532-9784`},
{ID: `(714)589-2697`},
{ID: `(714)725-3320`},
{ID: `(715)926-8554`},
{ID: `(717)296-3780`},
{ID: `(717)392-9508`},
{ID: `(718)838-3600`},
{ID: `(719)831-7376`},
{ID: `(719)954-3815`},
{ID: `(720)426-7959`},
{ID: `(720)437-6393`},
{ID: `(724)126-9900`},
{ID: `(724)229-3105`},
{ID: `(725)396-8121`},
{ID: `(726)900-2631`},
{ID: `(727)695-2782`},
{ID: `(728)179-6849`},
{ID: `(730)006-9963`},
{ID: `(731)087-2021`},
{ID: `(731)747-9962`},
{ID: `(732)212-3121`},
{ID: `(733)036-5331`},
{ID: `(733)527-8173`},
{ID: `(733)934-8906`},
{ID: `(734)805-0698`},
{ID: `(735)447-5288`},
{ID: `(736)068-7905`},
{ID: `(736)141-3190`},
{ID: `(737)834-7922`},
{ID: `(739)712-7981`},
{ID: `(740)439-4080`},
{ID: `(741)651-2611`},
{ID: `(742)057-3047`},
{ID: `(742)851-1109`},
{ID: `(743)771-1953`},
{ID: `(744)038-4911`},
{ID: `(744)269-2466`},
{ID: `(745)625-4492`},
{ID: `(746)052-6260`},
{ID: `(747)047-0854`},
{ID: `(748)496-6638`},
{ID: `(748)640-5986`},
{ID: `(748)941-9575`},
{ID: `(749)328-0833`},
{ID: `(749)675-5619`},
{ID: `(751)117-2370`},
{ID: `(751)468-0594`},
{ID: `(751)724-9503`},
{ID: `(752)623-8555`},
{ID: `(755)270-0373`},
{ID: `(755)375-1935`},
{ID: `(755)483-9014`},
{ID: `(756)067-8075`},
{ID: `(757)193-1109`},
{ID: `(759)957-2741`},
{ID: `(760)032-5379`},
{ID: `(760)226-4153`},
{ID: `(760)508-8473`},
{ID: `(761)292-1159`},
{ID: `(761)770-7382`},
{ID: `(761)986-9054`},
{ID: `(762)148-6339`},
{ID: `(763)595-3724`},
{ID: `(764)408-3515`},
{ID: `(766)167-8587`},
{ID: `(768)584-0342`},
{ID: `(769)152-1601`},
{ID: `(769)275-5693`},
{ID: `(770)349-8258`},
{ID: `(770)467-2443`},
{ID: `(770)702-3494`},
{ID: `(771)137-8946`},
{ID: `(771)613-6848`},
{ID: `(771)769-8105`},
{ID: `(771)867-9665`},
{ID: `(773)841-0055`},
{ID: `(774)619-9237`},
{ID: `(774)780-5604`},
{ID: `(774)840-6740`},
{ID: `(775)862-9463`},
{ID: `(779)588-9955`},
{ID: `(780)129-4538`},
{ID: `(781)273-3064`},
{ID: `(781)834-5371`},
{ID: `(784)638-1850`},
{ID: `(785)238-4683`},
{ID: `(785)299-1011`},
{ID: `(785)910-3080`},
{ID: `(787)542-1431`},
{ID: `(787)624-0514`},
{ID: `(788)288-9544`},
{ID: `(788)293-3465`},
{ID: `(790)248-0778`},
{ID: `(790)258-1436`},
{ID: `(790)292-7346`},
{ID: `(791)414-2366`},
{ID: `(794)405-1423`},
{ID: `(796)547-6357`},
{ID: `(796)993-4781`},
{ID: `(797)084-7316`},
{ID: `(797)387-8553`},
{ID: `(800)113-1772`},
{ID: `(801)282-8040`},
{ID: `(801)534-7997`},
{ID: `(802)171-7049`},
{ID: `(802)457-4026`},
{ID: `(803)667-9121`},
{ID: `(804)356-6528`},
{ID: `(805)908-0773`},
{ID: `(808)026-8750`},
{ID: `(808)726-1797`},
{ID: `(809)137-7017`},
{ID: `(809)859-2894`},
{ID: `(811)084-1723`},
{ID: `(812)814-2808`},
{ID: `(813)232-5375`},
{ID: `(815)119-3354`},
{ID: `(815)574-6110`},
{ID: `(815)922-9990`},
{ID: `(815)988-9936`},
{ID: `(816)932-6273`},
{ID: `(818)080-9652`},
{ID: `(818)207-5326`},
{ID: `(819)085-2607`},
{ID: `(819)274-5153`},
{ID: `(821)143-6569`},
{ID: `(824)000-6213`},
{ID: `(826)146-1471`},
{ID: `(827)055-4196`},
{ID: `(831)517-7557`},
{ID: `(835)044-4685`},
{ID: `(835)566-4747`},
{ID: `(836)214-5561`},
{ID: `(836)667-7541`},
{ID: `(838)430-2097`},
{ID: `(839)611-8354`},
{ID: `(840)214-1443`},
{ID: `(842)206-9652`},
{ID: `(842)553-9277`},
{ID: `(842)984-2217`},
{ID: `(843)609-6669`},
{ID: `(843)954-4932`},
{ID: `(845)125-8340`},
{ID: `(846)415-6832`},
{ID: `(849)176-1461`},
{ID: `(850)456-0085`},
{ID: `(851)544-0548`},
{ID: `(851)950-9071`},
{ID: `(853)054-9411`},
{ID: `(853)714-7336`},
{ID: `(854)055-1538`},
{ID: `(854)768-9065`},
{ID: `(854)772-6556`},
{ID: `(855)148-9530`},
{ID: `(855)921-1046`},
{ID: `(856)368-2122`},
{ID: `(857)077-4220`},
{ID: `(857)454-3787`},
{ID: `(859)131-3651`},
{ID: `(862)731-8562`},
{ID: `(863)595-1623`},
{ID: `(864)113-0448`},
{ID: `(866)690-4927`},
{ID: `(869)168-3379`},
{ID: `(869)219-9586`},
{ID: `(869)636-8984`},
{ID: `(872)062-9910`},
{ID: `(873)138-2124`},
{ID: `(873)591-1697`},
{ID: `(876)342-2217`},
{ID: `(876)816-1712`},
{ID: `(877)428-2087`},
{ID: `(879)646-6310`},
{ID: `(881)626-2391`},
{ID: `(881)760-6150`},
{ID: `(883)422-0394`},
{ID: `(883)638-2566`},
{ID: `(885)578-8821`},
{ID: `(888)489-0328`},
{ID: `(890)215-4593`},
{ID: `(891)340-2881`},
{ID: `(891)550-3544`},
{ID: `(892)328-0619`},
{ID: `(893)120-9009`},
{ID: `(894)325-8747`},
{ID: `(894)371-5424`},
{ID: `(894)577-2581`},
{ID: `(895)254-0384`},
{ID: `(895)756-4212`},
{ID: `(896)161-1085`},
{ID: `(896)745-9705`},
{ID: `(896)988-8817`},
{ID: `(898)335-4657`},
{ID: `(900)591-9222`},
{ID: `(901)868-4243`},
{ID: `(902)063-0631`},
{ID: `(903)939-8820`},
{ID: `(904)319-2997`},
{ID: `(905)653-8129`},
{ID: `(906)466-2298`},
{ID: `(907)759-8056`},
{ID: `(909)246-1852`},
{ID: `(909)300-2377`},
{ID: `(909)345-0034`},
{ID: `(910)861-4300`},
{ID: `(911)021-7823`},
{ID: `(911)281-3420`},
{ID: `(911)724-4584`},
{ID: `(913)503-8339`},
{ID: `(914)021-5994`},
{ID: `(915)757-2966`},
{ID: `(916)147-7644`},
{ID: `(917)141-1025`},
{ID: `(917)694-5537`},
{ID: `(918)803-9971`},
{ID: `(919)532-5858`},
{ID: `(919)693-6668`},
{ID: `(921)251-4862`},
{ID: `(921)775-9266`},
{ID: `(922)750-4564`},
{ID: `(924)229-8600`},
{ID: `(925)020-5381`},
{ID: `(925)692-5744`},
{ID: `(925)878-9730`},
{ID: `(926)487-5368`},
{ID: `(928)631-5868`},
{ID: `(929)550-5648`},
{ID: `(929)907-8014`},
{ID: `(932)218-3738`},
{ID: `(935)580-3106`},
{ID: `(935)606-3273`},
{ID: `(935)751-3561`},
{ID: `(936)135-2310`},
{ID: `(938)413-6458`},
{ID: `(941)047-2527`},
{ID: `(941)296-8588`},
{ID: `(941)934-6234`},
{ID: `(942)354-1999`},
{ID: `(942)722-6917`},
{ID: `(943)217-1571`},
{ID: `(943)774-5357`},
{ID: `(944)886-8208`},
{ID: `(947)108-2454`},
{ID: `(947)538-2838`},
{ID: `(948)304-6100`},
{ID: `(948)733-3149`},
{ID: `(949)800-0810`},
{ID: `(951)270-9835`},
{ID: `(952)162-1559`},
{ID: `(952)853-3566`},
{ID: `(953)189-1330`},
{ID: `(955)947-0459`},
{ID: `(956)517-0702`},
{ID: `(957)103-7685`},
{ID: `(957)376-1507`},
{ID: `(957)568-5503`},
{ID: `(959)252-4837`},
{ID: `(959)866-6711`},
{ID: `(960)159-9490`},
{ID: `(961)012-7334`},
{ID: `(961)772-7344`},
{ID: `(962)558-0335`},
{ID: `(963)592-4777`},
{ID: `(964)921-2640`},
{ID: `(967)034-3119`},
{ID: `(967)803-7125`},
{ID: `(968)059-6712`},
{ID: `(968)923-4624`},
{ID: `(969)545-9064`},
{ID: `(970)639-3627`},
{ID: `(970)819-7458`},
{ID: `(971)387-8213`},
{ID: `(973)129-2831`},
{ID: `(973)147-3696`},
{ID: `(973)724-7344`},
{ID: `(974)718-6899`},
{ID: `(974)793-8041`},
{ID: `(976)135-2972`},
{ID: `(978)965-3841`},
{ID: `(979)722-7875`},
{ID: `(980)341-1664`},
{ID: `(980)930-4619`},
{ID: `(981)732-8982`},
{ID: `(983)627-8743`},
{ID: `(984)814-2316`},
{ID: `(985)173-3767`},
{ID: `(986)294-6279`},
{ID: `(989)251-0197`},
{ID: `(990)266-2799`},
{ID: `(991)231-1452`},
{ID: `(992)643-0429`},
{ID: `(995)289-6049`},
{ID: `(995)907-1091`},
{ID: `(995)952-5150`},
{ID: `(996)139-6132`},
{ID: `(999)673-0589`},
{ID: `(999)879-1284`}}},
`State`: {ID: `State`, Name: `State`, Row: []Row{
{ID: `Alabama`},
{ID: `Alaska`},
{ID: `Arizona`},
{ID: `Arkansas`},
{ID: `California`},
{ID: `Colorado`},
{ID: `Connecticut`},
{ID: `Delaware`},
{ID: `Florida`},
{ID: `Georgia`},
{ID: `Hawaii`},
{ID: `Idaho`},
{ID: `Illinois`},
{ID: `Indiana`},
{ID: `Iowa`},
{ID: `Kansas`},
{ID: `Kentucky`},
{ID: `Louisiana`},
{ID: `Maine`},
{ID: `Maryland`},
{ID: `Massachusetts`},
{ID: `Michigan`},
{ID: `Minnesota`},
{ID: `Mississippi`},
{ID: `Missouri`},
{ID: `Montana`},
{ID: `Nebraska`},
{ID: `Nevada`},
{ID: `New Hampshire`},
{ID: `New Jersey`},
{ID: `New Mexico`},
{ID: `New York `},
{ID: `North Carolina`},
{ID: `North Dakota`},
{ID: `Ohio`},
{ID: `Oklahoma`},
{ID: `Oregon`},
{ID: `Pennsylvania`},
{ID: `Rhode Island`},
{ID: `South Carolina`},
{ID: `South Dakota`},
{ID: `Tennessee`},
{ID: `Texas`},
{ID: `Utah`},
{ID: `Vermont`},
{ID: `Virginia`},
{ID: `Washington`},
{ID: `West Virginia`},
{ID: `Wisconsin`},
{ID: `Wyoming`}}},
`Street`: {ID: `Street`, Name: `Street`, Row: []Row{
{ID: `11th St`},
{ID: `1st St`},
{ID: `2nd St`},
{ID: `3rd St`},
{ID: `41st St`},
{ID: `4th St`},
{ID: `6th St`},
{ID: `7th St`},
{ID: `8th St`},
{ID: `9th St`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>t`},
{ID: `<NAME>d`},
{ID: `Abington Ct`},
{ID: `Access Rd`},
{ID: `<NAME>d`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME> Rd`},
{ID: `Adairsville Pleasant Valley Rd`},
{ID: `<NAME> Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Adcock Rd`},
{ID: `Aiken St`},
{ID: `<NAME>`},
{ID: `Akin Rd`},
{ID: `<NAME>`},
{ID: `Akron St`},
{ID: `<NAME>`},
{ID: `Alexander St`},
{ID: `Alford Rd`},
{ID: `Alisha Cir`},
{ID: `All Metals Dr`},
{ID: `Allatoona Dam Rd`},
{ID: `Allatoona Dr`},
{ID: `Allatoona Estates Dr`},
{ID: `Allatoona Landing Rd`},
{ID: `Allatoona Pass Rd`},
{ID: `Allatoona Trace Dr`},
{ID: `Allatoona Woods Trl`},
{ID: `Allegiance Ct`},
{ID: `Allen Cir`},
{ID: `Allen Rd`},
{ID: `Allison Cir`},
{ID: `Allweather St`},
{ID: `Alpine Dr`},
{ID: `Amanda Ln`},
{ID: `Amandas Ct`},
{ID: `Amberidge Dr`},
{ID: `Amberly Ln`},
{ID: `Amberwood Conn`},
{ID: `Amberwood Ct`},
{ID: `Amberwood Ln`},
{ID: `Amberwood Pl`},
{ID: `Amberwood Trl`},
{ID: `Amberwood Way`},
{ID: `Ampacet Dr`},
{ID: `Anchor Rd`},
{ID: `Anderson St`},
{ID: `<NAME> Trl`},
{ID: `Angus Trl`},
{ID: `<NAME>ir`},
{ID: `Ann Rd`},
{ID: `Anna Pl`},
{ID: `Anns Ct`},
{ID: `Anns Trc`},
{ID: `Ansley Way`},
{ID: `Ansubet Dr`},
{ID: `Antebellum Ct`},
{ID: `Apache Dr`},
{ID: `Apache Trl`},
{ID: `Apex Dr`},
{ID: `Appaloosa Ct`},
{ID: `Apple Barrel Way`},
{ID: `Apple Ln`},
{ID: `Apple Tree Ln`},
{ID: `Apple Wood Ln`},
{ID: `Appletree Ct`},
{ID: `Appling Way`},
{ID: `April Ln`},
{ID: `Aragon Rd`},
{ID: `Arapaho Dr`},
{ID: `Arbor Ln`},
{ID: `Arbors Way`},
{ID: `Arbutus Trl`},
{ID: `<NAME>ir`},
{ID: `Arizona Ave`},
{ID: `Arlington Way`},
{ID: `Arnold Rd`},
{ID: `<NAME>`},
{ID: `Arrington Rd`},
{ID: `Arrow Mountain Dr`},
{ID: `Arrowhead Ct`},
{ID: `Arrowhead Dr`},
{ID: `Arrowhead Ln`},
{ID: `Ash Ct`},
{ID: `Ash Way`},
{ID: `Ashford Ct`},
{ID: `Ashford Pt`},
{ID: `Ashley Ct`},
{ID: `Ashley Rd`},
{ID: `Ashwood Dr`},
{ID: `Aspen Dr`},
{ID: `Aspen Ln`},
{ID: `Assembly Dr`},
{ID: `Atco All`},
{ID: `Attaway Dr`},
{ID: `Atwood Rd`},
{ID: `Aubrey Lake Rd`},
{ID: `Aubrey Rd`},
{ID: `Aubrey St`},
{ID: `Auburn Dr`},
{ID: `Austin Rd`},
{ID: `Autry Rd`},
{ID: `Autumn Pl`},
{ID: `Autumn Ridge Dr`},
{ID: `Autumn Turn`},
{ID: `Autumn Wood Dr`},
{ID: `Avenue Of Savannah`},
{ID: `Avon Ct`},
{ID: `Azalea Dr`},
{ID: `Aztec Way`},
{ID: `B D Trl`},
{ID: `Backus Rd`},
{ID: `Bagwell Ln`},
{ID: `<NAME> Rd`},
{ID: `Bailey Rd`},
{ID: `Baker Rd`},
{ID: `Baker St`},
{ID: `<NAME> Lndg`},
{ID: `Baldwell Ct`},
{ID: `Balfour Dr`},
{ID: `Balsam Dr`},
{ID: `Bandit Ln`},
{ID: `Bangor St`},
{ID: `Baptist Cir`},
{ID: `Barnsley Church Rd`},
{ID: `Barnsley Ct`},
{ID: `Barnsley Dr`},
{ID: `Barnsley Garden Rd`},
{ID: `Barnsley Village Dr`},
{ID: `Barnsley Village Trl`},
{ID: `Barrett Ln`},
{ID: `Barrett Rd`},
{ID: `Barry Dr`},
{ID: `Bartow Beach Rd`},
{ID: `<NAME> Rd`},
{ID: `Bartow St`},
{ID: `Bates Rd`},
{ID: `Bay Ct`},
{ID: `Bearden Rd`},
{ID: `Beasley Rd`},
{ID: `Beaureguard St`},
{ID: `Beaver Trl`},
{ID: `Beavers Dr`},
{ID: `Bedford Ct`},
{ID: `Bedford Rdg`},
{ID: `Bee Tree Rd`},
{ID: `Beechwood Dr`},
{ID: `Beguine Dr`},
{ID: `Bell Dr`},
{ID: `<NAME> Rd`},
{ID: `Belmont Dr`},
{ID: `Belmont Way`},
{ID: `<NAME>`},
{ID: `Benham Cir`},
{ID: `<NAME> Rd`},
{ID: `Bennett Way`},
{ID: `Bent Water Dr`},
{ID: `Berkeley Pl`},
{ID: `Berkshire Dr`},
{ID: `Bestway Dr`},
{ID: `Bestway Pkwy`},
{ID: `Betsy Locke Pt`},
{ID: `Beverlie Dr`},
{ID: `Bevil Ridge Rd`},
{ID: `Biddy Rd`},
{ID: `Big Branch Ct`},
{ID: `Big Ditch Rd`},
{ID: `Big Oak Tree Rd`},
{ID: `Big Pond Rd`},
{ID: `<NAME> Rd`},
{ID: `<NAME> Rd`},
{ID: `Billies Cv`},
{ID: `Bingham Rd`},
{ID: `Birch Pl`},
{ID: `Birch Way`},
{ID: `Bishop Cv`},
{ID: `Bishop Dr`},
{ID: `Bishop Loop`},
{ID: `Bishop Mill Dr`},
{ID: `Bishop Rd`},
{ID: `Black Jack Mountain Cir`},
{ID: `Black Oak Rd`},
{ID: `Black Rd`},
{ID: `Black Water Dr`},
{ID: `Blackacre Trl`},
{ID: `Blackberry Rdg`},
{ID: `Blackfoot Trl`},
{ID: `Blacksmith Ln`},
{ID: `Bloomfield Ct`},
{ID: `Blueberry Rdg`},
{ID: `Bluebird Cir`},
{ID: `Bluegrass Cv`},
{ID: `Bluff Ct`},
{ID: `Boardwalk Ct`},
{ID: `Boatner Ave`},
{ID: `Bob O Link Dr`},
{ID: `Bob White Trl`},
{ID: `Bobcat Ct`},
{ID: `Boliver Rd`},
{ID: `Bonair St`},
{ID: `Boones Farm`},
{ID: `Boones Ridge Dr`},
{ID: `Boones Ridge Pkwy`},
{ID: `Boss Rd`},
{ID: `Boulder Crest Rd`},
{ID: `Boulder Rd`},
{ID: `Bowen Rd`},
{ID: `Bowens Ct`},
{ID: `Bo<NAME> Dr`},
{ID: `Boyd Mountain Rd`},
{ID: `Boysenberry Ct`},
{ID: `Bozeman Rd`},
{ID: `Bradford Ct`},
{ID: `Bradford Dr`},
{ID: `Bradley Ln`},
{ID: `Bradley Trl`},
{ID: `Bramblewood Ct`},
{ID: `Bramblewood Dr`},
{ID: `Bramblewood Pl`},
{ID: `Bramblewood Trl`},
{ID: `Bramblewood Way`},
{ID: `<NAME> Rd`},
{ID: `<NAME>dg`},
{ID: `Brandy Ln`},
{ID: `<NAME> Rd`},
{ID: `Branson Mill Dr`},
{ID: `Branton Rd`},
{ID: `<NAME>`},
{ID: `Brentwood Dr`},
{ID: `<NAME>`},
{ID: `<NAME> Ct`},
{ID: `<NAME> Ln`},
{ID: `Briarcrest Way`},
{ID: `Briarwood Ln`},
{ID: `Brickshire`},
{ID: `Brickshire Dr`},
{ID: `Bridgestone Way`},
{ID: `Bridlewood Ct`},
{ID: `Brighton Ct`},
{ID: `Brightwell Pl`},
{ID: `Bristol Ct`},
{ID: `Brittani Ln`},
{ID: `Broadlands Dr`},
{ID: `Broken Arrow Ct`},
{ID: `Bronco Ct`},
{ID: `Brook Dr`},
{ID: `Brook Knoll Ct`},
{ID: `Brooke Rd`},
{ID: `Brookhollow Ln`},
{ID: `Brookland Dr`},
{ID: `Brookshire Dr`},
{ID: `Brookside Ct`},
{ID: `Brookside Way`},
{ID: `Brookwood Dr`},
{ID: `Brown Dr`},
{ID: `Brown Farm Rd`},
{ID: `Brown Loop`},
{ID: `Brown Loop Spur`},
{ID: `Brown Rd`},
{ID: `Brownwood Dr`},
{ID: `Bruce St`},
{ID: `Brutis Rd`},
{ID: `Bryan Dr`},
{ID: `Bryan Ln`},
{ID: `Buckhorn Trl`},
{ID: `Buckingham Ct`},
{ID: `Buckland Ct`},
{ID: `Buckskin Dr`},
{ID: `Bucky St`},
{ID: `Buena Vista Cir`},
{ID: `Buford St`},
{ID: `Bunch Mountain Rd`},
{ID: `Burch Ln`},
{ID: `Burges Mill Rd`},
{ID: `Burnt Hickory Dr`},
{ID: `Burnt Hickory Rd`},
{ID: `Busch Dr`},
{ID: `Bushey Trl`},
{ID: `Buttonwood Dr`},
{ID: `Buttram Rd`},
{ID: `Byars Rd`},
{ID: `C J Ct`},
{ID: `C J Dr`},
{ID: `Caboose Ct`},
{ID: `Cade Dr`},
{ID: `Cagle Rd`},
{ID: `Cain Dr`},
{ID: `Calico Valley Rd`},
{ID: `Calloway Ln`},
{ID: `Calvary Ct`},
{ID: `Cambridge Ct`},
{ID: `Cambridge Way`},
{ID: `<NAME> Dr`},
{ID: `Camellia Ln`},
{ID: `Camelot Dr`},
{ID: `Camp Creek Rd`},
{ID: `Camp Dr`},
{ID: `Camp Pl`},
{ID: `Camp Sunrise Rd`},
{ID: `Camp Trl`},
{ID: `Campbell Dr`},
{ID: `Campfire Trl`},
{ID: `Candlestick Comm`},
{ID: `Canefield Dr`},
{ID: `<NAME>`},
{ID: `<NAME>t`},
{ID: `<NAME>`},
{ID: `Canter Ln`},
{ID: `Canterbury Ct`},
{ID: `Canterbury Walk`},
{ID: `Cantrell Ln`},
{ID: `Cantrell Pt`},
{ID: `Cantrell St`},
{ID: `Canty Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Captains Walk`},
{ID: `Cardinal Ct`},
{ID: `Cardinal Rd`},
{ID: `<NAME> Dr`},
{ID: `<NAME>`},
{ID: `Carnes Dr`},
{ID: `Carnes Rd`},
{ID: `Carolyn Ct`},
{ID: `Carr Rd`},
{ID: `Carriage Ln`},
{ID: `Carriage Trc`},
{ID: `Carrington Dr`},
{ID: `Carrington Trc`},
{ID: `<NAME> Rd`},
{ID: `Carson Ct`},
{ID: `<NAME>`},
{ID: `<NAME>d`},
{ID: `<NAME> Blvd`},
{ID: `Carter Ln`},
{ID: `Carter Rd`},
{ID: `<NAME>ing Rd`},
{ID: `Casey Dr`},
{ID: `Casey Ln`},
{ID: `Casey St`},
{ID: `Cass Dr`},
{ID: `Cass Station Dr`},
{ID: `Cass Station Pass`},
{ID: `Cassandra View`},
{ID: `Cassville Pine Log Rd`},
{ID: `Cassville Rd`},
{ID: `Cassville White Rd`},
{ID: `Catalpa Ct`},
{ID: `Cathedral Hght`},
{ID: `<NAME>`},
{ID: `Catherine Way`},
{ID: `Cedar Creek Church Rd`},
{ID: `Cedar Creek Rd`},
{ID: `Cedar Gate Ln`},
{ID: `Cedar Ln`},
{ID: `Cedar Rd`},
{ID: `Cedar Rdg`},
{ID: `Cedar Springs Dr`},
{ID: `Cedar St`},
{ID: `Cedar Way`},
{ID: `Cemetary Rd`},
{ID: `Center Bluff`},
{ID: `Center Rd`},
{ID: `Center St`},
{ID: `Centerport Dr`},
{ID: `Central Ave`},
{ID: `Chance Cir`},
{ID: `Chandler Ln`},
{ID: `Chapel Way`},
{ID: `Charismatic Rd`},
{ID: `Charles Ct`},
{ID: `Charles St`},
{ID: `Charlotte Dr`},
{ID: `Chase Pl`},
{ID: `Chateau Dr`},
{ID: `Cherokee Cir`},
{ID: `Cherokee Dr`},
{ID: `Cherokee Hght`},
{ID: `Cherokee Hills Dr`},
{ID: `Cherokee Pl`},
{ID: `Cherokee St`},
{ID: `Cherry St`},
{ID: `Cherrywood Ln`},
{ID: `Cherrywood Way`},
{ID: `Cheryl Dr`},
{ID: `Chestnut Ridge Ct`},
{ID: `Chestnut Ridge Dr`},
{ID: `Chestnut St`},
{ID: `Cheyenne Way`},
{ID: `Chickasaw Trl`},
{ID: `Chickasaw Way`},
{ID: `Chimney Ln`},
{ID: `<NAME>ings Dr`},
{ID: `Chippewa Dr`},
{ID: `Chippewa Way`},
{ID: `Chitwood Cemetary Rd`},
{ID: `Choctaw Ct`},
{ID: `Christon Dr`},
{ID: `Christopher Pl`},
{ID: `<NAME>`},
{ID: `Chulio Dr`},
{ID: `Chunn Dr`},
{ID: `Chunn Facin Rd`},
{ID: `Church St`},
{ID: `Churchill Down`},
{ID: `Churchill Downs Down`},
{ID: `Cindy Ln`},
{ID: `Citation Pte`},
{ID: `Claire Cv`},
{ID: `<NAME>`},
{ID: `Clark Way`},
{ID: `Clear Creek Rd`},
{ID: `Clear Lake Dr`},
{ID: `Clear Pass`},
{ID: `Clearview Dr`},
{ID: `Clearwater St`},
{ID: `<NAME> Rd`},
{ID: `Cliffhanger Pte`},
{ID: `Cline Dr`},
{ID: `<NAME> Rd`},
{ID: `Cline St`},
{ID: `Clover Dr`},
{ID: `Clover Ln`},
{ID: `Clover Pass`},
{ID: `Clubhouse Ct`},
{ID: `Clubview Dr`},
{ID: `Clydesdale Trl`},
{ID: `Cobblestone Dr`},
{ID: `Cochrans Way`},
{ID: `Coffee St`},
{ID: `Cole Ct`},
{ID: `Cole Dr`},
{ID: `Coleman St`},
{ID: `Colleen and Karen Rd`},
{ID: `College St`},
{ID: `Collins Dr`},
{ID: `Collins Pl`},
{ID: `Collins St`},
{ID: `Collum Rd`},
{ID: `Colonial Cir`},
{ID: `Colonial Club Dr`},
{ID: `Colony Ct`},
{ID: `Colony Dr`},
{ID: `Colt Ct`},
{ID: `Colt Way`},
{ID: `Columbia St`},
{ID: `Comedy Ln`},
{ID: `Commanche Dr`},
{ID: `Commanche Trl`},
{ID: `Commerce Dr`},
{ID: `Commerce Row`},
{ID: `Commerce Way`},
{ID: `Cone Rd`},
{ID: `Confederate St`},
{ID: `Connesena Rd`},
{ID: `Connie St`},
{ID: `Conyers Industrial Dr`},
{ID: `Cook St`},
{ID: `Cooper Mill Rd`},
{ID: `Copeland Rd`},
{ID: `Coperite Pl`},
{ID: `Copperhead Rd`},
{ID: `Corbitt Dr`},
{ID: `Corinth Rd`},
{ID: `Corson Trl`},
{ID: `Cottage Dr`},
{ID: `Cottage Trc`},
{ID: `Cottage Walk`},
{ID: `Cotton Bend`},
{ID: `Cotton Dr`},
{ID: `Cotton St`},
{ID: `Cottonwood Ct`},
{ID: `Country Club Dr`},
{ID: `Country Cove Ln`},
{ID: `Country Creek Rd`},
{ID: `Country Dr`},
{ID: `Country Ln`},
{ID: `Country Meadow Way`},
{ID: `Country Walk`},
{ID: `County Line Loop No 1`},
{ID: `County Line Rd`},
{ID: `County Line Road No 2`},
{ID: `Courrant St`},
{ID: `Court Xing`},
{ID: `Courtyard Dr`},
{ID: `Courtyard Ln`},
{ID: `Covered Bridge Rd`},
{ID: `Cowan Dr`},
{ID: `Cox Farm Rd`},
{ID: `Cox Farm Spur`},
{ID: `Cox Rd`},
{ID: `Cox St`},
{ID: `Cozy Ln`},
{ID: `Craigs Rd`},
{ID: `Crane Cir`},
{ID: `Creed Dr`},
{ID: `Creek Bend Ct`},
{ID: `Creek Dr`},
{ID: `Creek Trl`},
{ID: `Creekbend Dr`},
{ID: `Creekside Dr`},
{ID: `Creekside Ln`},
{ID: `Creekstone Ct`},
{ID: `Creekview Dr`},
{ID: `Crescent Dr`},
{ID: `Crestbrook Dr`},
{ID: `Crestview Ln`},
{ID: `Crestwood Ct`},
{ID: `Crestwood Rd`},
{ID: `Crimson Hill Dr`},
{ID: `Criss Black Rd`},
{ID: `Crolley Ln`},
{ID: `Cromwell Ct`},
{ID: `Cross Creek Dr`},
{ID: `Cross St`},
{ID: `Cross Tie Ct`},
{ID: `Crossbridge CT`},
{ID: `Crossfield Cir`},
{ID: `Crowe Dr`},
{ID: `Crowe Springs Rd`},
{ID: `Crowe Springs Spur`},
{ID: `Crump Rd`},
{ID: `Crystal Ln`},
{ID: `Crystal Mountain Rd`},
{ID: `Culver Rd`},
{ID: `Cumberland Gap`},
{ID: `Cumberland Rd`},
{ID: `Cummings Rd`},
{ID: `Curtis Ct`},
{ID: `Cut Off Rd`},
{ID: `Cypress Way`},
{ID: `Dabbs Dr`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Danby Ct`},
{ID: `Darnell Rd`},
{ID: `<NAME>d`},
{ID: `David St`},
{ID: `Davids Way`},
{ID: `Davis Dr`},
{ID: `Davis Loop`},
{ID: `Davis St`},
{ID: `Davistown Rd`},
{ID: `Dawn Dr`},
{ID: `Dawns Way`},
{ID: `Dawson St`},
{ID: `Dean Dr`},
{ID: `Dean Rd`},
{ID: `Dean St`},
{ID: `<NAME>`},
{ID: `Deens Rd`},
{ID: `Deer Lodge Rd`},
{ID: `Deer Run Dr`},
{ID: `Deer Run Ln`},
{ID: `Deering Way`},
{ID: `Deerview Ct`},
{ID: `Defender St`},
{ID: `Dempsey Loop`},
{ID: `Dempsey Rd`},
{ID: `Dent Dr`},
{ID: `Denver Dr`},
{ID: `<NAME>`},
{ID: `Derrick Ln`},
{ID: `<NAME>n`},
{ID: `Devon Ct`},
{ID: `Dewberry Ln`},
{ID: `Dewey Dr`},
{ID: `Dianne Dr`},
{ID: `Dixie Dr`},
{ID: `Dobson Dr`},
{ID: `Dodd Rd`},
{ID: `<NAME>d`},
{ID: `<NAME>t`},
{ID: `Dog Ln`},
{ID: `<NAME>ir`},
{ID: `Dogwood Dr`},
{ID: `Dogwood Ln`},
{ID: `Dogwood Pl`},
{ID: `Dogwood Trl`},
{ID: `Dolphin Dr`},
{ID: `Donn Dr`},
{ID: `<NAME> Rd`},
{ID: `Doris Rd`},
{ID: `Doss Dr`},
{ID: `Douglas St`},
{ID: `Douthit Bridge Rd`},
{ID: `<NAME> Rd`},
{ID: `Dove Ct`},
{ID: `Dove Dr`},
{ID: `Dove Trl`},
{ID: `Dover Rd`},
{ID: `Downing Way`},
{ID: `<NAME> Trl`},
{ID: `Drury Ln`},
{ID: `<NAME> Rd`},
{ID: `Duncan Dr`},
{ID: `Dunhill Ct`},
{ID: `Durey Ct`},
{ID: `Dyar St`},
{ID: `Dysart Rd`},
{ID: `E Carter St`},
{ID: `E Cherokee Ave`},
{ID: `E Church St`},
{ID: `E Felton Rd`},
{ID: `E George St`},
{ID: `E Greenridge Rd`},
{ID: `E Holiday Ct`},
{ID: `E Howard St`},
{ID: `E Indiana Ave`},
{ID: `E Lee St`},
{ID: `E Main St`},
{ID: `E Mitchell Rd`},
{ID: `E Pleasant Valley Rd`},
{ID: `E Porter St`},
{ID: `E Railroad St`},
{ID: `E Rocky St`},
{ID: `Eagle Dr`},
{ID: `Eagle Glen Dr`},
{ID: `Eagle Ln`},
{ID: `Eagle Mountain Trl`},
{ID: `Eagle Pkwy`},
{ID: `Eagles Ct`},
{ID: `Eagles Nest Cv`},
{ID: `Eagles View Dr`},
{ID: `Earle Dr`},
{ID: `East Boxwood Dr`},
{ID: `East Heritage Dr`},
{ID: `East Valley Rd`},
{ID: `Easton Trc`},
{ID: `Eastview Ct`},
{ID: `Eastview Ter`},
{ID: `Eastwood Dr`},
{ID: `Echota Rd`},
{ID: `Edgewater Dr`},
{ID: `Edgewood Rd`},
{ID: `Edsel Dr`},
{ID: `Eidson St`},
{ID: `Elizabeth Rd`},
{ID: `Elizabeth St`},
{ID: `Elkhorn Ct`},
{ID: `Elliott St`},
{ID: `Ellis Rd`},
{ID: `Elm Dr`},
{ID: `Elm St`},
{ID: `Elmwood Pl`},
{ID: `Elrod Rdg`},
{ID: `Elrod St`},
{ID: `Ember Way`},
{ID: `Emerald Pass`},
{ID: `Emerald Run`},
{ID: `Emerald Springs Ct`},
{ID: `Emerald Springs Dr`},
{ID: `Emerald Springs Way`},
{ID: `Emerald Trl`},
{ID: `Engineer Ln`},
{ID: `English Turn`},
{ID: `Enon Ridge Rd`},
{ID: `Enterprise Dr`},
{ID: `Equestrian Way`},
{ID: `Estate Dr`},
{ID: `Estates Rdg`},
{ID: `Etowah Ct`},
{ID: `Etowah Dr`},
{ID: `Etowah Ln`},
{ID: `Etowah Ridge Dr`},
{ID: `Etowah Ridge Ovlk`},
{ID: `Etowah Ridge Trl`},
{ID: `Euharlee Five Forks Rd`},
{ID: `Euharlee Rd`},
{ID: `Euharlee St`},
{ID: `Evans Hightower Rd`},
{ID: `Evans Rd`},
{ID: `Evening Trl`},
{ID: `Everest Dr`},
{ID: `Everett Cir`},
{ID: `Evergreen Trl`},
{ID: `Ezell Rd`},
{ID: `Fairfield Ct`},
{ID: `Fairfield Dr`},
{ID: `Fairfield Ln`},
{ID: `Fairfield Way`},
{ID: `Fairmount Rd`},
{ID: `Fairview Church Rd`},
{ID: `Fairview Cir`},
{ID: `Fairview Dr`},
{ID: `Fairview St`},
{ID: `Faith Ln`},
{ID: `Falcon Cir`},
{ID: `Fall Dr`},
{ID: `Falling Springs Rd`},
{ID: `Farm Rd`},
{ID: `Farmbrook Dr`},
{ID: `Farmer Rd`},
{ID: `Farmstead Ct`},
{ID: `Farr Cir`},
{ID: `Fawn Lake Trl`},
{ID: `Fawn Ridge Dr`},
{ID: `Fawn View`},
{ID: `Felton Pl`},
{ID: `Felton St`},
{ID: `Ferguson Dr`},
{ID: `Ferry Views`},
{ID: `Fields Rd`},
{ID: `Fieldstone Ct`},
{ID: `Fieldstone Path`},
{ID: `Fieldwood Dr`},
{ID: `Finch Ct`},
{ID: `Findley Rd`},
{ID: `Finley St`},
{ID: `Fire Tower Rd`},
{ID: `Fireside Ct`},
{ID: `Fite St`},
{ID: `Five Forks Rd`},
{ID: `Flagstone Ct`},
{ID: `Flint Hill Rd`},
{ID: `Floral Dr`},
{ID: `Florence Dr`},
{ID: `Florida Ave`},
{ID: `Floyd Creek Church Rd`},
{ID: `Floyd Rd`},
{ID: `Folsom Glade Rd`},
{ID: `Folsom Rd`},
{ID: `Fools Gold Rd`},
{ID: `Foothills Pkwy`},
{ID: `Ford St`},
{ID: `Forest Hill Dr`},
{ID: `Forest Trl`},
{ID: `Forrest Ave`},
{ID: `Forrest Hill Dr`},
{ID: `Forrest Ln`},
{ID: `Fossetts Cv`},
{ID: `Fouche Ct`},
{ID: `Fouche Dr`},
{ID: `Four Feathers Ln`},
{ID: `Fowler Dr`},
{ID: `Fowler Rd`},
{ID: `Fox Chas`},
{ID: `Fox Hill Dr`},
{ID: `Fox Meadow Ct`},
{ID: `Foxfire Ln`},
{ID: `Foxhound Way`},
{ID: `Foxrun Ct`},
{ID: `<NAME>`},
{ID: `Franklin Dr`},
{ID: `<NAME> Dr`},
{ID: `Franklin Loop`},
{ID: `Fredda Ln`},
{ID: `Freedom Dr`},
{ID: `Freeman St`},
{ID: `Friction Dr`},
{ID: `Friendly Ln`},
{ID: `Friendship Rd`},
{ID: `Fuger Ln`},
{ID: `Fun Dr`},
{ID: `Funkhouser Industrial Access Rd`},
{ID: `Gaddis Rd`},
{ID: `Gail St`},
{ID: `Gaines Rd`},
{ID: `Gaither Boggs Rd`},
{ID: `Galt St`},
{ID: `Galway Dr`},
{ID: `Garden Gate`},
{ID: `Garland No 1 Rd`},
{ID: `Garland No 2 Rd`},
{ID: `Garrison Dr`},
{ID: `Gaston Westbrook Ave`},
{ID: `Gatepost Ln`},
{ID: `Gatlin Rd`},
{ID: `Gayle Dr`},
{ID: `Geneva Ln`},
{ID: `Gentilly Blvd`},
{ID: `Gentry Dr`},
{ID: `George St`},
{ID: `Georgia Ave`},
{ID: `Georgia Blvd`},
{ID: `Georgia North Cir`},
{ID: `Georgia North Industrial Rd`},
{ID: `Gertrude Ln`},
{ID: `Gibbons Rd`},
{ID: `Gill Rd`},
{ID: `<NAME>`},
{ID: `Gilmer St`},
{ID: `Gilreath Rd`},
{ID: `Gilreath Trl`},
{ID: `Glade Rd`},
{ID: `Glen Cove Dr`},
{ID: `Glenabby Dr`},
{ID: `<NAME>ve`},
{ID: `<NAME>`},
{ID: `Glenmore Dr`},
{ID: `Glenn Dr`},
{ID: `Glory Ln`},
{ID: `Gold Creek Trl`},
{ID: `Gold Hill Dr`},
{ID: `Golden Eagle Dr`},
{ID: `Goode Dr`},
{ID: `<NAME> Rd`},
{ID: `Goodwin St`},
{ID: `Goodyear Ave`},
{ID: `<NAME>d`},
{ID: `Gordon Rd`},
{ID: `Gore Rd`},
{ID: `Gore Springs Rd`},
{ID: `Goss St`},
{ID: `Governors Ct`},
{ID: `Grace Park Dr`},
{ID: `Grace St`},
{ID: `Grand Main St`},
{ID: `Grandview Ct`},
{ID: `Grandview Dr`},
{ID: `Granger Dr`},
{ID: `Grant Dr`},
{ID: `Grapevine Way`},
{ID: `Grassdale Rd`},
{ID: `Gray Rd`},
{ID: `Gray St`},
{ID: `Graysburg Dr`},
{ID: `Graystone Dr`},
{ID: `Greatwood Dr`},
{ID: `Green Acre Ln`},
{ID: `Green Apple Ct`},
{ID: `Green Gable Pt`},
{ID: `Green Ives Ln`},
{ID: `Green Loop Rd`},
{ID: `Green Rd`},
{ID: `Green St`},
{ID: `Green Valley Trl`},
{ID: `Greenbriar Ave`},
{ID: `Greencliff Way`},
{ID: `Greenhouse Dr`},
{ID: `Greenmont Ct`},
{ID: `Greenridge Rd`},
{ID: `Greenridge Trl`},
{ID: `Greenway Ln`},
{ID: `Greenwood Dr`},
{ID: `Greyrock`},
{ID: `Greystone Ln`},
{ID: `Greystone Way`},
{ID: `Greywood Ln`},
{ID: `Griffin Mill Dr`},
{ID: `Griffin Rd`},
{ID: `Grimshaw Rd`},
{ID: `Grist Mill Ln`},
{ID: `<NAME>`},
{ID: `Grogan Rd`},
{ID: `Groovers Landing Rd`},
{ID: `Grove Cir`},
{ID: `Grove Park Cir`},
{ID: `Grove Pointe Way`},
{ID: `Grove Springs Ct`},
{ID: `Grove Way`},
{ID: `Grover Rd`},
{ID: `<NAME>`},
{ID: `Gum Dr`},
{ID: `Gum Springs Ln`},
{ID: `Gunston Hall`},
{ID: `Guyton Industrial Dr`},
{ID: `Guyton St`},
{ID: `<NAME>`},
{ID: `Haley Pl`},
{ID: `Hall St`},
{ID: `Hall Station Rd`},
{ID: `Hames Pte`},
{ID: `Hamil Ct`},
{ID: `Hamilton Blvd`},
{ID: `Hamilton Crossing Rd`},
{ID: `Hampton Dr`},
{ID: `Hampton Ln`},
{ID: `<NAME> Way`},
{ID: `Hannon Way`},
{ID: `Happy Hollow Rd`},
{ID: `Happy Valley Ln`},
{ID: `Harbor Dr`},
{ID: `Harbor Ln`},
{ID: `Hardin Bridge Rd`},
{ID: `Hardin Rd`},
{ID: `Hardwood Ct`},
{ID: `Hardwood Ridge Dr`},
{ID: `Hardwood Ridge Pkwy`},
{ID: `Hardy Rd`},
{ID: `<NAME>`},
{ID: `<NAME>d`},
{ID: `Harris St`},
{ID: `<NAME>d`},
{ID: `Harvest Way`},
{ID: `<NAME>d`},
{ID: `Hastings Dr`},
{ID: `<NAME>d`},
{ID: `<NAME>`},
{ID: `<NAME>d`},
{ID: `<NAME>d`},
{ID: `Hawks Branch Ln`},
{ID: `<NAME> Rd`},
{ID: `Hawkstone Ct`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Hazelwood Rd`},
{ID: `<NAME>`},
{ID: `Heartwood Dr`},
{ID: `Heatco Ct`},
{ID: `Hedgerow Ct`},
{ID: `Heidelberg Ln`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Henderson Rd`},
{ID: `Hendricks Rd`},
{ID: `Hendricks St`},
{ID: `<NAME> Rd`},
{ID: `Hepworth Ln`},
{ID: `Heritage Ave`},
{ID: `Heritage Cv`},
{ID: `Heritage Dr`},
{ID: `Heritage Way`},
{ID: `Herring St`},
{ID: `Hickory Forest Ln`},
{ID: `Hickory Hill Dr`},
{ID: `H<NAME>oll`},
{ID: `Hickory Ln`},
{ID: `Hidden Valley Ln`},
{ID: `High Ct`},
{ID: `High Moon St`},
{ID: `High Point Ct`},
{ID: `High Pointe Dr`},
{ID: `Highland Cir`},
{ID: `Highland Crest Dr`},
{ID: `Highland Dr`},
{ID: `Highland Ln`},
{ID: `Highland Trl`},
{ID: `Highland Way`},
{ID: `Highpine Dr`},
{ID: `Hill St`},
{ID: `Hillside Dr`},
{ID: `Hillstone Way`},
{ID: `Hilltop Ct`},
{ID: `Hilltop Dr`},
{ID: `History St`},
{ID: `Hitchcock Sta`},
{ID: `Hobgood Rd`},
{ID: `Hodges Mine Rd`},
{ID: `Holcomb Rd`},
{ID: `Holcomb Spur`},
{ID: `Holcomb Trl`},
{ID: `Holloway Rd`},
{ID: `Hollows Dr`},
{ID: `Holly Ann St`},
{ID: `Holly Dr`},
{ID: `Holly Springs Rd`},
{ID: `Hollyhock Ln`},
{ID: `Holt Rd`},
{ID: `Home Place Dr`},
{ID: `Home Place Rd`},
{ID: `Homestead Dr`},
{ID: `Hometown Ct`},
{ID: `Honey Vine Trl`},
{ID: `Honeylocust Ct`},
{ID: `Honeysuckle Dr`},
{ID: `Hopkins Breeze`},
{ID: `Hopkins Farm Dr`},
{ID: `Hopkins Rd`},
{ID: `Hopson Rd`},
{ID: `Horizon Trl`},
{ID: `Horseshoe Ct`},
{ID: `Horseshoe Loop`},
{ID: `Horseshow Rd`},
{ID: `Hotel St`},
{ID: `Howard Ave`},
{ID: `Howard Dr`},
{ID: `Howard Heights St`},
{ID: `Howard St`},
{ID: `Howell Bend Rd`},
{ID: `Howell Rd`},
{ID: `Howell St`},
{ID: `Hughs Pl`},
{ID: `Hunt Club Ln`},
{ID: `Huntcliff Dr`},
{ID: `Hunters Cv`},
{ID: `Hunters Rdg`},
{ID: `Hunters View`},
{ID: `Huntington Ct`},
{ID: `Hwy 293`},
{ID: `Hwy 411`},
{ID: `Hyatt Ct`},
{ID: `I-75`},
{ID: `Idlewood Dr`},
{ID: `Imperial Ct`},
{ID: `Independence Way`},
{ID: `Indian Hills Dr`},
{ID: `Indian Hills Hght`},
{ID: `Indian Mounds Rd`},
{ID: `Indian Ridge Ct`},
{ID: `Indian Springs Dr`},
{ID: `Indian Trl`},
{ID: `Indian Valley Way`},
{ID: `Indian Woods Dr`},
{ID: `Industrial Dr`},
{ID: `Industrial Park Rd`},
{ID: `Ingram Rd`},
{ID: `Iron Belt Ct`},
{ID: `Iron Belt Rd`},
{ID: `Iron Hill Cv`},
{ID: `Iron Hill Rd`},
{ID: `Iron Mountain Rd`},
{ID: `Irwin St`},
{ID: `Isabella Ct`},
{ID: `Island Ford Rd`},
{ID: `Island Mill Rd`},
{ID: `<NAME> Rd`},
{ID: `Ivanhoe Pl`},
{ID: `<NAME> Way`},
{ID: `Ivy Ln`},
{ID: `Ivy Stone Ct`},
{ID: `J R Rd`},
{ID: `Jackson Dr`},
{ID: `<NAME>`},
{ID: `Jackson Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Jacobs Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `James Rd`},
{ID: `<NAME>`},
{ID: `Jamesport Ln`},
{ID: `<NAME>`},
{ID: `Janice Ln`},
{ID: `<NAME>`},
{ID: `Jasmine Ln`},
{ID: `Jazmin Sq`},
{ID: `Jeffery Ln`},
{ID: `Jeffery Rd`},
{ID: `<NAME>`},
{ID: `Jennifer Ln`},
{ID: `Jenny Ln`},
{ID: `Jewell Rd`},
{ID: `Jill Ln`},
{ID: `<NAME>`},
{ID: `<NAME> Rd`},
{ID: `Jim Ln`},
{ID: `<NAME> Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME> Rd`},
{ID: `<NAME> Dr`},
{ID: `<NAME>`},
{ID: `<NAME> Rd`},
{ID: `<NAME>`},
{ID: `Johnson Dr`},
{ID: `Johnson Ln`},
{ID: `<NAME> Rd`},
{ID: `Johnson St`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Jones Ct`},
{ID: `<NAME> Pl`},
{ID: `<NAME> Rd`},
{ID: `Jones Rd`},
{ID: `<NAME> Rd`},
{ID: `Jones St`},
{ID: `<NAME>d`},
{ID: `<NAME>`},
{ID: `<NAME>d`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>n`},
{ID: `<NAME>d`},
{ID: `Kakki Ct`},
{ID: `<NAME>t`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Katrina Dr`},
{ID: `<NAME>d`},
{ID: `Kayla Ct`},
{ID: `<NAME> Rd`},
{ID: `<NAME> Rd`},
{ID: `Keith Rd`},
{ID: `<NAME>l`},
{ID: `<NAME> Ct`},
{ID: `<NAME>`},
{ID: `Kelly Dr`},
{ID: `Ken St`},
{ID: `Kent Dr`},
{ID: `Kentucky Ave`},
{ID: `Kentucky Walk`},
{ID: `Kenwood Ln`},
{ID: `Kerry St`},
{ID: `Kimberly Dr`},
{ID: `<NAME>`},
{ID: `Kincannon Rd`},
{ID: `King Rd`},
{ID: `King St`},
{ID: `Kings Camp Rd`},
{ID: `Kings Dr`},
{ID: `Kingston Hwy`},
{ID: `Kingston Pointe Dr`},
{ID: `Kiowa Ct`},
{ID: `Kirby Ct`},
{ID: `Kirby Dr`},
{ID: `Kirk Rd`},
{ID: `Kitchen Mountain Rd`},
{ID: `Kitchens All`},
{ID: `Knight Dr`},
{ID: `Knight St`},
{ID: `Knight Way`},
{ID: `Knollwood Way`},
{ID: `Knucklesville Rd`},
{ID: `Kooweskoowe Blvd`},
{ID: `Kortlyn Pl`},
{ID: `Kovells Dr`},
{ID: `Kristen Ct`},
{ID: `Kristen Ln`},
{ID: `Kuhlman St`},
{ID: `Lacey Rd`},
{ID: `Ladds Mountain Rd`},
{ID: `Lake Ct`},
{ID: `Lake Dr`},
{ID: `Lake Drive No 1`},
{ID: `Lake Eagle Ct`},
{ID: `Lake Haven Dr`},
{ID: `Lake Marguerite Rd`},
{ID: `Lake Overlook Dr`},
{ID: `Lake Point Dr`},
{ID: `Lake Top Dr`},
{ID: `Lakeport`},
{ID: `Lakeshore Cir`},
{ID: `Lakeside Trl`},
{ID: `Lakeside Way`},
{ID: `Lakeview Ct`},
{ID: `Lakeview Drive No 1`},
{ID: `Lakeview Drive No 2`},
{ID: `Lakeview Drive No 3`},
{ID: `Lakewood Ct`},
{ID: `Lamplighter Cv`},
{ID: `Lancelot Ct`},
{ID: `Lancer Ct`},
{ID: `Landers Dr`},
{ID: `Landers Rd`},
{ID: `Lanham Field Rd`},
{ID: `Lanham Rd`},
{ID: `Lanier Dr`},
{ID: `Lantern Cir`},
{ID: `Lantern Light Trl`},
{ID: `<NAME>ir`},
{ID: `Larkspur Ln`},
{ID: `Larkspur Rd`},
{ID: `Larkwood Cir`},
{ID: `Larsen Rdg`},
{ID: `Latimer Ln`},
{ID: `Latimer Rd`},
{ID: `Laura Dr`},
{ID: `Laurel Cv`},
{ID: `Laurel Dr`},
{ID: `Laurel Trc`},
{ID: `Laurel Way`},
{ID: `Laurelwood Ln`},
{ID: `Lauren Ln`},
{ID: `Lavanes Way`},
{ID: `Law Rd`},
{ID: `Lawrence St`},
{ID: `Lazy Water Dr`},
{ID: `Lead Mountain Rd`},
{ID: `Leake St`},
{ID: `Ledford Ln`},
{ID: `Lee Ln`},
{ID: `Lee Rd`},
{ID: `Lee St`},
{ID: `Legacy Way`},
{ID: `Legion St`},
{ID: `Leila Cv`},
{ID: `Lennox Park Ave`},
{ID: `Lenox Dr`},
{ID: `Leonard Dr`},
{ID: `Leslie Cv`},
{ID: `Lewis Dr`},
{ID: `Lewis Farm Rd`},
{ID: `Lewis Rd`},
{ID: `Lewis Way`},
{ID: `Lexington Ct`},
{ID: `Lexy Way`},
{ID: `Liberty Crossing Dr`},
{ID: `Liberty Dr`},
{ID: `Liberty Square Dr`},
{ID: `<NAME>`},
{ID: `Limerick Ct`},
{ID: `Linda Rd`},
{ID: `Lindsey Dr`},
{ID: `Lingerfelt Ln`},
{ID: `Linwood Rd`},
{ID: `<NAME>`},
{ID: `Litchfield St`},
{ID: `Little Gate Way`},
{ID: `<NAME> Ln`},
{ID: `<NAME> Trl`},
{ID: `Little St`},
{ID: `Little Valley Rd`},
{ID: `Littlefield Rd`},
{ID: `Live Oak Run`},
{ID: `Livsey Rd`},
{ID: `Lodge Rd`},
{ID: `Lois Ln`},
{ID: `Lois Rd`},
{ID: `London Ct`},
{ID: `Londonderry Way`},
{ID: `Long Branch Ct`},
{ID: `Long Rd`},
{ID: `Long Trl`},
{ID: `Longview Pte`},
{ID: `Lovell St`},
{ID: `Low Ct`},
{ID: `Lowery Rd`},
{ID: `Lowry Way`},
{ID: `Lucas Ln`},
{ID: `Lucas Rd`},
{ID: `Lucille Rd`},
{ID: `Luckie St`},
{ID: `Luke Ln`},
{ID: `Lumpkin Dr`},
{ID: `<NAME>`},
{ID: `<NAME> Rd`},
{ID: `Luwanda Trl`},
{ID: `Lynch St`},
{ID: `<NAME> Rd`},
{ID: `<NAME> Rd`},
{ID: `Macedonia Rd`},
{ID: `Macra Dr`},
{ID: `Madden Rd`},
{ID: `Madden St`},
{ID: `Maddox Rd`},
{ID: `Madison Cir`},
{ID: `Madison Ct`},
{ID: `Madison Ln`},
{ID: `Madison Pl`},
{ID: `Madison Way`},
{ID: `Magnolia Ct`},
{ID: `Magnolia Dr`},
{ID: `Magnolia Farm Rd`},
{ID: `Mahan Ln`},
{ID: `Mahan Rd`},
{ID: `Main Lake Dr`},
{ID: `Main St`},
{ID: `Mallet Pte`},
{ID: `Mallory Ct`},
{ID: `Mallory Dr`},
{ID: `Manning Mill Rd`},
{ID: `Manning Mill Way`},
{ID: `Manning Rd`},
{ID: `Manor House Ln`},
{ID: `Manor Way`},
{ID: `Mansfield Rd`},
{ID: `Maple Ave`},
{ID: `Maple Dr`},
{ID: `Maple Grove Dr`},
{ID: `Maple Ln`},
{ID: `Maple Ridge Dr`},
{ID: `Maple St`},
{ID: `Maplewood Pl`},
{ID: `Maplewood Trl`},
{ID: `Marguerite Dr`},
{ID: `<NAME>d`},
{ID: `Mariner Way`},
{ID: `Mark Trl`},
{ID: `Market Place Blvd`},
{ID: `Marlin Ln`},
{ID: `Marr Rd`},
{ID: `<NAME>`},
{ID: `Martha Ct`},
{ID: `Marthas Pl`},
{ID: `Marthas Walk`},
{ID: `<NAME>`},
{ID: `Martin Loop`},
{ID: `Martin Luther King Jr Cir`},
{ID: `<NAME> Jr Dr`},
{ID: `<NAME>d`},
{ID: `<NAME> Ln`},
{ID: `Mary Ln`},
{ID: `Mary St`},
{ID: `Massell Dr`},
{ID: `Massingale Rd`},
{ID: `Mathews Rd`},
{ID: `<NAME> Rd`},
{ID: `<NAME>`},
{ID: `Maxwell Rd`},
{ID: `May St`},
{ID: `Maybelle St`},
{ID: `Mayfield Rd`},
{ID: `Mayflower Cir`},
{ID: `Mayflower St`},
{ID: `Mayflower Way`},
{ID: `Mays Rd`},
{ID: `McCanless St`},
{ID: `McClure Dr`},
{ID: `McCormick Rd`},
{ID: `McCoy Rd`},
{ID: `McElreath St`},
{ID: `McEver St`},
{ID: `McKaskey Creek Rd`},
{ID: `McKay Dr`},
{ID: `McKelvey Ct`},
{ID: `McKenna Rd`},
{ID: `<NAME>ir`},
{ID: `McKenzie St`},
{ID: `McKinley Ct`},
{ID: `McKinney Campground Rd`},
{ID: `McMillan Rd`},
{ID: `McStotts Rd`},
{ID: `McTier Cir`},
{ID: `Meadow Ln`},
{ID: `Meadowbridge Dr`},
{ID: `Meadowview Cir`},
{ID: `Meadowview Rd`},
{ID: `Medical Dr`},
{ID: `Melhana Dr`},
{ID: `Melone Dr`},
{ID: `Mercer Dr`},
{ID: `Mercer Ln`},
{ID: `Merchants Square Dr`},
{ID: `Michael Ln`},
{ID: `<NAME>`},
{ID: `Middle Ct`},
{ID: `Middlebrook Dr`},
{ID: `Middleton Ct`},
{ID: `Milam Bridge Rd`},
{ID: `Milam Cir`},
{ID: `Milam St`},
{ID: `Miles Dr`},
{ID: `Mill Creek Rd`},
{ID: `Mill Rock Dr`},
{ID: `Mill View Ct`},
{ID: `Miller Farm Rd`},
{ID: `Millers Way`},
{ID: `Millstone Pt`},
{ID: `Millstream Ct`},
{ID: `Milner Rd`},
{ID: `Milner St`},
{ID: `Miltons Walk`},
{ID: `Mimosa Ln`},
{ID: `Mimosa Ter`},
{ID: `Mineral Museum Dr`},
{ID: `Miners Pt`},
{ID: `Mint Rd`},
{ID: `Mirror Lake Dr`},
{ID: `Mission Hills Dr`},
{ID: `Mission Mountain Rd`},
{ID: `Mission Rd`},
{ID: `Mission Ridge Dr`},
{ID: `Misty Hollow Ct`},
{ID: `Misty Ridge Dr`},
{ID: `Misty Valley Dr`},
{ID: `Mitchell Ave`},
{ID: `Mitchell Rd`},
{ID: `Mockingbird Dr`},
{ID: `Mohawk Dr`},
{ID: `<NAME>`},
{ID: `Montclair Ct`},
{ID: `Montgomery St`},
{ID: `Montview Cir`},
{ID: `Moody St`},
{ID: `Moonlight Dr`},
{ID: `Moore Rd`},
{ID: `Moore St`},
{ID: `Moores Spring Rd`},
{ID: `Morgan Ave`},
{ID: `Morgan Dr`},
{ID: `Moriah Way`},
{ID: `Morris Dr`},
{ID: `Morris Rd`},
{ID: `Mosley Dr`},
{ID: `Moss Landing Rd`},
{ID: `Moss Ln`},
{ID: `Moss Way`},
{ID: `Mossy Rock Ln`},
{ID: `Mostellers Mill Rd`},
{ID: `Motorsports Dr`},
{ID: `Mount Olive St`},
{ID: `Mount Pleasant Rd`},
{ID: `Mountain Breeze Rd`},
{ID: `Mountain Chase Dr`},
{ID: `Mountain Creek Trl`},
{ID: `Mountain Ridge Dr`},
{ID: `Mountain Ridge Rd`},
{ID: `Mountain Trail Ct`},
{ID: `Mountain View Ct`},
{ID: `Mountain View Dr`},
{ID: `Mountain View Rd`},
{ID: `Mountainbrook Dr`},
{ID: `Muirfield Walk`},
{ID: `Mulberry Ln`},
{ID: `Mulberry Way`},
{ID: `Mulinix Rd`},
{ID: `Mull St`},
{ID: `Mullinax Rd`},
{ID: `Mundy Rd`},
{ID: `Mundy St`},
{ID: `Murphy Ln`},
{ID: `Murray Ave`},
{ID: `N Bartow St`},
{ID: `N Cass St`},
{ID: `N Central Ave`},
{ID: `N Dixie Ave`},
{ID: `N Erwin St`},
{ID: `N Franklin St`},
{ID: `N Gilmer St`},
{ID: `N Main St`},
{ID: `N Morningside Dr`},
{ID: `N Museum Dr`},
{ID: `N Public Sq`},
{ID: `N Railroad St`},
{ID: `N Tennessee St`},
{ID: `N Wall St`},
{ID: `<NAME>d`},
{ID: `Natalie Dr`},
{ID: `Natchi Trl`},
{ID: `Navajo Ln`},
{ID: `Navajo Trl`},
{ID: `Navigation Pte`},
{ID: `Needle Point Rdg`},
{ID: `Neel St`},
{ID: `Nelson St`},
{ID: `New Hope Church Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Noble St`},
{ID: `Noland St`},
{ID: `Norland Ct`},
{ID: `North Ave`},
{ID: `North Dr`},
{ID: `North Hampton Dr`},
{ID: `North Oaks Cir`},
{ID: `North Point Dr`},
{ID: `North Ridge Cir`},
{ID: `North Ridge Ct`},
{ID: `North Ridge Dr`},
{ID: `North Ridge Pt`},
{ID: `North Valley Rd`},
{ID: `North Village Cir`},
{ID: `North Wesley Rdg`},
{ID: `North Woods Dr`},
{ID: `Northpoint Pkwy`},
{ID: `Northside Pkwy`},
{ID: `Norton Rd`},
{ID: `Nottingham Dr`},
{ID: `Nottingham Way`},
{ID: `November Ln`},
{ID: `Oak Beach Dr`},
{ID: `Oak Ct`},
{ID: `Oak Dr`},
{ID: `Oak Farm Dr`},
{ID: `Oak Grove Ct`},
{ID: `Oak Grove Ln`},
{ID: `Oak Grove Rd`},
{ID: `Oak Hill Cir`},
{ID: `Oak Hill Dr`},
{ID: `Oak Hill Ln`},
{ID: `Oak Hill Way`},
{ID: `Oak Hollow Rd`},
{ID: `Oak Leaf Dr`},
{ID: `Oak Ln`},
{ID: `Oak St`},
{ID: `Oak Street No 1`},
{ID: `Oak Street No 2`},
{ID: `Oak Way`},
{ID: `Oakbrook Dr`},
{ID: `Oakdale Dr`},
{ID: `Oakland St`},
{ID: `Oakridge Dr`},
{ID: `Oakside Ct`},
{ID: `Oakside Trl`},
{ID: `Oakwood Way`},
{ID: `Ohio Ave`},
{ID: `Ohio St`},
{ID: `Old 140 Hwy`},
{ID: `Old 41 Hwy`},
{ID: `Old Alabama Rd`},
{ID: `Old Alabama Spur`},
{ID: `Old Allatoona Rd`},
{ID: `Old Barn Way`},
{ID: `Old Bells Ferry Rd`},
{ID: `Old C C C Rd`},
{ID: `Old Canton Rd`},
{ID: `Old Cassville White Rd`},
{ID: `Old Cline Smith Rd`},
{ID: `Old Dallas Hwy`},
{ID: `Old Dallas Rd`},
{ID: `Old Dixie Hwy`},
{ID: `Old Farm Rd`},
{ID: `Old Field Rd`},
{ID: `Old Furnace Rd`},
{ID: `Old Gilliam Springs Rd`},
{ID: `Old Goodie Mountain Rd`},
{ID: `Old Grassdale Rd`},
{ID: `Old Hall Station Rd`},
{ID: `Old Hardin Bridge Rd`},
{ID: `Old Hemlock Cv`},
{ID: `Old Home Place Rd`},
{ID: `Old Jones Mill Rd`},
{ID: `Old Macedonia Campground Rd`},
{ID: `Old Martin Rd`},
{ID: `Old McKaskey Creek Rd`},
{ID: `Old Mill Farm Rd`},
{ID: `Old Mill Rd`},
{ID: `Old Old Alabama Rd`},
{ID: `Old Post Rd`},
{ID: `Old River Rd`},
{ID: `Old Rome Rd`},
{ID: `Old Roving Rd`},
{ID: `Old Rudy York Rd`},
{ID: `Old Sandtown Rd`},
{ID: `Old Spring Place Rd`},
{ID: `Old Stilesboro Rd`},
{ID: `Old Tennessee Hwy`},
{ID: `Old Tennessee Rd`},
{ID: `Old Wade Rd`},
{ID: `Olive Vine Church Rd`},
{ID: `Opal St`},
{ID: `Orchard Rd`},
{ID: `Ore Mine Rd`},
{ID: `Oriole Dr`},
{ID: `Otting Dr`},
{ID: `Overlook Cir`},
{ID: `Overlook Way`},
{ID: `Owensby Ln`},
{ID: `Oxford Ct`},
{ID: `Oxford Dr`},
{ID: `Oxford Ln`},
{ID: `Oxford Mill Way`},
{ID: `P M B Young Rd`},
{ID: `Paddock Way`},
{ID: `Padgett Rd`},
{ID: `Paga Mine Rd`},
{ID: `Paige Dr`},
{ID: `Paige St`},
{ID: `Palmer Rd`},
{ID: `<NAME>`},
{ID: `Park Ct`},
{ID: `<NAME> Rd`},
{ID: `Park Place Dr`},
{ID: `Park St`},
{ID: `<NAME>`},
{ID: `<NAME> Rd`},
{ID: `Parkside View`},
{ID: `Parkview Dr`},
{ID: `Parmenter St`},
{ID: `<NAME> Rd`},
{ID: `Pasley Rd`},
{ID: `Pathfinder St`},
{ID: `Patricia Dr`},
{ID: `Patterson Dr`},
{ID: `Patterson Ln`},
{ID: `<NAME>n`},
{ID: `Patton St`},
{ID: `Pawnee Trl`},
{ID: `Peace Tree Ln`},
{ID: `<NAME>`},
{ID: `Peachtree St`},
{ID: `Pearl Ln`},
{ID: `Pearl St`},
{ID: `Pearson Rd`},
{ID: `Pearson St`},
{ID: `<NAME> Ct`},
{ID: `<NAME> Ct`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Peeples Valley Rd`},
{ID: `Pembroke Ln`},
{ID: `Pendley Trl`},
{ID: `Penelope Ln`},
{ID: `Penfield Dr`},
{ID: `Penny Ct`},
{ID: `Penny Ln`},
{ID: `Peppermill Dr`},
{ID: `Percheron Trl`},
{ID: `Perkins Dr`},
{ID: `Perkins Mountain Rd`},
{ID: `Perry Rd`},
{ID: `Pettit Cir`},
{ID: `Pettit Rd`},
{ID: `Phillips Dr`},
{ID: `Phoenix Air Dr`},
{ID: `Pickers Row`},
{ID: `Picklesimer Rd`},
{ID: `<NAME>`},
{ID: `Piedmont Ave`},
{ID: `Piedmont Ln`},
{ID: `Pilgrim St`},
{ID: `Pine Bow Rd`},
{ID: `Pine Cir`},
{ID: `Pine Dr`},
{ID: `Pine Forrest Rd`},
{ID: `Pine Grove Church Rd`},
{ID: `Pine Grove Cir`},
{ID: `Pine Grove Rd`},
{ID: `Pine Log Rd`},
{ID: `Pine Loop`},
{ID: `Pine Needle Trl`},
{ID: `Pine Oak Ct`},
{ID: `Pine Ridge Ct`},
{ID: `Pine Ridge Dr`},
{ID: `Pine Ridge Ln`},
{ID: `Pine Ridge Rd`},
{ID: `Pine St`},
{ID: `Pine Street No 1`},
{ID: `Pine Street No 2`},
{ID: `Pine Valley Cir`},
{ID: `Pine Valley Dr`},
{ID: `Pine Vista Cir`},
{ID: `Pine Water Ct`},
{ID: `Pine Wood Rd`},
{ID: `Pinecrest Dr`},
{ID: `Pinehill Dr`},
{ID: `Pinery Dr`},
{ID: `Piney Woods Rd`},
{ID: `Pinson Dr`},
{ID: `Pioneer Trl`},
{ID: `Pittman St`},
{ID: `Piute Pl`},
{ID: `Plainview Dr`},
{ID: `Plantation Rd`},
{ID: `Plantation Ridge Dr`},
{ID: `Planters Dr`},
{ID: `Pleasant Grove Church Rd`},
{ID: `Pleasant Ln`},
{ID: `Pleasant Run Dr`},
{ID: `Pleasant Valley Rd`},
{ID: `Plymouth Ct`},
{ID: `Plymouth Dr`},
{ID: `Point Dr`},
{ID: `Point Place Dr`},
{ID: `Pointe North Dr`},
{ID: `Pointe Way`},
{ID: `Polo Flds`},
{ID: `Pompano Ln`},
{ID: `Ponders Rd`},
{ID: `Popham Rd`},
{ID: `Poplar Springs Rd`},
{ID: `Poplar St`},
{ID: `Popular Dr`},
{ID: `Post Office Cir`},
{ID: `Postelle St`},
{ID: `Powell Rd`},
{ID: `Powers Ct`},
{ID: `Powersports Cir`},
{ID: `Prather St`},
{ID: `Pratt Rd`},
{ID: `Prayer Trl`},
{ID: `Prestwick Loop`},
{ID: `Princeton Ave`},
{ID: `Princeton Blvd`},
{ID: `Princeton Glen Ct`},
{ID: `Princeton Pl`},
{ID: `Princeton Place Dr`},
{ID: `Princeton Walk`},
{ID: `Priory Club Dr`},
{ID: `Public Sq`},
{ID: `Puckett Rd`},
{ID: `Puckett St`},
{ID: `Pumpkinvine Trl`},
{ID: `Puritan St`},
{ID: `Pyron Ct`},
{ID: `Quail Ct`},
{ID: `Quail Hollow Dr`},
{ID: `Quail Ridge Dr`},
{ID: `Quail Ridge Rd`},
{ID: `Quail Run`},
{ID: `Quality Dr`},
{ID: `R E Fields Rd`},
{ID: `Rail Dr`},
{ID: `Rail Ovlk`},
{ID: `Railroad Ave`},
{ID: `Railroad Pass`},
{ID: `Railroad St`},
{ID: `Raindrop Ln`},
{ID: `Randolph Rd`},
{ID: `<NAME>`},
{ID: `Ranell Pl`},
{ID: `Ranger Rd`},
{ID: `Rattler Rd`},
{ID: `Ravenfield Rd`},
{ID: `<NAME> Rd`},
{ID: `Recess Rd`},
{ID: `Red Apple Ter`},
{ID: `Red Barn Rd`},
{ID: `Red Bug Pt`},
{ID: `Red Fox Trl`},
{ID: `Red Oak Dr`},
{ID: `Red Tip Dr`},
{ID: `Red Top Beach Rd`},
{ID: `Red Top Cir`},
{ID: `Red Top Dr`},
{ID: `Red Top Mountain Rd`},
{ID: `Redcomb Dr`},
{ID: `Redd Rd`},
{ID: `Redding Rd`},
{ID: `Redfield Ct`},
{ID: `Rediger Ct`},
{ID: `Redwood Dr`},
{ID: `Reject Rd`},
{ID: `Remington Ct`},
{ID: `Remington Dr`},
{ID: `Remington Ln`},
{ID: `Retreat Rdg`},
{ID: `Rex Ln`},
{ID: `Reynolds Bend Rd`},
{ID: `Reynolds Bridge Rd`},
{ID: `Reynolds Ln`},
{ID: `Rhonda Ln`},
{ID: `Rice Dr`},
{ID: `<NAME>d`},
{ID: `Richland Dr`},
{ID: `Riddle Mill Rd`},
{ID: `Ridge Cross Rd`},
{ID: `Ridge Rd`},
{ID: `Ridge Row Dr`},
{ID: `Ridge View Dr`},
{ID: `Ridge Way`},
{ID: `Ridgedale Rd`},
{ID: `Ridgeline Way`},
{ID: `Ridgemont Way`},
{ID: `Ridgeview Ct`},
{ID: `Ridgeview Dr`},
{ID: `Ridgeview Trl`},
{ID: `Ridgewater Dr`},
{ID: `Ridgeway Ct`},
{ID: `Ridgewood Dr`},
{ID: `Ringers Rd`},
{ID: `Rip Rd`},
{ID: `Ripley Ave`},
{ID: `River Birch Cir`},
{ID: `River Birch Ct`},
{ID: `River Birch Dr`},
{ID: `River Birch Rd`},
{ID: `River Ct`},
{ID: `River Dr`},
{ID: `River Oaks Ct`},
{ID: `River Oaks Dr`},
{ID: `River Shoals Dr`},
{ID: `River Walk Pkwy`},
{ID: `Riverbend Rd`},
{ID: `Rivercreek Xing`},
{ID: `Riverside Ct`},
{ID: `Riverside Dr`},
{ID: `Riverview Ct`},
{ID: `Riverview Trl`},
{ID: `Riverwood Cv`},
{ID: `Roach Dr`},
{ID: `Road No 1 South`},
{ID: `Road No 2 South`},
{ID: `Road No 3 South`},
{ID: `Roberson Dr`},
{ID: `Roberson Rd`},
{ID: `Robert St`},
{ID: `Roberts Dr`},
{ID: `<NAME>`},
{ID: `Robin Dr`},
{ID: `<NAME> Dr`},
{ID: `<NAME>`},
{ID: `Rock Fence Cir`},
{ID: `Rock Fence Rd`},
{ID: `Rock Fence Road No 2`},
{ID: `Rock Ridge Ct`},
{ID: `Rock Ridge Rd`},
{ID: `Rockaway Ct`},
{ID: `Rockcrest Cir`},
{ID: `Rockpoint`},
{ID: `Rockridge Dr`},
{ID: `Rocky Ave`},
{ID: `Rocky Cir`},
{ID: `Rocky Mountain Pass`},
{ID: `Rocky Rd`},
{ID: `Rocky St`},
{ID: `Rogers Cut Off Rd`},
{ID: `Rogers Rd`},
{ID: `Rogers St`},
{ID: `Rolling Hills Dr`},
{ID: `Ron St`},
{ID: `Ronson St`},
{ID: `Roosevelt St`},
{ID: `<NAME>`},
{ID: `Rose Trl`},
{ID: `Rose Way`},
{ID: `Rosebury Ct`},
{ID: `Rosen St`},
{ID: `Rosewood Ln`},
{ID: `Ross Rd`},
{ID: `Roth Ln`},
{ID: `Roundtable Ct`},
{ID: `Roving Hills Cir`},
{ID: `Roving Rd`},
{ID: `Rowland Springs Rd`},
{ID: `Roxburgh Trl`},
{ID: `Roxy Pl`},
{ID: `Royal Lake Ct`},
{ID: `Royal Lake Cv`},
{ID: `Royal Lake Dr`},
{ID: `Royco Dr`},
{ID: `Rubie Ln`},
{ID: `<NAME> Ln`},
{ID: `Ruby St`},
{ID: `<NAME> Rd`},
{ID: `Ruff Dr`},
{ID: `Running Deer Trl`},
{ID: `Running Terrace Way`},
{ID: `Russell Dr`},
{ID: `<NAME>`},
{ID: `Russler Way`},
{ID: `<NAME>`},
{ID: `Ryan Rd`},
{ID: `Ryles Rd`},
{ID: `S Bartow St`},
{ID: `S Cass St`},
{ID: `S Central Ave`},
{ID: `S Dixie Ave`},
{ID: `S Erwin St`},
{ID: `S Franklin St`},
{ID: `S Gilmer St`},
{ID: `S Main St`},
{ID: `S Morningside Dr`},
{ID: `S Museum Dr`},
{ID: `S Public Sq`},
{ID: `S Railroad St`},
{ID: `S Tennessee St`},
{ID: `S Wall St`},
{ID: `Saddle Club Dr`},
{ID: `Saddle Field Cir`},
{ID: `Saddle Ln`},
{ID: `Saddle Ridge Dr`},
{ID: `Saddlebrook Dr`},
{ID: `Saddleman Ct`},
{ID: `Sage Way`},
{ID: `Saggus Rd`},
{ID: `Sailors Cv`},
{ID: `Saint Andrews Dr`},
{ID: `<NAME> Cir`},
{ID: `Saint Francis Pl`},
{ID: `Saint Ives Way`},
{ID: `Salacoa Creek Rd`},
{ID: `Salacoa Rd`},
{ID: `<NAME> Rd`},
{ID: `<NAME>`},
{ID: `Sandcliffe Ln`},
{ID: `Sandtown Rd`},
{ID: `Saratoga Dr`},
{ID: `Sassafras Trl`},
{ID: `Sassy Ln`},
{ID: `Satcher Rd`},
{ID: `Scale House Dr`},
{ID: `Scarlett Oak Dr`},
{ID: `Scenic Mountain Dr`},
{ID: `School St`},
{ID: `Scott Dr`},
{ID: `Screaming Eagle Ct`},
{ID: `Sea Horse Cir`},
{ID: `Secretariat Ct`},
{ID: `Secretariat Rd`},
{ID: `Seminole Rd`},
{ID: `Seminole Trl`},
{ID: `Seneca Ln`},
{ID: `Sentry Dr`},
{ID: `Sequoia Pl`},
{ID: `Sequoyah Cir`},
{ID: `Sequoyah Trl`},
{ID: `Serena St`},
{ID: `Service Road No 3`},
{ID: `Setters Pte`},
{ID: `Settlers Cv`},
{ID: `Sewell Rd`},
{ID: `Shadow Ln`},
{ID: `Shady Oak Ln`},
{ID: `Shady Valley Dr`},
{ID: `Shagbark Dr`},
{ID: `Shake Rag Cir`},
{ID: `Shake Rag Rd`},
{ID: `Shaker Ct`},
{ID: `Shallowood Pl`},
{ID: `Sharp Way`},
{ID: `Shaw Blvd`},
{ID: `Shaw St`},
{ID: `Sheffield Pl`},
{ID: `Sheila Ln`},
{ID: `Sheila Rdg`},
{ID: `Shenandoah Pkwy`},
{ID: `Sherman Ln`},
{ID: `Sherwood Dr`},
{ID: `Sherwood Ln`},
{ID: `Sherwood Way`},
{ID: `Shiloh Church Rd`},
{ID: `<NAME> Rd`},
{ID: `Shinall Rd`},
{ID: `Shirley Ln`},
{ID: `Shotgun Rd`},
{ID: `Shropshire Ln`},
{ID: `Signal Mountain Cir`},
{ID: `Signal Mountain Dr`},
{ID: `<NAME>l`},
{ID: `Simmons Dr`},
{ID: `<NAME>`},
{ID: `Simpson Rd`},
{ID: `Simpson Trl`},
{ID: `<NAME>`},
{ID: `Siniard Dr`},
{ID: `Siniard Rd`},
{ID: `Sioux Rd`},
{ID: `Skinner St`},
{ID: `Skyline Dr`},
{ID: `Skyview Dr`},
{ID: `Skyview Pte`},
{ID: `Slopes Dr`},
{ID: `<NAME> Rd`},
{ID: `<NAME>`},
{ID: `Smith Dr`},
{ID: `Smith Rd`},
{ID: `Smyrna St`},
{ID: `Snapper Ln`},
{ID: `Snow Springs Church Rd`},
{ID: `Snow Springs Rd`},
{ID: `Snug Harbor Dr`},
{ID: `Soaring Heights Dr`},
{ID: `Soho Dr`},
{ID: `Somerset Club Dr`},
{ID: `Somerset Ln`},
{ID: `Sonya Pl`},
{ID: `South Ave`},
{ID: `South Bridge Dr`},
{ID: `South Dr`},
{ID: `South Oaks Dr`},
{ID: `South Valley Rd`},
{ID: `Southern Rd`},
{ID: `Southridge Trl`},
{ID: `Southview Dr`},
{ID: `Southwell Ave`},
{ID: `Southwood Dr`},
{ID: `Sparks Rd`},
{ID: `Sparks St`},
{ID: `Sparky Trl`},
{ID: `Sparrow Ct`},
{ID: `Spigs St`},
{ID: `Split Oak Dr`},
{ID: `Split Rail Ct`},
{ID: `Spring Creek Cir`},
{ID: `Spring Folly`},
{ID: `Spring Lake Trl`},
{ID: `Spring Meadows Ln`},
{ID: `Spring Place Rd`},
{ID: `Spring St`},
{ID: `Springhouse Ct`},
{ID: `Springmont Dr`},
{ID: `Springwell Ln`},
{ID: `Spruce Ln`},
{ID: `Spruce St`},
{ID: `Squires Ct`},
{ID: `SR 113`},
{ID: `SR 140`},
{ID: `SR 20`},
{ID: `SR 294`},
{ID: `SR 61`},
{ID: `Stamp Creek Rd`},
{ID: `Stampede Pass`},
{ID: `Standard Ct`},
{ID: `Star Dust Trl`},
{ID: `Starlight Dr`},
{ID: `Starnes Rd`},
{ID: `Starting Gate Dr`},
{ID: `Stately Oaks Dr`},
{ID: `Station Ct`},
{ID: `Station Rail Dr`},
{ID: `Station Way`},
{ID: `Staton Pl`},
{ID: `Steeplechase Ln`},
{ID: `Stephen Way`},
{ID: `Stephens Rd`},
{ID: `Stephens St`},
{ID: `Sterling Ct`},
{ID: `Stewart Dr`},
{ID: `Stewart Ln`},
{ID: `Stiles Ct`},
{ID: `Stiles Fairway`},
{ID: `Stiles Rd`},
{ID: `Stillmont Way`},
{ID: `Stillwater Ct`},
{ID: `Stoker Rd`},
{ID: `Stokley St`},
{ID: `Stone Gate Dr`},
{ID: `Stone Mill Dr`},
{ID: `Stonebridge Ct`},
{ID: `Stonebrook Dr`},
{ID: `Stonecreek Dr`},
{ID: `Stonehaven Cir`},
{ID: `Stonehenge Ct`},
{ID: `Stoner Rd`},
{ID: `Stoneridge Pl`},
{ID: `Stoners Chapel Rd`},
{ID: `Stonewall Ln`},
{ID: `Stonewall St`},
{ID: `Stoneybrook Ct`},
{ID: `Stratford Ln`},
{ID: `Stratford Way`},
{ID: `Striplin Cv`},
{ID: `Sue U Path`},
{ID: `Sugar Hill Rd`},
{ID: `Sugar Mill Dr`},
{ID: `Sugar Valley Rd`},
{ID: `Sugarberry Pl`},
{ID: `Sukkau Dr`},
{ID: `Sullins Rd`},
{ID: `Summer Dr`},
{ID: `Summer Pl`},
{ID: `Summer St`},
{ID: `Summerset Ct`},
{ID: `Summit Ridge Cir`},
{ID: `Summit Ridge Dr`},
{ID: `Summit St`},
{ID: `Sumner Ln`},
{ID: `Sunrise Dr`},
{ID: `Sunset Cir`},
{ID: `Sunset Dr`},
{ID: `Sunset Rd`},
{ID: `Sunset Ter`},
{ID: `Surrey Ln`},
{ID: `Sutton Rd`},
{ID: `Sutton Trl`},
{ID: `Swafford Rd`},
{ID: `Swallow Dr`},
{ID: `Swan Cir`},
{ID: `Sweet Eloise Ln`},
{ID: `Sweet Gracie Holl`},
{ID: `Sweet Gum Ln`},
{ID: `Sweet Water Ct`},
{ID: `Sweetbriar Cir`},
{ID: `Swisher Dr`},
{ID: `Syble Cv`},
{ID: `Tabernacle St`},
{ID: `Taff Rd`},
{ID: `Talisman Dr`},
{ID: `<NAME> Ln`},
{ID: `Tanager Ln`},
{ID: `Tanchez Dr`},
{ID: `Tanglewood Dr`},
{ID: `Tank Hill St`},
{ID: `Tant Rd`},
{ID: `<NAME> Rd`},
{ID: `Tanyard Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>l`},
{ID: `<NAME> Rd`},
{ID: `Taylor Dr`},
{ID: `Taylor Ln`},
{ID: `Taylorsville Macedonia Rd`},
{ID: `Taylorsville Rd`},
{ID: `<NAME>d`},
{ID: `Teal Ct`},
{ID: `Tellus Dr`},
{ID: `Tennessee Ave`},
{ID: `Terrell Dr`},
{ID: `Terry Ln`},
{ID: `Thatch Ct`},
{ID: `Theater Ave`},
{ID: `Third Army Rd`},
{ID: `Thistle Stop`},
{ID: `Thomas Ct`},
{ID: `Thompson St`},
{ID: `Thornwood Dr`},
{ID: `Thoroughbred Ln`},
{ID: `Thrasher Ct`},
{ID: `Thrasher Rd`},
{ID: `Thunderhawk Ln`},
{ID: `Tidwell Rd`},
{ID: `Tillberry Ct`},
{ID: `Tillton Trl`},
{ID: `<NAME> Dr`},
{ID: `Timber Trl`},
{ID: `Timberlake Cv`},
{ID: `Timberlake Pte`},
{ID: `<NAME>ir`},
{ID: `Timberland Ct`},
{ID: `Timberwalk Ct`},
{ID: `<NAME>`},
{ID: `Timberwood Rd`},
{ID: `Tinsley Dr`},
{ID: `Todd Rd`},
{ID: `<NAME> Rd`},
{ID: `Tomahawk Dr`},
{ID: `Top Ridge Ct`},
{ID: `Topridge Dr`},
{ID: `Tori Ln`},
{ID: `Towe Chapel Rd`},
{ID: `Tower Dr`},
{ID: `Tower Ridge Rd`},
{ID: `Tower St`},
{ID: `Town And Country Dr`},
{ID: `Townsend Dr`},
{ID: `Townsend Teague Rd`},
{ID: `Townsley Dr`},
{ID: `Tracy Ln`},
{ID: `Tramore Ct`},
{ID: `Trappers Cv`},
{ID: `Travelers Path`},
{ID: `Treemont Dr`},
{ID: `Triangle Ln`},
{ID: `Trimble Hollow Rd`},
{ID: `Trotters Walk`},
{ID: `Tuba Dr`},
{ID: `Tumlin St`},
{ID: `Tupelo Dr`},
{ID: `Turnberry Ct`},
{ID: `Turner Dr`},
{ID: `Turner St`},
{ID: `Turtle Rock Ct`},
{ID: `Twelve Oaks Dr`},
{ID: `Twin Branches Ln`},
{ID: `Twin Bridges Rd`},
{ID: `Twin Oaks Ln`},
{ID: `Twin Pines Rd`},
{ID: `Twinleaf Ct`},
{ID: `Two Gun Bailey Rd`},
{ID: `Two Run Creek Rd`},
{ID: `Two Run Creek Trl`},
{ID: `Two Run Trc`},
{ID: `Two Run Xing`},
{ID: `Unbridled Rd`},
{ID: `Val Hollow Ridge Rd`},
{ID: `Valley Creek Dr`},
{ID: `Valley Dale Dr`},
{ID: `Valley Dr`},
{ID: `Valley Trl`},
{ID: `Valley View Ct`},
{ID: `Valley View Dr`},
{ID: `Valley View Farm Rd`},
{ID: `Vaughan Ct`},
{ID: `Vaughan Dr`},
{ID: `<NAME>d`},
{ID: `Vaughn Rd`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `<NAME>`},
{ID: `Victoria Dr`},
{ID: `Vigilant St`},
{ID: `Village Dr`},
{ID: `Village Trc`},
{ID: `Vineyard Mountain Rd`},
{ID: `Vineyard Rd`},
{ID: `Vineyard Way`},
{ID: `Vinnings Ln`},
{ID: `Vintage Ct`},
{ID: `Vintagewood Cv`},
{ID: `Virginia Ave`},
{ID: `Vista Ct`},
{ID: `Vista Woods Dr`},
{ID: `Vulcan Quarry Rd`},
{ID: `W Carter St`},
{ID: `W Cherokee Ave`},
{ID: `W Church St`},
{ID: `W Felton Rd`},
{ID: `W George St`},
{ID: `W Georgia Ave`},
{ID: `W Holiday Ct`},
{ID: `W Howard St`},
{ID: `W Indiana Ave`},
{ID: `W Iron Belt Rd`},
{ID: `W Lee St`},
{ID: `W Main St`},
{ID: `W Oak Grove Rd`},
{ID: `W Porter St`},
{ID: `W Railroad St`},
{ID: `W Rocky St`},
{ID: `Wade Chapel Rd`},
{ID: `Wade Rd`},
{ID: `Wagonwheel Dr`},
{ID: `<NAME>`},
{ID: `Walker Hills Cir`},
{ID: `Walker Rd`},
{ID: `Walker St`},
{ID: `Walnut Dr`},
{ID: `Walnut Grove Rd`},
{ID: `Walnut Ln`},
{ID: `Walnut Trl`},
{ID: `Walt Way`},
{ID: `Walton St`},
{ID: `Wanda Dr`},
{ID: `Wansley Dr`},
{ID: `Ward Cir`},
{ID: `Ward Mountain Rd`},
{ID: `Ward Mountain Trl`},
{ID: `Warren Cv`},
{ID: `Washakie Ln`},
{ID: `Water Tower Rd`},
{ID: `Waterford Dr`},
{ID: `Waterfront Dr`},
{ID: `Waters Edge Dr`},
{ID: `Waters View`},
{ID: `Waterside Dr`},
{ID: `Waterstone Ct`},
{ID: `Waterstone Dr`},
{ID: `Watters Rd`},
{ID: `Wayland Cir`},
{ID: `Wayne Ave`},
{ID: `Wayne Dr`},
{ID: `Wayside Dr`},
{ID: `Wayside Rd`},
{ID: `Weaver St`},
{ID: `Webb Dr`},
{ID: `Websters Ferry Lndg`},
{ID: `Websters Overlook Dr`},
{ID: `Websters Overlook Lndg`},
{ID: `Weems Dr`},
{ID: `Weems Rd`},
{ID: `Weems Spur`},
{ID: `Weeping Willow Ln`},
{ID: `Weissinger Rd`},
{ID: `Wellington Dr`},
{ID: `Wellons Rd`},
{ID: `Wells Dr`},
{ID: `Wells St`},
{ID: `Wentercress Dr`},
{ID: `<NAME> Ln`},
{ID: `Wesley Mill Dr`},
{ID: `Wesley Rd`},
{ID: `Wesley Trc`},
{ID: `Wessington Pl`},
{ID: `West Ave`},
{ID: `West Dr`},
{ID: `West Ln`},
{ID: `West Oak Dr`},
{ID: `West Ridge Ct`},
{ID: `West Ridge Dr`},
{ID: `Westchester Dr`},
{ID: `Westfield Park`},
{ID: `Westgate Dr`},
{ID: `Westminster Dr`},
{ID: `Westover Dr`},
{ID: `Westover Rdg`},
{ID: `Westside Chas`},
{ID: `Westview Dr`},
{ID: `Westwood Cir`},
{ID: `Westwood Dr`},
{ID: `Westwood Ln`},
{ID: `Wetlands Rd`},
{ID: `Wexford Cir`},
{ID: `Wey Bridge Ct`},
{ID: `Wheeler Rd`},
{ID: `Whipporwill Ct`},
{ID: `Whipporwill Ln`},
{ID: `Whispering Pine Cir`},
{ID: `Whispering Pine Ln`},
{ID: `Whistle Stop Dr`},
{ID: `White Oak Dr`},
{ID: `White Rd`},
{ID: `Widgeon Way`},
{ID: `Wild Flower Trl`},
{ID: `Wildberry Path`},
{ID: `Wilderness Camp Rd`},
{ID: `Wildwood Dr`},
{ID: `Wilkey St`},
{ID: `Wilkins Rd`},
{ID: `William Dr`},
{ID: `<NAME> Trl`},
{ID: `Williams Rd`},
{ID: `<NAME> Rd`},
{ID: `Williams St`},
{ID: `Willis Rd`},
{ID: `<NAME> Dr`},
{ID: `<NAME>`},
{ID: `Willow Ct`},
{ID: `Willow Ln`},
{ID: `Willow Trc`},
{ID: `<NAME> Ln`},
{ID: `Willowbrook Ct`},
{ID: `Wilmer Way`},
{ID: `Wilson St`},
{ID: `Winchester Ave`},
{ID: `Winchester Dr`},
{ID: `Windcliff Ct`},
{ID: `<NAME>`},
{ID: `Windfield Dr`},
{ID: `Winding Branch Trc`},
{ID: `Winding Water Cv`},
{ID: `Windrush Dr`},
{ID: `Windsor Ct`},
{ID: `Windsor Trc`},
{ID: `Windy Hill Rd`},
{ID: `Wingfoot Ct`},
{ID: `Wingfoot Trl`},
{ID: `<NAME> Rd`},
{ID: `Winter Wood Ct`},
{ID: `Winter Wood Cv`},
{ID: `Winter Wood Dr`},
{ID: `Winter Wood Trc`},
{ID: `Winter Wood Trl`},
{ID: `Winter Wood Way`},
{ID: `Winterset Dr`},
{ID: `Wiseman Rd`},
{ID: `Wisteria Trl`},
{ID: `Wofford St`},
{ID: `Wolfcliff Rd`},
{ID: `Wolfpen Pass`},
{ID: `Wolfridge Trl`},
{ID: `Womack Dr`},
{ID: `Wood Cir`},
{ID: `Wood Forest Dr`},
{ID: `Wood Ln`},
{ID: `Wood Rd`},
{ID: `Wood St`},
{ID: `Woodall Rd`},
{ID: `Woodbine Dr`},
{ID: `Woodbridge Dr`},
{ID: `Woodcrest Dr`},
{ID: `Woodcrest Rd`},
{ID: `Wooddale Dr`},
{ID: `Woodhaven Ct`},
{ID: `Woodhaven Dr`},
{ID: `Woodland Bridge Rd`},
{ID: `Woodland Dr`},
{ID: `Woodland Rd`},
{ID: `Woodland Way`},
{ID: `Woodlands Way`},
{ID: `Woodsong Ct`},
{ID: `Woodview Dr`},
{ID: `Woodvine Ct`},
{ID: `Woodvine Dr`},
{ID: `Woody Rd`},
{ID: `Wooleys Rd`},
{ID: `Worthington Rd`},
{ID: `Wren Ct`},
{ID: `Wykle St`},
{ID: `Wynn Loop`},
{ID: `Wynn Rd`},
{ID: `Yacht Club Rd`},
{ID: `Yellow Brick Rd`},
{ID: `<NAME> Dr`},
{ID: `<NAME>`},
{ID: `York Trl`},
{ID: `<NAME> Trl`},
{ID: `Young Loop`},
{ID: `Young Rd`},
{ID: `Young St`},
{ID: `Youngs Mill Rd`},
{ID: `<NAME>`},
{ID: `Zion Rd`}}},
`ZipCode`: {ID: `ZipCode`, Name: `Zip Code`, Row: []Row{
{ID: `01770`},
{ID: `02030`},
{ID: `02108`},
{ID: `02109`},
{ID: `02110`},
{ID: `02199`},
{ID: `02481`},
{ID: `02493`},
{ID: `06820`},
{ID: `06830`},
{ID: `06831`},
{ID: `06840`},
{ID: `06853`},
{ID: `06870`},
{ID: `06878`},
{ID: `06880`},
{ID: `06883`},
{ID: `07021`},
{ID: `07046`},
{ID: `07078`},
{ID: `07417`},
{ID: `07458`},
{ID: `07620`},
{ID: `07760`},
{ID: `07924`},
{ID: `07931`},
{ID: `07945`},
{ID: `10004`},
{ID: `10017`},
{ID: `10018`},
{ID: `10021`},
{ID: `10022`},
{ID: `10028`},
{ID: `10069`},
{ID: `10504`},
{ID: `10506`},
{ID: `10514`},
{ID: `10538`},
{ID: `10576`},
{ID: `10577`},
{ID: `10580`},
{ID: `10583`},
{ID: `11024`},
{ID: `11030`},
{ID: `11568`},
{ID: `11724`},
{ID: `19035`},
{ID: `19041`},
{ID: `19085`},
{ID: `19807`},
{ID: `20198`},
{ID: `20854`},
{ID: `22066`},
{ID: `23219`},
{ID: `28207`},
{ID: `30326`},
{ID: `32963`},
{ID: `33480`},
{ID: `33786`},
{ID: `33921`},
{ID: `34102`},
{ID: `34108`},
{ID: `34228`},
{ID: `60022`},
{ID: `60043`},
{ID: `60045`},
{ID: `60093`},
{ID: `60521`},
{ID: `60606`},
{ID: `60611`},
{ID: `63124`},
{ID: `74103`},
{ID: `75205`},
{ID: `75225`},
{ID: `76102`},
{ID: `77002`},
{ID: `77024`},
{ID: `78257`},
{ID: `83014`},
{ID: `85253`},
{ID: `89451`},
{ID: `90067`},
{ID: `90077`},
{ID: `90210`},
{ID: `90212`},
{ID: `90272`},
{ID: `90402`},
{ID: `91436`},
{ID: `92067`},
{ID: `92091`},
{ID: `92657`},
{ID: `93108`},
{ID: `94022`},
{ID: `94027`},
{ID: `94028`},
{ID: `94062`},
{ID: `94111`},
{ID: `94301`},
{ID: `94304`},
{ID: `94920`},
{ID: `98039`}}},
}
// TableValueLookup may be used to validate a specific value.
var TableValueLookup = map[string]map[string]bool{
`0001`: {
`F`: true,
`M`: true,
`O`: true,
`U`: true},
`0002`: {
`A`: true,
`D`: true,
`M`: true,
`S`: true,
`W`: true},
`0003`: {
`A01`: true,
`A02`: true,
`A03`: true,
`A04`: true,
`A05`: true,
`A06`: true,
`A07`: true,
`A08`: true,
`A09`: true,
`A10`: true,
`A11`: true,
`A12`: true,
`A13`: true,
`A14`: true,
`A15`: true,
`A16`: true,
`A17`: true,
`A18`: true,
`A19`: true,
`A20`: true,
`A21`: true,
`A22`: true,
`A23`: true,
`A24`: true,
`A25`: true,
`A26`: true,
`A27`: true,
`A28`: true,
`A29`: true,
`A30`: true,
`A31`: true,
`A32`: true,
`A33`: true,
`A34`: true,
`A35`: true,
`A36`: true,
`A37`: true,
`A38`: true,
`A39`: true,
`A40`: true,
`A41`: true,
`A42`: true,
`A43`: true,
`A44`: true,
`A45`: true,
`A46`: true,
`A47`: true,
`A48`: true,
`A49`: true,
`A50`: true,
`A51`: true,
`C01`: true,
`C02`: true,
`C03`: true,
`C04`: true,
`C05`: true,
`C06`: true,
`C07`: true,
`C08`: true,
`C09`: true,
`C10`: true,
`C11`: true,
`C12`: true,
`CNQ`: true,
`I01`: true,
`I02`: true,
`I03`: true,
`I04`: true,
`I05`: true,
`I06`: true,
`I07`: true,
`I08`: true,
`I09`: true,
`I10`: true,
`I11`: true,
`I12`: true,
`I13`: true,
`I14`: true,
`I15`: true,
`M01`: true,
`M02`: true,
`M03`: true,
`M04`: true,
`M05`: true,
`M06`: true,
`M07`: true,
`M08`: true,
`M09`: true,
`M10`: true,
`M11`: true,
`O01`: true,
`O02`: true,
`P01`: true,
`P02`: true,
`P03`: true,
`P04`: true,
`P05`: true,
`P06`: true,
`P07`: true,
`P08`: true,
`P09`: true,
`PC1`: true,
`PC2`: true,
`PC3`: true,
`PC4`: true,
`PC5`: true,
`PC6`: true,
`PC7`: true,
`PC8`: true,
`PC9`: true,
`PCA`: true,
`PCB`: true,
`PCC`: true,
`PCD`: true,
`PCE`: true,
`PCF`: true,
`PCG`: true,
`PCH`: true,
`PCJ`: true,
`PCK`: true,
`PCL`: true,
`Q01`: true,
`Q02`: true,
`Q03`: true,
`Q04`: true,
`Q05`: true,
`Q06`: true,
`Q07`: true,
`Q08`: true,
`Q09`: true,
`R01`: true,
`R02`: true,
`R03`: true,
`R04`: true,
`R05`: true,
`R06`: true,
`R07`: true,
`R08`: true,
`R09`: true,
`R0R`: true,
`RAR`: true,
`RDR`: true,
`RER`: true,
`RGR`: true,
`S01`: true,
`S02`: true,
`S03`: true,
`S04`: true,
`S05`: true,
`S06`: true,
`S07`: true,
`S08`: true,
`S09`: true,
`S10`: true,
`S11`: true,
`S12`: true,
`S13`: true,
`S14`: true,
`S15`: true,
`S16`: true,
`S17`: true,
`S18`: true,
`S19`: true,
`S20`: true,
`S21`: true,
`S22`: true,
`S23`: true,
`S24`: true,
`S25`: true,
`S26`: true,
`T01`: true,
`T02`: true,
`T03`: true,
`T04`: true,
`T05`: true,
`T06`: true,
`T07`: true,
`T08`: true,
`T09`: true,
`T10`: true,
`T11`: true,
`T12`: true,
`V01`: true,
`V02`: true,
`V03`: true,
`V04`: true,
`W01`: true,
`W02`: true},
`0004`: {
`B`: true,
`E`: true,
`I`: true,
`O`: true,
`P`: true,
`R`: true},
`0005`: {},
`0006`: {},
`0007`: {
`A`: true,
`E`: true,
`L`: true,
`R`: true},
`0008`: {
`AA`: true,
`AE`: true,
`AR`: true,
`CA`: true,
`CE`: true,
`CR`: true},
`0009`: {
`A0`: true,
`A1`: true,
`A2`: true,
`A3`: true,
`A4`: true,
`A5`: true,
`A6`: true,
`A7`: true,
`A8`: true,
`A9`: true,
`B1`: true,
`B2`: true,
`B3`: true,
`B4`: true,
`B5`: true,
`B6`: true},
`0010`: {},
`0017`: {
`AJ`: true,
`CD`: true,
`CG`: true,
`PY`: true},
`0018`: {},
`0019`: {},
`0021`: {},
`0022`: {},
`0023`: {
`1`: true,
`2`: true,
`3`: true,
`4`: true,
`5`: true,
`6`: true,
`7`: true,
`8`: true,
`9`: true},
`0024`: {},
`0027`: {
`A`: true,
`P`: true,
`R`: true,
`S`: true,
`T`: true},
`0032`: {},
`0038`: {
`A`: true,
`CA`: true,
`CM`: true,
`DC`: true,
`ER`: true,
`HD`: true,
`IP`: true,
`RP`: true,
`SC`: true},
`0042`: {},
`0043`: {
`01`: true,
`02`: true,
`03`: true,
`04`: true,
`05`: true,
`06`: true,
`07`: true,
`08`: true,
`09`: true,
`10`: true,
`11`: true,
`12 ... 16`: true,
`18`: true,
`19`: true,
`20`: true,
`21`: true,
`26`: true,
`27`: true,
`28`: true,
`29`: true,
`31`: true,
`32`: true,
`33`: true,
`34`: true,
`36`: true,
`37`: true,
`38`: true,
`39`: true,
`40`: true,
`41`: true,
`46`: true,
`48`: true,
`55`: true,
`56`: true,
`57`: true,
`60`: true,
`61`: true,
`62`: true,
`66`: true,
`67`: true,
`68`: true,
`70`: true,
`71`: true,
`72`: true,
`73`: true,
`74`: true,
`75`: true,
`76`: true,
`77`: true,
`78`: true,
`79`: true,
`80`: true},
`0044`: {},
`0045`: {},
`0046`: {},
`0048`: {
`ADV`: true,
`ANU`: true,
`APA`: true,
`APM`: true,
`APN`: true,
`APP`: true,
`ARN`: true,
`CAN`: true,
`DEM`: true,
`FIN`: true,
`GOL`: true,
`MRI`: true,
`MRO`: true,
`NCK`: true,
`NSC`: true,
`NST`: true,
`ORD`: true,
`OTH`: true,
`PRB`: true,
`PRO`: true,
`RAR`: true,
`RDR`: true,
`RER`: true,
`RES`: true,
`RGR`: true,
`ROR`: true,
`SAL`: true,
`SBK`: true,
`SBL`: true,
`SOP`: true,
`SSA`: true,
`SSR`: true,
`STA`: true,
`VXI`: true},
`0049`: {},
`0050`: {},
`0051`: {},
`0052`: {
`A`: true,
`F`: true,
`W`: true},
`0053`: {},
`0055`: {},
`0056`: {},
`0059`: {},
`0061`: {
`ISO`: true,
`M10`: true,
`M11`: true,
`NPI`: true},
`0062`: {
`01`: true,
`02`: true,
`03`: true},
`0063`: {},
`0064`: {},
`0065`: {
`A`: true,
`G`: true,
`L`: true,
`O`: true,
`P`: true,
`R`: true,
`S`: true},
`0066`: {},
`0068`: {},
`0069`: {},
`0070`: {
`ABS`: true,
`AMN`: true,
`ASP`: true,
`BBL`: true,
`BDY`: true,
`BIFL`: true,
`BLD`: true,
`BLDA`: true,
`BLDC`: true,
`BLDV`: true,
`BON`: true,
`BPH`: true,
`BPU`: true,
`BRN`: true,
`BRO`: true,
`BRTH`: true,
`CALC`: true,
`CBLD`: true,
`CDM`: true,
`CNJT`: true,
`CNL`: true,
`COL`: true,
`CSF`: true,
`CTP`: true,
`CUR`: true,
`CVM`: true,
`CVX`: true,
`CYST`: true,
`DIAF`: true,
`DOSE`: true,
`DRN`: true,
`DUFL`: true,
`EAR`: true,
`EARW`: true,
`ELT`: true,
`ENDC`: true,
`ENDM`: true,
`EOS`: true,
`EXHLD`: true,
`EYE`: true,
`FIB`: true,
`FIST`: true,
`FLT`: true,
`FLU`: true,
`GAS`: true,
`GAST`: true,
`GEN`: true,
`GENC`: true,
`GENL`: true,
`GENV`: true,
`HAR`: true,
`IHG`: true,
`ISLT`: true,
`IT`: true,
`LAM`: true,
`LIQ`: true,
`LN`: true,
`LNA`: true,
`LNV`: true,
`LYM`: true,
`MAC`: true,
`MAR`: true,
`MBLD`: true,
`MEC`: true,
`MILK`: true,
`MLK`: true,
`NAIL`: true,
`NOS`: true,
`ORH`: true,
`PAFL`: true,
`PAT`: true,
`PLAS`: true,
`PLB`: true,
`PLC`: true,
`PLR`: true,
`PMN`: true,
`PPP`: true,
`PRP`: true,
`PRT`: true,
`PUS`: true,
`RBC`: true,
`RT`: true,
`SAL`: true,
`SEM`: true,
`SER`: true,
`SKM`: true,
`SKN`: true,
`SNV`: true,
`SPRM`: true,
`SPT`: true,
`SPTC`: true,
`SPTT`: true,
`STL`: true,
`STON`: true,
`SWT`: true,
`TEAR`: true,
`THRB`: true,
`THRT`: true,
`TISG`: true,
`TISPL`: true,
`TISS`: true,
`TISU`: true,
`TLGI`: true,
`TLNG`: true,
`TSMI`: true,
`TUB`: true,
`ULC`: true,
`UMB`: true,
`UMED`: true,
`UR`: true,
`URC`: true,
`URNS`: true,
`URT`: true,
`URTH`: true,
`USUB`: true,
`VOM`: true,
`WAT`: true,
`WBC`: true,
`WICK`: true,
`WND`: true,
`WNDA`: true,
`WNDD`: true,
`WNDE`: true,
`XXX`: true},
`0072`: {},
`0073`: {},
`0074`: {
`AU`: true,
`BG`: true,
`BLB`: true,
`CH`: true,
`CP`: true,
`CT`: true,
`CTH`: true,
`CUS`: true,
`EC`: true,
`EN`: true,
`HM`: true,
`ICU`: true,
`IMM`: true,
`LAB`: true,
`MB`: true,
`MCB`: true,
`MYC`: true,
`NMR`: true,
`NMS`: true,
`NRS`: true,
`OSL`: true,
`OT`: true,
`OTH`: true,
`OUS`: true,
`PF`: true,
`PHR`: true,
`PHY`: true,
`PT`: true,
`RAD`: true,
`RC`: true,
`RT`: true,
`RUS`: true,
`RX`: true,
`SP`: true,
`SR`: true,
`TX`: true,
`VR`: true,
`VUS`: true,
`XRC`: true},
`0076`: {
`ACK`: true,
`ADR`: true,
`ADT`: true,
`ARD`: true,
`BAR`: true,
`CRM`: true,
`CSU`: true,
`DFT`: true,
`DOC`: true,
`DSR`: true,
`EDR`: true,
`EQQ`: true,
`ERP`: true,
`MCF`: true,
`MDM`: true,
`MFD`: true,
`MFK`: true,
`MFN`: true,
`MFQ`: true,
`MFR`: true,
`NMD`: true,
`NMQ`: true,
`NMR`: true,
`ORF`: true,
`ORM`: true,
`ORR`: true,
`ORU`: true,
`OSQ`: true,
`OSR`: true,
`PEX`: true,
`PGL`: true,
`PIN`: true,
`PPG`: true,
`PPP`: true,
`PPR`: true,
`PPT`: true,
`PPV`: true,
`PRR`: true,
`PTR`: true,
`QCK`: true,
`QRY`: true,
`RAR`: true,
`RAS`: true,
`RCI`: true,
`RCL`: true,
`RDE`: true,
`RDR`: true,
`RDS`: true,
`REF`: true,
`RER`: true,
`RGR`: true,
`RGV`: true,
`ROR`: true,
`RPA`: true,
`RPI`: true,
`RPL`: true,
`RPR`: true,
`RQA`: true,
`RQC`: true,
`RQI`: true,
`RQP`: true,
`RQQ`: true,
`RRA`: true,
`RRD`: true,
`RRE`: true,
`RRG`: true,
`RRI`: true,
`SIU`: true,
`SPQ`: true,
`SQM`: true,
`SQR`: true,
`SRM`: true,
`SRR`: true,
`SUR`: true,
`TBR`: true,
`UDM`: true,
`VQQ`: true,
`VXQ`: true,
`VXR`: true,
`VXU`: true,
`VXX`: true},
`0078`: {
`<`: true,
`>`: true,
`A`: true,
`AA`: true,
`B`: true,
`D`: true,
`H`: true,
`HH`: true,
`I`: true,
`L`: true,
`LL`: true,
`MS`: true,
`N`: true,
`null`: true,
`R`: true,
`S`: true,
`U`: true,
`VS`: true,
`W`: true},
`0080`: {
`A`: true,
`N`: true,
`R`: true,
`S`: true},
`0083`: {
`C`: true,
`D`: true},
`0084`: {},
`0085`: {
`C`: true,
`D`: true,
`F`: true,
`I`: true,
`N`: true,
`O`: true,
`P`: true,
`R`: true,
`S`: true,
`U`: true,
`W`: true,
`X`: true},
`0086`: {},
`0087`: {},
`0088`: {},
`0089`: {},
`0091`: {
`D`: true,
`I`: true},
`0092`: {
`R`: true},
`0093`: {
`N`: true,
`Y`: true},
`0098`: {
`M`: true,
`S`: true,
`U`: true},
`0099`: {},
`0100`: {
`D`: true,
`O`: true,
`R`: true,
`S`: true,
`T`: true},
`0102`: {
`D`: true,
`F`: true},
`0103`: {
`D`: true,
`P`: true,
`T`: true},
`0104`: {
`2.0`: true,
`2.0D`: true,
`2.1`: true,
`2.2`: true,
`2.3`: true,
`2.3.1`: true,
`2.3.2`: true},
`0105`: {
`L`: true,
`O`: true,
`P`: true},
`0106`: {
`D`: true,
`R`: true,
`T`: true},
`0107`: {
`B`: true,
`L`: true},
`0108`: {
`O`: true,
`R`: true,
`S`: true,
`T`: true},
`0109`: {
`R`: true,
`S`: true},
`0110`: {},
`0111`: {},
`0112`: {
`01`: true,
`02`: true,
`03`: true,
`04`: true,
`05`: true,
`06`: true,
`07`: true,
`08`: true,
`09`: true,
`10`: true,
`11`: true,
`12`: true,
`13`: true,
`14`: true,
`15`: true,
`16`: true,
`17`: true,
`18`: true,
`19`: true,
`20`: true,
`21`: true,
`22`: true,
`23`: true,
`24`: true,
`25`: true,
`26`: true,
`27`: true,
`28`: true,
`29`: true,
`30`: true,
`31`: true,
`32`: true,
`33`: true,
`34`: true,
`35`: true,
`36`: true,
`37`: true,
`38`: true,
`39`: true,
`40`: true,
`41`: true,
`42`: true},
`0113`: {},
`0114`: {},
`0115`: {},
`0116`: {
`C`: true,
`H`: true,
`I`: true,
`K`: true,
`O`: true,
`U`: true},
`0117`: {},
`0118`: {},
`0119`: {
`AF`: true,
`CA`: true,
`CH`: true,
`CN`: true,
`CR`: true,
`DC`: true,
`DE`: true,
`DF`: true,
`FU`: true,
`HD`: true,
`HR`: true,
`LI`: true,
`NA`: true,
`NW`: true,
`OC`: true,
`OD`: true,
`OE`: true,
`OF`: true,
`OH`: true,
`OK`: true,
`OR`: true,
`PA`: true,
`RE`: true,
`RF`: true,
`RL`: true,
`RO`: true,
`RP`: true,
`RQ`: true,
`RR`: true,
`RU`: true,
`SC`: true,
`SN`: true,
`SR`: true,
`SS`: true,
`UA`: true,
`UC`: true,
`UF`: true,
`UH`: true,
`UM`: true,
`UN`: true,
`UR`: true,
`UX`: true,
`XO`: true,
`XR`: true,
`XX`: true},
`0121`: {
`D`: true,
`E`: true,
`F`: true,
`N`: true,
`R`: true},
`0122`: {
`CH`: true,
`CO`: true,
`CR`: true,
`DP`: true,
`GR`: true,
`NC`: true,
`PC`: true,
`RS`: true},
`0123`: {
`A`: true,
`C`: true,
`F`: true,
`I`: true,
`O`: true,
`P`: true,
`R`: true,
`S`: true,
`X`: true,
`Y`: true,
`Z`: true},
`0124`: {
`CART`: true,
`PORT`: true,
`WALK`: true,
`WHLC`: true},
`0125`: {
`AD`: true,
`CE`: true,
`CF`: true,
`CK`: true,
`CN`: true,
`CP`: true,
`CX`: true,
`DT`: true,
`ED`: true,
`FT`: true,
`ID`: true,
`MO`: true,
`NM`: true,
`PN`: true,
`RP`: true,
`SN`: true,
`ST`: true,
`TM`: true,
`TN`: true,
`TS`: true,
`TX`: true,
`XAD`: true,
`XCN`: true,
`XON`: true,
`XPN`: true,
`XTN`: true},
`0127`: {
`DA`: true,
`FA`: true,
`MA`: true,
`MC`: true},
`0128`: {
`MI`: true,
`MO`: true,
`SV`: true},
`0129`: {},
`0130`: {},
`0131`: {},
`0132`: {},
`0135`: {
`M`: true,
`N`: true,
`Y`: true},
`0136`: {
`N`: true,
`Y`: true},
`0137`: {
`E`: true,
`G`: true,
`I`: true,
`O`: true,
`P`: true},
`0139`: {},
`0140`: {
`NATO`: true,
`NOAA`: true,
`USA`: true,
`USAF`: true,
`USCG`: true,
`USMC`: true,
`USN`: true,
`USPHS`: true},
`0141`: {
`E1`: true,
`E2`: true,
`E3`: true,
`E4`: true,
`E5`: true,
`E6`: true,
`E7`: true,
`E8`: true,
`E9`: true,
`O1`: true,
`O10`: true,
`O2`: true,
`O3`: true,
`O4`: true,
`O5`: true,
`O6`: true,
`O7`: true,
`O8`: true,
`O9`: true,
`W1`: true,
`W2`: true,
`W3`: true,
`W4`: true},
`0142`: {
`ACT`: true,
`DEC`: true,
`RET`: true},
`0143`: {},
`0144`: {
`1`: true,
`2`: true,
`3`: true,
`4`: true,
`5`: true,
`6`: true,
`7`: true},
`0145`: {
`2ICU`: true,
`2PRI`: true,
`2SPR`: true,
`ICU`: true,
`PRI`: true,
`SPR`: true},
`0146`: {
`DF`: true,
`LM`: true,
`PC`: true,
`RT`: true,
`UL`: true},
`0147`: {
`2ANC`: true,
`2MMD`: true,
`3MMD`: true,
`ANC`: true,
`MMD`: true},
`0148`: {
`AT`: true,
`PC`: true},
`0149`: {
`AP`: true,
`DE`: true,
`PE`: true},
`0150`: {
`ER`: true,
`IPE`: true,
`OPE`: true,
`UR`: true},
`0151`: {},
`0152`: {},
`0153`: {
`01`: true,
`02`: true,
`04`: true,
`05`: true,
`06`: true,
`08`: true,
`09`: true,
`10`: true,
`11`: true,
`12`: true,
`13`: true,
`14`: true,
`15`: true,
`16`: true,
`17`: true,
`21`: true,
`22`: true,
`23`: true,
`24`: true,
`30`: true,
`31`: true,
`37`: true,
`38`: true,
`39`: true,
`40`: true,
`41`: true,
`42`: true,
`43`: true,
`44`: true,
`45`: true,
`46`: true,
`47`: true,
`48`: true,
`49`: true,
`50`: true,
`51`: true,
`52`: true,
`53`: true,
`56`: true,
`57`: true,
`58`: true,
`59`: true,
`60`: true,
`67`: true,
`68`: true,
`70 ... 72`: true,
`75 ... 79`: true,
`80`: true,
`81`: true,
`A1`: true,
`A2`: true,
`A3`: true,
`X0`: true,
`X4`: true},
`0155`: {
`AL`: true,
`ER`: true,
`NE`: true,
`SU`: true},
`0156`: {
`ANY`: true,
`COL`: true,
`ORD`: true,
`RCT`: true,
`REP`: true,
`SCHED`: true},
`0157`: {
`ANY`: true,
`CFN`: true,
`COR`: true,
`FIN`: true,
`PRE`: true,
`REP`: true},
`0158`: {
`1ST`: true,
`ALL`: true,
`LST`: true,
`REV`: true},
`0159`: {
`D`: true,
`P`: true,
`S`: true},
`0160`: {
`EARLY`: true,
`GUEST`: true,
`LATE`: true,
`MSG`: true,
`NO`: true},
`0161`: {
`G`: true,
`N`: true,
`T`: true},
`0162`: {
`AP`: true,
`B`: true,
`DT`: true,
`EP`: true,
`ET`: true,
`GTT`: true,
`GU`: true,
`IA`: true,
`IB`: true,
`IC`: true,
`ICV`: true,
`ID`: true,
`IH`: true,
`IHA`: true,
`IMR`: true,
`IU`: true,
`MM`: true,
`MTH`: true,
`NG`: true,
`NP`: true,
`NS`: true,
`NT`: true,
`OP`: true,
`OT`: true,
`OTH`: true,
`PF`: true,
`PO`: true,
`PR`: true,
`RM`: true,
`SC`: true,
`SD`: true,
`SL`: true,
`TD`: true,
`TL`: true,
`TP`: true,
`TRA`: true,
`UR`: true,
`VG`: true,
`VM`: true,
`WND`: true},
`0163`: {
`BE`: true,
`BN`: true,
`BU`: true,
`CT`: true,
`LA`: true,
`LAC`: true,
`LACF`: true,
`LD`: true,
`LE`: true,
`LEJ`: true,
`LF`: true,
`LG`: true,
`LH`: true,
`LIJ`: true,
`LLAQ`: true,
`LLFA`: true,
`LMFA`: true,
`LN`: true,
`LPC`: true,
`LSC`: true,
`LT`: true,
`LUA`: true,
`LUAQ`: true,
`LUFA`: true,
`LVG`: true,
`LVL`: true,
`NB`: true,
`OD`: true,
`OS`: true,
`OU`: true,
`PA`: true,
`PERIN`: true,
`RA`: true,
`RAC`: true,
`RACF`: true,
`RD`: true,
`RE`: true,
`REJ`: true,
`RF`: true,
`RG`: true,
`RH`: true,
`RIJ`: true,
`RLAQ`: true,
`RLFA`: true,
`RMFA`: true,
`RN`: true,
`RPC`: true,
`RSC`: true,
`RT`: true,
`RUA`: true,
`RUAQ`: true,
`RUFA`: true,
`RVG`: true,
`RVL`: true},
`0164`: {
`AP`: true,
`BT`: true,
`HL`: true,
`IPPB`: true,
`IVP`: true,
`IVS`: true,
`MI`: true,
`NEB`: true,
`PCA`: true},
`0165`: {
`CH`: true,
`DI`: true,
`DU`: true,
`IF`: true,
`IR`: true,
`IS`: true,
`IVP`: true,
`IVPB`: true,
`NB`: true,
`PF`: true,
`PT`: true,
`SH`: true,
`SO`: true,
`WA`: true,
`WI`: true},
`0166`: {
`A`: true,
`B`: true},
`0167`: {
`0`: true,
`1`: true,
`2`: true,
`3`: true,
`4`: true,
`5`: true,
`7`: true,
`8`: true,
`G`: true,
`N`: true,
`T`: true},
`0168`: {
`A`: true,
`B`: true,
`C`: true,
`P`: true,
`R`: true,
`S`: true,
`T`: true},
`0169`: {
`C`: true,
`R`: true},
`0170`: {
`C`: true,
`N`: true,
`P`: true},
`0171`: {},
`0172`: {},
`0173`: {
`CO`: true,
`IN`: true},
`0174`: {
`A`: true,
`C`: true,
`F`: true,
`P`: true,
`S`: true},
`0175`: {
`CDM`: true,
`CM0`: true,
`CM1`: true,
`CM2`: true,
`LOC`: true,
`OM1`: true,
`OM2`: true,
`OM3`: true,
`OM4`: true,
`OM5`: true,
`OM6`: true,
`PRA`: true,
`STF`: true},
`0177`: {
`AID`: true,
`EMP`: true,
`ETH`: true,
`HIV`: true,
`PSY`: true,
`R`: true,
`U`: true,
`UWM`: true,
`V`: true,
`VIP`: true},
`0178`: {
`REP`: true,
`UPD`: true},
`0179`: {
`AL`: true,
`ER`: true,
`NE`: true,
`SU`: true},
`0180`: {
`MAC`: true,
`MAD`: true,
`MDC`: true,
`MDL`: true,
`MUP`: true},
`0181`: {
`S`: true,
`U`: true},
`0182`: {},
`0183`: {
`A`: true,
`I`: true},
`0184`: {},
`0185`: {
`B`: true,
`C`: true,
`E`: true,
`F`: true,
`H`: true,
`O`: true},
`0186`: {},
`0187`: {
`I`: true,
`P`: true},
`0188`: {},
`0189`: {},
`0190`: {
`B`: true,
`BA`: true,
`BDL`: true,
`BR`: true,
`C`: true,
`F`: true,
`H`: true,
`L`: true,
`M`: true,
`N`: true,
`O`: true,
`P`: true,
`RH`: true},
`0191`: {
`AP`: true,
`Application`: true,
`AU`: true,
`Audio`: true,
`FT`: true,
`IM`: true,
`Image`: true,
`NS`: true,
`SD`: true,
`SI`: true,
`TEXT`: true,
`TX`: true},
`0193`: {
`AT`: true,
`LM`: true,
`PC`: true,
`UL`: true},
`0200`: {
`A`: true,
`B`: true,
`C`: true,
`D`: true,
`L`: true,
`M`: true,
`P`: true,
`S`: true,
`T`: true,
`U`: true},
`0201`: {
`ASN`: true,
`BPN`: true,
`EMR`: true,
`NET`: true,
`ORN`: true,
`PRN`: true,
`VHN`: true,
`WPN`: true},
`0202`: {
`BP`: true,
`CP`: true,
`FX`: true,
`Internet`: true,
`MD`: true,
`PH`: true,
`X.400`: true},
`0203`: {
`AM`: true,
`AN`: true,
`BR`: true,
`DI`: true,
`DL`: true,
`DN`: true,
`DS`: true,
`EI`: true,
`EN`: true,
`FI`: true,
`GI`: true,
`GN`: true,
`LN`: true,
`LR`: true,
`MA`: true,
`MC`: true,
`MR`: true,
`MS`: true,
`NE`: true,
`NH`: true,
`NI`: true,
`NNxxx`: true,
`NPI`: true,
`PI`: true,
`PN`: true,
`PRN`: true,
`PT`: true,
`RR`: true,
`RRI`: true,
`SL`: true,
`SR`: true,
`SS`: true,
`U`: true,
`UPIN`: true,
`VN`: true,
`VS`: true,
`WC`: true,
`XX`: true},
`0204`: {
`A`: true,
`D`: true,
`L`: true,
`SL`: true},
`0205`: {
`AP`: true,
`DC`: true,
`IC`: true,
`PF`: true,
`TF`: true,
`TP`: true,
`UP`: true},
`0206`: {
`A`: true,
`D`: true,
`U`: true},
`0207`: {
``: true,
`a`: true,
`i`: true,
`r`: true},
`0208`: {
`AE`: true,
`AR`: true,
`NF`: true,
`OK`: true},
`0209`: {
`CT`: true,
`EQ`: true,
`GE`: true,
`GN`: true,
`GT`: true,
`LE`: true,
`LT`: true,
`NE`: true},
`0210`: {
`AND`: true,
`OR`: true},
`0211`: {
`8859/1`: true,
`8859/2`: true,
`8859/3`: true,
`8859/4`: true,
`8859/5`: true,
`8859/6`: true,
`8859/7`: true,
`8859/8`: true,
`8859/9`: true,
`ASCII`: true,
`ISO IR14`: true,
`ISO IR159`: true,
`ISO IR87`: true,
`UNICODE`: true},
`0212`: {},
`0213`: {
`D`: true,
`I`: true,
`P`: true},
`0214`: {},
`0215`: {},
`0216`: {},
`0217`: {},
`0218`: {},
`0219`: {},
`0220`: {
`A`: true,
`F`: true,
`I`: true,
`R`: true,
`S`: true,
`U`: true},
`0222`: {},
`0223`: {
`CB`: true,
`D`: true,
`M`: true,
`S`: true,
`WU`: true},
`0224`: {
`A`: true,
`N`: true,
`U`: true},
`0225`: {
`N`: true,
`R`: true,
`U`: true},
`0227`: {
`AB`: true,
`AD`: true,
`ALP`: true,
`AR`: true,
`AVI`: true,
`BA`: true,
`BAY`: true,
`BP`: true,
`BPC`: true,
`CEN`: true,
`CHI`: true,
`CON`: true,
`EVN`: true,
`GRE`: true,
`IAG`: true,
`IM`: true,
`IUS`: true,
`JPN`: true,
`KGC`: true,
`LED`: true,
`MA`: true,
`MED`: true,
`MIL`: true,
`MIP`: true,
`MSD`: true,
`NAB`: true,
`NAV`: true,
`NOV`: true,
`NYB`: true,
`ORT`: true,
`OTC`: true,
`OTH`: true,
`PD`: true,
`PMC`: true,
`PRX`: true,
`SCL`: true,
`SI`: true,
`SKB`: true,
`UNK`: true,
`USA`: true,
`WA`: true,
`WAL`: true},
`0228`: {
`C`: true,
`D`: true,
`I`: true,
`M`: true,
`O`: true,
`R`: true,
`S`: true,
`T`: true},
`0229`: {
`C`: true,
`G`: true,
`M`: true},
`0230`: {
`A`: true,
`D`: true,
`I`: true,
`P`: true},
`0231`: {
`F`: true,
`N`: true,
`P`: true},
`0232`: {
`01`: true,
`02`: true,
`03`: true},
`0233`: {},
`0234`: {
`10D`: true,
`15D`: true,
`30D`: true,
`3D`: true,
`7D`: true,
`AD`: true,
`CO`: true,
`DE`: true,
`PD`: true,
`RQ`: true},
`0235`: {
`C`: true,
`D`: true,
`E`: true,
`H`: true,
`L`: true,
`M`: true,
`N`: true,
`O`: true,
`P`: true,
`R`: true},
`0236`: {
`D`: true,
`L`: true,
`M`: true,
`R`: true},
`0237`: {
`A`: true,
`B`: true,
`D`: true,
`I`: true,
`L`: true,
`M`: true,
`O`: true,
`W`: true},
`0238`: {
`N`: true,
`S`: true,
`Y`: true},
`0239`: {
`N`: true,
`U`: true,
`Y`: true},
`0240`: {
`C`: true,
`D`: true,
`H`: true,
`I`: true,
`J`: true,
`L`: true,
`O`: true,
`P`: true,
`R`: true},
`0241`: {
`D`: true,
`F`: true,
`N`: true,
`R`: true,
`S`: true,
`U`: true,
`W`: true},
`0242`: {
`C`: true,
`H`: true,
`L`: true,
`M`: true,
`O`: true,
`P`: true,
`R`: true},
`0243`: {
`N`: true,
`NA`: true,
`Y`: true},
`0244`: {},
`0245`: {},
`0246`: {},
`0247`: {
`A`: true,
`C`: true,
`D`: true,
`I`: true,
`K`: true,
`O`: true,
`P`: true,
`Q`: true,
`R`: true,
`U`: true,
`X`: true,
`Y`: true},
`0248`: {
`A`: true,
`L`: true,
`N`: true,
`R`: true},
`0249`: {},
`0250`: {
`H`: true,
`I`: true,
`M`: true,
`N`: true,
`S`: true},
`0251`: {
`DI`: true,
`DR`: true,
`N`: true,
`OT`: true,
`WP`: true,
`WT`: true},
`0252`: {
`AW`: true,
`BE`: true,
`DR`: true,
`EX`: true,
`IN`: true,
`LI`: true,
`OE`: true,
`OT`: true,
`PL`: true,
`SE`: true,
`TC`: true},
`0253`: {
`B`: true,
`F`: true,
`O`: true,
`P`: true,
`X`: true},
`0254`: {
`ABS`: true,
`ACNC`: true,
`ACT`: true,
`APER`: true,
`ARB`: true,
`AREA`: true,
`ASPECT`: true,
`CACT`: true,
`CCNT`: true,
`CCRTO`: true,
`CFR`: true,
`CLAS`: true,
`CNC`: true,
`CNST`: true,
`COEF`: true,
`COLOR`: true,
`CONS`: true,
`CRAT`: true,
`CRTO`: true,
`DEN`: true,
`DEV`: true,
`DIFF`: true,
`ELAS`: true,
`ELPOT`: true,
`ELRAT`: true,
`ELRES`: true,
`ENGR`: true,
`ENT`: true,
`ENTCAT`: true,
`ENTNUM`: true,
`ENTSUB`: true,
`ENTVOL`: true,
`EQL`: true,
`FORCE`: true,
`FREQ`: true,
`IMP`: true,
`KINV`: true,
`LEN`: true,
`LINC`: true,
`LIQ`: true,
`MASS`: true,
`MCNC`: true,
`MCNT`: true,
`MCRTO`: true,
`MFR`: true,
`MGFLUX`: true,
`MINC`: true,
`MORPH`: true,
`MOTIL`: true,
`MRAT`: true,
`MRTO`: true,
`NCNC`: true,
`NCNT`: true,
`NFR`: true,
`NRTO`: true,
`NUM`: true,
`OD`: true,
`OSMOL`: true,
`PRES`: true,
`PRID`: true,
`PWR`: true,
`RANGE`: true,
`RATIO`: true,
`RCRLTM`: true,
`RDEN`: true,
`REL`: true,
`RLMCNC`: true,
`RLSCNC`: true,
`RLTM`: true,
`SATFR`: true,
`SCNC`: true,
`SCNCIN`: true,
`SCNT`: true,
`SCNTR`: true,
`SCRTO`: true,
`SFR`: true,
`SHAPE`: true,
`SMELL`: true,
`SRAT`: true,
`SRTO`: true,
`SUB`: true,
`SUSC`: true,
`TASTE`: true,
`TEMP`: true,
`TEMPDF`: true,
`TEMPIN`: true,
`THRMCNC`: true,
`THRSCNC`: true,
`TIME`: true,
`TITR`: true,
`TMDF`: true,
`TMSTP`: true,
`TRTO`: true,
`TYPE`: true,
`VCNT`: true,
`VEL`: true,
`VELRT`: true,
`VFR`: true,
`VISC`: true,
`VOL`: true,
`VRAT`: true,
`VRTO`: true},
`0255`: {
`* (star)`: true,
`12H`: true,
`1H`: true,
`1L`: true,
`1W`: true,
`2.5H`: true,
`24H`: true,
`2D`: true,
`2H`: true,
`2L`: true,
`2W`: true,
`30M`: true,
`3D`: true,
`3H`: true,
`3L`: true,
`3W`: true,
`4D`: true,
`4H`: true,
`4W`: true,
`5D`: true,
`5H`: true,
`6D`: true,
`6H`: true,
`7H`: true,
`8H`: true,
`PT`: true},
`0258`: {
`BPU`: true,
`CONTROL`: true,
`DONOR`: true,
`PATIENT`: true},
`0259`: {
`AS`: true,
`BS`: true,
`CD`: true,
`CP`: true,
`CR`: true,
`CS`: true,
`CT`: true,
`DD`: true,
`DG`: true,
`DM`: true,
`EC`: true,
`ES`: true,
`FA`: true,
`FS`: true,
`LP`: true,
`LS`: true,
`MA`: true,
`MS`: true,
`NM`: true,
`OT`: true,
`PT`: true,
`RF`: true,
`ST`: true,
`TG`: true,
`US`: true,
`XA`: true},
`0260`: {
`B`: true,
`C`: true,
`D`: true,
`E`: true,
`L`: true,
`N`: true,
`O`: true,
`R`: true},
`0261`: {
`EEG`: true,
`EKG`: true,
`INF`: true,
`IVP`: true,
`OXY`: true,
`SUC`: true,
`VEN`: true,
`VIT`: true},
`0264`: {},
`0265`: {
`ALC`: true,
`AMB`: true,
`CAN`: true,
`CAR`: true,
`CCR`: true,
`CHI`: true,
`EDI`: true,
`EMR`: true,
`FPC`: true,
`INT`: true,
`ISO`: true,
`NAT`: true,
`NBI`: true,
`OBG`: true,
`OBS`: true,
`OTH`: true,
`PED`: true,
`PHY`: true,
`PIN`: true,
`PPS`: true,
`PRE`: true,
`PSI`: true,
`PSY`: true,
`REH`: true,
`SUR`: true,
`WIC`: true},
`0267`: {
`FRI`: true,
`MON`: true,
`SAT`: true,
`SUN`: true,
`THU`: true,
`TUE`: true,
`WED`: true},
`0268`: {
`A`: true,
`R`: true,
`X`: true},
`0269`: {
`O`: true,
`R`: true},
`0270`: {
`AR`: true,
`CD`: true,
`CN`: true,
`DI`: true,
`DS`: true,
`ED`: true,
`HP`: true,
`OP`: true,
`PC`: true,
`PH`: true,
`PN`: true,
`PR`: true,
`SP`: true,
`TS`: true},
`0271`: {
`AU`: true,
`DI`: true,
`DO`: true,
`IN`: true,
`IP`: true,
`LA`: true,
`PA`: true},
`0272`: {
`R`: true,
`U`: true,
`V`: true},
`0273`: {
`AV`: true,
`CA`: true,
`OB`: true,
`UN`: true},
`0275`: {
`AA`: true,
`AC`: true,
`AR`: true,
`PU`: true},
`0276`: {
`Checkup`: true,
`Emergency`: true,
`Followup`: true,
`Routine`: true,
`Walkin`: true},
`0277`: {
`Complete`: true,
`Normal`: true,
`Tentative`: true},
`0278`: {
`Blocked`: true,
`Booked`: true,
`Cancelled`: true,
`Complete`: true,
`Dc`: true,
`Deleted`: true,
`Overbook`: true,
`Pending`: true,
`Started`: true,
`Waitlist`: true},
`0279`: {
`Confirm`: true,
`No`: true,
`Notify`: true,
`Yes`: true},
`0280`: {
`A`: true,
`R`: true,
`S`: true},
`0281`: {
`Hom`: true,
`Lab`: true,
`Med`: true,
`Psy`: true,
`Rad`: true,
`Skn`: true},
`0282`: {
`AM`: true,
`RP`: true,
`SO`: true,
`WR`: true},
`0283`: {
`A`: true,
`E`: true,
`P`: true,
`R`: true},
`0284`: {
`A`: true,
`E`: true,
`I`: true,
`O`: true},
`0285`: {},
`0286`: {
`CP`: true,
`PP`: true,
`RP`: true,
`RT`: true},
`0287`: {
`AD`: true,
`CO`: true,
`DE`: true,
`LI`: true,
`UC`: true,
`UN`: true,
`UP`: true},
`0288`: {},
`0289`: {},
`0292`: {
`1`: true,
`10`: true,
`11`: true,
`12`: true,
`13`: true,
`14`: true,
`15`: true,
`16`: true,
`17`: true,
`18`: true,
`19`: true,
`2`: true,
`20`: true,
`21`: true,
`22`: true,
`23`: true,
`24`: true,
`25`: true,
`26`: true,
`27`: true,
`28`: true,
`29`: true,
`3`: true,
`30`: true,
`31`: true,
`32`: true,
`33`: true,
`34`: true,
`35`: true,
`36`: true,
`37`: true,
`38`: true,
`39`: true,
`4`: true,
`40`: true,
`41`: true,
`42`: true,
`43`: true,
`44`: true,
`45`: true,
`46`: true,
`47`: true,
`48`: true,
`49`: true,
`5`: true,
`50`: true,
`51`: true,
`52`: true,
`53`: true,
`54`: true,
`55`: true,
`56`: true,
`57`: true,
`58`: true,
`59`: true,
`6`: true,
`60`: true,
`61`: true,
`62`: true,
`63`: true,
`64`: true,
`65`: true,
`66`: true,
`67`: true,
`68`: true,
`69`: true,
`7`: true,
`70`: true,
`71`: true,
`72`: true,
`73`: true,
`74`: true,
`75`: true,
`76`: true,
`77`: true,
`78`: true,
`79`: true,
`8`: true,
`80`: true,
`81`: true,
`82`: true,
`83`: true,
`84`: true,
`85`: true,
`86`: true,
`87`: true,
`88`: true,
`89`: true,
`9`: true,
`90`: true,
`91`: true,
`92`: true},
`0293`: {},
`0294`: {
`FRI`: true,
`MON`: true,
`PREFEND`: true,
`PREFSTART`: true,
`SAT`: true,
`SUN`: true,
`THU`: true,
`TUE`: true,
`WED`: true},
`0295`: {},
`0296`: {},
`0297`: {},
`0298`: {
`F`: true,
`P`: true},
`0300`: {},
`0301`: {
`DNS`: true,
`GUID`: true,
`HCD`: true,
`HL7`: true,
`ISO`: true,
`L`: true,
`M`: true,
`N`: true,
`Random`: true,
`UUID`: true,
`x400`: true,
`x500`: true},
`0302`: {},
`0303`: {},
`0304`: {},
`0305`: {},
`0306`: {},
`0307`: {},
`0308`: {},
`0309`: {
`B`: true,
`H`: true,
`P`: true},
`0311`: {
`O`: true,
`P`: true,
`T`: true,
`U`: true},
`0312`: {},
`0313`: {},
`0315`: {
`F`: true,
`I`: true,
`N`: true,
`U`: true,
`Y`: true},
`0316`: {
`F`: true,
`I`: true,
`U`: true,
`Y`: true},
`0319`: {},
`0320`: {},
`0321`: {
`AD`: true,
`F`: true,
`TR`: true,
`UD`: true},
`0322`: {
`CP`: true,
`NA`: true,
`PA`: true,
`RE`: true},
`0323`: {
`A`: true,
`D`: true,
`U`: true},
`0324`: {
`GEN`: true,
`IMP`: true,
`INF`: true,
`LCR`: true,
`LIC`: true,
`OVR`: true,
`PRL`: true,
`SET`: true,
`SHA`: true,
`SMK`: true,
`STF`: true,
`TEA`: true},
`0325`: {
`ALI`: true,
`DTY`: true,
`LAB`: true,
`LB2`: true,
`PAR`: true,
`RX`: true,
`RX2`: true},
`0326`: {
`A`: true,
`V`: true},
`0327`: {},
`0328`: {},
`0329`: {
`A`: true,
`E`: true},
`0330`: {
`510E`: true,
`510K`: true,
`522S`: true,
`PMA`: true,
`PRE`: true,
`TXN`: true},
`0331`: {
`A`: true,
`D`: true,
`M`: true,
`U`: true},
`0332`: {
`A`: true,
`I`: true},
`0333`: {
`M`: true,
`SD`: true,
`SU`: true},
`0334`: {
`AP`: true,
`GT`: true,
`IN`: true,
`PT`: true},
`0335`: {},
`0336`: {},
`0337`: {
`C`: true,
`E`: true},
`0338`: {
`CY`: true,
`DEA`: true,
`GL`: true,
`L&I`: true,
`MCD`: true,
`MCR`: true,
`QA`: true,
`SL`: true,
`TAX`: true,
`TRL`: true,
`UPIN`: true},
`0339`: {
`1`: true,
`2`: true,
`3`: true,
`4`: true},
`0340`: {},
`0341`: {},
`0342`: {},
`0343`: {},
`0344`: {
`01`: true,
`02`: true,
`03`: true,
`04`: true,
`05`: true,
`06`: true,
`07`: true,
`08`: true,
`09`: true,
`10`: true,
`11`: true,
`12`: true,
`13`: true,
`14`: true,
`15`: true,
`16`: true,
`17`: true,
`18`: true,
`19`: true},
`0345`: {},
`0346`: {},
`0347`: {},
`0348`: {
`01`: true,
`02`: true,
`03`: true,
`04`: true,
`05`: true,
`06`: true,
`07`: true,
`08`: true},
`0349`: {
`1`: true,
`2`: true,
`3`: true,
`4`: true,
`5`: true},
`0350`: {
`01`: true,
`02`: true,
`03`: true,
`04`: true,
`05`: true,
`06`: true,
`09`: true,
`10`: true,
`11`: true,
`12`: true,
`17`: true,
`18`: true,
`19`: true,
`20`: true,
`21`: true,
`22`: true,
`24`: true,
`25`: true,
`26`: true,
`27`: true,
`28`: true,
`29`: true,
`30`: true,
`31`: true,
`32`: true,
`33`: true,
`34`: true,
`35`: true,
`36`: true,
`37`: true,
`40`: true,
`41`: true,
`42`: true,
`43`: true,
`44`: true,
`45`: true,
`46`: true,
`47 ... 49`: true,
`50`: true,
`51`: true,
`70 ... 99`: true,
`A1`: true,
`A2`: true,
`A3`: true},
`0351`: {
`70`: true,
`71`: true,
`72`: true,
`73`: true,
`74`: true,
`75`: true,
`76`: true,
`77`: true,
`78`: true,
`79`: true,
`M0`: true},
`0354`: {
`ADT_A01`: true,
`ADT_A02`: true,
`ADT_A03`: true,
`ADT_A06`: true,
`ADT_A09`: true,
`ADT_A12`: true,
`ADT_A16`: true,
`ADT_A17`: true,
`ADT_A18`: true,
`ADT_A20`: true,
`ADT_A24`: true,
`ADT_A28`: true,
`ADT_A30`: true,
`ADT_A37`: true,
`ADT_A38`: true,
`ADT_A39`: true,
`ADT_A43`: true,
`ADT_A45`: true,
`ADT_A50`: true,
`ARD_A19`: true,
`BAR_P01`: true,
`BAR_P02`: true,
`BAR_P06`: true,
`CRM_C01`: true,
`CSU_C09`: true,
`DFT_P03`: true,
`DOC_T12`: true,
`DSR_Q01`: true,
`DSR_Q03`: true,
`EDR_R07`: true,
`EQQ_Q04`: true,
`ERP_R09`: true,
`MDM_T01`: true,
`MDM_T02`: true,
`MFD_P09`: true,
`MFK_M01`: true,
`MFN_M01`: true,
`MFN_M02`: true,
`MFN_M03`: true,
`MFN_M05`: true,
`MFN_M06`: true,
`MFN_M07`: true,
`MFN_M08`: true,
`MFN_M09`: true,
`MFN_M10`: true,
`MFN_M11`: true,
`ORF_R02`: true,
`ORM__O01`: true,
`ORM_Q06`: true,
`ORR_O02`: true,
`ORR_Q06`: true,
`ORU_R01`: true,
`ORU_W01`: true,
`OSQ_Q06`: true,
`OSR_Q06`: true,
`PEX_P07`: true,
`PGL_PC6`: true,
`PIN_107`: true,
`PPG_PCG`: true,
`PPP_PCB`: true,
`PPR_PC1`: true,
`PPT_PCL`: true,
`PPV_PCA`: true,
`PRR_PC5`: true,
`PTR_PCF`: true,
`QCK_Q02`: true,
`QRY_A19`: true,
`QRY_PC4`: true,
`QRY_Q01`: true,
`QRY_Q02`: true,
`QRY_R02`: true,
`QRY_T12`: true,
`RAR_RAR`: true,
`RAS_O01`: true,
`RAS_O02`: true,
`RCI_I05`: true,
`RCL_I06`: true,
`RDE_O01`: true,
`RDR_RDR`: true,
`RDS_O01`: true,
`REF_I12`: true,
`RER_RER`: true,
`RGR_RGR`: true,
`RGV_O01`: true,
`RPA_I08`: true,
`RPI_I0I`: true,
`RPL_I02`: true,
`RPR_I03`: true,
`RQA_I08`: true,
`RQC_I05`: true,
`RQC_I06`: true,
`RQI_I0I`: true,
`RQP_I04`: true,
`RQQ_Q09`: true,
`RRA_O02`: true,
`RRD_O02`: true,
`RRE_O01`: true,
`RRG_O02`: true,
`RRI_I12`: true,
`RROR_ROR`: true,
`SIIU_S12`: true,
`SPQ_Q08`: true,
`SQM_S25`: true,
`SQR_S25`: true,
`SRM_S01`: true,
`SRM_T12`: true,
`SRR_S01`: true,
`SRR_T12`: true,
`SUR_P09`: true,
`TBR_R09`: true,
`UDM_Q05`: true,
`VQQ_Q07`: true,
`VXQ_V01`: true,
`VXR_V03`: true,
`VXU_V04`: true,
`VXX_V02`: true},
`0355`: {
`CE`: true,
`PL`: true},
`0356`: {
`<null>`: true,
`2.3`: true,
`ISO 2022-1994`: true},
`0357`: {
`0`: true,
`100`: true,
`101`: true,
`102`: true,
`103`: true,
`200`: true,
`201`: true,
`202`: true,
`203`: true,
`204`: true,
`205`: true,
`206`: true,
`207`: true},
`0359`: {
`0`: true,
`1`: true,
`2`: true},
`0360`: {
`AA`: true,
`AAS`: true,
`ABA`: true,
`AE`: true,
`AS`: true,
`BA`: true,
`BBA`: true,
`BE`: true,
`BFA`: true,
`BN`: true,
`BS`: true,
`BSL`: true,
`BT`: true,
`CER`: true,
`DBA`: true,
`DED`: true,
`DIP`: true,
`DO`: true,
`HS`: true,
`JD`: true,
`MA`: true,
`MBA`: true,
`MCE`: true,
`MD`: true,
`MDI`: true,
`ME`: true,
`MED`: true,
`MEE`: true,
`MFA`: true,
`MME`: true,
`MS`: true,
`MSL`: true,
`MT`: true,
`NG`: true,
`PHD`: true,
`PHE`: true,
`PHS`: true,
`SEC`: true,
`TS`: true},
`0361`: {},
`0362`: {},
`0364`: {
`1R`: true,
`2R`: true,
`AI`: true,
`DR`: true,
`GI`: true,
`GR`: true,
`PI`: true,
`RE`: true},
`4000`: {
`A`: true,
`I`: true,
`P`: true},
`City`: {
`Albuquerque`: true,
`Arlington`: true,
`Atlanta`: true,
`Austin`: true,
`Baltimore`: true,
`Boston`: true,
`Charlotte`: true,
`Chicago`: true,
`Cleveland`: true,
`Colorado Springs`: true,
`Columbus`: true,
`Dallas`: true,
`Denver`: true,
`Detroit`: true,
`El Paso`: true,
`Fort Worth`: true,
`Fresno`: true,
`Honolulu`: true,
`Houston`: true,
`Indianapolis`: true,
`Jacksonville`: true,
`Kansas City`: true,
`Las Vegas`: true,
`Long Beach`: true,
`Los Angeles`: true,
`Louisville-Jefferson County`: true,
`Memphis`: true,
`Mesa`: true,
`Miami`: true,
`Milwaukee`: true,
`Minneapolis`: true,
`Nashville-Davidson`: true,
`New York`: true,
`Oakland`: true,
`Oklahoma City`: true,
`Omaha`: true,
`Philadelphia`: true,
`Phoenix`: true,
`Portland`: true,
`Raleigh`: true,
`Sacramento`: true,
`San Antonio`: true,
`San Diego`: true,
`San Francisco`: true,
`San Jose`: true,
`Seattle`: true,
`Tucson`: true,
`Tulsa`: true,
`Virginia Beach`: true,
`Washington`: true},
`FirstName`: {
`Aaron`: true,
`Abby`: true,
`Abe`: true,
`Abel`: true,
`Abigail`: true,
`Abraham`: true,
`Ada`: true,
`Adam`: true,
`Addie`: true,
`Adela`: true,
`Adele`: true,
`Adolfo`: true,
`Adolph`: true,
`Adolphus`: true,
`Adrian`: true,
`Adrienne`: true,
`Agnes`: true,
`Agustin`: true,
`Aida`: true,
`Aileen`: true,
`Aimee`: true,
`Al`: true,
`Alan`: true,
`Alana`: true,
`Albert`: true,
`Alberta`: true,
`Alberto`: true,
`Alden`: true,
`Alejandro`: true,
`Aleta`: true,
`Aletha`: true,
`Alex`: true,
`Alexander`: true,
`Alexandra`: true,
`Alexis`: true,
`Alfonso`: true,
`Alfonzo`: true,
`Alford`: true,
`Alfred`: true,
`Alfreda`: true,
`Alfredo`: true,
`Alice`: true,
`Alicia`: true,
`Alisa`: true,
`Alison`: true,
`Allan`: true,
`Allen`: true,
`Allison`: true,
`Allyn`: true,
`Alma`: true,
`Alonzo`: true,
`Alphonse`: true,
`Alphonso`: true,
`Alta`: true,
`Althea`: true,
`Alton`: true,
`Alva`: true,
`Alvin`: true,
`Alyce`: true,
`Amanda`: true,
`Amber`: true,
`Amelia`: true,
`Amos`: true,
`Amy`: true,
`Ana`: true,
`Anderson`: true,
`Andre`: true,
`Andrea`: true,
`Andres`: true,
`Andrew`: true,
`Andy`: true,
`Angel`: true,
`Angela`: true,
`Angelia`: true,
`Angelina`: true,
`Angeline`: true,
`Angelita`: true,
`Angelo`: true,
`Angie`: true,
`Anita`: true,
`Ann`: true,
`Anna`: true,
`Anne`: true,
`Annemarie`: true,
`Annetta`: true,
`Annette`: true,
`Annie`: true,
`Annmarie`: true,
`Anthony`: true,
`Antionette`: true,
`Antoinette`: true,
`Anton`: true,
`Antonia`: true,
`Antonio`: true,
`April`: true,
`Archie`: true,
`Arden`: true,
`Arleen`: true,
`Arlen`: true,
`Arlene`: true,
`Arlie`: true,
`Armand`: true,
`Armando`: true,
`Arnold`: true,
`Arnulfo`: true,
`Art`: true,
`Arthur`: true,
`Artie`: true,
`Artis`: true,
`Arturo`: true,
`Ashley`: true,
`Athena`: true,
`Aubrey`: true,
`Audie`: true,
`Audrey`: true,
`August`: true,
`Augustine`: true,
`Augustus`: true,
`Aurelio`: true,
`Aurora`: true,
`Austin`: true,
`Ava`: true,
`Avery`: true,
`Avis`: true,
`Bambi`: true,
`Barbara`: true,
`Barbra`: true,
`Barney`: true,
`Barrett`: true,
`Barry`: true,
`Bart`: true,
`Barton`: true,
`Basil`: true,
`Beatrice`: true,
`Becky`: true,
`Belinda`: true,
`Ben`: true,
`Benedict`: true,
`Benita`: true,
`Benito`: true,
`Benjamin`: true,
`Bennett`: true,
`Bennie`: true,
`Benny`: true,
`Benton`: true,
`Bernadette`: true,
`Bernadine`: true,
`Bernard`: true,
`Bernice`: true,
`Bernie`: true,
`Berry`: true,
`Bert`: true,
`Bertha`: true,
`Bertram`: true,
`Beryl`: true,
`Bessie`: true,
`Beth`: true,
`Bethany`: true,
`Betsy`: true,
`Bette`: true,
`Bettie`: true,
`Betty`: true,
`Bettye`: true,
`Beulah`: true,
`Beverley`: true,
`Beverly`: true,
`Bill`: true,
`Billie`: true,
`Billy`: true,
`Blaine`: true,
`Blair`: true,
`Blake`: true,
`Blanca`: true,
`Blanche`: true,
`Blane`: true,
`Bob`: true,
`Bobbi`: true,
`Bobbie`: true,
`Bobby`: true,
`Bonita`: true,
`Bonnie`: true,
`Bonny`: true,
`Booker`: true,
`Boyce`: true,
`Boyd`: true,
`Brad`: true,
`Bradford`: true,
`Bradley`: true,
`Bradly`: true,
`Brady`: true,
`Brandon`: true,
`Brant`: true,
`Brenda`: true,
`Brendan`: true,
`Brent`: true,
`Bret`: true,
`Brett`: true,
`Brian`: true,
`Brice`: true,
`Bridget`: true,
`Britt`: true,
`Brooks`: true,
`Bruce`: true,
`Bruno`: true,
`Bryan`: true,
`Bryant`: true,
`Bryce`: true,
`Bryon`: true,
`Bud`: true,
`Buddy`: true,
`Buford`: true,
`Burl`: true,
`Burt`: true,
`Burton`: true,
`Buster`: true,
`Butch`: true,
`Byron`: true,
`Callie`: true,
`Calvin`: true,
`Cameron`: true,
`Camilla`: true,
`Camille`: true,
`Candace`: true,
`Candice`: true,
`Candy`: true,
`Cara`: true,
`Caren`: true,
`Carey`: true,
`Carl`: true,
`Carla`: true,
`Carleen`: true,
`Carlene`: true,
`Carleton`: true,
`Carlo`: true,
`Carlos`: true,
`Carlotta`: true,
`Carlton`: true,
`Carmel`: true,
`Carmela`: true,
`Carmella`: true,
`Carmelo`: true,
`Carmen`: true,
`Carmine`: true,
`Carnell`: true,
`Carol`: true,
`Carole`: true,
`Carolina`: true,
`Caroline`: true,
`Carolyn`: true,
`Caron`: true,
`Carrie`: true,
`Carroll`: true,
`Carson`: true,
`Carter`: true,
`Cary`: true,
`Caryl`: true,
`Caryn`: true,
`Casey`: true,
`Cassandra`: true,
`Catharine`: true,
`Catherine`: true,
`Cathey`: true,
`Cathie`: true,
`Cathleen`: true,
`Cathrine`: true,
`Cathryn`: true,
`Cathy`: true,
`Cecelia`: true,
`Cecil`: true,
`Cecile`: true,
`Cecilia`: true,
`Cedric`: true,
`Celeste`: true,
`Celestine`: true,
`Celia`: true,
`Cesar`: true,
`Chad`: true,
`Charla`: true,
`Charleen`: true,
`Charlene`: true,
`Charles`: true,
`Charley`: true,
`Charlie`: true,
`Charlotte`: true,
`Charmaine`: true,
`Chauncey`: true,
`Cheri`: true,
`Cherie`: true,
`Cherri`: true,
`Cherrie`: true,
`Cherry`: true,
`Cheryl`: true,
`Cheryle`: true,
`Cheryll`: true,
`Chester`: true,
`Chip`: true,
`Chris`: true,
`Christa`: true,
`Christi`: true,
`Christian`: true,
`Christie`: true,
`Christina`: true,
`Christine`: true,
`Christophe`: true,
`Christopher`: true,
`Christy`: true,
`Chuck`: true,
`Cinda`: true,
`Cindi`: true,
`Cindy`: true,
`Clair`: true,
`Claire`: true,
`Clara`: true,
`Clare`: true,
`Clarence`: true,
`Clarice`: true,
`Clarissa`: true,
`Clark`: true,
`Clarke`: true,
`Claud`: true,
`Claude`: true,
`Claudette`: true,
`Claudia`: true,
`Clay`: true,
`Clayton`: true,
`Clement`: true,
`Cleo`: true,
`Cletus`: true,
`Cleve`: true,
`Cleveland`: true,
`Cliff`: true,
`Clifford`: true,
`Clifton`: true,
`Clint`: true,
`Clinton`: true,
`Clyde`: true,
`Cody`: true,
`Cole`: true,
`Coleen`: true,
`Coleman`: true,
`Colette`: true,
`Colin`: true,
`Colleen`: true,
`Collette`: true,
`Columbus`: true,
`Concetta`: true,
`Connie`: true,
`Conrad`: true,
`Constance`: true,
`Consuelo`: true,
`Cora`: true,
`Cordell`: true,
`Corey`: true,
`Corine`: true,
`Corinne`: true,
`Corliss`: true,
`Cornelia`: true,
`Cornelius`: true,
`Cornell`: true,
`Corrine`: true,
`Cory`: true,
`Courtney`: true,
`Coy`: true,
`Craig`: true,
`Cris`: true,
`Cristina`: true,
`Cruz`: true,
`Crystal`: true,
`Curt`: true,
`Curtis`: true,
`Curtiss`: true,
`Cynthia`: true,
`Cyril`: true,
`Cyrus`: true,
`Daisy`: true,
`Dale`: true,
`Dallas`: true,
`Dalton`: true,
`Damian`: true,
`Damon`: true,
`Dan`: true,
`Dana`: true,
`Dane`: true,
`Danette`: true,
`Danial`: true,
`Daniel`: true,
`Danielle`: true,
`Danita`: true,
`Dann`: true,
`Danna`: true,
`Dannie`: true,
`Danny`: true,
`Dante`: true,
`Daphne`: true,
`Darcy`: true,
`Darell`: true,
`Daria`: true,
`Darius`: true,
`Darla`: true,
`Darleen`: true,
`Darlene`: true,
`Darnell`: true,
`Darold`: true,
`Darrel`: true,
`Darrell`: true,
`Darryl`: true,
`Darwin`: true,
`Daryl`: true,
`Daryle`: true,
`Dave`: true,
`Davey`: true,
`David`: true,
`Davie`: true,
`Davis`: true,
`Davy`: true,
`Dawn`: true,
`Dayna`: true,
`Dean`: true,
`Deana`: true,
`Deann`: true,
`Deanna`: true,
`Deanne`: true,
`Debbi`: true,
`Debbie`: true,
`Debbra`: true,
`Debby`: true,
`Debi`: true,
`Debora`: true,
`Deborah`: true,
`Debra`: true,
`Debrah`: true,
`Debroah`: true,
`Dee`: true,
`Deena`: true,
`Deidre`: true,
`Deirdre`: true,
`Del`: true,
`Delbert`: true,
`Delia`: true,
`Delilah`: true,
`Dell`: true,
`Della`: true,
`Delma`: true,
`Delmar`: true,
`Delmer`: true,
`Delois`: true,
`Delores`: true,
`Deloris`: true,
`Delphine`: true,
`Delton`: true,
`Demetrius`: true,
`Dena`: true,
`Denice`: true,
`Denis`: true,
`Denise`: true,
`Dennie`: true,
`Dennis`: true,
`Denny`: true,
`Denver`: true,
`Derek`: true,
`Derrell`: true,
`Derrick`: true,
`Desiree`: true,
`Desmond`: true,
`Dewayne`: true,
`Dewey`: true,
`Dewitt`: true,
`Dexter`: true,
`Dian`: true,
`Diana`: true,
`Diane`: true,
`Diann`: true,
`Dianna`: true,
`Dianne`: true,
`Dick`: true,
`Dickie`: true,
`Dina`: true,
`Dinah`: true,
`Dino`: true,
`Dirk`: true,
`Dixie`: true,
`Dollie`: true,
`Dolly`: true,
`Dolores`: true,
`Domenic`: true,
`Domingo`: true,
`Dominic`: true,
`Dominick`: true,
`Don`: true,
`Dona`: true,
`Donald`: true,
`Donell`: true,
`Donita`: true,
`Donn`: true,
`Donna`: true,
`Donnell`: true,
`Donnie`: true,
`Donny`: true,
`Donovan`: true,
`Dora`: true,
`Dorcas`: true,
`Doreen`: true,
`Dorene`: true,
`Doretha`: true,
`Dorian`: true,
`Dorinda`: true,
`Doris`: true,
`Dorothea`: true,
`Dorothy`: true,
`Dorsey`: true,
`Dorthy`: true,
`Dottie`: true,
`Doug`: true,
`Douglas`: true,
`Douglass`: true,
`Doyle`: true,
`Drew`: true,
`Duane`: true,
`Dudley`: true,
`Duke`: true,
`Duncan`: true,
`Dusty`: true,
`Duwayne`: true,
`Dwain`: true,
`Dwaine`: true,
`Dwayne`: true,
`Dwight`: true,
`Earl`: true,
`Earle`: true,
`Earlene`: true,
`Earline`: true,
`Earnest`: true,
`Earnestine`: true,
`Eartha`: true,
`Ed`: true,
`Eddie`: true,
`Eddy`: true,
`Edgar`: true,
`Edith`: true,
`Edmund`: true,
`Edna`: true,
`Eduardo`: true,
`Edward`: true,
`Edwardo`: true,
`Edwin`: true,
`Edwina`: true,
`Effie`: true,
`Efrain`: true,
`Eileen`: true,
`Elaine`: true,
`Elbert`: true,
`Eldon`: true,
`Eldridge`: true,
`Eleanor`: true,
`Elena`: true,
`Eli`: true,
`Elias`: true,
`Elijah`: true,
`Elisa`: true,
`Elisabeth`: true,
`Elise`: true,
`Eliseo`: true,
`Elissa`: true,
`Eliza`: true,
`Elizabeth`: true,
`Ella`: true,
`Ellen`: true,
`Elliot`: true,
`Elliott`: true,
`Ellis`: true,
`Elma`: true,
`Elmer`: true,
`Elmo`: true,
`Elnora`: true,
`Eloise`: true,
`Eloy`: true,
`Elroy`: true,
`Elsa`: true,
`Elsie`: true,
`Elton`: true,
`Elva`: true,
`Elvin`: true,
`Elvira`: true,
`Elvis`: true,
`Elwood`: true,
`Elyse`: true,
`Emanuel`: true,
`Emerson`: true,
`Emery`: true,
`Emil`: true,
`Emilio`: true,
`Emily`: true,
`Emma`: true,
`Emmanuel`: true,
`Emmett`: true,
`Emmitt`: true,
`Emory`: true,
`Enoch`: true,
`Enrique`: true,
`Eric`: true,
`Erica`: true,
`Erich`: true,
`Erick`: true,
`Erik`: true,
`Erin`: true,
`Erma`: true,
`Ernest`: true,
`Ernestine`: true,
`Ernesto`: true,
`Ernie`: true,
`Errol`: true,
`Ervin`: true,
`Erwin`: true,
`Esmeralda`: true,
`Esperanza`: true,
`Essie`: true,
`Esteban`: true,
`Estela`: true,
`Estella`: true,
`Estelle`: true,
`Ester`: true,
`Esther`: true,
`Ethel`: true,
`Etta`: true,
`Eugene`: true,
`Eugenia`: true,
`Eula`: true,
`Eunice`: true,
`Eva`: true,
`Evan`: true,
`Evangeline`: true,
`Eve`: true,
`Evelyn`: true,
`Everett`: true,
`Everette`: true,
`Ezra`: true,
`Faith`: true,
`Fannie`: true,
`Faron`: true,
`Farrell`: true,
`Fay`: true,
`Faye`: true,
`Federico`: true,
`Felecia`: true,
`Felicia`: true,
`Felipe`: true,
`Felix`: true,
`Felton`: true,
`Ferdinand`: true,
`Fern`: true,
`Fernando`: true,
`Fidel`: true,
`Fletcher`: true,
`Flora`: true,
`Florence`: true,
`Florine`: true,
`Floyd`: true,
`Forest`: true,
`Forrest`: true,
`Foster`: true,
`Fran`: true,
`Frances`: true,
`Francesca`: true,
`Francine`: true,
`Francis`: true,
`Francisco`: true,
`Frank`: true,
`Frankie`: true,
`Franklin`: true,
`Franklyn`: true,
`Fred`: true,
`Freda`: true,
`Freddie`: true,
`Freddy`: true,
`Frederic`: true,
`Frederick`: true,
`Fredric`: true,
`Fredrick`: true,
`Freeman`: true,
`Freida`: true,
`Frieda`: true,
`Fritz`: true,
`Gabriel`: true,
`Gail`: true,
`Gale`: true,
`Galen`: true,
`Garland`: true,
`Garold`: true,
`Garrett`: true,
`Garry`: true,
`Garth`: true,
`Gary`: true,
`Gavin`: true,
`Gay`: true,
`Gaye`: true,
`Gayla`: true,
`Gayle`: true,
`Gaylon`: true,
`Gaylord`: true,
`Gearld`: true,
`Geary`: true,
`Gena`: true,
`Gene`: true,
`Geneva`: true,
`Genevieve`: true,
`Geoffrey`: true,
`George`: true,
`Georgette`: true,
`Georgia`: true,
`Georgina`: true,
`Gerald`: true,
`Geraldine`: true,
`Geralyn`: true,
`Gerard`: true,
`Gerardo`: true,
`Geri`: true,
`Gerri`: true,
`Gerry`: true,
`Gertrude`: true,
`Gil`: true,
`Gilbert`: true,
`Gilberto`: true,
`Gilda`: true,
`Giles`: true,
`Gina`: true,
`Ginger`: true,
`Gino`: true,
`Gisele`: true,
`Gladys`: true,
`Glen`: true,
`Glenda`: true,
`Glenn`: true,
`Glenna`: true,
`Glinda`: true,
`Gloria`: true,
`Glynn`: true,
`Goldie`: true,
`Gordon`: true,
`Grace`: true,
`Gracie`: true,
`Graciela`: true,
`Grady`: true,
`Graham`: true,
`Grant`: true,
`Greg`: true,
`Gregg`: true,
`Greggory`: true,
`Gregorio`: true,
`Gregory`: true,
`Greta`: true,
`Gretchen`: true,
`Grover`: true,
`Guadalupe`: true,
`Guillermo`: true,
`Gus`: true,
`Gustavo`: true,
`Guy`: true,
`Gwen`: true,
`Gwendolyn`: true,
`Hal`: true,
`Hank`: true,
`Hannah`: true,
`Hans`: true,
`Harlan`: true,
`Harley`: true,
`Harmon`: true,
`Harold`: true,
`Harriet`: true,
`Harriett`: true,
`Harris`: true,
`Harrison`: true,
`Harry`: true,
`Harvey`: true,
`Hattie`: true,
`Hayward`: true,
`Haywood`: true,
`Hazel`: true,
`Heather`: true,
`Hector`: true,
`Heidi`: true,
`Helen`: true,
`Helena`: true,
`Helene`: true,
`Henrietta`: true,
`Henry`: true,
`Herbert`: true,
`Heriberto`: true,
`Herman`: true,
`Herschel`: true,
`Hershel`: true,
`Hilary`: true,
`Hilda`: true,
`Hilton`: true,
`Hiram`: true,
`Hollis`: true,
`Holly`: true,
`Homer`: true,
`Hope`: true,
`Horace`: true,
`Hosea`: true,
`Houston`: true,
`Howard`: true,
`Hoyt`: true,
`Hubert`: true,
`Huey`: true,
`Hugh`: true,
`Hugo`: true,
`Humberto`: true,
`Ian`: true,
`Ida`: true,
`Ignacio`: true,
`Ike`: true,
`Ilene`: true,
`Imogene`: true,
`Ina`: true,
`Inez`: true,
`Ingrid`: true,
`Ira`: true,
`Irene`: true,
`Iris`: true,
`Irma`: true,
`Irvin`: true,
`Irving`: true,
`Irwin`: true,
`Isaac`: true,
`Isabel`: true,
`Isaiah`: true,
`Isiah`: true,
`Ismael`: true,
`Israel`: true,
`Issac`: true,
`Iva`: true,
`Ivan`: true,
`Ivory`: true,
`Ivy`: true,
`Jacalyn`: true,
`Jack`: true,
`Jackie`: true,
`Jacklyn`: true,
`Jackson`: true,
`Jacky`: true,
`Jacob`: true,
`Jacque`: true,
`Jacqueline`: true,
`Jacquelyn`: true,
`Jacques`: true,
`Jacquline`: true,
`Jaime`: true,
`Jake`: true,
`Jame`: true,
`James`: true,
`Jamie`: true,
`Jan`: true,
`Jana`: true,
`Jane`: true,
`Janeen`: true,
`Janell`: true,
`Janelle`: true,
`Janet`: true,
`Janette`: true,
`Janice`: true,
`Janie`: true,
`Janine`: true,
`Janis`: true,
`Jann`: true,
`Janna`: true,
`Jannette`: true,
`Jannie`: true,
`Jared`: true,
`Jarvis`: true,
`Jason`: true,
`Jasper`: true,
`Javier`: true,
`Jay`: true,
`Jaye`: true,
`Jayne`: true,
`Jean`: true,
`Jeanette`: true,
`Jeanie`: true,
`Jeanine`: true,
`Jeanne`: true,
`Jeannette`: true,
`Jeannie`: true,
`Jeannine`: true,
`Jed`: true,
`Jeff`: true,
`Jefferey`: true,
`Jefferson`: true,
`Jeffery`: true,
`Jeffry`: true,
`Jenifer`: true,
`Jennie`: true,
`Jennifer`: true,
`Jenny`: true,
`Jerald`: true,
`Jere`: true,
`Jeremiah`: true,
`Jeremy`: true,
`Jeri`: true,
`Jerilyn`: true,
`Jerold`: true,
`Jerome`: true,
`Jerri`: true,
`Jerrie`: true,
`Jerrold`: true,
`Jerry`: true,
`Jeryl`: true,
`Jess`: true,
`Jesse`: true,
`Jessica`: true,
`Jessie`: true,
`Jesus`: true,
`Jewel`: true,
`Jewell`: true,
`Jill`: true,
`Jim`: true,
`Jimmie`: true,
`Jimmy`: true,
`Jo`: true,
`Joan`: true,
`Joanie`: true,
`Joann`: true,
`Joanna`: true,
`Joanne`: true,
`Joaquin`: true,
`Jocelyn`: true,
`Jodi`: true,
`Jodie`: true,
`Jody`: true,
`Joe`: true,
`Joel`: true,
`Joellen`: true,
`Joesph`: true,
`Joette`: true,
`Joey`: true,
`Johanna`: true,
`John`: true,
`Johnathan`: true,
`Johnie`: true,
`Johnnie`: true,
`Johnny`: true,
`Joleen`: true,
`Jolene`: true,
`Jon`: true,
`Jonas`: true,
`Jonathan`: true,
`Jonathon`: true,
`Joni`: true,
`Jordan`: true,
`Jorge`: true,
`Jose`: true,
`Josefina`: true,
`Joseph`: true,
`Josephine`: true,
`Joshua`: true,
`Josie`: true,
`Joy`: true,
`Joyce`: true,
`Joycelyn`: true,
`Juan`: true,
`Juana`: true,
`Juanita`: true,
`Jude`: true,
`Judi`: true,
`Judith`: true,
`Judson`: true,
`Judy`: true,
`Jules`: true,
`Julia`: true,
`Julian`: true,
`Juliana`: true,
`Juliann`: true,
`Julianne`: true,
`Julie`: true,
`Juliet`: true,
`Juliette`: true,
`Julio`: true,
`Julius`: true,
`June`: true,
`Junior`: true,
`Justin`: true,
`Justine`: true,
`Kandy`: true,
`Karan`: true,
`Karen`: true,
`Kari`: true,
`Karin`: true,
`Karl`: true,
`Karla`: true,
`Karol`: true,
`Karon`: true,
`Karyn`: true,
`Kate`: true,
`Kathaleen`: true,
`Katharine`: true,
`Katherine`: true,
`Katheryn`: true,
`Kathi`: true,
`Kathie`: true,
`Kathleen`: true,
`Kathrine`: true,
`Kathryn`: true,
`Kathy`: true,
`Katie`: true,
`Katrina`: true,
`Kay`: true,
`Kaye`: true,
`Keith`: true,
`Kelley`: true,
`Kelly`: true,
`Kelvin`: true,
`Ken`: true,
`Kendall`: true,
`Kendra`: true,
`Kenneth`: true,
`Kennith`: true,
`Kenny`: true,
`Kent`: true,
`Kenton`: true,
`Kermit`: true,
`Kerri`: true,
`Kerry`: true,
`Kevan`: true,
`Keven`: true,
`Kevin`: true,
`Kim`: true,
`Kimberlee`: true,
`Kimberley`: true,
`Kimberly`: true,
`King`: true,
`Kip`: true,
`Kirby`: true,
`Kirk`: true,
`Kirt`: true,
`Kit`: true,
`Kitty`: true,
`Kraig`: true,
`Kris`: true,
`Krista`: true,
`Kristen`: true,
`Kristi`: true,
`Kristie`: true,
`Kristin`: true,
`Kristina`: true,
`Kristine`: true,
`Kristy`: true,
`Kurt`: true,
`Kurtis`: true,
`Kyle`: true,
`Lacy`: true,
`Ladonna`: true,
`Lafayette`: true,
`Lamar`: true,
`Lamont`: true,
`Lana`: true,
`Lance`: true,
`Lane`: true,
`Lanette`: true,
`Lanny`: true,
`Larry`: true,
`Laura`: true,
`Laureen`: true,
`Laurel`: true,
`Lauren`: true,
`Laurence`: true,
`Laurene`: true,
`Lauretta`: true,
`Lauri`: true,
`Laurie`: true,
`Lavern`: true,
`Laverne`: true,
`Lavonne`: true,
`Lawanda`: true,
`Lawerence`: true,
`Lawrence`: true,
`Layne`: true,
`Lea`: true,
`Leah`: true,
`Leander`: true,
`Leann`: true,
`Leanna`: true,
`Leanne`: true,
`Lee`: true,
`Leeann`: true,
`Leigh`: true,
`Leila`: true,
`Lela`: true,
`Leland`: true,
`Lelia`: true,
`Lemuel`: true,
`Len`: true,
`Lena`: true,
`Lenard`: true,
`Lennie`: true,
`Lenny`: true,
`Lenora`: true,
`Lenore`: true,
`Leo`: true,
`Leola`: true,
`Leon`: true,
`Leona`: true,
`Leonard`: true,
`Leonardo`: true,
`Leroy`: true,
`Les`: true,
`Lesa`: true,
`Leslee`: true,
`Lesley`: true,
`Leslie`: true,
`Lessie`: true,
`Lester`: true,
`Leta`: true,
`Letha`: true,
`Leticia`: true,
`Letitia`: true,
`Levern`: true,
`Levi`: true,
`Levon`: true,
`Lewis`: true,
`Lex`: true,
`Libby`: true,
`Lila`: true,
`Lillian`: true,
`Lillie`: true,
`Lilly`: true,
`Lily`: true,
`Lincoln`: true,
`Linda`: true,
`Lindsay`: true,
`Lindsey`: true,
`Lindy`: true,
`Linnea`: true,
`Linwood`: true,
`Lionel`: true,
`Lisa`: true,
`Lise`: true,
`Lizabeth`: true,
`Lizzie`: true,
`Lloyd`: true,
`Logan`: true,
`Lois`: true,
`Lola`: true,
`Lolita`: true,
`Lon`: true,
`Lona`: true,
`Lonnie`: true,
`Lonny`: true,
`Lora`: true,
`Loraine`: true,
`Lorelei`: true,
`Loren`: true,
`Lorena`: true,
`Lorene`: true,
`Lorenzo`: true,
`Loretta`: true,
`Lori`: true,
`Lorie`: true,
`Lorin`: true,
`Lorinda`: true,
`Lorna`: true,
`Lorraine`: true,
`Lorri`: true,
`Lorrie`: true,
`Lottie`: true,
`Lou`: true,
`Louann`: true,
`Louella`: true,
`Louie`: true,
`Louis`: true,
`Louisa`: true,
`Louise`: true,
`Lourdes`: true,
`Lowell`: true,
`Loyd`: true,
`Lu`: true,
`Luann`: true,
`Luanne`: true,
`Lucia`: true,
`Lucille`: true,
`Lucinda`: true,
`Lucius`: true,
`Lucretia`: true,
`Lucy`: true,
`Luella`: true,
`Luis`: true,
`Luke`: true,
`Lula`: true,
`Lupe`: true,
`Luther`: true,
`Luz`: true,
`Lydia`: true,
`Lyle`: true,
`Lyman`: true,
`Lyn`: true,
`Lynda`: true,
`Lyndon`: true,
`Lynette`: true,
`Lynn`: true,
`Lynne`: true,
`Lynnette`: true,
`Lynwood`: true,
`Mabel`: true,
`Mable`: true,
`Mac`: true,
`Mack`: true,
`Madeleine`: true,
`Madeline`: true,
`Madelyn`: true,
`Madonna`: true,
`Mae`: true,
`Magdalena`: true,
`Maggie`: true,
`Major`: true,
`Malcolm`: true,
`Malinda`: true,
`Mamie`: true,
`Manuel`: true,
`Mara`: true,
`Marc`: true,
`Marcel`: true,
`Marcella`: true,
`Marci`: true,
`Marcia`: true,
`Marcie`: true,
`Marco`: true,
`Marcos`: true,
`Marcus`: true,
`Marcy`: true,
`Margaret`: true,
`Margarita`: true,
`Margarito`: true,
`Margery`: true,
`Margie`: true,
`Margo`: true,
`Margot`: true,
`Margret`: true,
`Marguerite`: true,
`Mari`: true,
`Maria`: true,
`Marian`: true,
`Mariann`: true,
`Marianna`: true,
`Marianne`: true,
`Maribeth`: true,
`Marie`: true,
`Marietta`: true,
`Marilee`: true,
`Marilyn`: true,
`Marilynn`: true,
`Marina`: true,
`Mario`: true,
`Marion`: true,
`Marita`: true,
`Marjorie`: true,
`Mark`: true,
`Marla`: true,
`Marlene`: true,
`Marlin`: true,
`Marlon`: true,
`Marlys`: true,
`Marsha`: true,
`Marshall`: true,
`Marta`: true,
`Martha`: true,
`Martin`: true,
`Martina`: true,
`Marty`: true,
`Marva`: true,
`Marvin`: true,
`Mary`: true,
`Maryann`: true,
`Maryanne`: true,
`Marybeth`: true,
`Maryellen`: true,
`Maryjane`: true,
`Maryjo`: true,
`Marylou`: true,
`Mason`: true,
`Mathew`: true,
`Matilda`: true,
`Matt`: true,
`Matthew`: true,
`Mattie`: true,
`Maura`: true,
`Maureen`: true,
`Maurice`: true,
`Mavis`: true,
`Max`: true,
`Maxine`: true,
`Maxwell`: true,
`May`: true,
`Maynard`: true,
`Mckinley`: true,
`Megan`: true,
`Mel`: true,
`Melanie`: true,
`Melba`: true,
`Melinda`: true,
`Melissa`: true,
`Melodee`: true,
`Melodie`: true,
`Melody`: true,
`Melva`: true,
`Melvin`: true,
`Mercedes`: true,
`Meredith`: true,
`Merle`: true,
`Merlin`: true,
`Merri`: true,
`Merrill`: true,
`Merry`: true,
`Mervin`: true,
`Meryl`: true,
`Michael`: true,
`Michal`: true,
`Michale`: true,
`Micheal`: true,
`Michel`: true,
`Michele`: true,
`Michelle`: true,
`Mickey`: true,
`Mickie`: true,
`Micky`: true,
`Migdalia`: true,
`Miguel`: true,
`Mike`: true,
`Mikel`: true,
`Milagros`: true,
`Milan`: true,
`Mildred`: true,
`Miles`: true,
`Milford`: true,
`Millard`: true,
`Millicent`: true,
`Millie`: true,
`Milo`: true,
`Milton`: true,
`Mimi`: true,
`Mindy`: true,
`Minerva`: true,
`Minnie`: true,
`Miriam`: true,
`Mitch`: true,
`Mitchel`: true,
`Mitchell`: true,
`Mitzi`: true,
`Moira`: true,
`Moises`: true,
`Mollie`: true,
`Molly`: true,
`Mona`: true,
`Monica`: true,
`Monique`: true,
`Monroe`: true,
`Monte`: true,
`Monty`: true,
`Morgan`: true,
`Morris`: true,
`Mose`: true,
`Moses`: true,
`Muriel`: true,
`Murphy`: true,
`Murray`: true,
`Myles`: true,
`Myra`: true,
`Myrna`: true,
`Myron`: true,
`Myrtle`: true,
`Nadine`: true,
`Nan`: true,
`Nanci`: true,
`Nancy`: true,
`Nanette`: true,
`Nannette`: true,
`Naomi`: true,
`Napoleon`: true,
`Natalie`: true,
`Nathan`: true,
`Nathaniel`: true,
`Neal`: true,
`Ned`: true,
`Nedra`: true,
`Neil`: true,
`Nelda`: true,
`Nellie`: true,
`Nelson`: true,
`Nettie`: true,
`Neva`: true,
`Newton`: true,
`Nicholas`: true,
`Nick`: true,
`Nicki`: true,
`Nickolas`: true,
`Nicky`: true,
`Nicolas`: true,
`Nicole`: true,
`Nikki`: true,
`Nina`: true,
`Nita`: true,
`Noah`: true,
`Noe`: true,
`Noel`: true,
`Noemi`: true,
`Nola`: true,
`Nolan`: true,
`Nona`: true,
`Nora`: true,
`Norbert`: true,
`Noreen`: true,
`Norma`: true,
`Norman`: true,
`Normand`: true,
`Norris`: true,
`Odell`: true,
`Odessa`: true,
`Odis`: true,
`Ofelia`: true,
`Ola`: true,
`Olen`: true,
`Olga`: true,
`Olin`: true,
`Oliver`: true,
`Olivia`: true,
`Ollie`: true,
`Omar`: true,
`Opal`: true,
`Ophelia`: true,
`Ora`: true,
`Oralia`: true,
`Orlando`: true,
`Orval`: true,
`Orville`: true,
`Oscar`: true,
`Otha`: true,
`Otis`: true,
`Otto`: true,
`Owen`: true,
`Pablo`: true,
`Paige`: true,
`Pam`: true,
`Pamala`: true,
`Pamela`: true,
`Pamella`: true,
`Pasquale`: true,
`Pat`: true,
`Patrica`: true,
`Patrice`: true,
`Patricia`: true,
`Patrick`: true,
`Patsy`: true,
`Patti`: true,
`Pattie`: true,
`Patty`: true,
`Paul`: true,
`Paula`: true,
`Paulette`: true,
`Pauline`: true,
`Pearl`: true,
`Pearlie`: true,
`Pedro`: true,
`Peggie`: true,
`Peggy`: true,
`Penelope`: true,
`Pennie`: true,
`Penny`: true,
`Percy`: true,
`Perry`: true,
`Pete`: true,
`Peter`: true,
`Phil`: true,
`Philip`: true,
`Phoebe`: true,
`Phyllis`: true,
`Pierre`: true,
`Polly`: true,
`Porter`: true,
`Portia`: true,
`Preston`: true,
`Prince`: true,
`Priscilla`: true,
`Queen`: true,
`Quentin`: true,
`Quincy`: true,
`Quinton`: true,
`Rachael`: true,
`Rachel`: true,
`Rachelle`: true,
`Rae`: true,
`Rafael`: true,
`Raleigh`: true,
`Ralph`: true,
`Ramiro`: true,
`Ramon`: true,
`Ramona`: true,
`Rand`: true,
`Randal`: true,
`Randall`: true,
`Randel`: true,
`Randi`: true,
`Randle`: true,
`Randolf`: true,
`Randolph`: true,
`Randy`: true,
`Raphael`: true,
`Raquel`: true,
`Raul`: true,
`Ray`: true,
`Rayford`: true,
`Raymon`: true,
`Raymond`: true,
`Raymundo`: true,
`Reba`: true,
`Rebecca`: true,
`Rebekah`: true,
`Reed`: true,
`Regenia`: true,
`Reggie`: true,
`Regina`: true,
`Reginald`: true,
`Regis`: true,
`Reid`: true,
`Rena`: true,
`Renae`: true,
`Rene`: true,
`Renee`: true,
`Renita`: true,
`Reta`: true,
`Retha`: true,
`Reuben`: true,
`Reva`: true,
`Rex`: true,
`Reynaldo`: true,
`Reynold`: true,
`Rhea`: true,
`Rhett`: true,
`Rhoda`: true,
`Rhonda`: true,
`Ricardo`: true,
`Richard`: true,
`Rick`: true,
`Rickey`: true,
`Ricki`: true,
`Rickie`: true,
`Ricky`: true,
`Riley`: true,
`Rita`: true,
`Ritchie`: true,
`Rob`: true,
`Robbie`: true,
`Robbin`: true,
`Robby`: true,
`Robert`: true,
`Roberta`: true,
`Roberto`: true,
`Robin`: true,
`Robyn`: true,
`Rocco`: true,
`Rochelle`: true,
`Rock`: true,
`Rocky`: true,
`Rod`: true,
`Roderick`: true,
`Rodger`: true,
`Rodney`: true,
`Rodolfo`: true,
`Rodrick`: true,
`Rogelio`: true,
`Roger`: true,
`Rogers`: true,
`Roland`: true,
`Rolando`: true,
`Rolf`: true,
`Rolland`: true,
`Roman`: true,
`Romona`: true,
`Ron`: true,
`Rona`: true,
`Ronald`: true,
`Ronda`: true,
`Roni`: true,
`Ronna`: true,
`Ronnie`: true,
`Ronny`: true,
`Roosevelt`: true,
`Rory`: true,
`Rosa`: true,
`Rosalie`: true,
`Rosalind`: true,
`Rosalinda`: true,
`Rosalyn`: true,
`Rosanna`: true,
`Rosanne`: true,
`Rosario`: true,
`Roscoe`: true,
`Rose`: true,
`Roseann`: true,
`Roseanne`: true,
`Rosemarie`: true,
`Rosemary`: true,
`Rosendo`: true,
`Rosetta`: true,
`Rosie`: true,
`Rosita`: true,
`Roslyn`: true,
`Ross`: true,
`Rowena`: true,
`Rowland`: true,
`Roxane`: true,
`Roxann`: true,
`Roxanna`: true,
`Roxanne`: true,
`Roxie`: true,
`Roy`: true,
`Royal`: true,
`Royce`: true,
`Ruben`: true,
`Rubin`: true,
`Ruby`: true,
`Rudolfo`: true,
`Rudolph`: true,
`Rudy`: true,
`Rufus`: true,
`Russ`: true,
`Russel`: true,
`Russell`: true,
`Rusty`: true,
`Ruth`: true,
`Ruthie`: true,
`Ryan`: true,
`Sabrina`: true,
`Sadie`: true,
`Sallie`: true,
`Sally`: true,
`Salvador`: true,
`Salvatore`: true,
`Sam`: true,
`Sammie`: true,
`Sammy`: true,
`Samuel`: true,
`Sandi`: true,
`Sandra`: true,
`Sandy`: true,
`Sanford`: true,
`Santiago`: true,
`Santos`: true,
`Sara`: true,
`Sarah`: true,
`Saul`: true,
`Saundra`: true,
`Scot`: true,
`Scott`: true,
`Scottie`: true,
`Scotty`: true,
`Sean`: true,
`Selma`: true,
`Serena`: true,
`Sergio`: true,
`Seth`: true,
`Shane`: true,
`Shannon`: true,
`Sharen`: true,
`Shari`: true,
`Sharlene`: true,
`Sharon`: true,
`Sharron`: true,
`Shaun`: true,
`Shauna`: true,
`Shawn`: true,
`Sheila`: true,
`Sheilah`: true,
`Shelby`: true,
`Sheldon`: true,
`Shelia`: true,
`Shelley`: true,
`Shelly`: true,
`Shelton`: true,
`Sheree`: true,
`Sheri`: true,
`Sherie`: true,
`Sherman`: true,
`Sheron`: true,
`Sherree`: true,
`Sherri`: true,
`Sherrie`: true,
`Sherrill`: true,
`Sherry`: true,
`Sherryl`: true,
`Sherwood`: true,
`Sheryl`: true,
`Sheryll`: true,
`Shirlene`: true,
`Shirley`: true,
`Sidney`: true,
`Silas`: true,
`Silvia`: true,
`Simon`: true,
`Skip`: true,
`Solomon`: true,
`Sondra`: true,
`Sonia`: true,
`Sonja`: true,
`Sonny`: true,
`Sonya`: true,
`Sophia`: true,
`Sophie`: true,
`Spencer`: true,
`Stacey`: true,
`Stacy`: true,
`Stan`: true,
`Stanford`: true,
`Stanley`: true,
`Stanton`: true,
`Starla`: true,
`Stella`: true,
`Stephan`: true,
`Stephanie`: true,
`Stephen`: true,
`Sterling`: true,
`Stevan`: true,
`Steve`: true,
`Steven`: true,
`Stevie`: true,
`Stewart`: true,
`Stuart`: true,
`Sue`: true,
`Suellen`: true,
`Susan`: true,
`Susana`: true,
`Susanna`: true,
`Susanne`: true,
`Susie`: true,
`Suzan`: true,
`Suzann`: true,
`Suzanne`: true,
`Suzette`: true,
`Sybil`: true,
`Sydney`: true,
`Sylvester`: true,
`Sylvia`: true,
`Tad`: true,
`Talmadge`: true,
`Tamara`: true,
`Tami`: true,
`Tammy`: true,
`Tana`: true,
`Tanya`: true,
`Tara`: true,
`Taryn`: true,
`Taylor`: true,
`Ted`: true,
`Teddy`: true,
`Teena`: true,
`Tena`: true,
`Terence`: true,
`Teresa`: true,
`Terese`: true,
`Teressa`: true,
`Teri`: true,
`Terrance`: true,
`Terrell`: true,
`Terrence`: true,
`Terri`: true,
`Terrie`: true,
`Terry`: true,
`Thad`: true,
`Thaddeus`: true,
`Thea`: true,
`Theadore`: true,
`Thelma`: true,
`Theodis`: true,
`Theodore`: true,
`Theresa`: true,
`Therese`: true,
`Theron`: true,
`Thomas`: true,
`Thurman`: true,
`Tim`: true,
`Timmothy`: true,
`Timmy`: true,
`Timothy`: true,
`Tina`: true,
`Toby`: true,
`Tod`: true,
`Todd`: true,
`Tom`: true,
`Tomas`: true,
`Tommie`: true,
`Tommy`: true,
`Toney`: true,
`Toni`: true,
`Tonia`: true,
`Tony`: true,
`Tonya`: true,
`Tracey`: true,
`Tracy`: true,
`Travis`: true,
`Trena`: true,
`Trent`: true,
`Treva`: true,
`Tricia`: true,
`Trina`: true,
`Troy`: true,
`Trudy`: true,
`Truman`: true,
`Twila`: true,
`Twyla`: true,
`Ty`: true,
`Tyler`: true,
`Tyrone`: true,
`Ulysses`: true,
`Ursula`: true,
`Val`: true,
`Valarie`: true,
`Valentine`: true,
`Valeria`: true,
`Valerie`: true,
`Valorie`: true,
`Van`: true,
`Vance`: true,
`Vanessa`: true,
`Vaughn`: true,
`Velda`: true,
`Velma`: true,
`Venita`: true,
`Vera`: true,
`Vern`: true,
`Verna`: true,
`Verne`: true,
`Vernell`: true,
`Vernita`: true,
`Vernon`: true,
`Veronica`: true,
`Vicente`: true,
`Vickey`: true,
`Vicki`: true,
`Vickie`: true,
`Vicky`: true,
`Victor`: true,
`Victoria`: true,
`Vikki`: true,
`Vince`: true,
`Vincent`: true,
`Viola`: true,
`Violet`: true,
`Virgie`: true,
`Virgil`: true,
`Virginia`: true,
`Vito`: true,
`Vivian`: true,
`Von`: true,
`Vonda`: true,
`Wade`: true,
`Walker`: true,
`Wallace`: true,
`Wally`: true,
`Walter`: true,
`Wanda`: true,
`Ward`: true,
`Wardell`: true,
`Warner`: true,
`Warren`: true,
`Waymon`: true,
`Wayne`: true,
`Weldon`: true,
`Wendell`: true,
`Wendy`: true,
`Wesley`: true,
`Wilbert`: true,
`Wilbur`: true,
`Wilburn`: true,
`Wiley`: true,
`Wilford`: true,
`Wilfred`: true,
`Wilfredo`: true,
`Will`: true,
`Willa`: true,
`Willard`: true,
`William`: true,
`Williams`: true,
`Willie`: true,
`Willis`: true,
`Wilma`: true,
`Wilmer`: true,
`Wilson`: true,
`Wilton`: true,
`Winford`: true,
`Winfred`: true,
`Winifred`: true,
`Winona`: true,
`Winston`: true,
`Woodrow`: true,
`Woody`: true,
`Wyatt`: true,
`Xavier`: true,
`Yolanda`: true,
`Yvette`: true,
`Yvonne`: true,
`Zachary`: true,
`Zane`: true,
`Zelda`: true,
`Zelma`: true,
`Zoe`: true},
`ISO3166`: {
`ABW`: true,
`AFG`: true,
`AGO`: true,
`AIA`: true,
`ALA`: true,
`ALB`: true,
`AND`: true,
`ARE`: true,
`ARG`: true,
`ARM`: true,
`ASM`: true,
`ATA`: true,
`ATF`: true,
`ATG`: true,
`AUS`: true,
`AUT`: true,
`AZE`: true,
`BDI`: true,
`BEL`: true,
`BEN`: true,
`BES`: true,
`BFA`: true,
`BGD`: true,
`BGR`: true,
`BHR`: true,
`BHS`: true,
`BIH`: true,
`BLM`: true,
`BLR`: true,
`BLZ`: true,
`BMU`: true,
`BOL`: true,
`BRA`: true,
`BRB`: true,
`BRN`: true,
`BTN`: true,
`BVT`: true,
`BWA`: true,
`CAF`: true,
`CAN`: true,
`CCK`: true,
`CHE`: true,
`CHL`: true,
`CHN`: true,
`CIV`: true,
`CMR`: true,
`COD`: true,
`COG`: true,
`COK`: true,
`COL`: true,
`COM`: true,
`CPV`: true,
`CRI`: true,
`CUB`: true,
`CUW`: true,
`CXR`: true,
`CYM`: true,
`CYP`: true,
`CZE`: true,
`DEU`: true,
`DJI`: true,
`DMA`: true,
`DNK`: true,
`DOM`: true,
`DZA`: true,
`ECU`: true,
`EGY`: true,
`ERI`: true,
`ESH`: true,
`ESP`: true,
`EST`: true,
`ETH`: true,
`FIN`: true,
`FJI`: true,
`FLK`: true,
`FRA`: true,
`FRO`: true,
`FSM`: true,
`GAB`: true,
`GBR`: true,
`GEO`: true,
`GGY`: true,
`GHA`: true,
`GIB`: true,
`GIN`: true,
`GLP`: true,
`GMB`: true,
`GNB`: true,
`GNQ`: true,
`GRC`: true,
`GRD`: true,
`GRL`: true,
`GTM`: true,
`GUF`: true,
`GUM`: true,
`GUY`: true,
`HKG`: true,
`HMD`: true,
`HND`: true,
`HRV`: true,
`HTI`: true,
`HUN`: true,
`IDN`: true,
`IMN`: true,
`IND`: true,
`IOT`: true,
`IRL`: true,
`IRN`: true,
`IRQ`: true,
`ISL`: true,
`ISR`: true,
`ITA`: true,
`JAM`: true,
`JEY`: true,
`JOR`: true,
`JPN`: true,
`KAZ`: true,
`KEN`: true,
`KGZ`: true,
`KHM`: true,
`KIR`: true,
`KNA`: true,
`KOR`: true,
`KWT`: true,
`LAO`: true,
`LBN`: true,
`LBR`: true,
`LBY`: true,
`LCA`: true,
`LIE`: true,
`LKA`: true,
`LSO`: true,
`LTU`: true,
`LUX`: true,
`LVA`: true,
`MAC`: true,
`MAF`: true,
`MAR`: true,
`MCO`: true,
`MDA`: true,
`MDG`: true,
`MDV`: true,
`MEX`: true,
`MHL`: true,
`MKD`: true,
`MLI`: true,
`MLT`: true,
`MMR`: true,
`MNE`: true,
`MNG`: true,
`MNP`: true,
`MOZ`: true,
`MRT`: true,
`MSR`: true,
`MTQ`: true,
`MUS`: true,
`MWI`: true,
`MYS`: true,
`MYT`: true,
`NAM`: true,
`NCL`: true,
`NER`: true,
`NFK`: true,
`NGA`: true,
`NIC`: true,
`NIU`: true,
`NLD`: true,
`NOR`: true,
`NPL`: true,
`NRU`: true,
`NZL`: true,
`OMN`: true,
`PAK`: true,
`PAN`: true,
`PCN`: true,
`PER`: true,
`PHL`: true,
`PLW`: true,
`PNG`: true,
`POL`: true,
`PRI`: true,
`PRK`: true,
`PRT`: true,
`PRY`: true,
`PSE`: true,
`PYF`: true,
`QAT`: true,
`REU`: true,
`ROU`: true,
`RUS`: true,
`RWA`: true,
`SAU`: true,
`SDN`: true,
`SEN`: true,
`SGP`: true,
`SGS`: true,
`SHN`: true,
`SJM`: true,
`SLB`: true,
`SLE`: true,
`SLV`: true,
`SMR`: true,
`SOM`: true,
`SPM`: true,
`SRB`: true,
`SSD`: true,
`STP`: true,
`SUR`: true,
`SVK`: true,
`SVN`: true,
`SWE`: true,
`SWZ`: true,
`SXM`: true,
`SYC`: true,
`SYR`: true,
`TCA`: true,
`TCD`: true,
`TGO`: true,
`THA`: true,
`TJK`: true,
`TKL`: true,
`TKM`: true,
`TLS`: true,
`TON`: true,
`TTO`: true,
`TUN`: true,
`TUR`: true,
`TUV`: true,
`TWN`: true,
`TZA`: true,
`UGA`: true,
`UKR`: true,
`UMI`: true,
`URY`: true,
`USA`: true,
`UZB`: true,
`VAT`: true,
`VCT`: true,
`VEN`: true,
`VGB`: true,
`VIR`: true,
`VNM`: true,
`VUT`: true,
`WLF`: true,
`WSM`: true,
`YEM`: true,
`ZAF`: true,
`ZMB`: true,
`ZWE`: true},
`ISO4217`: {
``: true,
`AED`: true,
`AFN`: true,
`ALL`: true,
`AMD`: true,
`ANG`: true,
`AOA`: true,
`ARS`: true,
`AUD`: true,
`AWG`: true,
`AZN`: true,
`BAM`: true,
`BBD`: true,
`BDT`: true,
`BGN`: true,
`BHD`: true,
`BIF`: true,
`BMD`: true,
`BND`: true,
`BOB`: true,
`BOV`: true,
`BRL`: true,
`BSD`: true,
`BTN`: true,
`BWP`: true,
`BYN`: true,
`BZD`: true,
`CAD`: true,
`CDF`: true,
`CHE`: true,
`CHF`: true,
`CHW`: true,
`CLF`: true,
`CLP`: true,
`CNY`: true,
`COP`: true,
`COU`: true,
`CRC`: true,
`CUC`: true,
`CUP`: true,
`CVE`: true,
`CZK`: true,
`DJF`: true,
`DKK`: true,
`DOP`: true,
`DZD`: true,
`EGP`: true,
`ERN`: true,
`ETB`: true,
`EUR`: true,
`FJD`: true,
`FKP`: true,
`GBP`: true,
`GEL`: true,
`GHS`: true,
`GIP`: true,
`GMD`: true,
`GNF`: true,
`GTQ`: true,
`GYD`: true,
`HKD`: true,
`HNL`: true,
`HRK`: true,
`HTG`: true,
`HUF`: true,
`IDR`: true,
`ILS`: true,
`INR`: true,
`IQD`: true,
`IRR`: true,
`ISK`: true,
`JMD`: true,
`JOD`: true,
`JPY`: true,
`KES`: true,
`KGS`: true,
`KHR`: true,
`KMF`: true,
`KPW`: true,
`KRW`: true,
`KWD`: true,
`KYD`: true,
`KZT`: true,
`LAK`: true,
`LBP`: true,
`LKR`: true,
`LRD`: true,
`LSL`: true,
`LYD`: true,
`MAD`: true,
`MDL`: true,
`MGA`: true,
`MKD`: true,
`MMK`: true,
`MNT`: true,
`MOP`: true,
`MRU`: true,
`MUR`: true,
`MVR`: true,
`MWK`: true,
`MXN`: true,
`MXV`: true,
`MYR`: true,
`MZN`: true,
`NAD`: true,
`NGN`: true,
`NIO`: true,
`NOK`: true,
`NPR`: true,
`NZD`: true,
`OMR`: true,
`PAB`: true,
`PEN`: true,
`PGK`: true,
`PHP`: true,
`PKR`: true,
`PLN`: true,
`PYG`: true,
`QAR`: true,
`RON`: true,
`RSD`: true,
`RUB`: true,
`RWF`: true,
`SAR`: true,
`SBD`: true,
`SCR`: true,
`SDG`: true,
`SEK`: true,
`SGD`: true,
`SHP`: true,
`SLL`: true,
`SOS`: true,
`SRD`: true,
`SSP`: true,
`STN`: true,
`SVC`: true,
`SYP`: true,
`SZL`: true,
`THB`: true,
`TJS`: true,
`TMT`: true,
`TND`: true,
`TOP`: true,
`TRY`: true,
`TTD`: true,
`TWD`: true,
`TZS`: true,
`UAH`: true,
`UGX`: true,
`USD`: true,
`USN`: true,
`UYI`: true,
`UYU`: true,
`UYW`: true,
`UZS`: true,
`VES`: true,
`VND`: true,
`VUV`: true,
`WST`: true,
`XAF`: true,
`XAG`: true,
`XAU`: true,
`XBA`: true,
`XBB`: true,
`XBC`: true,
`XBD`: true,
`XCD`: true,
`XDR`: true,
`XOF`: true,
`XPD`: true,
`XPF`: true,
`XPT`: true,
`XSU`: true,
`XTS`: true,
`XUA`: true,
`XXX`: true,
`YER`: true,
`ZAR`: true,
`ZMW`: true,
`ZWL`: true},
`LastName`: {
`Abbott`: true,
`Acevedo`: true,
`Acosta`: true,
`Adams`: true,
`Adkins`: true,
`Aguilar`: true,
`Aguirre`: true,
`Albert`: true,
`Alexander`: true,
`Alford`: true,
`Allen`: true,
`Allison`: true,
`Alston`: true,
`Alvarado`: true,
`Alvarez`: true,
`Anderson`: true,
`Andrews`: true,
`Anthony`: true,
`Armstrong`: true,
`Arnold`: true,
`Ashley`: true,
`Atkins`: true,
`Atkinson`: true,
`Austin`: true,
`Avery`: true,
`Avila`: true,
`Ayala`: true,
`Ayers`: true,
`Bailey`: true,
`Baird`: true,
`Baker`: true,
`Baldwin`: true,
`Ball`: true,
`Ballard`: true,
`Banks`: true,
`Barber`: true,
`Barker`: true,
`Barlow`: true,
`Barnes`: true,
`Barnett`: true,
`Barr`: true,
`Barrera`: true,
`Barrett`: true,
`Barron`: true,
`Barry`: true,
`Bartlett`: true,
`Barton`: true,
`Bass`: true,
`Bates`: true,
`Battle`: true,
`Bauer`: true,
`Baxter`: true,
`Beach`: true,
`Bean`: true,
`Beard`: true,
`Beasley`: true,
`Beck`: true,
`Becker`: true,
`Bell`: true,
`Bender`: true,
`Benjamin`: true,
`Bennett`: true,
`Benson`: true,
`Bentley`: true,
`Benton`: true,
`Berg`: true,
`Berger`: true,
`Bernard`: true,
`Berry`: true,
`Best`: true,
`Bird`: true,
`Bishop`: true,
`Black`: true,
`Blackburn`: true,
`Blackwell`: true,
`Blair`: true,
`Blake`: true,
`Blanchard`: true,
`Blankenship`: true,
`Blevins`: true,
`Bolton`: true,
`Bond`: true,
`Bonner`: true,
`Booker`: true,
`Boone`: true,
`Booth`: true,
`Bowen`: true,
`Bowers`: true,
`Bowman`: true,
`Boyd`: true,
`Boyer`: true,
`Boyle`: true,
`Bradford`: true,
`Bradley`: true,
`Bradshaw`: true,
`Brady`: true,
`Branch`: true,
`Bray`: true,
`Brennan`: true,
`Brewer`: true,
`Bridges`: true,
`Briggs`: true,
`Bright`: true,
`Britt`: true,
`Brock`: true,
`Brooks`: true,
`Brown`: true,
`Browning`: true,
`Bruce`: true,
`Bryan`: true,
`Bryant`: true,
`Buchanan`: true,
`Buck`: true,
`Buckley`: true,
`Buckner`: true,
`Bullock`: true,
`Burch`: true,
`Burgess`: true,
`Burke`: true,
`Burks`: true,
`Burnett`: true,
`Burns`: true,
`Burris`: true,
`Burt`: true,
`Burton`: true,
`Bush`: true,
`Butler`: true,
`Byers`: true,
`Byrd`: true,
`Cabrera`: true,
`Cain`: true,
`Calderon`: true,
`Caldwell`: true,
`Calhoun`: true,
`Callahan`: true,
`Camacho`: true,
`Cameron`: true,
`Campbell`: true,
`Campos`: true,
`Cannon`: true,
`Cantrell`: true,
`Cantu`: true,
`Cardenas`: true,
`Carey`: true,
`Carlson`: true,
`Carney`: true,
`Carpenter`: true,
`Carr`: true,
`Carrillo`: true,
`Carroll`: true,
`Carson`: true,
`Carter`: true,
`Carver`: true,
`Case`: true,
`Casey`: true,
`Cash`: true,
`Castaneda`: true,
`Castillo`: true,
`Castro`: true,
`Cervantes`: true,
`Chambers`: true,
`Chan`: true,
`Chandler`: true,
`Chaney`: true,
`Chang`: true,
`Chapman`: true,
`Charles`: true,
`Chase`: true,
`Chavez`: true,
`Chen`: true,
`Cherry`: true,
`Christensen`: true,
`Christian`: true,
`Church`: true,
`Clark`: true,
`Clarke`: true,
`Clay`: true,
`Clayton`: true,
`Clements`: true,
`Clemons`: true,
`Cleveland`: true,
`Cline`: true,
`Cobb`: true,
`Cochran`: true,
`Coffey`: true,
`Cohen`: true,
`Cole`: true,
`Coleman`: true,
`Collier`: true,
`Collins`: true,
`Colon`: true,
`Combs`: true,
`Compton`: true,
`Conley`: true,
`Conner`: true,
`Conrad`: true,
`Contreras`: true,
`Conway`: true,
`Cook`: true,
`Cooke`: true,
`Cooley`: true,
`Cooper`: true,
`Copeland`: true,
`Cortez`: true,
`Cote`: true,
`Cotton`: true,
`Cox`: true,
`Craft`: true,
`Craig`: true,
`Crane`: true,
`Crawford`: true,
`Crosby`: true,
`Cross`: true,
`Cruz`: true,
`Cummings`: true,
`Cunningham`: true,
`Curry`: true,
`Curtis`: true,
`Dale`: true,
`Dalton`: true,
`Daniel`: true,
`Daniels`: true,
`Daugherty`: true,
`Davenport`: true,
`David`: true,
`Davidson`: true,
`Davis`: true,
`Dawson`: true,
`Day`: true,
`Dean`: true,
`Decker`: true,
`Dejesus`: true,
`Delacruz`: true,
`Delaney`: true,
`Deleon`: true,
`Delgado`: true,
`Dennis`: true,
`Diaz`: true,
`Dickerson`: true,
`Dickson`: true,
`Dillard`: true,
`Dillon`: true,
`Dixon`: true,
`Dodson`: true,
`Dominguez`: true,
`Donaldson`: true,
`Donovan`: true,
`Dorsey`: true,
`Dotson`: true,
`Douglas`: true,
`Downs`: true,
`Doyle`: true,
`Drake`: true,
`Dudley`: true,
`Duffy`: true,
`Duke`: true,
`Duncan`: true,
`Dunlap`: true,
`Dunn`: true,
`Duran`: true,
`Durham`: true,
`Dyer`: true,
`Eaton`: true,
`Edwards`: true,
`Elliott`: true,
`Ellis`: true,
`Ellison`: true,
`Emerson`: true,
`England`: true,
`English`: true,
`Erickson`: true,
`Espinoza`: true,
`Estes`: true,
`Estrada`: true,
`Evans`: true,
`Everett`: true,
`Ewing`: true,
`Farley`: true,
`Farmer`: true,
`Farrell`: true,
`Faulkner`: true,
`Ferguson`: true,
`Fernandez`: true,
`Ferrell`: true,
`Fields`: true,
`Figueroa`: true,
`Finch`: true,
`Finley`: true,
`Fischer`: true,
`Fisher`: true,
`Fitzgerald`: true,
`Fitzpatrick`: true,
`Fleming`: true,
`Fletcher`: true,
`Flores`: true,
`Flowers`: true,
`Floyd`: true,
`Flynn`: true,
`Foley`: true,
`Forbes`: true,
`Ford`: true,
`Foreman`: true,
`Foster`: true,
`Fowler`: true,
`Fox`: true,
`Francis`: true,
`Franco`: true,
`Frank`: true,
`Franklin`: true,
`Franks`: true,
`Frazier`: true,
`Frederick`: true,
`Freeman`: true,
`French`: true,
`Frost`: true,
`Fry`: true,
`Frye`: true,
`Fuentes`: true,
`Fuller`: true,
`Fulton`: true,
`Gaines`: true,
`Gallagher`: true,
`Gallegos`: true,
`Galloway`: true,
`Gamble`: true,
`Garcia`: true,
`Gardner`: true,
`Garner`: true,
`Garrett`: true,
`Garrison`: true,
`Garza`: true,
`Gates`: true,
`Gay`: true,
`Gentry`: true,
`George`: true,
`Gibbs`: true,
`Gibson`: true,
`Gilbert`: true,
`Giles`: true,
`Gill`: true,
`Gillespie`: true,
`Gilliam`: true,
`Gilmore`: true,
`Glass`: true,
`Glenn`: true,
`Glover`: true,
`Goff`: true,
`Golden`: true,
`Gomez`: true,
`Gonzales`: true,
`Gonzalez`: true,
`Good`: true,
`Goodman`: true,
`Goodwin`: true,
`Gordon`: true,
`Gould`: true,
`Graham`: true,
`Grant`: true,
`Graves`: true,
`Gray`: true,
`Green`: true,
`Greene`: true,
`Greer`: true,
`Gregory`: true,
`Griffin`: true,
`Griffith`: true,
`Grimes`: true,
`Gross`: true,
`Guerra`: true,
`Guerrero`: true,
`Guthrie`: true,
`Gutierrez`: true,
`Guy`: true,
`Guzman`: true,
`Hahn`: true,
`Hale`: true,
`Haley`: true,
`Hall`: true,
`Hamilton`: true,
`Hammond`: true,
`Hampton`: true,
`Hancock`: true,
`Haney`: true,
`Hansen`: true,
`Hanson`: true,
`Hardin`: true,
`Harding`: true,
`Hardy`: true,
`Harmon`: true,
`Harper`: true,
`Harrell`: true,
`Harrington`: true,
`Harris`: true,
`Harrison`: true,
`Hart`: true,
`Hartman`: true,
`Harvey`: true,
`Hatfield`: true,
`Hawkins`: true,
`Hayden`: true,
`Hayes`: true,
`Haynes`: true,
`Hays`: true,
`Head`: true,
`Heath`: true,
`Hebert`: true,
`Henderson`: true,
`Hendricks`: true,
`Hendrix`: true,
`Henry`: true,
`Hensley`: true,
`Henson`: true,
`Herman`: true,
`Hernandez`: true,
`Herrera`: true,
`Herring`: true,
`Hess`: true,
`Hester`: true,
`Hewitt`: true,
`Hickman`: true,
`Hicks`: true,
`Higgins`: true,
`Hill`: true,
`Hines`: true,
`Hinton`: true,
`Hobbs`: true,
`Hodge`: true,
`Hodges`: true,
`Hoffman`: true,
`Hogan`: true,
`Holcomb`: true,
`Holden`: true,
`Holder`: true,
`Holland`: true,
`Holloway`: true,
`Holman`: true,
`Holmes`: true,
`Holt`: true,
`Hood`: true,
`Hooper`: true,
`Hoover`: true,
`Hopkins`: true,
`Hopper`: true,
`Horn`: true,
`Horne`: true,
`Horton`: true,
`House`: true,
`Houston`: true,
`Howard`: true,
`Howe`: true,
`Howell`: true,
`Hubbard`: true,
`Huber`: true,
`Hudson`: true,
`Huff`: true,
`Huffman`: true,
`Hughes`: true,
`Hull`: true,
`Humphrey`: true,
`Hunt`: true,
`Hunter`: true,
`Hurley`: true,
`Hurst`: true,
`Hutchinson`: true,
`Hyde`: true,
`Ingram`: true,
`Irwin`: true,
`Jackson`: true,
`Jacobs`: true,
`Jacobson`: true,
`James`: true,
`Jarvis`: true,
`Jefferson`: true,
`Jenkins`: true,
`Jennings`: true,
`Jensen`: true,
`Jimenez`: true,
`Johns`: true,
`Johnson`: true,
`Johnston`: true,
`Jones`: true,
`Jordan`: true,
`Joseph`: true,
`Joyce`: true,
`Joyner`: true,
`Juarez`: true,
`Justice`: true,
`Kane`: true,
`Kaufman`: true,
`Keith`: true,
`Keller`: true,
`Kelley`: true,
`Kelly`: true,
`Kemp`: true,
`Kennedy`: true,
`Kent`: true,
`Kerr`: true,
`Key`: true,
`Kidd`: true,
`Kim`: true,
`King`: true,
`Kinney`: true,
`Kirby`: true,
`Kirk`: true,
`Kirkland`: true,
`Klein`: true,
`Kline`: true,
`Knapp`: true,
`Knight`: true,
`Knowles`: true,
`Knox`: true,
`Koch`: true,
`Kramer`: true,
`Lamb`: true,
`Lambert`: true,
`Lancaster`: true,
`Landry`: true,
`Lane`: true,
`Lang`: true,
`Langley`: true,
`Lara`: true,
`Larsen`: true,
`Larson`: true,
`Lawrence`: true,
`Lawson`: true,
`Le`: true,
`Leach`: true,
`Leblanc`: true,
`Lee`: true,
`Leon`: true,
`Leonard`: true,
`Lester`: true,
`Levine`: true,
`Levy`: true,
`Lewis`: true,
`Lindsay`: true,
`Lindsey`: true,
`Little`: true,
`Livingston`: true,
`Lloyd`: true,
`Logan`: true,
`Long`: true,
`Lopez`: true,
`Lott`: true,
`Love`: true,
`Lowe`: true,
`Lowery`: true,
`Lucas`: true,
`Luna`: true,
`Lynch`: true,
`Lynn`: true,
`Lyons`: true,
`Macdonald`: true,
`Macias`: true,
`Mack`: true,
`Madden`: true,
`Maddox`: true,
`Maldonado`: true,
`Malone`: true,
`Mann`: true,
`Manning`: true,
`Marks`: true,
`Marquez`: true,
`Marsh`: true,
`Marshall`: true,
`Martin`: true,
`Martinez`: true,
`Mason`: true,
`Massey`: true,
`Mathews`: true,
`Mathis`: true,
`Matthews`: true,
`Maxwell`: true,
`May`: true,
`Mayer`: true,
`Maynard`: true,
`Mayo`: true,
`Mays`: true,
`Mcbride`: true,
`Mccall`: true,
`Mccarthy`: true,
`Mccarty`: true,
`Mcclain`: true,
`Mcclure`: true,
`Mcconnell`: true,
`Mccormick`: true,
`Mccoy`: true,
`Mccray`: true,
`Mccullough`: true,
`Mcdaniel`: true,
`Mcdonald`: true,
`Mcdowell`: true,
`Mcfadden`: true,
`Mcfarland`: true,
`Mcgee`: true,
`Mcgowan`: true,
`Mcguire`: true,
`Mcintosh`: true,
`Mcintyre`: true,
`Mckay`: true,
`Mckee`: true,
`Mckenzie`: true,
`Mckinney`: true,
`Mcknight`: true,
`Mclaughlin`: true,
`Mclean`: true,
`Mcleod`: true,
`Mcmahon`: true,
`Mcmillan`: true,
`Mcneil`: true,
`Mcpherson`: true,
`Meadows`: true,
`Medina`: true,
`Mejia`: true,
`Melendez`: true,
`Melton`: true,
`Mendez`: true,
`Mendoza`: true,
`Mercado`: true,
`Mercer`: true,
`Merrill`: true,
`Merritt`: true,
`Meyer`: true,
`Meyers`: true,
`Michael`: true,
`Middleton`: true,
`Miles`: true,
`Miller`: true,
`Mills`: true,
`Miranda`: true,
`Mitchell`: true,
`Molina`: true,
`Monroe`: true,
`Montgomery`: true,
`Montoya`: true,
`Moody`: true,
`Moon`: true,
`Mooney`: true,
`Moore`: true,
`Morales`: true,
`Moran`: true,
`Moreno`: true,
`Morgan`: true,
`Morin`: true,
`Morris`: true,
`Morrison`: true,
`Morrow`: true,
`Morse`: true,
`Morton`: true,
`Moses`: true,
`Mosley`: true,
`Moss`: true,
`Mueller`: true,
`Mullen`: true,
`Mullins`: true,
`Munoz`: true,
`Murphy`: true,
`Murray`: true,
`Myers`: true,
`Nash`: true,
`Navarro`: true,
`Neal`: true,
`Nelson`: true,
`Newman`: true,
`Newton`: true,
`Nguyen`: true,
`Nichols`: true,
`Nicholson`: true,
`Nielsen`: true,
`Nieves`: true,
`Nixon`: true,
`Noble`: true,
`Noel`: true,
`Nolan`: true,
`Norman`: true,
`Norris`: true,
`Norton`: true,
`Nunez`: true,
`Obrien`: true,
`Ochoa`: true,
`Oconnor`: true,
`Odom`: true,
`Odonnell`: true,
`Oliver`: true,
`Olsen`: true,
`Olson`: true,
`Oneal`: true,
`Oneil`: true,
`Oneill`: true,
`Orr`: true,
`Ortega`: true,
`Ortiz`: true,
`Osborn`: true,
`Osborne`: true,
`Owen`: true,
`Owens`: true,
`Pace`: true,
`Pacheco`: true,
`Padilla`: true,
`Page`: true,
`Palmer`: true,
`Park`: true,
`Parker`: true,
`Parks`: true,
`Parrish`: true,
`Parsons`: true,
`Pate`: true,
`Patel`: true,
`Patrick`: true,
`Patterson`: true,
`Patton`: true,
`Paul`: true,
`Payne`: true,
`Pearson`: true,
`Peck`: true,
`Pena`: true,
`Pennington`: true,
`Perez`: true,
`Perkins`: true,
`Perry`: true,
`Peters`: true,
`Petersen`: true,
`Peterson`: true,
`Petty`: true,
`Phelps`: true,
`Phillips`: true,
`Pickett`: true,
`Pierce`: true,
`Pittman`: true,
`Pitts`: true,
`Pollard`: true,
`Poole`: true,
`Pope`: true,
`Porter`: true,
`Potter`: true,
`Potts`: true,
`Powell`: true,
`Powers`: true,
`Pratt`: true,
`Preston`: true,
`Price`: true,
`Prince`: true,
`Pruitt`: true,
`Puckett`: true,
`Pugh`: true,
`Quinn`: true,
`Ramirez`: true,
`Ramos`: true,
`Ramsey`: true,
`Randall`: true,
`Randolph`: true,
`Rasmussen`: true,
`Ratliff`: true,
`Ray`: true,
`Raymond`: true,
`Reed`: true,
`Reese`: true,
`Reeves`: true,
`Reid`: true,
`Reilly`: true,
`Reyes`: true,
`Reynolds`: true,
`Rhodes`: true,
`Rice`: true,
`Rich`: true,
`Richard`: true,
`Richards`: true,
`Richardson`: true,
`Richmond`: true,
`Riddle`: true,
`Riggs`: true,
`Riley`: true,
`Rios`: true,
`Rivas`: true,
`Rivera`: true,
`Rivers`: true,
`Roach`: true,
`Robbins`: true,
`Roberson`: true,
`Roberts`: true,
`Robertson`: true,
`Robinson`: true,
`Robles`: true,
`Rocha`: true,
`Rodgers`: true,
`Rodriguez`: true,
`Rodriquez`: true,
`Rogers`: true,
`Rojas`: true,
`Rollins`: true,
`Roman`: true,
`Romero`: true,
`Rosa`: true,
`Rosales`: true,
`Rosario`: true,
`Rose`: true,
`Ross`: true,
`Roth`: true,
`Rowe`: true,
`Rowland`: true,
`Roy`: true,
`Ruiz`: true,
`Rush`: true,
`Russell`: true,
`Russo`: true,
`Rutledg`: true,
`Ryan`: true,
`Salas`: true,
`Salazar`: true,
`Salinas`: true,
`Sampson`: true,
`Sanchez`: true,
`Sanders`: true,
`Sandoval`: true,
`Sanford`: true,
`Santana`: true,
`Santiago`: true,
`Santos`: true,
`Sargent`: true,
`Saunders`: true,
`Savage`: true,
`Sawyer`: true,
`Schmidt`: true,
`Schneider`: true,
`Schroeder`: true,
`Schultz`: true,
`Schwartz`: true,
`Scott`: true,
`Sears`: true,
`Sellers`: true,
`Serrano`: true,
`Sexton`: true,
`Shaffer`: true,
`Shannon`: true,
`Sharp`: true,
`Sharpe`: true,
`Shaw`: true,
`Shelton`: true,
`Shepard`: true,
`Shepherd`: true,
`Sheppard`: true,
`Sherman`: true,
`Shields`: true,
`Short`: true,
`Silva`: true,
`Simmons`: true,
`Simon`: true,
`Simpson`: true,
`Sims`: true,
`Singleton`: true,
`Skinner`: true,
`Slater`: true,
`Sloan`: true,
`Small`: true,
`Smith`: true,
`Snider`: true,
`Snow`: true,
`Snyder`: true,
`Solis`: true,
`Solomon`: true,
`Sosa`: true,
`Soto`: true,
`Sparks`: true,
`Spears`: true,
`Spence`: true,
`Spencer`: true,
`Stafford`: true,
`Stanley`: true,
`Stanton`: true,
`Stark`: true,
`Steele`: true,
`Stein`: true,
`Stephens`: true,
`Stephenson`: true,
`Stevens`: true,
`Stevenson`: true,
`Stewart`: true,
`Stokes`: true,
`Stone`: true,
`Stout`: true,
`Strickland`: true,
`Strong`: true,
`Stuart`: true,
`Suarez`: true,
`Sullivan`: true,
`Summers`: true,
`Sutton`: true,
`Swanson`: true,
`Sweeney`: true,
`Sweet`: true,
`Sykes`: true,
`Talley`: true,
`Tanner`: true,
`Tate`: true,
`Taylor`: true,
`Terrell`: true,
`Terry`: true,
`Thomas`: true,
`Thompson`: true,
`Thornton`: true,
`Tillman`: true,
`Todd`: true,
`Torres`: true,
`Townsend`: true,
`Tran`: true,
`Travis`: true,
`Trevino`: true,
`Trujillo`: true,
`Tucker`: true,
`Turner`: true,
`Tyler`: true,
`Tyson`: true,
`Underwood`: true,
`Valdez`: true,
`Valencia`: true,
`Valentine`: true,
`Valenzuela`: true,
`Vance`: true,
`Vang`: true,
`Vargas`: true,
`Vasquez`: true,
`Vaughan`: true,
`Vaughn`: true,
`Vazquez`: true,
`Vega`: true,
`Velasquez`: true,
`Velazquez`: true,
`Velez`: true,
`Villarreal`: true,
`Vincent`: true,
`Vinson`: true,
`Wade`: true,
`Wagner`: true,
`Walker`: true,
`Wall`: true,
`Wallace`: true,
`Waller`: true,
`Walls`: true,
`Walsh`: true,
`Walter`: true,
`Walters`: true,
`Walton`: true,
`Ward`: true,
`Ware`: true,
`Warner`: true,
`Warren`: true,
`Washington`: true,
`Waters`: true,
`Watkins`: true,
`Watson`: true,
`Watts`: true,
`Weaver`: true,
`Webb`: true,
`Weber`: true,
`Webster`: true,
`Weeks`: true,
`Weiss`: true,
`Welch`: true,
`Wells`: true,
`West`: true,
`Wheeler`: true,
`Whitaker`: true,
`White`: true,
`Whitehead`: true,
`Whitfield`: true,
`Whitley`: true,
`Whitney`: true,
`Wiggins`: true,
`Wilcox`: true,
`Wilder`: true,
`Wiley`: true,
`Wilkerson`: true,
`Wilkins`: true,
`Wilkinson`: true,
`William`: true,
`Williams`: true,
`Williamson`: true,
`Willis`: true,
`Wilson`: true,
`Winters`: true,
`Wise`: true,
`Witt`: true,
`Wolf`: true,
`Wolfe`: true,
`Wong`: true,
`Wood`: true,
`Woodard`: true,
`Woods`: true,
`Woodward`: true,
`Wooten`: true,
`Workman`: true,
`Wright`: true,
`Wyatt`: true,
`Wynn`: true,
`Yang`: true,
`Yates`: true,
`York`: true,
`Young`: true,
`Zamora`: true,
`Zimmerman`: true},
`OSD1`: {
`C`: true,
`R`: true,
`S`: true},
`PhoneNumber`: {
`(000)503-3290`: true,
`(002)912-8668`: true,
`(003)060-0974`: true,
`(003)791-2955`: true,
`(004)371-3089`: true,
`(004)706-7495`: true,
`(004)723-8271`: true,
`(007)105-2079`: true,
`(009)384-4587`: true,
`(009)489-2523`: true,
`(010)647-1327`: true,
`(013)691-1470`: true,
`(015)036-3156`: true,
`(015)289-6392`: true,
`(016)540-1454`: true,
`(017)070-6374`: true,
`(018)715-4178`: true,
`(019)139-0416`: true,
`(019)716-0500`: true,
`(020)194-0034`: true,
`(020)849-4973`: true,
`(021)223-4523`: true,
`(021)422-2184`: true,
`(022)869-2197`: true,
`(024)065-9119`: true,
`(025)904-1039`: true,
`(027)208-2365`: true,
`(027)475-6720`: true,
`(028)108-0238`: true,
`(029)036-7289`: true,
`(030)582-4128`: true,
`(031)269-4560`: true,
`(031)424-9609`: true,
`(032)815-6760`: true,
`(033)244-0726`: true,
`(033)438-4988`: true,
`(033)586-0374`: true,
`(034)111-9582`: true,
`(036)676-1372`: true,
`(038)211-1102`: true,
`(040)824-5847`: true,
`(043)065-6356`: true,
`(043)596-2806`: true,
`(043)823-2538`: true,
`(044)656-4942`: true,
`(046)348-4079`: true,
`(046)414-7849`: true,
`(047)109-9173`: true,
`(048)115-6190`: true,
`(051)838-9519`: true,
`(052)604-8044`: true,
`(052)921-2833`: true,
`(055)386-6569`: true,
`(055)432-4112`: true,
`(056)915-1096`: true,
`(056)992-2232`: true,
`(058)109-0276`: true,
`(058)864-2295`: true,
`(059)280-5179`: true,
`(059)520-5259`: true,
`(059)779-4344`: true,
`(060)858-5109`: true,
`(060)983-1989`: true,
`(061)516-4952`: true,
`(062)657-6469`: true,
`(063)155-1229`: true,
`(064)457-1271`: true,
`(065)373-0732`: true,
`(066)074-6490`: true,
`(069)230-1887`: true,
`(069)742-8257`: true,
`(069)754-9611`: true,
`(070)462-1205`: true,
`(072)395-1492`: true,
`(072)420-3523`: true,
`(075)489-1136`: true,
`(077)156-7343`: true,
`(077)541-2856`: true,
`(079)145-7971`: true,
`(080)664-4237`: true,
`(082)040-5891`: true,
`(082)195-4821`: true,
`(083)406-6723`: true,
`(083)483-5991`: true,
`(087)241-5023`: true,
`(088)489-8724`: true,
`(088)696-6852`: true,
`(089)811-1888`: true,
`(091)639-8297`: true,
`(092)966-3934`: true,
`(093)256-8654`: true,
`(095)672-4654`: true,
`(098)391-8341`: true,
`(098)416-8830`: true,
`(099)628-5848`: true,
`(102)709-6111`: true,
`(103)228-7215`: true,
`(103)262-0320`: true,
`(103)292-5439`: true,
`(104)622-7908`: true,
`(104)689-0166`: true,
`(105)615-5856`: true,
`(105)628-0336`: true,
`(105)702-0880`: true,
`(106)534-0914`: true,
`(107)732-2379`: true,
`(107)784-3345`: true,
`(108)819-9427`: true,
`(108)873-6082`: true,
`(109)347-7690`: true,
`(109)608-3776`: true,
`(109)916-7853`: true,
`(112)633-8283`: true,
`(112)752-0942`: true,
`(115)222-1944`: true,
`(115)889-6818`: true,
`(118)393-8780`: true,
`(118)762-1615`: true,
`(119)216-6501`: true,
`(119)977-7977`: true,
`(121)864-7287`: true,
`(122)091-6358`: true,
`(123)274-9613`: true,
`(123)685-2708`: true,
`(125)441-7663`: true,
`(126)225-8991`: true,
`(126)524-4596`: true,
`(130)091-2416`: true,
`(131)788-3073`: true,
`(134)894-6688`: true,
`(134)970-2755`: true,
`(135)450-8105`: true,
`(137)492-1205`: true,
`(138)060-1315`: true,
`(138)928-2523`: true,
`(139)030-1713`: true,
`(139)455-2779`: true,
`(139)474-6928`: true,
`(142)564-5602`: true,
`(143)433-3909`: true,
`(143)950-0817`: true,
`(146)704-7067`: true,
`(147)340-8591`: true,
`(148)412-5568`: true,
`(148)799-2429`: true,
`(150)058-4475`: true,
`(151)498-8566`: true,
`(151)902-0269`: true,
`(152)710-9598`: true,
`(152)906-3006`: true,
`(156)356-7137`: true,
`(157)024-3918`: true,
`(157)687-3493`: true,
`(157)927-8202`: true,
`(159)523-6517`: true,
`(160)068-4907`: true,
`(161)463-5188`: true,
`(162)153-7433`: true,
`(163)054-3027`: true,
`(163)458-5291`: true,
`(164)744-0036`: true,
`(164)909-3183`: true,
`(166)991-6655`: true,
`(167)082-3478`: true,
`(167)820-3863`: true,
`(168)304-0302`: true,
`(169)008-2343`: true,
`(169)355-2528`: true,
`(171)295-2312`: true,
`(171)894-0025`: true,
`(171)959-4074`: true,
`(173)456-3664`: true,
`(176)494-8246`: true,
`(176)680-7428`: true,
`(179)404-1075`: true,
`(180)432-8504`: true,
`(180)595-8939`: true,
`(181)156-2076`: true,
`(183)430-9688`: true,
`(185)639-4760`: true,
`(186)386-6132`: true,
`(186)592-2245`: true,
`(188)591-6136`: true,
`(189)710-4631`: true,
`(190)421-5552`: true,
`(192)073-0277`: true,
`(192)685-9015`: true,
`(199)210-7188`: true,
`(200)354-8721`: true,
`(202)217-5102`: true,
`(202)624-9486`: true,
`(202)866-6263`: true,
`(203)831-7337`: true,
`(205)499-3441`: true,
`(205)891-8016`: true,
`(207)308-2766`: true,
`(207)344-8223`: true,
`(208)187-3910`: true,
`(208)759-8568`: true,
`(209)732-3442`: true,
`(209)734-0145`: true,
`(210)534-7153`: true,
`(211)916-6352`: true,
`(211)971-2024`: true,
`(212)603-0058`: true,
`(212)821-6961`: true,
`(216)555-9335`: true,
`(218)988-1372`: true,
`(221)558-6885`: true,
`(223)293-9838`: true,
`(223)343-4132`: true,
`(224)088-3864`: true,
`(224)333-7890`: true,
`(226)093-3014`: true,
`(226)934-8448`: true,
`(228)057-2396`: true,
`(228)202-0426`: true,
`(228)273-1420`: true,
`(228)294-3872`: true,
`(228)828-3818`: true,
`(229)327-7533`: true,
`(231)145-1584`: true,
`(231)247-7563`: true,
`(232)714-2933`: true,
`(234)386-0989`: true,
`(234)815-7007`: true,
`(236)498-9009`: true,
`(238)335-3862`: true,
`(241)156-5823`: true,
`(245)535-3716`: true,
`(245)835-1382`: true,
`(248)993-0603`: true,
`(249)745-9320`: true,
`(251)321-5064`: true,
`(252)623-2197`: true,
`(253)291-2275`: true,
`(254)442-1760`: true,
`(255)809-0577`: true,
`(256)881-9253`: true,
`(257)051-5138`: true,
`(257)636-0217`: true,
`(258)316-0310`: true,
`(258)508-7852`: true,
`(258)833-9222`: true,
`(258)938-2039`: true,
`(259)342-4512`: true,
`(261)300-0096`: true,
`(267)112-7989`: true,
`(267)554-2469`: true,
`(268)922-4967`: true,
`(268)949-2505`: true,
`(270)546-9048`: true,
`(271)092-2658`: true,
`(273)430-7094`: true,
`(274)769-7713`: true,
`(276)877-7439`: true,
`(278)682-1772`: true,
`(279)163-0060`: true,
`(279)452-2109`: true,
`(280)698-2335`: true,
`(281)215-4807`: true,
`(281)544-8581`: true,
`(282)151-9460`: true,
`(282)306-2569`: true,
`(283)016-6536`: true,
`(286)743-1038`: true,
`(287)527-8113`: true,
`(287)889-1233`: true,
`(287)889-2501`: true,
`(288)817-0784`: true,
`(289)609-1858`: true,
`(289)870-8706`: true,
`(290)228-8981`: true,
`(291)201-8175`: true,
`(291)499-0374`: true,
`(291)627-6797`: true,
`(291)806-1698`: true,
`(291)982-9942`: true,
`(292)270-0243`: true,
`(292)824-1320`: true,
`(293)181-8432`: true,
`(294)850-2124`: true,
`(297)006-5022`: true,
`(298)340-7100`: true,
`(300)986-2736`: true,
`(301)434-3859`: true,
`(303)741-3296`: true,
`(304)296-8457`: true,
`(307)143-4944`: true,
`(307)683-8701`: true,
`(307)700-4692`: true,
`(308)991-5267`: true,
`(309)482-8110`: true,
`(309)548-7794`: true,
`(310)387-9193`: true,
`(310)440-8045`: true,
`(311)678-3486`: true,
`(313)077-0397`: true,
`(313)596-2652`: true,
`(314)797-3015`: true,
`(316)861-5772`: true,
`(318)522-4088`: true,
`(318)756-0731`: true,
`(319)972-9529`: true,
`(320)470-8698`: true,
`(323)679-5219`: true,
`(323)805-4742`: true,
`(323)861-8409`: true,
`(325)418-7973`: true,
`(325)938-7699`: true,
`(327)841-4635`: true,
`(328)109-9783`: true,
`(334)235-4488`: true,
`(334)686-5697`: true,
`(335)297-7433`: true,
`(336)833-0445`: true,
`(338)895-1370`: true,
`(338)965-6696`: true,
`(339)431-4537`: true,
`(339)947-4189`: true,
`(339)949-6401`: true,
`(341)603-5104`: true,
`(342)252-0512`: true,
`(342)325-2247`: true,
`(342)535-5615`: true,
`(342)773-1673`: true,
`(343)813-8373`: true,
`(346)818-8636`: true,
`(346)923-4272`: true,
`(347)249-5996`: true,
`(347)659-2569`: true,
`(347)813-6348`: true,
`(347)898-4726`: true,
`(348)105-2636`: true,
`(348)633-5659`: true,
`(349)834-7568`: true,
`(349)940-3903`: true,
`(350)551-1949`: true,
`(350)969-3384`: true,
`(351)521-8096`: true,
`(351)657-9527`: true,
`(351)920-9979`: true,
`(352)346-3192`: true,
`(352)572-3753`: true,
`(352)813-7699`: true,
`(353)571-9328`: true,
`(353)734-4437`: true,
`(357)206-3921`: true,
`(358)260-2906`: true,
`(358)443-3105`: true,
`(359)055-7442`: true,
`(359)660-2174`: true,
`(362)566-6872`: true,
`(363)696-5662`: true,
`(364)455-6039`: true,
`(365)618-1800`: true,
`(365)987-5723`: true,
`(366)745-5764`: true,
`(368)150-3525`: true,
`(369)675-0347`: true,
`(370)852-2804`: true,
`(371)457-3138`: true,
`(371)824-8676`: true,
`(372)873-9163`: true,
`(373)306-5227`: true,
`(374)472-6944`: true,
`(375)579-0962`: true,
`(377)342-9398`: true,
`(378)105-2471`: true,
`(378)221-9592`: true,
`(379)130-9890`: true,
`(379)211-6896`: true,
`(379)284-6108`: true,
`(381)263-3395`: true,
`(381)673-7468`: true,
`(383)601-1058`: true,
`(384)180-2584`: true,
`(384)938-6496`: true,
`(385)290-8460`: true,
`(385)833-6509`: true,
`(388)119-2749`: true,
`(388)258-1387`: true,
`(388)375-7301`: true,
`(390)978-2697`: true,
`(395)291-4430`: true,
`(395)878-6308`: true,
`(395)931-7094`: true,
`(399)054-4627`: true,
`(399)249-5648`: true,
`(400)147-2102`: true,
`(400)455-9848`: true,
`(400)470-4740`: true,
`(403)559-8817`: true,
`(404)385-2422`: true,
`(404)638-2932`: true,
`(405)145-0317`: true,
`(406)051-9985`: true,
`(406)176-2347`: true,
`(406)569-7233`: true,
`(407)155-6201`: true,
`(409)090-0084`: true,
`(409)346-6541`: true,
`(409)765-1451`: true,
`(410)625-4841`: true,
`(411)685-1825`: true,
`(411)738-3402`: true,
`(413)204-5839`: true,
`(414)665-3249`: true,
`(415)319-3966`: true,
`(415)766-6735`: true,
`(418)269-7776`: true,
`(418)866-9389`: true,
`(419)179-5498`: true,
`(419)296-0568`: true,
`(420)177-7801`: true,
`(421)803-5499`: true,
`(423)675-8558`: true,
`(424)220-4883`: true,
`(424)837-7127`: true,
`(425)394-7431`: true,
`(427)322-3615`: true,
`(428)559-6652`: true,
`(428)747-2642`: true,
`(429)719-2829`: true,
`(430)031-9275`: true,
`(431)695-8541`: true,
`(432)483-4111`: true,
`(433)897-2204`: true,
`(435)172-8495`: true,
`(436)428-3533`: true,
`(437)490-4436`: true,
`(438)418-6258`: true,
`(439)156-8045`: true,
`(439)520-0144`: true,
`(440)035-0301`: true,
`(440)661-3829`: true,
`(440)964-2847`: true,
`(443)208-7431`: true,
`(444)531-4151`: true,
`(447)867-1650`: true,
`(450)661-7337`: true,
`(451)445-3454`: true,
`(453)453-9496`: true,
`(453)742-6569`: true,
`(453)841-9597`: true,
`(454)612-4389`: true,
`(455)766-1641`: true,
`(456)344-1269`: true,
`(457)211-2990`: true,
`(458)744-9454`: true,
`(458)841-9455`: true,
`(460)923-4708`: true,
`(462)249-1126`: true,
`(462)769-7484`: true,
`(463)792-7207`: true,
`(463)793-0089`: true,
`(464)043-7396`: true,
`(466)020-8794`: true,
`(466)719-5502`: true,
`(467)695-5419`: true,
`(468)265-2733`: true,
`(469)504-0680`: true,
`(470)419-3270`: true,
`(470)974-5922`: true,
`(470)978-8523`: true,
`(471)551-4277`: true,
`(472)498-6104`: true,
`(474)092-0985`: true,
`(474)515-2118`: true,
`(477)355-7502`: true,
`(477)816-0873`: true,
`(478)951-7242`: true,
`(479)641-6937`: true,
`(481)890-6449`: true,
`(482)537-9094`: true,
`(482)608-1906`: true,
`(485)044-4689`: true,
`(485)878-2778`: true,
`(486)196-0236`: true,
`(487)361-9472`: true,
`(488)227-1192`: true,
`(490)363-1724`: true,
`(490)581-1683`: true,
`(491)056-2691`: true,
`(492)340-2105`: true,
`(493)449-9353`: true,
`(493)558-2330`: true,
`(495)881-8656`: true,
`(496)649-3490`: true,
`(498)483-6438`: true,
`(500)126-3629`: true,
`(502)541-6350`: true,
`(503)799-9651`: true,
`(504)400-5778`: true,
`(504)600-9630`: true,
`(506)518-9133`: true,
`(508)009-0311`: true,
`(513)843-8210`: true,
`(514)218-4313`: true,
`(514)463-7083`: true,
`(515)141-9299`: true,
`(516)059-4087`: true,
`(516)636-3997`: true,
`(517)643-3356`: true,
`(519)191-9417`: true,
`(523)165-7674`: true,
`(525)142-5695`: true,
`(525)580-0351`: true,
`(526)225-3999`: true,
`(526)368-4043`: true,
`(526)855-2737`: true,
`(527)675-6113`: true,
`(530)287-4456`: true,
`(530)814-1162`: true,
`(530)935-8616`: true,
`(531)134-1587`: true,
`(533)721-7542`: true,
`(533)885-1179`: true,
`(535)896-1109`: true,
`(536)040-4796`: true,
`(537)119-3022`: true,
`(539)327-4819`: true,
`(539)747-3658`: true,
`(541)644-7108`: true,
`(542)039-7083`: true,
`(544)333-8413`: true,
`(544)881-1615`: true,
`(547)205-1413`: true,
`(549)300-1441`: true,
`(549)328-2327`: true,
`(551)423-3511`: true,
`(551)901-6452`: true,
`(552)265-2807`: true,
`(553)748-3267`: true,
`(556)012-0350`: true,
`(556)666-4825`: true,
`(557)080-4887`: true,
`(557)413-6179`: true,
`(557)891-7243`: true,
`(558)110-5674`: true,
`(559)019-2177`: true,
`(560)398-2890`: true,
`(560)492-2803`: true,
`(560)824-4296`: true,
`(563)057-9593`: true,
`(563)135-7239`: true,
`(566)343-6158`: true,
`(567)343-3601`: true,
`(567)699-0964`: true,
`(567)955-4755`: true,
`(568)455-5518`: true,
`(569)485-1351`: true,
`(569)675-5592`: true,
`(572)256-5255`: true,
`(572)583-6670`: true,
`(572)599-8576`: true,
`(574)370-3785`: true,
`(574)448-6569`: true,
`(575)149-1800`: true,
`(575)519-6399`: true,
`(575)968-9030`: true,
`(576)008-9199`: true,
`(578)513-1672`: true,
`(578)513-3257`: true,
`(578)737-4341`: true,
`(580)561-3207`: true,
`(584)846-4230`: true,
`(586)302-0737`: true,
`(587)286-0462`: true,
`(588)157-6521`: true,
`(589)219-4327`: true,
`(590)382-0464`: true,
`(594)780-8689`: true,
`(595)171-4971`: true,
`(595)609-5113`: true,
`(595)742-1887`: true,
`(596)242-5986`: true,
`(596)787-1563`: true,
`(597)063-4595`: true,
`(597)704-7408`: true,
`(600)599-8053`: true,
`(601)292-0226`: true,
`(601)430-4410`: true,
`(602)386-1964`: true,
`(603)339-0991`: true,
`(603)454-5797`: true,
`(603)922-9921`: true,
`(605)166-2693`: true,
`(606)491-6899`: true,
`(608)159-1463`: true,
`(609)075-9738`: true,
`(610)258-6392`: true,
`(610)451-3175`: true,
`(616)084-5568`: true,
`(616)367-5125`: true,
`(616)591-9407`: true,
`(617)933-5027`: true,
`(619)384-5684`: true,
`(620)091-7168`: true,
`(620)848-0484`: true,
`(621)993-9659`: true,
`(622)021-5399`: true,
`(622)665-9770`: true,
`(623)551-5738`: true,
`(624)192-9953`: true,
`(624)330-3619`: true,
`(626)054-3967`: true,
`(627)966-9063`: true,
`(629)328-9582`: true,
`(629)426-8169`: true,
`(630)649-4087`: true,
`(630)688-7013`: true,
`(631)283-9658`: true,
`(631)861-0610`: true,
`(633)271-7066`: true,
`(634)767-7614`: true,
`(635)817-4500`: true,
`(636)019-9596`: true,
`(636)648-5663`: true,
`(637)469-1401`: true,
`(637)992-1529`: true,
`(640)532-7532`: true,
`(640)808-2950`: true,
`(643)406-5013`: true,
`(643)617-1328`: true,
`(643)815-7142`: true,
`(645)939-1884`: true,
`(646)330-7552`: true,
`(646)430-4425`: true,
`(646)757-9645`: true,
`(648)576-6542`: true,
`(649)281-5817`: true,
`(651)434-7877`: true,
`(651)855-5503`: true,
`(651)907-9152`: true,
`(652)201-1937`: true,
`(652)677-9302`: true,
`(653)913-3561`: true,
`(653)919-0290`: true,
`(654)214-0363`: true,
`(654)584-3638`: true,
`(655)628-3423`: true,
`(656)205-8838`: true,
`(658)186-0584`: true,
`(660)553-2359`: true,
`(660)614-6256`: true,
`(661)888-8175`: true,
`(662)918-0585`: true,
`(664)486-7933`: true,
`(664)644-0588`: true,
`(666)373-9068`: true,
`(666)610-9788`: true,
`(666)711-0630`: true,
`(666)936-4637`: true,
`(667)581-4428`: true,
`(667)794-5040`: true,
`(669)412-4853`: true,
`(671)377-1515`: true,
`(672)861-4357`: true,
`(673)209-2035`: true,
`(673)899-9851`: true,
`(674)824-2613`: true,
`(675)289-8662`: true,
`(677)434-0724`: true,
`(677)521-9206`: true,
`(678)508-7427`: true,
`(682)595-4806`: true,
`(683)223-0630`: true,
`(683)770-8839`: true,
`(684)935-4057`: true,
`(685)584-0855`: true,
`(686)066-5474`: true,
`(687)058-2573`: true,
`(687)113-9639`: true,
`(687)136-5457`: true,
`(688)233-4463`: true,
`(691)104-4382`: true,
`(691)327-7872`: true,
`(694)102-9428`: true,
`(698)008-9712`: true,
`(698)465-6001`: true,
`(698)651-7847`: true,
`(698)660-8633`: true,
`(698)879-0511`: true,
`(699)048-1691`: true,
`(701)753-9540`: true,
`(704)385-8282`: true,
`(705)269-7628`: true,
`(705)424-3598`: true,
`(705)895-5731`: true,
`(706)021-7859`: true,
`(707)357-8230`: true,
`(708)245-0694`: true,
`(708)907-9137`: true,
`(709)679-7726`: true,
`(710)315-6149`: true,
`(711)499-6820`: true,
`(712)182-2385`: true,
`(712)943-1067`: true,
`(713)078-7309`: true,
`(713)282-1103`: true,
`(713)888-1609`: true,
`(714)489-4836`: true,
`(714)532-9784`: true,
`(714)589-2697`: true,
`(714)725-3320`: true,
`(715)926-8554`: true,
`(717)296-3780`: true,
`(717)392-9508`: true,
`(718)838-3600`: true,
`(719)831-7376`: true,
`(719)954-3815`: true,
`(720)426-7959`: true,
`(720)437-6393`: true,
`(724)126-9900`: true,
`(724)229-3105`: true,
`(725)396-8121`: true,
`(726)900-2631`: true,
`(727)695-2782`: true,
`(728)179-6849`: true,
`(730)006-9963`: true,
`(731)087-2021`: true,
`(731)747-9962`: true,
`(732)212-3121`: true,
`(733)036-5331`: true,
`(733)527-8173`: true,
`(733)934-8906`: true,
`(734)805-0698`: true,
`(735)447-5288`: true,
`(736)068-7905`: true,
`(736)141-3190`: true,
`(737)834-7922`: true,
`(739)712-7981`: true,
`(740)439-4080`: true,
`(741)651-2611`: true,
`(742)057-3047`: true,
`(742)851-1109`: true,
`(743)771-1953`: true,
`(744)038-4911`: true,
`(744)269-2466`: true,
`(745)625-4492`: true,
`(746)052-6260`: true,
`(747)047-0854`: true,
`(748)496-6638`: true,
`(748)640-5986`: true,
`(748)941-9575`: true,
`(749)328-0833`: true,
`(749)675-5619`: true,
`(751)117-2370`: true,
`(751)468-0594`: true,
`(751)724-9503`: true,
`(752)623-8555`: true,
`(755)270-0373`: true,
`(755)375-1935`: true,
`(755)483-9014`: true,
`(756)067-8075`: true,
`(757)193-1109`: true,
`(759)957-2741`: true,
`(760)032-5379`: true,
`(760)226-4153`: true,
`(760)508-8473`: true,
`(761)292-1159`: true,
`(761)770-7382`: true,
`(761)986-9054`: true,
`(762)148-6339`: true,
`(763)595-3724`: true,
`(764)408-3515`: true,
`(766)167-8587`: true,
`(768)584-0342`: true,
`(769)152-1601`: true,
`(769)275-5693`: true,
`(770)349-8258`: true,
`(770)467-2443`: true,
`(770)702-3494`: true,
`(771)137-8946`: true,
`(771)613-6848`: true,
`(771)769-8105`: true,
`(771)867-9665`: true,
`(773)841-0055`: true,
`(774)619-9237`: true,
`(774)780-5604`: true,
`(774)840-6740`: true,
`(775)862-9463`: true,
`(779)588-9955`: true,
`(780)129-4538`: true,
`(781)273-3064`: true,
`(781)834-5371`: true,
`(784)638-1850`: true,
`(785)238-4683`: true,
`(785)299-1011`: true,
`(785)910-3080`: true,
`(787)542-1431`: true,
`(787)624-0514`: true,
`(788)288-9544`: true,
`(788)293-3465`: true,
`(790)248-0778`: true,
`(790)258-1436`: true,
`(790)292-7346`: true,
`(791)414-2366`: true,
`(794)405-1423`: true,
`(796)547-6357`: true,
`(796)993-4781`: true,
`(797)084-7316`: true,
`(797)387-8553`: true,
`(800)113-1772`: true,
`(801)282-8040`: true,
`(801)534-7997`: true,
`(802)171-7049`: true,
`(802)457-4026`: true,
`(803)667-9121`: true,
`(804)356-6528`: true,
`(805)908-0773`: true,
`(808)026-8750`: true,
`(808)726-1797`: true,
`(809)137-7017`: true,
`(809)859-2894`: true,
`(811)084-1723`: true,
`(812)814-2808`: true,
`(813)232-5375`: true,
`(815)119-3354`: true,
`(815)574-6110`: true,
`(815)922-9990`: true,
`(815)988-9936`: true,
`(816)932-6273`: true,
`(818)080-9652`: true,
`(818)207-5326`: true,
`(819)085-2607`: true,
`(819)274-5153`: true,
`(821)143-6569`: true,
`(824)000-6213`: true,
`(826)146-1471`: true,
`(827)055-4196`: true,
`(831)517-7557`: true,
`(835)044-4685`: true,
`(835)566-4747`: true,
`(836)214-5561`: true,
`(836)667-7541`: true,
`(838)430-2097`: true,
`(839)611-8354`: true,
`(840)214-1443`: true,
`(842)206-9652`: true,
`(842)553-9277`: true,
`(842)984-2217`: true,
`(843)609-6669`: true,
`(843)954-4932`: true,
`(845)125-8340`: true,
`(846)415-6832`: true,
`(849)176-1461`: true,
`(850)456-0085`: true,
`(851)544-0548`: true,
`(851)950-9071`: true,
`(853)054-9411`: true,
`(853)714-7336`: true,
`(854)055-1538`: true,
`(854)768-9065`: true,
`(854)772-6556`: true,
`(855)148-9530`: true,
`(855)921-1046`: true,
`(856)368-2122`: true,
`(857)077-4220`: true,
`(857)454-3787`: true,
`(859)131-3651`: true,
`(862)731-8562`: true,
`(863)595-1623`: true,
`(864)113-0448`: true,
`(866)690-4927`: true,
`(869)168-3379`: true,
`(869)219-9586`: true,
`(869)636-8984`: true,
`(872)062-9910`: true,
`(873)138-2124`: true,
`(873)591-1697`: true,
`(876)342-2217`: true,
`(876)816-1712`: true,
`(877)428-2087`: true,
`(879)646-6310`: true,
`(881)626-2391`: true,
`(881)760-6150`: true,
`(883)422-0394`: true,
`(883)638-2566`: true,
`(885)578-8821`: true,
`(888)489-0328`: true,
`(890)215-4593`: true,
`(891)340-2881`: true,
`(891)550-3544`: true,
`(892)328-0619`: true,
`(893)120-9009`: true,
`(894)325-8747`: true,
`(894)371-5424`: true,
`(894)577-2581`: true,
`(895)254-0384`: true,
`(895)756-4212`: true,
`(896)161-1085`: true,
`(896)745-9705`: true,
`(896)988-8817`: true,
`(898)335-4657`: true,
`(900)591-9222`: true,
`(901)868-4243`: true,
`(902)063-0631`: true,
`(903)939-8820`: true,
`(904)319-2997`: true,
`(905)653-8129`: true,
`(906)466-2298`: true,
`(907)759-8056`: true,
`(909)246-1852`: true,
`(909)300-2377`: true,
`(909)345-0034`: true,
`(910)861-4300`: true,
`(911)021-7823`: true,
`(911)281-3420`: true,
`(911)724-4584`: true,
`(913)503-8339`: true,
`(914)021-5994`: true,
`(915)757-2966`: true,
`(916)147-7644`: true,
`(917)141-1025`: true,
`(917)694-5537`: true,
`(918)803-9971`: true,
`(919)532-5858`: true,
`(919)693-6668`: true,
`(921)251-4862`: true,
`(921)775-9266`: true,
`(922)750-4564`: true,
`(924)229-8600`: true,
`(925)020-5381`: true,
`(925)692-5744`: true,
`(925)878-9730`: true,
`(926)487-5368`: true,
`(928)631-5868`: true,
`(929)550-5648`: true,
`(929)907-8014`: true,
`(932)218-3738`: true,
`(935)580-3106`: true,
`(935)606-3273`: true,
`(935)751-3561`: true,
`(936)135-2310`: true,
`(938)413-6458`: true,
`(941)047-2527`: true,
`(941)296-8588`: true,
`(941)934-6234`: true,
`(942)354-1999`: true,
`(942)722-6917`: true,
`(943)217-1571`: true,
`(943)774-5357`: true,
`(944)886-8208`: true,
`(947)108-2454`: true,
`(947)538-2838`: true,
`(948)304-6100`: true,
`(948)733-3149`: true,
`(949)800-0810`: true,
`(951)270-9835`: true,
`(952)162-1559`: true,
`(952)853-3566`: true,
`(953)189-1330`: true,
`(955)947-0459`: true,
`(956)517-0702`: true,
`(957)103-7685`: true,
`(957)376-1507`: true,
`(957)568-5503`: true,
`(959)252-4837`: true,
`(959)866-6711`: true,
`(960)159-9490`: true,
`(961)012-7334`: true,
`(961)772-7344`: true,
`(962)558-0335`: true,
`(963)592-4777`: true,
`(964)921-2640`: true,
`(967)034-3119`: true,
`(967)803-7125`: true,
`(968)059-6712`: true,
`(968)923-4624`: true,
`(969)545-9064`: true,
`(970)639-3627`: true,
`(970)819-7458`: true,
`(971)387-8213`: true,
`(973)129-2831`: true,
`(973)147-3696`: true,
`(973)724-7344`: true,
`(974)718-6899`: true,
`(974)793-8041`: true,
`(976)135-2972`: true,
`(978)965-3841`: true,
`(979)722-7875`: true,
`(980)341-1664`: true,
`(980)930-4619`: true,
`(981)732-8982`: true,
`(983)627-8743`: true,
`(984)814-2316`: true,
`(985)173-3767`: true,
`(986)294-6279`: true,
`(989)251-0197`: true,
`(990)266-2799`: true,
`(991)231-1452`: true,
`(992)643-0429`: true,
`(995)289-6049`: true,
`(995)907-1091`: true,
`(995)952-5150`: true,
`(996)139-6132`: true,
`(999)673-0589`: true,
`(999)879-1284`: true},
`State`: {
`Alabama`: true,
`Alaska`: true,
`Arizona`: true,
`Arkansas`: true,
`California`: true,
`Colorado`: true,
`Connecticut`: true,
`Delaware`: true,
`Florida`: true,
`Georgia`: true,
`Hawaii`: true,
`Idaho`: true,
`Illinois`: true,
`Indiana`: true,
`Iowa`: true,
`Kansas`: true,
`Kentucky`: true,
`Louisiana`: true,
`Maine`: true,
`Maryland`: true,
`Massachusetts`: true,
`Michigan`: true,
`Minnesota`: true,
`Mississippi`: true,
`Missouri`: true,
`Montana`: true,
`Nebraska`: true,
`Nevada`: true,
`New Hampshire`: true,
`New Jersey`: true,
`New Mexico`: true,
`New York `: true,
`North Carolina`: true,
`North Dakota`: true,
`Ohio`: true,
`Oklahoma`: true,
`Oregon`: true,
`Pennsylvania`: true,
`Rhode Island`: true,
`South Carolina`: true,
`South Dakota`: true,
`Tennessee`: true,
`Texas`: true,
`Utah`: true,
`Vermont`: true,
`Virginia`: true,
`Washington`: true,
`West Virginia`: true,
`Wisconsin`: true,
`Wyoming`: true},
`Street`: {
`11th St`: true,
`1st St`: true,
`2nd St`: true,
`3rd St`: true,
`41st St`: true,
`4th St`: true,
`6th St`: true,
`7th St`: true,
`8th St`: true,
`9th St`: true,
`<NAME>n`: true,
`Abbey Ln`: true,
`Abercrombie St`: true,
`Aberdeen Ct`: true,
`Abernathy Rd`: true,
`Abington Ct`: true,
`Access Rd`: true,
`Ackerman Rd`: true,
`<NAME> NW`: true,
`Adair Dr`: true,
`Adair Hollow Rd`: true,
`Adairsville Pleasant Valley Rd`: true,
`Adams Chapel Rd`: true,
`Adams Way`: true,
`Adcock Loop`: true,
`Adcock Rd`: true,
`Aiken St`: true,
`Akin Dr`: true,
`Akin Rd`: true,
`Akin Way`: true,
`Akron St`: true,
`Alex Dr`: true,
`Alexander St`: true,
`Alford Rd`: true,
`<NAME>ir`: true,
`All Metals Dr`: true,
`Allatoona Dam Rd`: true,
`Allatoona Dr`: true,
`Allatoona Estates Dr`: true,
`Allatoona Landing Rd`: true,
`Allatoona Pass Rd`: true,
`Allatoona Trace Dr`: true,
`Allatoona Woods Trl`: true,
`Allegiance Ct`: true,
`Allen Cir`: true,
`Allen Rd`: true,
`Allison Cir`: true,
`Allweather St`: true,
`Alpine Dr`: true,
`Amanda Ln`: true,
`Amandas Ct`: true,
`Amberidge Dr`: true,
`Amberly Ln`: true,
`Amberwood Conn`: true,
`Amberwood Ct`: true,
`Amberwood Ln`: true,
`Amberwood Pl`: true,
`Amberwood Trl`: true,
`Amberwood Way`: true,
`Ampacet Dr`: true,
`Anchor Rd`: true,
`Anderson St`: true,
`<NAME> Trl`: true,
`Angus Trl`: true,
`Ann Cir`: true,
`Ann Rd`: true,
`Anna Pl`: true,
`Anns Ct`: true,
`Anns Trc`: true,
`Ansley Way`: true,
`Ansubet Dr`: true,
`Antebellum Ct`: true,
`Apache Dr`: true,
`Apache Trl`: true,
`Apex Dr`: true,
`Appaloosa Ct`: true,
`Apple Barrel Way`: true,
`Apple Ln`: true,
`Apple Tree Ln`: true,
`Apple Wood Ln`: true,
`Appletree Ct`: true,
`Appling Way`: true,
`April Ln`: true,
`Aragon Rd`: true,
`Arapaho Dr`: true,
`Arbor Ln`: true,
`Arbors Way`: true,
`Arbutus Trl`: true,
`Ardmore Cir`: true,
`Arizona Ave`: true,
`Arlington Way`: true,
`Arnold Rd`: true,
`<NAME>`: true,
`Arrington Rd`: true,
`Arrow Mountain Dr`: true,
`Arrowhead Ct`: true,
`Arrowhead Dr`: true,
`Arrowhead Ln`: true,
`Ash Ct`: true,
`Ash Way`: true,
`Ashford Ct`: true,
`Ashford Pt`: true,
`Ashley Ct`: true,
`Ashley Rd`: true,
`Ashwood Dr`: true,
`Aspen Dr`: true,
`Aspen Ln`: true,
`Assembly Dr`: true,
`Atco All`: true,
`Attaway Dr`: true,
`Atwood Rd`: true,
`Aubrey Lake Rd`: true,
`Aubrey Rd`: true,
`Aubrey St`: true,
`Auburn Dr`: true,
`Austin Rd`: true,
`Autry Rd`: true,
`Autumn Pl`: true,
`Autumn Ridge Dr`: true,
`Autumn Turn`: true,
`Autumn Wood Dr`: true,
`Avenue Of Savannah`: true,
`Avon Ct`: true,
`Azalea Dr`: true,
`Aztec Way`: true,
`B D Trl`: true,
`Backus Rd`: true,
`Bagwell Ln`: true,
`Bailey Hill Rd`: true,
`Bailey Rd`: true,
`Baker Rd`: true,
`Baker St`: true,
`<NAME> Lndg`: true,
`Baldwell Ct`: true,
`Balfour Dr`: true,
`Balsam Dr`: true,
`Bandit Ln`: true,
`Bangor St`: true,
`Baptist Cir`: true,
`Barnsley Church Rd`: true,
`Barnsley Ct`: true,
`Barnsley Dr`: true,
`Barnsley Garden Rd`: true,
`Barnsley Village Dr`: true,
`Barnsley Village Trl`: true,
`Barrett Ln`: true,
`Barrett Rd`: true,
`Barry Dr`: true,
`Bartow Beach Rd`: true,
`<NAME> Rd`: true,
`Bartow St`: true,
`Bates Rd`: true,
`Bay Ct`: true,
`Bearden Rd`: true,
`Beasley Rd`: true,
`Beaureguard St`: true,
`Beaver Trl`: true,
`Beavers Dr`: true,
`Bedford Ct`: true,
`Bedford Rdg`: true,
`Bee Tree Rd`: true,
`Beechwood Dr`: true,
`Beguine Dr`: true,
`Bell Dr`: true,
`<NAME> Rd`: true,
`Belmont Dr`: true,
`Belmont Way`: true,
`Benfield Cir`: true,
`Benham Cir`: true,
`<NAME> Rd`: true,
`Bennett Way`: true,
`Bent Water Dr`: true,
`Berkeley Pl`: true,
`Berkshire Dr`: true,
`Bestway Dr`: true,
`Bestway Pkwy`: true,
`Betsy Locke Pt`: true,
`Beverlie Dr`: true,
`Bevil Ridge Rd`: true,
`Biddy Rd`: true,
`Big Branch Ct`: true,
`Big Ditch Rd`: true,
`Big Oak Tree Rd`: true,
`Big Pond Rd`: true,
`<NAME> Rd`: true,
`<NAME> Rd`: true,
`Billies Cv`: true,
`Bingham Rd`: true,
`Birch Pl`: true,
`Birch Way`: true,
`Bishop Cv`: true,
`Bishop Dr`: true,
`Bishop Loop`: true,
`Bishop Mill Dr`: true,
`Bishop Rd`: true,
`Black Jack Mountain Cir`: true,
`Black Oak Rd`: true,
`Black Rd`: true,
`Black Water Dr`: true,
`Blackacre Trl`: true,
`Blackberry Rdg`: true,
`Blackfoot Trl`: true,
`Blacksmith Ln`: true,
`Bloomfield Ct`: true,
`Blueberry Rdg`: true,
`Bluebird Cir`: true,
`Bluegrass Cv`: true,
`Bluff Ct`: true,
`Boardwalk Ct`: true,
`Boatner Ave`: true,
`Bob O Link Dr`: true,
`Bob White Trl`: true,
`Bobcat Ct`: true,
`Boliver Rd`: true,
`Bonair St`: true,
`Boones Farm`: true,
`Boones Ridge Dr`: true,
`Boones Ridge Pkwy`: true,
`Boss Rd`: true,
`Boulder Crest Rd`: true,
`Boulder Rd`: true,
`Bowen Rd`: true,
`Bowens Ct`: true,
`Boyd Morris Dr`: true,
`Boyd Mountain Rd`: true,
`Boysenberry Ct`: true,
`Bozeman Rd`: true,
`Bradford Ct`: true,
`Bradford Dr`: true,
`Bradley Ln`: true,
`Bradley Trl`: true,
`Bramblewood Ct`: true,
`Bramblewood Dr`: true,
`Bramblewood Pl`: true,
`Bramblewood Trl`: true,
`Bramblewood Way`: true,
`Brandon Farm Rd`: true,
`Brandon Rdg`: true,
`Brandy Ln`: true,
`Branson Crossing Rd`: true,
`Branson Mill Dr`: true,
`Branton Rd`: true,
`<NAME>ir`: true,
`Brentwood Dr`: true,
`Brett Way`: true,
`Briar Chase Ct`: true,
`Briar Patch Ln`: true,
`Briarcrest Way`: true,
`Briarwood Ln`: true,
`Brickshire`: true,
`Brickshire Dr`: true,
`Bridgestone Way`: true,
`Bridlewood Ct`: true,
`Brighton Ct`: true,
`Brightwell Pl`: true,
`Bristol Ct`: true,
`Brittani Ln`: true,
`Broadlands Dr`: true,
`Broken Arrow Ct`: true,
`Bronco Ct`: true,
`Brook Dr`: true,
`Brook Knoll Ct`: true,
`Brooke Rd`: true,
`Brookhollow Ln`: true,
`Brookland Dr`: true,
`Brookshire Dr`: true,
`Brookside Ct`: true,
`Brookside Way`: true,
`Brookwood Dr`: true,
`Brown Dr`: true,
`Brown Farm Rd`: true,
`Brown Loop`: true,
`Brown Loop Spur`: true,
`Brown Rd`: true,
`Brownwood Dr`: true,
`Bruce St`: true,
`Brutis Rd`: true,
`Bryan Dr`: true,
`Bryan Ln`: true,
`Buckhorn Trl`: true,
`Buckingham Ct`: true,
`Buckland Ct`: true,
`Buckskin Dr`: true,
`Bucky St`: true,
`Buena Vista Cir`: true,
`Buford St`: true,
`Bunch Mountain Rd`: true,
`Burch Ln`: true,
`Burges Mill Rd`: true,
`Burnt Hickory Dr`: true,
`Burnt Hickory Rd`: true,
`Busch Dr`: true,
`Bushey Trl`: true,
`Buttonwood Dr`: true,
`Buttram Rd`: true,
`Byars Rd`: true,
`C J Ct`: true,
`C J Dr`: true,
`Caboose Ct`: true,
`Cade Dr`: true,
`Cagle Rd`: true,
`Cain Dr`: true,
`Calico Valley Rd`: true,
`Calloway Ln`: true,
`Calvary Ct`: true,
`Cambridge Ct`: true,
`Cambridge Way`: true,
`Camden Woods Dr`: true,
`Camellia Ln`: true,
`Camelot Dr`: true,
`Camp Creek Rd`: true,
`Camp Dr`: true,
`Camp Pl`: true,
`Camp Sunrise Rd`: true,
`Camp Trl`: true,
`Campbell Dr`: true,
`Campfire Trl`: true,
`Candlestick Comm`: true,
`Canefield Dr`: true,
`<NAME>`: true,
`Cannon Ct`: true,
`Cannonade Run`: true,
`Canter Ln`: true,
`Canterbury Ct`: true,
`Canterbury Walk`: true,
`Cantrell Ln`: true,
`Cantrell Pt`: true,
`Cantrell St`: true,
`Canty Rd`: true,
`<NAME>`: true,
`Captains Turn`: true,
`Captains Walk`: true,
`Cardinal Ct`: true,
`Cardinal Rd`: true,
`<NAME> Dr`: true,
`<NAME>`: true,
`Carnes Dr`: true,
`Carnes Rd`: true,
`Carolyn Ct`: true,
`Carr Rd`: true,
`Carriage Ln`: true,
`Carriage Trc`: true,
`Carrington Dr`: true,
`Carrington Trc`: true,
`<NAME> Rd`: true,
`Carson Ct`: true,
`Carson Loop`: true,
`Carson Rd`: true,
`Carter Grove Blvd`: true,
`Carter Ln`: true,
`Carter Rd`: true,
`Carver Landing Rd`: true,
`Casey Dr`: true,
`Casey Ln`: true,
`Casey St`: true,
`Cass Dr`: true,
`Cass Station Dr`: true,
`Cass Station Pass`: true,
`Cassandra View`: true,
`Cassville Pine Log Rd`: true,
`Cassville Rd`: true,
`Cassville White Rd`: true,
`Catalpa Ct`: true,
`Cathedral Hght`: true,
`Catherine Cir`: true,
`Catherine Way`: true,
`Cedar Creek Church Rd`: true,
`Cedar Creek Rd`: true,
`Cedar Gate Ln`: true,
`Cedar Ln`: true,
`Cedar Rd`: true,
`Cedar Rdg`: true,
`Cedar Springs Dr`: true,
`Cedar St`: true,
`Cedar Way`: true,
`Cemetary Rd`: true,
`Center Bluff`: true,
`Center Rd`: true,
`Center St`: true,
`Centerport Dr`: true,
`Central Ave`: true,
`Chance Cir`: true,
`Chandler Ln`: true,
`Chapel Way`: true,
`Charismatic Rd`: true,
`Charles Ct`: true,
`Charles St`: true,
`Charlotte Dr`: true,
`Chase Pl`: true,
`Chateau Dr`: true,
`Cherokee Cir`: true,
`Cherokee Dr`: true,
`Cherokee Hght`: true,
`Cherokee Hills Dr`: true,
`Cherokee Pl`: true,
`Cherokee St`: true,
`Cherry St`: true,
`Cherrywood Ln`: true,
`Cherrywood Way`: true,
`Cheryl Dr`: true,
`Chestnut Ridge Ct`: true,
`Chestnut Ridge Dr`: true,
`Chestnut St`: true,
`Cheyenne Way`: true,
`Chickasaw Trl`: true,
`Chickasaw Way`: true,
`Chimney Ln`: true,
`Chimney Springs Dr`: true,
`Chippewa Dr`: true,
`Chippewa Way`: true,
`<NAME>ary Rd`: true,
`Choctaw Ct`: true,
`Christon Dr`: true,
`Christopher Pl`: true,
`Christopher Rdg`: true,
`Chulio Dr`: true,
`Chunn Dr`: true,
`<NAME> Rd`: true,
`Church St`: true,
`Churchill Down`: true,
`Churchill Downs Down`: true,
`Cindy Ln`: true,
`Citation Pte`: true,
`Claire Cv`: true,
`<NAME>ir`: true,
`Clark Way`: true,
`Clear Creek Rd`: true,
`Clear Lake Dr`: true,
`Clear Pass`: true,
`Clearview Dr`: true,
`Clearwater St`: true,
`<NAME> Rd`: true,
`Cliffhanger Pte`: true,
`Cline Dr`: true,
`<NAME> Rd`: true,
`Cline St`: true,
`Clover Dr`: true,
`Clover Ln`: true,
`Clover Pass`: true,
`Clubhouse Ct`: true,
`Clubview Dr`: true,
`Clydesdale Trl`: true,
`Cobblestone Dr`: true,
`Cochrans Way`: true,
`Coffee St`: true,
`Cole Ct`: true,
`Cole Dr`: true,
`Coleman St`: true,
`Colleen and Karen Rd`: true,
`College St`: true,
`Collins Dr`: true,
`Collins Pl`: true,
`Collins St`: true,
`Collum Rd`: true,
`Colonial Cir`: true,
`Colonial Club Dr`: true,
`Colony Ct`: true,
`Colony Dr`: true,
`Colt Ct`: true,
`Colt Way`: true,
`Columbia St`: true,
`Comedy Ln`: true,
`Commanche Dr`: true,
`Commanche Trl`: true,
`Commerce Dr`: true,
`Commerce Row`: true,
`Commerce Way`: true,
`Cone Rd`: true,
`Confederate St`: true,
`Connesena Rd`: true,
`Connie St`: true,
`Conyers Industrial Dr`: true,
`Cook St`: true,
`Cooper Mill Rd`: true,
`Copeland Rd`: true,
`Coperite Pl`: true,
`Copperhead Rd`: true,
`Corbitt Dr`: true,
`Corinth Rd`: true,
`Corson Trl`: true,
`Cottage Dr`: true,
`Cottage Trc`: true,
`Cottage Walk`: true,
`Cotton Bend`: true,
`Cotton Dr`: true,
`Cotton St`: true,
`Cottonwood Ct`: true,
`Country Club Dr`: true,
`Country Cove Ln`: true,
`Country Creek Rd`: true,
`Country Dr`: true,
`Country Ln`: true,
`Country Meadow Way`: true,
`Country Walk`: true,
`County Line Loop No 1`: true,
`County Line Rd`: true,
`County Line Road No 2`: true,
`Courrant St`: true,
`Court Xing`: true,
`Courtyard Dr`: true,
`Courtyard Ln`: true,
`Covered Bridge Rd`: true,
`Cowan Dr`: true,
`Cox Farm Rd`: true,
`Cox Farm Spur`: true,
`Cox Rd`: true,
`Cox St`: true,
`Cozy Ln`: true,
`Craigs Rd`: true,
`Crane Cir`: true,
`Creed Dr`: true,
`Creek Bend Ct`: true,
`Creek Dr`: true,
`Creek Trl`: true,
`Creekbend Dr`: true,
`Creekside Dr`: true,
`Creekside Ln`: true,
`Creekstone Ct`: true,
`Creekview Dr`: true,
`Crescent Dr`: true,
`Crestbrook Dr`: true,
`Crestview Ln`: true,
`Crestwood Ct`: true,
`Crestwood Rd`: true,
`Crimson Hill Dr`: true,
`Criss Black Rd`: true,
`Crolley Ln`: true,
`Cromwell Ct`: true,
`Cross Creek Dr`: true,
`Cross St`: true,
`Cross Tie Ct`: true,
`Crossbridge CT`: true,
`Crossfield Cir`: true,
`Crowe Dr`: true,
`Crowe Springs Rd`: true,
`Crowe Springs Spur`: true,
`Crump Rd`: true,
`Crystal Ln`: true,
`Crystal Mountain Rd`: true,
`Culver Rd`: true,
`Cumberland Gap`: true,
`Cumberland Rd`: true,
`Cummings Rd`: true,
`Curtis Ct`: true,
`Cut Off Rd`: true,
`Cypress Way`: true,
`Dabbs Dr`: true,
`Dan Dr`: true,
`Dana Way`: true,
`Danby Ct`: true,
`Darnell Rd`: true,
`David Rd`: true,
`David St`: true,
`Davids Way`: true,
`Davis Dr`: true,
`Davis Loop`: true,
`Davis St`: true,
`Davistown Rd`: true,
`Dawn Dr`: true,
`Dawns Way`: true,
`Dawson St`: true,
`Dean Dr`: true,
`Dean Rd`: true,
`Dean St`: true,
`<NAME>ir`: true,
`Deens Rd`: true,
`Deer Lodge Rd`: true,
`Deer Run Dr`: true,
`Deer Run Ln`: true,
`Deering Way`: true,
`Deerview Ct`: true,
`Defender St`: true,
`Dempsey Loop`: true,
`Dempsey Rd`: true,
`Dent Dr`: true,
`Denver Dr`: true,
`Derby Way`: true,
`Derrick Ln`: true,
`Devin Ln`: true,
`Devon Ct`: true,
`Dewberry Ln`: true,
`Dewey Dr`: true,
`Dianne Dr`: true,
`Dixie Dr`: true,
`Dobson Dr`: true,
`Dodd Rd`: true,
`Dodson Rd`: true,
`Doe Ct`: true,
`Dog Ln`: true,
`Dogwood Cir`: true,
`Dogwood Dr`: true,
`Dogwood Ln`: true,
`Dogwood Pl`: true,
`Dogwood Trl`: true,
`Dolphin Dr`: true,
`Donn Dr`: true,
`<NAME> Rd`: true,
`Doris Rd`: true,
`Doss Dr`: true,
`Douglas St`: true,
`Douthit Bridge Rd`: true,
`<NAME> Rd`: true,
`Dove Ct`: true,
`Dove Dr`: true,
`Dove Trl`: true,
`Dover Rd`: true,
`Downing Way`: true,
`Dripping Rock Trl`: true,
`Drury Ln`: true,
`<NAME> Rd`: true,
`Duncan Dr`: true,
`Dunhill Ct`: true,
`Durey Ct`: true,
`Dyar St`: true,
`Dysart Rd`: true,
`E Carter St`: true,
`E Cherokee Ave`: true,
`E Church St`: true,
`E Felton Rd`: true,
`E George St`: true,
`E Greenridge Rd`: true,
`E Holiday Ct`: true,
`E Howard St`: true,
`E Indiana Ave`: true,
`E Lee St`: true,
`E Main St`: true,
`E Mitchell Rd`: true,
`E Pleasant Valley Rd`: true,
`E Porter St`: true,
`E Railroad St`: true,
`E Rocky St`: true,
`Eagle Dr`: true,
`Eagle Glen Dr`: true,
`Eagle Ln`: true,
`Eagle Mountain Trl`: true,
`Eagle Pkwy`: true,
`Eagles Ct`: true,
`Eagles Nest Cv`: true,
`Eagles View Dr`: true,
`Earle Dr`: true,
`East Boxwood Dr`: true,
`East Heritage Dr`: true,
`East Valley Rd`: true,
`Easton Trc`: true,
`Eastview Ct`: true,
`Eastview Ter`: true,
`Eastwood Dr`: true,
`Echota Rd`: true,
`Edgewater Dr`: true,
`Edgewood Rd`: true,
`Edsel Dr`: true,
`Eidson St`: true,
`Elizabeth Rd`: true,
`Elizabeth St`: true,
`Elkhorn Ct`: true,
`Elliott St`: true,
`Ellis Rd`: true,
`Elm Dr`: true,
`Elm St`: true,
`Elmwood Pl`: true,
`Elrod Rdg`: true,
`Elrod St`: true,
`Ember Way`: true,
`Emerald Pass`: true,
`Emerald Run`: true,
`Emerald Springs Ct`: true,
`Emerald Springs Dr`: true,
`Emerald Springs Way`: true,
`Emerald Trl`: true,
`Engineer Ln`: true,
`English Turn`: true,
`Enon Ridge Rd`: true,
`Enterprise Dr`: true,
`Equestrian Way`: true,
`Estate Dr`: true,
`Estates Rdg`: true,
`Etowah Ct`: true,
`Etowah Dr`: true,
`Etowah Ln`: true,
`Etowah Ridge Dr`: true,
`Etowah Ridge Ovlk`: true,
`Etowah Ridge Trl`: true,
`Euharlee Five Forks Rd`: true,
`Euharlee Rd`: true,
`Euharlee St`: true,
`Evans Hightower Rd`: true,
`Evans Rd`: true,
`Evening Trl`: true,
`Everest Dr`: true,
`Everett Cir`: true,
`Evergreen Trl`: true,
`Ezell Rd`: true,
`Fairfield Ct`: true,
`Fairfield Dr`: true,
`Fairfield Ln`: true,
`Fairfield Way`: true,
`Fairmount Rd`: true,
`Fairview Church Rd`: true,
`Fairview Cir`: true,
`Fairview Dr`: true,
`Fairview St`: true,
`Faith Ln`: true,
`Falcon Cir`: true,
`Fall Dr`: true,
`Falling Springs Rd`: true,
`Farm Rd`: true,
`Farmbrook Dr`: true,
`Farmer Rd`: true,
`Farmstead Ct`: true,
`Farr Cir`: true,
`Fawn Lake Trl`: true,
`Fawn Ridge Dr`: true,
`Fawn View`: true,
`Felton Pl`: true,
`Felton St`: true,
`Ferguson Dr`: true,
`Ferry Views`: true,
`Fields Rd`: true,
`Fieldstone Ct`: true,
`Fieldstone Path`: true,
`Fieldwood Dr`: true,
`Finch Ct`: true,
`Findley Rd`: true,
`Finley St`: true,
`Fire Tower Rd`: true,
`Fireside Ct`: true,
`Fite St`: true,
`Five Forks Rd`: true,
`Flagstone Ct`: true,
`Flint Hill Rd`: true,
`Floral Dr`: true,
`Florence Dr`: true,
`Florida Ave`: true,
`Floyd Creek Church Rd`: true,
`Floyd Rd`: true,
`Folsom Glade Rd`: true,
`Folsom Rd`: true,
`Fools Gold Rd`: true,
`Foothills Pkwy`: true,
`Ford St`: true,
`Forest Hill Dr`: true,
`Forest Trl`: true,
`Forrest Ave`: true,
`Forrest Hill Dr`: true,
`Forrest Ln`: true,
`Fossetts Cv`: true,
`Fouche Ct`: true,
`Fouche Dr`: true,
`Four Feathers Ln`: true,
`Fowler Dr`: true,
`Fowler Rd`: true,
`Fox Chas`: true,
`Fox Hill Dr`: true,
`Fox Meadow Ct`: true,
`Foxfire Ln`: true,
`Foxhound Way`: true,
`Foxrun Ct`: true,
`Frances Way`: true,
`Franklin Dr`: true,
`<NAME> Dr`: true,
`Franklin Loop`: true,
`Fredda Ln`: true,
`Freedom Dr`: true,
`Freeman St`: true,
`Friction Dr`: true,
`Friendly Ln`: true,
`Friendship Rd`: true,
`Fuger Ln`: true,
`Fun Dr`: true,
`Funkhouser Industrial Access Rd`: true,
`Gaddis Rd`: true,
`Gail St`: true,
`Gaines Rd`: true,
`Gaither Boggs Rd`: true,
`Galt St`: true,
`Galway Dr`: true,
`Garden Gate`: true,
`Garland No 1 Rd`: true,
`Garland No 2 Rd`: true,
`Garrison Dr`: true,
`Gaston Westbrook Ave`: true,
`Gatepost Ln`: true,
`Gatlin Rd`: true,
`Gayle Dr`: true,
`Geneva Ln`: true,
`Gentilly Blvd`: true,
`Gentry Dr`: true,
`George St`: true,
`Georgia Ave`: true,
`Georgia Blvd`: true,
`Georgia North Cir`: true,
`Georgia North Industrial Rd`: true,
`Gertrude Ln`: true,
`Gibbons Rd`: true,
`Gill Rd`: true,
`<NAME>`: true,
`Gilmer St`: true,
`Gilreath Rd`: true,
`Gilreath Trl`: true,
`Glade Rd`: true,
`Glen Cove Dr`: true,
`Glenabby Dr`: true,
`<NAME>ve`: true,
`Glenmaura Way`: true,
`Glenmore Dr`: true,
`Glenn Dr`: true,
`Glory Ln`: true,
`Gold Creek Trl`: true,
`Gold Hill Dr`: true,
`Golden Eagle Dr`: true,
`Goode Dr`: true,
`<NAME> Rd`: true,
`Goodwin St`: true,
`Goodyear Ave`: true,
`<NAME> Rd`: true,
`Gordon Rd`: true,
`Gore Rd`: true,
`Gore Springs Rd`: true,
`Goss St`: true,
`Governors Ct`: true,
`Grace Park Dr`: true,
`Grace St`: true,
`Grand Main St`: true,
`Grandview Ct`: true,
`Grandview Dr`: true,
`Granger Dr`: true,
`Grant Dr`: true,
`Grapevine Way`: true,
`Grassdale Rd`: true,
`Gray Rd`: true,
`Gray St`: true,
`Graysburg Dr`: true,
`Graystone Dr`: true,
`Greatwood Dr`: true,
`Green Acre Ln`: true,
`Green Apple Ct`: true,
`Green Gable Pt`: true,
`Green Ives Ln`: true,
`Green Loop Rd`: true,
`Green Rd`: true,
`Green St`: true,
`Green Valley Trl`: true,
`Greenbriar Ave`: true,
`Greencliff Way`: true,
`Greenhouse Dr`: true,
`Greenmont Ct`: true,
`Greenridge Rd`: true,
`Greenridge Trl`: true,
`Greenway Ln`: true,
`Greenwood Dr`: true,
`Greyrock`: true,
`Greystone Ln`: true,
`Greystone Way`: true,
`Greywood Ln`: true,
`Griffin Mill Dr`: true,
`Griffin Rd`: true,
`Grimshaw Rd`: true,
`Grist Mill Ln`: true,
`Gristmill Parish`: true,
`Grogan Rd`: true,
`Groovers Landing Rd`: true,
`Grove Cir`: true,
`Grove Park Cir`: true,
`Grove Pointe Way`: true,
`Grove Springs Ct`: true,
`Grove Way`: true,
`Grover Rd`: true,
`Guest Holl`: true,
`Gum Dr`: true,
`Gum Springs Ln`: true,
`Gunston Hall`: true,
`Guyton Industrial Dr`: true,
`Guyton St`: true,
`Habersham Cir`: true,
`Haley Pl`: true,
`Hall St`: true,
`Hall Station Rd`: true,
`Hames Pte`: true,
`Hamil Ct`: true,
`Hamilton Blvd`: true,
`Hamilton Crossing Rd`: true,
`Hampton Dr`: true,
`Hampton Ln`: true,
`Haney Hollow Way`: true,
`Hannon Way`: true,
`Happy Hollow Rd`: true,
`Happy Valley Ln`: true,
`Harbor Dr`: true,
`Harbor Ln`: true,
`Hardin Bridge Rd`: true,
`Hardin Rd`: true,
`Hardwood Ct`: true,
`Hardwood Ridge Dr`: true,
`Hardwood Ridge Pkwy`: true,
`Hardy Rd`: true,
`Hargis Way`: true,
`Harris Rd`: true,
`Harris St`: true,
`Harrison Rd`: true,
`Harvest Way`: true,
`<NAME> Rd`: true,
`Hastings Dr`: true,
`Hatfield Rd`: true,
`Hattie St`: true,
`Hawk Rd`: true,
`Hawkins Rd`: true,
`Hawks Branch Ln`: true,
`Hawks Farm Rd`: true,
`Hawkstone Ct`: true,
`Hawthorne Dr`: true,
`<NAME>`: true,
`Hazelwood Rd`: true,
`Headden Rdg`: true,
`Heartwood Dr`: true,
`Heatco Ct`: true,
`Hedgerow Ct`: true,
`Heidelberg Ln`: true,
`Helen Ln`: true,
`Hemlock Pl`: true,
`Henderson Dr`: true,
`Henderson Rd`: true,
`Hendricks Rd`: true,
`Hendricks St`: true,
`<NAME> Rd`: true,
`Hepworth Ln`: true,
`Heritage Ave`: true,
`Heritage Cv`: true,
`Heritage Dr`: true,
`Heritage Way`: true,
`Herring St`: true,
`Hickory Forest Ln`: true,
`Hickory Hill Dr`: true,
`Hickory Holl`: true,
`Hickory Ln`: true,
`Hidden Valley Ln`: true,
`High Ct`: true,
`High Moon St`: true,
`High Point Ct`: true,
`High Pointe Dr`: true,
`Highland Cir`: true,
`Highland Crest Dr`: true,
`Highland Dr`: true,
`Highland Ln`: true,
`Highland Trl`: true,
`Highland Way`: true,
`Highpine Dr`: true,
`Hill St`: true,
`Hillside Dr`: true,
`Hillstone Way`: true,
`Hilltop Ct`: true,
`Hilltop Dr`: true,
`History St`: true,
`Hitchcock Sta`: true,
`Hobgood Rd`: true,
`Hodges Mine Rd`: true,
`Holcomb Rd`: true,
`Holcomb Spur`: true,
`Holcomb Trl`: true,
`Holloway Rd`: true,
`Hollows Dr`: true,
`Holly Ann St`: true,
`Holly Dr`: true,
`Holly Springs Rd`: true,
`Hollyhock Ln`: true,
`Holt Rd`: true,
`Home Place Dr`: true,
`Home Place Rd`: true,
`Homestead Dr`: true,
`Hometown Ct`: true,
`Honey Vine Trl`: true,
`Honeylocust Ct`: true,
`Honeysuckle Dr`: true,
`Hopkins Breeze`: true,
`Hopkins Farm Dr`: true,
`Hopkins Rd`: true,
`Hopson Rd`: true,
`Horizon Trl`: true,
`Horseshoe Ct`: true,
`Horseshoe Loop`: true,
`Horseshow Rd`: true,
`Hotel St`: true,
`Howard Ave`: true,
`Howard Dr`: true,
`Howard Heights St`: true,
`Howard St`: true,
`Howell Bend Rd`: true,
`Howell Rd`: true,
`Howell St`: true,
`Hughs Pl`: true,
`Hunt Club Ln`: true,
`Huntcliff Dr`: true,
`Hunters Cv`: true,
`Hunters Rdg`: true,
`Hunters View`: true,
`Huntington Ct`: true,
`Hwy 293`: true,
`Hwy 411`: true,
`Hyatt Ct`: true,
`I-75`: true,
`Idlewood Dr`: true,
`Imperial Ct`: true,
`Independence Way`: true,
`Indian Hills Dr`: true,
`Indian Hills Hght`: true,
`Indian Mounds Rd`: true,
`Indian Ridge Ct`: true,
`Indian Springs Dr`: true,
`Indian Trl`: true,
`Indian Valley Way`: true,
`Indian Woods Dr`: true,
`Industrial Dr`: true,
`Industrial Park Rd`: true,
`Ingram Rd`: true,
`Iron Belt Ct`: true,
`Iron Belt Rd`: true,
`Iron Hill Cv`: true,
`Iron Hill Rd`: true,
`Iron Mountain Rd`: true,
`Irwin St`: true,
`Isabella Ct`: true,
`Island Ford Rd`: true,
`Island Mill Rd`: true,
`<NAME> Rd`: true,
`Ivanhoe Pl`: true,
`Ivy Chase Way`: true,
`Ivy Ln`: true,
`Ivy Stone Ct`: true,
`J R Rd`: true,
`Jackson Dr`: true,
`Jackson Pl`: true,
`Jackson Rd`: true,
`<NAME>`: true,
`Jackson St`: true,
`Jacob Dr`: true,
`Jacobs Rd`: true,
`<NAME>ve`: true,
`James Place`: true,
`James Rd`: true,
`James St`: true,
`Jamesport Ln`: true,
`Janice Dr`: true,
`Janice Ln`: true,
`<NAME>`: true,
`Jasmine Ln`: true,
`Jazmin Sq`: true,
`Jeffery Ln`: true,
`Jeffery Rd`: true,
`Jenkins Dr`: true,
`Jennifer Ln`: true,
`Jenny Ln`: true,
`Jewell Rd`: true,
`Jill Ln`: true,
`Jim Dr`: true,
`<NAME> Rd`: true,
`Jim Ln`: true,
`<NAME> Rd`: true,
`Jockey Way`: true,
`<NAME> Pkwy`: true,
`<NAME> Rd`: true,
`<NAME> Dr`: true,
`<NAME> St`: true,
`<NAME> Rd`: true,
`<NAME>`: true,
`Johnson Dr`: true,
`Johnson Ln`: true,
`<NAME> Rd`: true,
`Johnson St`: true,
`<NAME>`: true,
`<NAME>ir`: true,
`Jones Ct`: true,
`<NAME> Pl`: true,
`<NAME> Rd`: true,
`Jones Rd`: true,
`<NAME> Rd`: true,
`Jones St`: true,
`Jordan Rd`: true,
`Jordan St`: true,
`Joree Rd`: true,
`<NAME>`: true,
`Jude Dr`: true,
`<NAME>`: true,
`<NAME>`: true,
`<NAME>n`: true,
`<NAME>d`: true,
`Kakki Ct`: true,
`Kaleigh Ct`: true,
`Katie Dr`: true,
`Katie Rdg`: true,
`Katrina Dr`: true,
`Kay Rd`: true,
`Kayla Ct`: true,
`Keeling Lake Rd`: true,
`Keeling Mountain Rd`: true,
`Keith Rd`: true,
`<NAME>l`: true,
`<NAME> Ct`: true,
`<NAME>`: true,
`Kelly Dr`: true,
`Ken St`: true,
`Kent Dr`: true,
`Kentucky Ave`: true,
`Kentucky Walk`: true,
`Kenwood Ln`: true,
`Kerry St`: true,
`Kimberly Dr`: true,
`<NAME>`: true,
`Kincannon Rd`: true,
`King Rd`: true,
`King St`: true,
`Kings Camp Rd`: true,
`Kings Dr`: true,
`Kingston Hwy`: true,
`Kingston Pointe Dr`: true,
`Kiowa Ct`: true,
`Kirby Ct`: true,
`Kirby Dr`: true,
`Kirk Rd`: true,
`Kitchen Mountain Rd`: true,
`Kitchens All`: true,
`Knight Dr`: true,
`Knight St`: true,
`Knight Way`: true,
`Knollwood Way`: true,
`Knucklesville Rd`: true,
`Kooweskoowe Blvd`: true,
`Kortlyn Pl`: true,
`Kovells Dr`: true,
`Kristen Ct`: true,
`Kristen Ln`: true,
`Kuhlman St`: true,
`Lacey Rd`: true,
`Ladds Mountain Rd`: true,
`Lake Ct`: true,
`Lake Dr`: true,
`Lake Drive No 1`: true,
`Lake Eagle Ct`: true,
`Lake Haven Dr`: true,
`Lake Marguerite Rd`: true,
`Lake Overlook Dr`: true,
`Lake Point Dr`: true,
`Lake Top Dr`: true,
`Lakeport`: true,
`Lakeshore Cir`: true,
`Lakeside Trl`: true,
`Lakeside Way`: true,
`Lakeview Ct`: true,
`Lakeview Drive No 1`: true,
`Lakeview Drive No 2`: true,
`Lakeview Drive No 3`: true,
`Lakewood Ct`: true,
`Lamplighter Cv`: true,
`Lancelot Ct`: true,
`Lancer Ct`: true,
`Landers Dr`: true,
`Landers Rd`: true,
`Lanham Field Rd`: true,
`Lanham Rd`: true,
`Lanier Dr`: true,
`Lantern Cir`: true,
`Lantern Light Trl`: true,
`Lark Cir`: true,
`Larkspur Ln`: true,
`Larkspur Rd`: true,
`Larkwood Cir`: true,
`Larsen Rdg`: true,
`Latimer Ln`: true,
`Latimer Rd`: true,
`Laura Dr`: true,
`Laurel Cv`: true,
`Laurel Dr`: true,
`Laurel Trc`: true,
`Laurel Way`: true,
`Laurelwood Ln`: true,
`Lauren Ln`: true,
`Lavanes Way`: true,
`Law Rd`: true,
`Lawrence St`: true,
`Lazy Water Dr`: true,
`Lead Mountain Rd`: true,
`Leake St`: true,
`Ledford Ln`: true,
`Lee Ln`: true,
`Lee Rd`: true,
`Lee St`: true,
`Legacy Way`: true,
`Legion St`: true,
`Leila Cv`: true,
`Lennox Park Ave`: true,
`Lenox Dr`: true,
`Leonard Dr`: true,
`Leslie Cv`: true,
`Lewis Dr`: true,
`Lewis Farm Rd`: true,
`Lewis Rd`: true,
`Lewis Way`: true,
`Lexington Ct`: true,
`Lexy Way`: true,
`Liberty Crossing Dr`: true,
`Liberty Dr`: true,
`Liberty Square Dr`: true,
`Lily Way`: true,
`Limerick Ct`: true,
`Linda Rd`: true,
`Lindsey Dr`: true,
`Lingerfelt Ln`: true,
`Linwood Rd`: true,
`Lipscomb Cir`: true,
`Litchfield St`: true,
`Little Gate Way`: true,
`<NAME> Ln`: true,
`<NAME> Trl`: true,
`Little St`: true,
`Little Valley Rd`: true,
`Littlefield Rd`: true,
`Live Oak Run`: true,
`Livsey Rd`: true,
`Lodge Rd`: true,
`Lois Ln`: true,
`Lois Rd`: true,
`London Ct`: true,
`Londonderry Way`: true,
`Long Branch Ct`: true,
`Long Rd`: true,
`Long Trl`: true,
`Longview Pte`: true,
`Lovell St`: true,
`Low Ct`: true,
`Lowery Rd`: true,
`Lowry Way`: true,
`Lucas Ln`: true,
`Lucas Rd`: true,
`Lucille Rd`: true,
`Luckie St`: true,
`Luke Ln`: true,
`Lumpkin Dr`: true,
`Lusk Ave`: true,
`Luther Knight Rd`: true,
`Luwanda Trl`: true,
`Lynch St`: true,
`<NAME> Rd`: true,
`<NAME> Rd`: true,
`Macedonia Rd`: true,
`Macra Dr`: true,
`Madden Rd`: true,
`Madden St`: true,
`Maddox Rd`: true,
`Madison Cir`: true,
`Madison Ct`: true,
`Madison Ln`: true,
`Madison Pl`: true,
`Madison Way`: true,
`Magnolia Ct`: true,
`Magnolia Dr`: true,
`Magnolia Farm Rd`: true,
`Mahan Ln`: true,
`Mahan Rd`: true,
`Main Lake Dr`: true,
`Main St`: true,
`Mallet Pte`: true,
`Mallory Ct`: true,
`Mallory Dr`: true,
`Manning Mill Rd`: true,
`Manning Mill Way`: true,
`Manning Rd`: true,
`Manor House Ln`: true,
`Manor Way`: true,
`Mansfield Rd`: true,
`Maple Ave`: true,
`Maple Dr`: true,
`Maple Grove Dr`: true,
`Maple Ln`: true,
`Maple Ridge Dr`: true,
`Maple St`: true,
`Maplewood Pl`: true,
`Maplewood Trl`: true,
`Marguerite Dr`: true,
`Marina Rd`: true,
`Mariner Way`: true,
`Mark Trl`: true,
`Market Place Blvd`: true,
`Marlin Ln`: true,
`Marr Rd`: true,
`Marshwood Glen`: true,
`Martha Ct`: true,
`Marthas Pl`: true,
`Marthas Walk`: true,
`<NAME>ir`: true,
`Martin Loop`: true,
`<NAME>`: true,
`<NAME>r Dr`: true,
`Martin Rd`: true,
`<NAME> Ln`: true,
`Mary Ln`: true,
`Mary St`: true,
`Massell Dr`: true,
`Massingale Rd`: true,
`Mathews Rd`: true,
`<NAME> Rd`: true,
`Mauldin Cir`: true,
`Maxwell Rd`: true,
`May St`: true,
`Maybelle St`: true,
`Mayfield Rd`: true,
`Mayflower Cir`: true,
`Mayflower St`: true,
`Mayflower Way`: true,
`Mays Rd`: true,
`McCanless St`: true,
`McClure Dr`: true,
`McCormick Rd`: true,
`McCoy Rd`: true,
`McElreath St`: true,
`McEver St`: true,
`McKaskey Creek Rd`: true,
`McKay Dr`: true,
`McKelvey Ct`: true,
`McKenna Rd`: true,
`McKenzie Cir`: true,
`McKenzie St`: true,
`McKinley Ct`: true,
`McKinney Campground Rd`: true,
`McMillan Rd`: true,
`McStotts Rd`: true,
`McTier Cir`: true,
`Meadow Ln`: true,
`Meadowbridge Dr`: true,
`Meadowview Cir`: true,
`Meadowview Rd`: true,
`Medical Dr`: true,
`Melhana Dr`: true,
`Melone Dr`: true,
`Mercer Dr`: true,
`Mercer Ln`: true,
`Merchants Square Dr`: true,
`Michael Ln`: true,
`Michigan Ave`: true,
`Middle Ct`: true,
`Middlebrook Dr`: true,
`Middleton Ct`: true,
`Milam Bridge Rd`: true,
`Milam Cir`: true,
`Milam St`: true,
`Miles Dr`: true,
`Mill Creek Rd`: true,
`Mill Rock Dr`: true,
`Mill View Ct`: true,
`Miller Farm Rd`: true,
`Millers Way`: true,
`Millstone Pt`: true,
`Millstream Ct`: true,
`Milner Rd`: true,
`Milner St`: true,
`Miltons Walk`: true,
`Mimosa Ln`: true,
`Mimosa Ter`: true,
`Mineral Museum Dr`: true,
`Miners Pt`: true,
`Mint Rd`: true,
`Mirror Lake Dr`: true,
`Mission Hills Dr`: true,
`Mission Mountain Rd`: true,
`Mission Rd`: true,
`Mission Ridge Dr`: true,
`Misty Hollow Ct`: true,
`Misty Ridge Dr`: true,
`Misty Valley Dr`: true,
`Mitchell Ave`: true,
`Mitchell Rd`: true,
`Mockingbird Dr`: true,
`Mohawk Dr`: true,
`<NAME>`: true,
`Montclair Ct`: true,
`Montgomery St`: true,
`Montview Cir`: true,
`Moody St`: true,
`Moonlight Dr`: true,
`Moore Rd`: true,
`Moore St`: true,
`Moores Spring Rd`: true,
`Morgan Ave`: true,
`Morgan Dr`: true,
`Moriah Way`: true,
`Morris Dr`: true,
`Morris Rd`: true,
`Mosley Dr`: true,
`Moss Landing Rd`: true,
`Moss Ln`: true,
`Moss Way`: true,
`Mossy Rock Ln`: true,
`Mostellers Mill Rd`: true,
`Motorsports Dr`: true,
`Mount Olive St`: true,
`Mount Pleasant Rd`: true,
`Mountain Breeze Rd`: true,
`Mountain Chase Dr`: true,
`Mountain Creek Trl`: true,
`Mountain Ridge Dr`: true,
`Mountain Ridge Rd`: true,
`Mountain Trail Ct`: true,
`Mountain View Ct`: true,
`Mountain View Dr`: true,
`Mountain View Rd`: true,
`Mountainbrook Dr`: true,
`Muirfield Walk`: true,
`Mulberry Ln`: true,
`Mulberry Way`: true,
`Mulinix Rd`: true,
`Mull St`: true,
`Mullinax Rd`: true,
`Mundy Rd`: true,
`Mundy St`: true,
`Murphy Ln`: true,
`Murray Ave`: true,
`N Bartow St`: true,
`N Cass St`: true,
`N Central Ave`: true,
`N Dixie Ave`: true,
`N Erwin St`: true,
`N Franklin St`: true,
`N Gilmer St`: true,
`N Main St`: true,
`N Morningside Dr`: true,
`N Museum Dr`: true,
`N Public Sq`: true,
`N Railroad St`: true,
`N Tennessee St`: true,
`N Wall St`: true,
`Nally Rd`: true,
`Natalie Dr`: true,
`Natchi Trl`: true,
`Navajo Ln`: true,
`Navajo Trl`: true,
`Navigation Pte`: true,
`Needle Point Rdg`: true,
`Neel St`: true,
`Nelson St`: true,
`New Hope Church Rd`: true,
`Nicholas Ln`: true,
`Noble Hill`: true,
`Noble St`: true,
`Noland St`: true,
`Norland Ct`: true,
`North Ave`: true,
`North Dr`: true,
`North Hampton Dr`: true,
`North Oaks Cir`: true,
`North Point Dr`: true,
`North Ridge Cir`: true,
`North Ridge Ct`: true,
`North Ridge Dr`: true,
`North Ridge Pt`: true,
`North Valley Rd`: true,
`North Village Cir`: true,
`North Wesley Rdg`: true,
`North Woods Dr`: true,
`Northpoint Pkwy`: true,
`Northside Pkwy`: true,
`Norton Rd`: true,
`Nottingham Dr`: true,
`Nottingham Way`: true,
`November Ln`: true,
`Oak Beach Dr`: true,
`Oak Ct`: true,
`Oak Dr`: true,
`Oak Farm Dr`: true,
`Oak Grove Ct`: true,
`Oak Grove Ln`: true,
`Oak Grove Rd`: true,
`Oak Hill Cir`: true,
`Oak Hill Dr`: true,
`Oak Hill Ln`: true,
`Oak Hill Way`: true,
`Oak Hollow Rd`: true,
`Oak Leaf Dr`: true,
`Oak Ln`: true,
`Oak St`: true,
`Oak Street No 1`: true,
`Oak Street No 2`: true,
`Oak Way`: true,
`Oakbrook Dr`: true,
`Oakdale Dr`: true,
`Oakland St`: true,
`Oakridge Dr`: true,
`Oakside Ct`: true,
`Oakside Trl`: true,
`Oakwood Way`: true,
`Ohio Ave`: true,
`Ohio St`: true,
`Old 140 Hwy`: true,
`Old 41 Hwy`: true,
`Old Alabama Rd`: true,
`Old Alabama Spur`: true,
`Old Allatoona Rd`: true,
`Old Barn Way`: true,
`Old Bells Ferry Rd`: true,
`Old C C C Rd`: true,
`Old Canton Rd`: true,
`Old Cassville White Rd`: true,
`Old Cline Smith Rd`: true,
`Old Dallas Hwy`: true,
`Old Dallas Rd`: true,
`Old Dixie Hwy`: true,
`Old Farm Rd`: true,
`Old Field Rd`: true,
`Old Furnace Rd`: true,
`Old Gilliam Springs Rd`: true,
`Old Goodie Mountain Rd`: true,
`Old Grassdale Rd`: true,
`Old Hall Station Rd`: true,
`Old Hardin Bridge Rd`: true,
`Old Hemlock Cv`: true,
`Old Home Place Rd`: true,
`Old Jones Mill Rd`: true,
`Old Macedonia Campground Rd`: true,
`Old Martin Rd`: true,
`Old McKaskey Creek Rd`: true,
`Old Mill Farm Rd`: true,
`Old Mill Rd`: true,
`Old Old Alabama Rd`: true,
`Old Post Rd`: true,
`Old River Rd`: true,
`Old Rome Rd`: true,
`Old Roving Rd`: true,
`Old Rudy York Rd`: true,
`Old Sandtown Rd`: true,
`Old Spring Place Rd`: true,
`Old Stilesboro Rd`: true,
`Old Tennessee Hwy`: true,
`Old Tennessee Rd`: true,
`Old Wade Rd`: true,
`Olive Vine Church Rd`: true,
`Opal St`: true,
`Orchard Rd`: true,
`Ore Mine Rd`: true,
`Oriole Dr`: true,
`Otting Dr`: true,
`Overlook Cir`: true,
`Overlook Way`: true,
`Owensby Ln`: true,
`Oxford Ct`: true,
`Oxford Dr`: true,
`Oxford Ln`: true,
`Oxford Mill Way`: true,
`P M B Young Rd`: true,
`Paddock Way`: true,
`Padgett Rd`: true,
`Paga Mine Rd`: true,
`Paige Dr`: true,
`Paige St`: true,
`Palmer Rd`: true,
`<NAME>`: true,
`Park Ct`: true,
`Par<NAME> Rd`: true,
`Park Place Dr`: true,
`Park St`: true,
`Parker Ave`: true,
`<NAME> Rd`: true,
`Parkside View`: true,
`Parkview Dr`: true,
`Parmenter St`: true,
`<NAME> Rd`: true,
`Pasley Rd`: true,
`Pathfinder St`: true,
`Patricia Dr`: true,
`Patterson Dr`: true,
`Patterson Ln`: true,
`Patton Ln`: true,
`Patton St`: true,
`Pawnee Trl`: true,
`Peace Tree Ln`: true,
`<NAME>`: true,
`Peachtree St`: true,
`Pearl Ln`: true,
`Pearl St`: true,
`Pearson Rd`: true,
`Pearson St`: true,
`<NAME> Ct`: true,
`Pebble Hill Ct`: true,
`Pecan Ln`: true,
`Peddlers Way`: true,
`Peeples Valley Rd`: true,
`Pembroke Ln`: true,
`Pendley Trl`: true,
`Penelope Ln`: true,
`Penfield Dr`: true,
`Penny Ct`: true,
`Penny Ln`: true,
`Peppermill Dr`: true,
`Percheron Trl`: true,
`Perkins Dr`: true,
`Perkins Mountain Rd`: true,
`Perry Rd`: true,
`Pettit Cir`: true,
`Pettit Rd`: true,
`Phillips Dr`: true,
`Phoenix Air Dr`: true,
`Pickers Row`: true,
`Picklesimer Rd`: true,
`Pickys Holl`: true,
`Piedmont Ave`: true,
`Piedmont Ln`: true,
`Pilgrim St`: true,
`Pine Bow Rd`: true,
`Pine Cir`: true,
`Pine Dr`: true,
`Pine Forrest Rd`: true,
`Pine Grove Church Rd`: true,
`Pine Grove Cir`: true,
`Pine Grove Rd`: true,
`Pine Log Rd`: true,
`Pine Loop`: true,
`Pine Needle Trl`: true,
`Pine Oak Ct`: true,
`Pine Ridge Ct`: true,
`Pine Ridge Dr`: true,
`Pine Ridge Ln`: true,
`Pine Ridge Rd`: true,
`Pine St`: true,
`Pine Street No 1`: true,
`Pine Street No 2`: true,
`Pine Valley Cir`: true,
`Pine Valley Dr`: true,
`Pine Vista Cir`: true,
`Pine Water Ct`: true,
`Pine Wood Rd`: true,
`Pinecrest Dr`: true,
`Pinehill Dr`: true,
`Pinery Dr`: true,
`Piney Woods Rd`: true,
`Pinson Dr`: true,
`Pioneer Trl`: true,
`Pittman St`: true,
`Piute Pl`: true,
`Plainview Dr`: true,
`Plantation Rd`: true,
`Plantation Ridge Dr`: true,
`Planters Dr`: true,
`Pleasant Grove Church Rd`: true,
`Pleasant Ln`: true,
`Pleasant Run Dr`: true,
`Pleasant Valley Rd`: true,
`Plymouth Ct`: true,
`Plymouth Dr`: true,
`Point Dr`: true,
`Point Place Dr`: true,
`Pointe North Dr`: true,
`Pointe Way`: true,
`Polo Flds`: true,
`Pompano Ln`: true,
`Ponders Rd`: true,
`Popham Rd`: true,
`Poplar Springs Rd`: true,
`Poplar St`: true,
`Popular Dr`: true,
`Post Office Cir`: true,
`Postelle St`: true,
`Powell Rd`: true,
`Powers Ct`: true,
`Powersports Cir`: true,
`Prather St`: true,
`Pratt Rd`: true,
`Prayer Trl`: true,
`Prestwick Loop`: true,
`Princeton Ave`: true,
`Princeton Blvd`: true,
`Princeton Glen Ct`: true,
`Princeton Pl`: true,
`Princeton Place Dr`: true,
`Princeton Walk`: true,
`Priory Club Dr`: true,
`Public Sq`: true,
`Puckett Rd`: true,
`Puckett St`: true,
`Pumpkinvine Trl`: true,
`Puritan St`: true,
`Pyron Ct`: true,
`Quail Ct`: true,
`Quail Hollow Dr`: true,
`Quail Ridge Dr`: true,
`Quail Ridge Rd`: true,
`Quail Run`: true,
`Quality Dr`: true,
`R E Fields Rd`: true,
`Rail Dr`: true,
`Rail Ovlk`: true,
`Railroad Ave`: true,
`Railroad Pass`: true,
`Railroad St`: true,
`Raindrop Ln`: true,
`Randolph Rd`: true,
`Randy Way`: true,
`Ranell Pl`: true,
`Ranger Rd`: true,
`Rattler Rd`: true,
`Ravenfield Rd`: true,
`<NAME> Rd`: true,
`Recess Rd`: true,
`Red Apple Ter`: true,
`Red Barn Rd`: true,
`Red Bug Pt`: true,
`Red Fox Trl`: true,
`Red Oak Dr`: true,
`Red Tip Dr`: true,
`Red Top Beach Rd`: true,
`Red Top Cir`: true,
`Red Top Dr`: true,
`Red Top Mountain Rd`: true,
`Redcomb Dr`: true,
`Redd Rd`: true,
`Redding Rd`: true,
`Redfield Ct`: true,
`Rediger Ct`: true,
`Redwood Dr`: true,
`Reject Rd`: true,
`Remington Ct`: true,
`Remington Dr`: true,
`Remington Ln`: true,
`Retreat Rdg`: true,
`Rex Ln`: true,
`Reynolds Bend Rd`: true,
`Reynolds Bridge Rd`: true,
`Reynolds Ln`: true,
`Rhonda Ln`: true,
`Rice Dr`: true,
`Richards Rd`: true,
`Richland Dr`: true,
`Riddle Mill Rd`: true,
`Ridge Cross Rd`: true,
`Ridge Rd`: true,
`Ridge Row Dr`: true,
`Ridge View Dr`: true,
`Ridge Way`: true,
`Ridgedale Rd`: true,
`Ridgeline Way`: true,
`Ridgemont Way`: true,
`Ridgeview Ct`: true,
`Ridgeview Dr`: true,
`Ridgeview Trl`: true,
`Ridgewater Dr`: true,
`Ridgeway Ct`: true,
`Ridgewood Dr`: true,
`Ringers Rd`: true,
`Rip Rd`: true,
`Ripley Ave`: true,
`River Birch Cir`: true,
`River Birch Ct`: true,
`River Birch Dr`: true,
`River Birch Rd`: true,
`River Ct`: true,
`River Dr`: true,
`River Oaks Ct`: true,
`River Oaks Dr`: true,
`River Shoals Dr`: true,
`River Walk Pkwy`: true,
`Riverbend Rd`: true,
`Rivercreek Xing`: true,
`Riverside Ct`: true,
`Riverside Dr`: true,
`Riverview Ct`: true,
`Riverview Trl`: true,
`Riverwood Cv`: true,
`Roach Dr`: true,
`Road No 1 South`: true,
`Road No 2 South`: true,
`Road No 3 South`: true,
`Roberson Dr`: true,
`Roberson Rd`: true,
`Robert St`: true,
`Roberts Dr`: true,
`Roberts Way`: true,
`Robin Dr`: true,
`Robin Hood Dr`: true,
`Robinson Loop`: true,
`Rock Fence Cir`: true,
`Rock Fence Rd`: true,
`Rock Fence Road No 2`: true,
`Rock Ridge Ct`: true,
`Rock Ridge Rd`: true,
`Rockaway Ct`: true,
`Rockcrest Cir`: true,
`Rockpoint`: true,
`Rockridge Dr`: true,
`Rocky Ave`: true,
`Rocky Cir`: true,
`Rocky Mountain Pass`: true,
`Rocky Rd`: true,
`Rocky St`: true,
`Rogers Cut Off Rd`: true,
`Rogers Rd`: true,
`Rogers St`: true,
`Rolling Hills Dr`: true,
`Ron St`: true,
`Ronson St`: true,
`Roosevelt St`: true,
`Rose Brook Cir`: true,
`Rose Trl`: true,
`Rose Way`: true,
`Rosebury Ct`: true,
`Rosen St`: true,
`Rosewood Ln`: true,
`Ross Rd`: true,
`Roth Ln`: true,
`Roundtable Ct`: true,
`Roving Hills Cir`: true,
`Roving Rd`: true,
`Rowland Springs Rd`: true,
`Roxburgh Trl`: true,
`Roxy Pl`: true,
`Royal Lake Ct`: true,
`Royal Lake Cv`: true,
`Royal Lake Dr`: true,
`Royco Dr`: true,
`Rubie Ln`: true,
`Ruby Dabbs Ln`: true,
`Ruby St`: true,
`Rudy York Rd`: true,
`Ruff Dr`: true,
`Running Deer Trl`: true,
`Running Terrace Way`: true,
`Russell Dr`: true,
`Russell Rdg`: true,
`Russler Way`: true,
`<NAME>`: true,
`Ryan Rd`: true,
`Ryles Rd`: true,
`S Bartow St`: true,
`S Cass St`: true,
`S Central Ave`: true,
`S Dixie Ave`: true,
`S Erwin St`: true,
`S Franklin St`: true,
`S Gilmer St`: true,
`S Main St`: true,
`S Morningside Dr`: true,
`S Museum Dr`: true,
`S Public Sq`: true,
`S Railroad St`: true,
`S Tennessee St`: true,
`S Wall St`: true,
`Saddle Club Dr`: true,
`Saddle Field Cir`: true,
`Saddle Ln`: true,
`Saddle Ridge Dr`: true,
`Saddlebrook Dr`: true,
`Saddleman Ct`: true,
`Sage Way`: true,
`Saggus Rd`: true,
`Sailors Cv`: true,
`Saint Andrews Dr`: true,
`Saint Elmo Cir`: true,
`Saint Francis Pl`: true,
`Saint Ives Way`: true,
`Salacoa Creek Rd`: true,
`Salacoa Rd`: true,
`<NAME> Rd`: true,
`Samuel Way`: true,
`Sandcliffe Ln`: true,
`Sandtown Rd`: true,
`Saratoga Dr`: true,
`Sassafras Trl`: true,
`Sassy Ln`: true,
`Satcher Rd`: true,
`Scale House Dr`: true,
`Scarlett Oak Dr`: true,
`Scenic Mountain Dr`: true,
`School St`: true,
`Scott Dr`: true,
`Screaming Eagle Ct`: true,
`Sea Horse Cir`: true,
`Secretariat Ct`: true,
`Secretariat Rd`: true,
`Seminole Rd`: true,
`Seminole Trl`: true,
`Seneca Ln`: true,
`Sentry Dr`: true,
`Sequoia Pl`: true,
`Sequoyah Cir`: true,
`Sequoyah Trl`: true,
`Serena St`: true,
`Service Road No 3`: true,
`Setters Pte`: true,
`Settlers Cv`: true,
`Sewell Rd`: true,
`Shadow Ln`: true,
`Shady Oak Ln`: true,
`Shady Valley Dr`: true,
`Shagbark Dr`: true,
`Shake Rag Cir`: true,
`Shake Rag Rd`: true,
`Shaker Ct`: true,
`Shallowood Pl`: true,
`Sharp Way`: true,
`Shaw Blvd`: true,
`Shaw St`: true,
`Sheffield Pl`: true,
`Sheila Ln`: true,
`Sheila Rdg`: true,
`Shenandoah Pkwy`: true,
`Sherman Ln`: true,
`Sherwood Dr`: true,
`Sherwood Ln`: true,
`Sherwood Way`: true,
`Shiloh Church Rd`: true,
`Shinall Gaines Rd`: true,
`Shinall Rd`: true,
`Shirley Ln`: true,
`Shotgun Rd`: true,
`Shropshire Ln`: true,
`Signal Mountain Cir`: true,
`Signal Mountain Dr`: true,
`Silversmith Trl`: true,
`Simmons Dr`: true,
`<NAME>ir`: true,
`Simpson Rd`: true,
`Simpson Trl`: true,
`Singletree Rdg`: true,
`Siniard Dr`: true,
`Siniard Rd`: true,
`Sioux Rd`: true,
`Skinner St`: true,
`Skyline Dr`: true,
`Skyview Dr`: true,
`Skyview Pte`: true,
`Slopes Dr`: true,
`<NAME> Rd`: true,
`<NAME>`: true,
`Smith Dr`: true,
`Smith Rd`: true,
`Smyrna St`: true,
`Snapper Ln`: true,
`Snow Springs Church Rd`: true,
`Snow Springs Rd`: true,
`Snug Harbor Dr`: true,
`Soaring Heights Dr`: true,
`Soho Dr`: true,
`Somerset Club Dr`: true,
`Somerset Ln`: true,
`Sonya Pl`: true,
`South Ave`: true,
`South Bridge Dr`: true,
`South Dr`: true,
`South Oaks Dr`: true,
`South Valley Rd`: true,
`Southern Rd`: true,
`Southridge Trl`: true,
`Southview Dr`: true,
`Southwell Ave`: true,
`Southwood Dr`: true,
`Sparks Rd`: true,
`Sparks St`: true,
`Sparky Trl`: true,
`Sparrow Ct`: true,
`Spigs St`: true,
`Split Oak Dr`: true,
`Split Rail Ct`: true,
`Spring Creek Cir`: true,
`Spring Folly`: true,
`Spring Lake Trl`: true,
`Spring Meadows Ln`: true,
`Spring Place Rd`: true,
`Spring St`: true,
`Springhouse Ct`: true,
`Springmont Dr`: true,
`Springwell Ln`: true,
`Spruce Ln`: true,
`Spruce St`: true,
`Squires Ct`: true,
`SR 113`: true,
`SR 140`: true,
`SR 20`: true,
`SR 294`: true,
`SR 61`: true,
`Stamp Creek Rd`: true,
`Stampede Pass`: true,
`Standard Ct`: true,
`Star Dust Trl`: true,
`Starlight Dr`: true,
`Starnes Rd`: true,
`Starting Gate Dr`: true,
`Stately Oaks Dr`: true,
`Station Ct`: true,
`Station Rail Dr`: true,
`Station Way`: true,
`Staton Pl`: true,
`Steeplechase Ln`: true,
`Stephen Way`: true,
`Stephens Rd`: true,
`Stephens St`: true,
`Sterling Ct`: true,
`Stewart Dr`: true,
`Stewart Ln`: true,
`Stiles Ct`: true,
`Stiles Fairway`: true,
`Stiles Rd`: true,
`Stillmont Way`: true,
`Stillwater Ct`: true,
`Stoker Rd`: true,
`Stokley St`: true,
`Stone Gate Dr`: true,
`Stone Mill Dr`: true,
`Stonebridge Ct`: true,
`Stonebrook Dr`: true,
`Stonecreek Dr`: true,
`Stonehaven Cir`: true,
`Stonehenge Ct`: true,
`Stoner Rd`: true,
`Stoneridge Pl`: true,
`Stoners Chapel Rd`: true,
`Stonewall Ln`: true,
`Stonewall St`: true,
`Stoneybrook Ct`: true,
`Stratford Ln`: true,
`Stratford Way`: true,
`Striplin Cv`: true,
`Sue U Path`: true,
`Sugar Hill Rd`: true,
`Sugar Mill Dr`: true,
`Sugar Valley Rd`: true,
`Sugarberry Pl`: true,
`Sukkau Dr`: true,
`Sullins Rd`: true,
`Summer Dr`: true,
`Summer Pl`: true,
`Summer St`: true,
`Summerset Ct`: true,
`Summit Ridge Cir`: true,
`Summit Ridge Dr`: true,
`Summit St`: true,
`Sumner Ln`: true,
`Sunrise Dr`: true,
`Sunset Cir`: true,
`Sunset Dr`: true,
`Sunset Rd`: true,
`Sunset Ter`: true,
`Surrey Ln`: true,
`Sutton Rd`: true,
`Sutton Trl`: true,
`Swafford Rd`: true,
`Swallow Dr`: true,
`Swan Cir`: true,
`Sweet Eloise Ln`: true,
`Sweet Gracie Holl`: true,
`Sweet Gum Ln`: true,
`Sweet Water Ct`: true,
`Sweetbriar Cir`: true,
`Swisher Dr`: true,
`Syble Cv`: true,
`Tabernacle St`: true,
`Taff Rd`: true,
`Talisman Dr`: true,
`Tall Oaks Ln`: true,
`Tanager Ln`: true,
`Tanchez Dr`: true,
`Tanglewood Dr`: true,
`Tank Hill St`: true,
`Tant Rd`: true,
`Tanyard Creek Rd`: true,
`Tanyard Rd`: true,
`Tara Way`: true,
`Tarpon Trl`: true,
`Tasha Trl`: true,
`<NAME> Rd`: true,
`Taylor Dr`: true,
`Taylor Ln`: true,
`Taylorsville Macedonia Rd`: true,
`Taylorsville Rd`: true,
`Teague Rd`: true,
`Teal Ct`: true,
`Tellus Dr`: true,
`Tennessee Ave`: true,
`Terrell Dr`: true,
`Terry Ln`: true,
`Thatch Ct`: true,
`Theater Ave`: true,
`Third Army Rd`: true,
`Thistle Stop`: true,
`Thomas Ct`: true,
`Thompson St`: true,
`Thornwood Dr`: true,
`Thoroughbred Ln`: true,
`Thrasher Ct`: true,
`Thrasher Rd`: true,
`Thunderhawk Ln`: true,
`Tidwell Rd`: true,
`Tillberry Ct`: true,
`Tillton Trl`: true,
`Timber Ridge Dr`: true,
`Timber Trl`: true,
`Timberlake Cv`: true,
`Timberlake Pte`: true,
`Timberland Cir`: true,
`Timberland Ct`: true,
`Timberwalk Ct`: true,
`Timberwood Knol`: true,
`Timberwood Rd`: true,
`Tinsley Dr`: true,
`Todd Rd`: true,
`<NAME> Rd`: true,
`Tomahawk Dr`: true,
`Top Ridge Ct`: true,
`Topridge Dr`: true,
`Tori Ln`: true,
`Towe Chapel Rd`: true,
`Tower Dr`: true,
`Tower Ridge Rd`: true,
`Tower St`: true,
`Town And Country Dr`: true,
`Townsend Dr`: true,
`Townsend Teague Rd`: true,
`Townsley Dr`: true,
`Tracy Ln`: true,
`Tramore Ct`: true,
`Trappers Cv`: true,
`Travelers Path`: true,
`Treemont Dr`: true,
`Triangle Ln`: true,
`Trimble Hollow Rd`: true,
`Trotters Walk`: true,
`Tuba Dr`: true,
`Tumlin St`: true,
`Tupelo Dr`: true,
`Turnberry Ct`: true,
`Turner Dr`: true,
`Turner St`: true,
`Turtle Rock Ct`: true,
`Twelve Oaks Dr`: true,
`Twin Branches Ln`: true,
`Twin Bridges Rd`: true,
`Twin Oaks Ln`: true,
`Twin Pines Rd`: true,
`Twinleaf Ct`: true,
`Two Gun Bailey Rd`: true,
`Two Run Creek Rd`: true,
`Two Run Creek Trl`: true,
`Two Run Trc`: true,
`Two Run Xing`: true,
`Unbridled Rd`: true,
`Val Hollow Ridge Rd`: true,
`Valley Creek Dr`: true,
`Valley Dale Dr`: true,
`Valley Dr`: true,
`Valley Trl`: true,
`Valley View Ct`: true,
`Valley View Dr`: true,
`Valley View Farm Rd`: true,
`Vaughan Ct`: true,
`Vaughan Dr`: true,
`Va<NAME> Rd`: true,
`Vaughn Rd`: true,
`Vaughn Spur`: true,
`Veach Loop`: true,
`Vermont Ave`: true,
`Victoria Dr`: true,
`Vigilant St`: true,
`Village Dr`: true,
`Village Trc`: true,
`Vineyard Mountain Rd`: true,
`Vineyard Rd`: true,
`Vineyard Way`: true,
`Vinnings Ln`: true,
`Vintage Ct`: true,
`Vintagewood Cv`: true,
`Virginia Ave`: true,
`Vista Ct`: true,
`Vista Woods Dr`: true,
`Vulcan Quarry Rd`: true,
`W Carter St`: true,
`W Cherokee Ave`: true,
`W Church St`: true,
`W Felton Rd`: true,
`W George St`: true,
`W Georgia Ave`: true,
`W Holiday Ct`: true,
`W Howard St`: true,
`W Indiana Ave`: true,
`W Iron Belt Rd`: true,
`W Lee St`: true,
`W Main St`: true,
`W Oak Grove Rd`: true,
`W Porter St`: true,
`W Railroad St`: true,
`W Rocky St`: true,
`Wade Chapel Rd`: true,
`Wade Rd`: true,
`Wagonwheel Dr`: true,
`Walden Xing`: true,
`Walker Hills Cir`: true,
`Walker Rd`: true,
`Walker St`: true,
`Walnut Dr`: true,
`Walnut Grove Rd`: true,
`Walnut Ln`: true,
`Walnut Trl`: true,
`Walt Way`: true,
`Walton St`: true,
`Wanda Dr`: true,
`Wansley Dr`: true,
`Ward Cir`: true,
`Ward Mountain Rd`: true,
`Ward Mountain Trl`: true,
`Warren Cv`: true,
`Washakie Ln`: true,
`Water Tower Rd`: true,
`Waterford Dr`: true,
`Waterfront Dr`: true,
`Waters Edge Dr`: true,
`Waters View`: true,
`Waterside Dr`: true,
`Waterstone Ct`: true,
`Waterstone Dr`: true,
`Watters Rd`: true,
`Wayland Cir`: true,
`Wayne Ave`: true,
`Wayne Dr`: true,
`Wayside Dr`: true,
`Wayside Rd`: true,
`Weaver St`: true,
`Webb Dr`: true,
`Websters Ferry Lndg`: true,
`Websters Overlook Dr`: true,
`Websters Overlook Lndg`: true,
`Weems Dr`: true,
`Weems Rd`: true,
`Weems Spur`: true,
`We<NAME> Ln`: true,
`Weissinger Rd`: true,
`Wellington Dr`: true,
`Wellons Rd`: true,
`Wells Dr`: true,
`Wells St`: true,
`Wentercress Dr`: true,
`<NAME> Ln`: true,
`<NAME> Dr`: true,
`Wesley Rd`: true,
`Wesley Trc`: true,
`Wessington Pl`: true,
`West Ave`: true,
`West Dr`: true,
`West Ln`: true,
`West Oak Dr`: true,
`West Ridge Ct`: true,
`West Ridge Dr`: true,
`Westchester Dr`: true,
`Westfield Park`: true,
`Westgate Dr`: true,
`Westminster Dr`: true,
`Westover Dr`: true,
`Westover Rdg`: true,
`Westside Chas`: true,
`Westview Dr`: true,
`Westwood Cir`: true,
`Westwood Dr`: true,
`Westwood Ln`: true,
`Wetlands Rd`: true,
`Wexford Cir`: true,
`Wey Bridge Ct`: true,
`Wheeler Rd`: true,
`Whipporwill Ct`: true,
`Whipporwill Ln`: true,
`Whispering Pine Cir`: true,
`Whispering Pine Ln`: true,
`Whistle Stop Dr`: true,
`White Oak Dr`: true,
`White Rd`: true,
`Widgeon Way`: true,
`Wild Flower Trl`: true,
`Wildberry Path`: true,
`Wilderness Camp Rd`: true,
`Wildwood Dr`: true,
`Wilkey St`: true,
`Wilkins Rd`: true,
`William Dr`: true,
`Williams Creek Trl`: true,
`Williams Rd`: true,
`Williams Spur Rd`: true,
`Williams St`: true,
`Willis Rd`: true,
`<NAME> Dr`: true,
`<NAME>`: true,
`Willow Ct`: true,
`Willow Ln`: true,
`Willow Trc`: true,
`Willow Wood Ln`: true,
`Willowbrook Ct`: true,
`Wilmer Way`: true,
`Wilson St`: true,
`Winchester Ave`: true,
`Winchester Dr`: true,
`Windcliff Ct`: true,
`<NAME>`: true,
`Windfield Dr`: true,
`Winding Branch Trc`: true,
`Winding Water Cv`: true,
`Windrush Dr`: true,
`Windsor Ct`: true,
`Windsor Trc`: true,
`Windy Hill Rd`: true,
`Wingfoot Ct`: true,
`Wingfoot Trl`: true,
`<NAME> Rd`: true,
`Winter Wood Ct`: true,
`Winter Wood Cv`: true,
`Winter Wood Dr`: true,
`Winter Wood Trc`: true,
`Winter Wood Trl`: true,
`Winter Wood Way`: true,
`Winterset Dr`: true,
`Wiseman Rd`: true,
`Wisteria Trl`: true,
`Wofford St`: true,
`Wolfcliff Rd`: true,
`Wolfpen Pass`: true,
`Wolfridge Trl`: true,
`Womack Dr`: true,
`Wood Cir`: true,
`Wood Forest Dr`: true,
`Wood Ln`: true,
`Wood Rd`: true,
`Wood St`: true,
`Woodall Rd`: true,
`Woodbine Dr`: true,
`Woodbridge Dr`: true,
`Woodcrest Dr`: true,
`Woodcrest Rd`: true,
`Wooddale Dr`: true,
`Woodhaven Ct`: true,
`Woodhaven Dr`: true,
`Woodland Bridge Rd`: true,
`Woodland Dr`: true,
`Woodland Rd`: true,
`Woodland Way`: true,
`Woodlands Way`: true,
`Woodsong Ct`: true,
`Woodview Dr`: true,
`Woodvine Ct`: true,
`Woodvine Dr`: true,
`Woody Rd`: true,
`Wooleys Rd`: true,
`Worthington Rd`: true,
`Wren Ct`: true,
`Wykle St`: true,
`Wynn Loop`: true,
`Wynn Rd`: true,
`Yacht Club Rd`: true,
`Yellow Brick Rd`: true,
`Yellow Hammer Dr`: true,
`Yon<NAME>`: true,
`York Trl`: true,
`Young Deer Trl`: true,
`Young Loop`: true,
`Young Rd`: true,
`Young St`: true,
`Youngs Mill Rd`: true,
`Zena Dr`: true,
`Zion Rd`: true},
`ZipCode`: {
`01770`: true,
`02030`: true,
`02108`: true,
`02109`: true,
`02110`: true,
`02199`: true,
`02481`: true,
`02493`: true,
`06820`: true,
`06830`: true,
`06831`: true,
`06840`: true,
`06853`: true,
`06870`: true,
`06878`: true,
`06880`: true,
`06883`: true,
`07021`: true,
`07046`: true,
`07078`: true,
`07417`: true,
`07458`: true,
`07620`: true,
`07760`: true,
`07924`: true,
`07931`: true,
`07945`: true,
`10004`: true,
`10017`: true,
`10018`: true,
`10021`: true,
`10022`: true,
`10028`: true,
`10069`: true,
`10504`: true,
`10506`: true,
`10514`: true,
`10538`: true,
`10576`: true,
`10577`: true,
`10580`: true,
`10583`: true,
`11024`: true,
`11030`: true,
`11568`: true,
`11724`: true,
`19035`: true,
`19041`: true,
`19085`: true,
`19807`: true,
`20198`: true,
`20854`: true,
`22066`: true,
`23219`: true,
`28207`: true,
`30326`: true,
`32963`: true,
`33480`: true,
`33786`: true,
`33921`: true,
`34102`: true,
`34108`: true,
`34228`: true,
`60022`: true,
`60043`: true,
`60045`: true,
`60093`: true,
`60521`: true,
`60606`: true,
`60611`: true,
`63124`: true,
`74103`: true,
`75205`: true,
`75225`: true,
`76102`: true,
`77002`: true,
`77024`: true,
`78257`: true,
`83014`: true,
`85253`: true,
`89451`: true,
`90067`: true,
`90077`: true,
`90210`: true,
`90212`: true,
`90272`: true,
`90402`: true,
`91436`: true,
`92067`: true,
`92091`: true,
`92657`: true,
`93108`: true,
`94022`: true,
`94027`: true,
`94028`: true,
`94062`: true,
`94111`: true,
`94301`: true,
`94304`: true,
`94920`: true,
`98039`: true},
} | h231/table.go | 0.698535 | 0.75021 | table.go | starcoder |
package aoc2015
/*
--- Day 3: Perfectly Spherical Houses in a Vacuum ---
Santa is delivering presents to an infinite two-dimensional grid of houses.
He begins by delivering a present to the house at his starting location, and then an elf at the North Pole calls him via radio and tells him where to move next. Moves are always exactly one house to the north (^), south (v), east (>), or west (<). After each move, he delivers another present to the house at his new location.
However, the elf back at the north pole has had a little too much eggnog, and so his directions are a little off, and Santa ends up visiting some houses more than once. How many houses receive at least one present?
For example:
> delivers presents to 2 houses: one at the starting location, and one to the east.
^>v< delivers presents to 4 houses in a square, including twice to the house at his starting/ending location.
^v^v^v^v^v delivers a bunch of presents to some very lucky children at only 2 houses.*/
import (
"fmt"
goutils "github.com/simonski/goutils"
)
// AOC_2015_03 is the entrypoint
func (app *Application) Y2015D03() {
app.Y2015D03P1()
app.Y2015D03P2()
}
func (app *Application) Y2015D03P1() {
grid := NewGrid201503()
grid.Increment(0, 0)
for index := 0; index < len(DAY_2015_03_DATA); index++ {
c := DAY_2015_03_DATA[index : index+1]
if c == "<" {
grid.West()
} else if c == ">" {
grid.East()
} else if c == "^" {
grid.North()
} else if c == "v" {
grid.South()
} else {
panic("wtf")
}
}
total_single_presents := 0
for _, value := range grid.Counter.Data {
if value == 1 {
total_single_presents++
}
}
fmt.Printf("Part1: Single present households: %v\n", total_single_presents)
fmt.Printf("Part1: Total households: %v\n", len(grid.Counter.Data))
}
/*
--- Part Two ---
The next year, to speed up the process, Santa creates a robot version of himself, Robo-Santa, to deliver presents with him.
Santa and Robo-Santa start at the same location (delivering two presents to the same starting house), then take turns moving based on instructions from the elf, who is eggnoggedly reading from the same script as the previous year.
This year, how many houses receive at least one present?
For example:
^v delivers presents to 3 houses, because Santa goes north, and then Robo-Santa goes south.
^>v< now delivers presents to 3 houses, and Santa and Robo-Santa end up back where they started.
^v^v^v^v^v now delivers presents to 11 houses, with Santa going one direction and Robo-Santa going the other.
*/
func (app *Application) Y2015D03P2() {
grid := NewGrid201503()
grid.Increment(0, 0)
grid.Increment(0, 0)
data := DAY_2015_03_DATA
for index := 0; index < len(data); index += 2 {
c1 := data[index : index+1]
if c1 == "<" {
grid.West()
} else if c1 == ">" {
grid.East()
} else if c1 == "^" {
grid.North()
} else if c1 == "v" {
grid.South()
} else {
panic("wtf")
}
idx := index + 1
c2 := data[idx : idx+1]
if c2 == "<" {
grid.RoboWest()
} else if c2 == ">" {
grid.RoboEast()
} else if c2 == "^" {
grid.RoboNorth()
} else if c2 == "v" {
grid.RoboSouth()
} else {
panic("wtf")
}
}
total_single_presents := 0
for _, value := range grid.Counter.Data {
if value == 1 {
total_single_presents++
}
}
fmt.Printf("Part2: Single present households: %v\n", total_single_presents)
fmt.Printf("Part2: Total households: %v\n", len(grid.Counter.Data))
}
type Grid201503 struct {
x int
y int
robo_x int
robo_y int
Counter *goutils.Counter
}
func NewGrid201503() *Grid201503 {
g := Grid201503{x: 0, y: 0, Counter: goutils.NewCounter()}
return &g
}
func (grid *Grid201503) Increment(x int, y int) {
key := <KEY>
grid.Counter.Increment(key)
}
func (grid *Grid201503) North() {
y := grid.y + 1
x := grid.x
grid.Increment(x, y)
grid.x = x
grid.y = y
}
func (grid *Grid201503) South() {
y := grid.y - 1
x := grid.x
grid.Increment(x, y)
grid.x = x
grid.y = y
}
func (grid *Grid201503) East() {
y := grid.y
x := grid.x + 1
grid.Increment(x, y)
grid.x = x
grid.y = y
}
func (grid *Grid201503) West() {
y := grid.y
x := grid.x - 1
grid.Increment(x, y)
grid.x = x
grid.y = y
}
func (grid *Grid201503) RoboNorth() {
y := grid.robo_y + 1
x := grid.robo_x
grid.Increment(x, y)
grid.robo_x = x
grid.robo_y = y
}
func (grid *Grid201503) RoboSouth() {
y := grid.robo_y - 1
x := grid.robo_x
grid.Increment(x, y)
grid.robo_x = x
grid.robo_y = y
}
func (grid *Grid201503) RoboEast() {
y := grid.robo_y
x := grid.robo_x + 1
grid.Increment(x, y)
grid.robo_x = x
grid.robo_y = y
}
func (grid *Grid201503) RoboWest() {
y := grid.robo_y
x := grid.robo_x - 1
grid.Increment(x, y)
grid.robo_x = x
grid.robo_y = y
} | app/aoc2015/aoc2015_03.go | 0.544559 | 0.735831 | aoc2015_03.go | starcoder |
package main
import (
"fmt"
"github.com/heimdalr/dag"
"math"
"time"
)
type largeVertex struct {
value int
}
// implement the interface{}'s interface method Id()
func (v largeVertex) ID() string {
return fmt.Sprintf("%d", v.value)
}
func main() {
d := dag.NewDAG()
root := largeVertex{1}
key, _ := d.AddVertex(root)
levels := 7
branches := 9
var start, end time.Time
start = time.Now()
largeAux(d, levels, branches, root)
end = time.Now()
fmt.Printf("%fs to add %d vertices and %d edges\n", end.Sub(start).Seconds(), d.GetOrder(), d.GetSize())
expectedVertexCount := sum(0, levels-1, branches, pow)
vertexCount := len(d.GetVertices())
if vertexCount != expectedVertexCount {
panic(fmt.Sprintf("GetVertices() = %d, want %d", vertexCount, expectedVertexCount))
}
start = time.Now()
descendants, _ := d.GetDescendants(key)
end = time.Now()
fmt.Printf("%fs to get descendants\n", end.Sub(start).Seconds())
descendantsCount := len(descendants)
expectedDescendantsCount := vertexCount - 1
if descendantsCount != expectedDescendantsCount {
panic(fmt.Sprintf("GetDescendants(root) = %d, want %d", descendantsCount, expectedDescendantsCount))
}
start = time.Now()
_, _ = d.GetDescendants(key)
end = time.Now()
fmt.Printf("%fs to get descendants 2nd time\n", end.Sub(start).Seconds())
start = time.Now()
descendantsOrdered, _ := d.GetOrderedDescendants(key)
end = time.Now()
fmt.Printf("%fs to get descendants ordered\n", end.Sub(start).Seconds())
descendantsOrderedCount := len(descendantsOrdered)
if descendantsOrderedCount != expectedDescendantsCount {
panic(fmt.Sprintf("GetOrderedDescendants(root) = %d, want %d", descendantsOrderedCount, expectedDescendantsCount))
}
start = time.Now()
children, _ := d.GetChildren(key)
end = time.Now()
fmt.Printf("%fs to get children\n", end.Sub(start).Seconds())
childrenCount := len(children)
expectedChildrenCount := branches
if childrenCount != expectedChildrenCount {
panic(fmt.Sprintf("GetChildren(root) = %d, want %d", childrenCount, expectedChildrenCount))
}
_, _ = d.GetDescendants(key)
edgeCountBefore := d.GetSize()
start = time.Now()
d.ReduceTransitively()
end = time.Now()
fmt.Printf("%fs to transitively reduce the graph with caches poupulated\n", end.Sub(start).Seconds())
if edgeCountBefore != d.GetSize() {
panic(fmt.Sprintf("GetSize() = %d, want %d", d.GetSize(), edgeCountBefore))
}
d.FlushCaches()
start = time.Now()
d.ReduceTransitively()
end = time.Now()
fmt.Printf("%fs to transitively reduce the graph without caches poupulated\n", end.Sub(start).Seconds())
var childList []string
for x := range children {
childList = append(childList, x)
break
}
start = time.Now()
if len(childList) > 0 {
_ = d.DeleteEdge(key, childList[0])
}
end = time.Now()
fmt.Printf("%fs to delete an edge from the root\n", end.Sub(start).Seconds())
}
func largeAux(d *dag.DAG, level int, branches int, parent largeVertex) (int, int) {
var vertexCount int
var edgeCount int
if level > 1 {
if branches < 1 || branches > 9 {
panic("number of branches must be between 1 and 9")
}
for i := 1; i <= branches; i++ {
value := parent.value*10 + i
child := largeVertex{value}
childId, _ := d.AddVertex(child)
vertexCount++
err := d.AddEdge(parent.ID(), childId)
edgeCount++
if err != nil {
panic(err)
}
childVertexCount, childEdgeCount := largeAux(d, level-1, branches, child)
vertexCount += childVertexCount
edgeCount += childEdgeCount
}
}
return vertexCount, edgeCount
}
func sum(x, y, branches int, fn interface{}) int {
if x > y {
return 0
}
f, ok := fn.(func(int, int) int)
if !ok {
panic("function no of correct tpye")
}
current := f(branches, x)
rest := sum(x+1, y, branches, f)
return current + rest
}
func pow(base int, exp int) int {
pow := math.Pow(float64(base), float64(exp))
return int(pow)
} | cmd/timing/main.go | 0.566258 | 0.432363 | main.go | starcoder |
package utils
import (
"fmt"
)
type ScaleParams struct {
Offset float64
Scale float64
Clip float64
}
func scale(r Raster, params ScaleParams) (*ByteRaster, error) {
scale := float32(params.Scale)
if scale <= 0.0 {
if params.Clip <= 0.0 {
scale = float32(1.0)
} else {
scale = float32(float32(254.0) / float32(params.Clip))
}
}
switch t := r.(type) {
case *ByteRaster:
noData := uint8(t.NoData)
offset := uint8(params.Offset)
clip := uint8(params.Clip)
for i, value := range t.Data {
if value == noData {
t.Data[i] = 0xFF
} else {
value += offset
if value > clip {
value = clip
}
if value < 0 {
value = 0
}
t.Data[i] = uint8(float32(value) * scale)
}
}
return &ByteRaster{t.NameSpace, t.Data, t.Height, t.Width, t.NoData}, nil
case *Int16Raster:
out := &ByteRaster{NameSpace: t.NameSpace, NoData: t.NoData, Data: make([]uint8, t.Height*t.Width), Width: t.Width, Height: t.Height}
noData := int16(t.NoData)
offset := int16(params.Offset)
clip := int16(params.Clip)
for i, value := range t.Data {
if value == noData {
out.Data[i] = 0xFF
} else {
value += offset
if value > clip {
value = clip
}
if value < 0 {
value = 0
}
out.Data[i] = uint8(float32(value) * scale)
}
}
return out, nil
case *UInt16Raster:
out := &ByteRaster{NameSpace: t.NameSpace, NoData: t.NoData, Data: make([]uint8, t.Height*t.Width), Width: t.Width, Height: t.Height}
noData := uint16(t.NoData)
offset := uint16(params.Offset)
clip := uint16(params.Clip)
for i, value := range t.Data {
if value == noData {
out.Data[i] = 0xFF
} else {
value += offset
if value > clip {
value = clip
}
if value < 0 {
value = 0
}
out.Data[i] = uint8(float32(value) * scale)
}
}
return out, nil
case *Float32Raster:
out := &ByteRaster{NameSpace: t.NameSpace, NoData: t.NoData, Data: make([]uint8, t.Height*t.Width), Width: t.Width, Height: t.Height}
noData := float32(t.NoData)
offset := float32(params.Offset)
clip := float32(params.Clip)
for i, value := range t.Data {
if value == noData {
out.Data[i] = 0xFF
} else {
value += offset
if value > clip {
value = clip
}
if value < 0.0 {
value = 0.0
}
out.Data[i] = uint8(value * scale)
}
}
return out, nil
default:
return &ByteRaster{}, fmt.Errorf("Raster type not implemented")
}
}
func Scale(rs []Raster, params ScaleParams) ([]*ByteRaster, error) {
out := make([]*ByteRaster, len(rs))
for i, r := range rs {
br, err := scale(r, params)
if err != nil {
return out, err
}
out[i] = br
}
return out, nil
} | utils/raster_scaler.go | 0.575349 | 0.401189 | raster_scaler.go | starcoder |
package sceneitems
import requests "github.com/andreykaipov/goobs/api/requests"
/*
SetSceneItemPropertiesParams represents the params body for the "SetSceneItemProperties" request.
Sets the scene specific properties of a source. Unspecified properties will remain unchanged.
Coordinates are relative to the item's parent (the scene or group it belongs to).
Since 4.3.0.
*/
type SetSceneItemPropertiesParams struct {
requests.ParamsBasic
Bounds struct {
// The new alignment of the bounding box. (0-2, 4-6, 8-10)
Alignment int `json:"alignment"`
// The new bounds type of the source. Can be "OBS_BOUNDS_STRETCH", "OBS_BOUNDS_SCALE_INNER",
// "OBS_BOUNDS_SCALE_OUTER", "OBS_BOUNDS_SCALE_TO_WIDTH", "OBS_BOUNDS_SCALE_TO_HEIGHT", "OBS_BOUNDS_MAX_ONLY" or
// "OBS_BOUNDS_NONE".
Type string `json:"type"`
// The new width of the bounding box.
X float64 `json:"x"`
// The new height of the bounding box.
Y float64 `json:"y"`
} `json:"bounds"`
Crop struct {
// The new amount of pixels cropped off the bottom of the source before scaling.
Bottom int `json:"bottom"`
// The new amount of pixels cropped off the left of the source before scaling.
Left int `json:"left"`
// The new amount of pixels cropped off the right of the source before scaling.
Right int `json:"right"`
// The new amount of pixels cropped off the top of the source before scaling.
Top int `json:"top"`
} `json:"crop"`
Item struct {
// Scene Item ID (if the `item` field is an object)
Id int `json:"id"`
// Scene Item name (if the `item` field is an object)
Name string `json:"name"`
} `json:"item"`
// The new locked status of the source. 'true' keeps it in its current position, 'false' allows movement.
Locked bool `json:"locked"`
Position struct {
// The new alignment of the source.
Alignment float64 `json:"alignment"`
// The new x position of the source.
X float64 `json:"x"`
// The new y position of the source.
Y float64 `json:"y"`
} `json:"position"`
// The new clockwise rotation of the item in degrees.
Rotation float64 `json:"rotation"`
Scale struct {
// The new scale filter of the source. Can be "OBS_SCALE_DISABLE", "OBS_SCALE_POINT", "OBS_SCALE_BICUBIC",
// "OBS_SCALE_BILINEAR", "OBS_SCALE_LANCZOS" or "OBS_SCALE_AREA".
Filter string `json:"filter"`
// The new x scale of the item.
X float64 `json:"x"`
// The new y scale of the item.
Y float64 `json:"y"`
} `json:"scale"`
// Name of the scene the source item belongs to. Defaults to the current scene.
SceneName string `json:"scene-name"`
// The new visibility of the source. 'true' shows source, 'false' hides source.
Visible bool `json:"visible"`
}
// GetSelfName just returns "SetSceneItemProperties".
func (o *SetSceneItemPropertiesParams) GetSelfName() string {
return "SetSceneItemProperties"
}
/*
SetSceneItemPropertiesResponse represents the response body for the "SetSceneItemProperties" request.
Sets the scene specific properties of a source. Unspecified properties will remain unchanged.
Coordinates are relative to the item's parent (the scene or group it belongs to).
Since v4.3.0.
*/
type SetSceneItemPropertiesResponse struct {
requests.ResponseBasic
}
// SetSceneItemProperties sends the corresponding request to the connected OBS WebSockets server.
func (c *Client) SetSceneItemProperties(params *SetSceneItemPropertiesParams) (*SetSceneItemPropertiesResponse, error) {
data := &SetSceneItemPropertiesResponse{}
if err := c.SendRequest(params, data); err != nil {
return nil, err
}
return data, nil
} | api/requests/scene_items/xx_generated.setsceneitemproperties.go | 0.833019 | 0.401776 | xx_generated.setsceneitemproperties.go | starcoder |
package suncal
import (
"fmt"
. "math"
"time"
)
const (
// Private constants
pi2 = 2 * Pi
jd2000 = 2451545.0
)
type SunInfo struct {
Rise time.Time
Set time.Time
}
type GeoCoordinates struct {
Latitude float64
Longitude float64
}
func (c GeoCoordinates) String() string {
return fmt.Sprintf("Latitude: %v Longitude %v", c.Latitude, c.Longitude)
}
func mkJulianDate(date time.Time) float64 {
const hour = 12.0
const minute = 0.0
const second = 0.0
year, month, day := date.Date()
if month <= 2 {
month = month + 12
year = year - 1
}
// Gregorian calendar
var gregor int = (year / 400) - (year / 100) + (year / 4)
return 2400000.5 + 365.0*float64(year) - 679004.0 + float64(gregor) +
float64(int64(30.6001*(float64(month)+1))) + float64(day) + hour/24.0 +
minute/1440.0 + second/86400.0
}
func inPi(x float64) float64 {
var n int = (int)(x / pi2)
x = x - float64(n)*pi2
if x < 0 {
x += pi2
}
return x
}
// Tilt of the earth axis
func eps(t float64) float64 {
return Pi / 180 * (23.43929111 + (-46.8150*t-0.00059*t*t+0.001813*t*t*t)/3600.0)
}
// https://en.wikipedia.org/wiki/Equation_of_time
func calcTimeEquation(t float64) (float64, float64) {
raMid := 18.71506921 + 2400.0513369*t + (2.5862e-5-1.72e-9*t)*t*t
m := inPi(pi2 * (0.993133 + 99.997361*t))
l := inPi(pi2 * (0.7859453 + m/pi2 + (6893.0*Sin(m)+72.0*Sin(2.0*m)+6191.2*t)/1296.0e3))
e := eps(t)
ra := Atan(Tan(l) * Cos(e))
if ra < 0.0 {
ra += Pi
}
if l > Pi {
ra += Pi
}
ra = 24.0 * ra / pi2
dk := Asin(Sin(e) * Sin(l)) // declination
// Ensure 0 <= raMid < 24
raMid = 24.0 * inPi(pi2*raMid/24.0) / pi2
dRA := raMid - ra
if dRA < -12.0 {
dRA += 24.0
} else if dRA > 12.0 {
dRA -= 24.0
}
dRA = dRA * 1.0027379
return dRA, dk
}
func timeFromFloatTime(date time.Time, ftime float64) time.Time {
var minute int = int(60.0*(ftime-float64(int(ftime))) + 0.5)
var hour int = int(ftime)
if minute >= 60.0 {
minute -= 60.0
hour++
} else if minute < 0 {
minute += 60.0
hour--
if hour < 0.0 {
hour += 24.0
}
}
return time.Date(date.Year(), date.Month(), date.Day(),
hour, minute, 0, 0,
date.Location())
}
// Apply timezone to world time
func applyTimezone(worldTime float64, date time.Time) float64 {
_, tzoffsetMinutes := date.Zone()
offset := float64(tzoffsetMinutes / 3600)
if t := worldTime + offset; t < 0.0 {
return t + 24.0
} else if t >= 24.0 {
return t - 24.0
} else {
return t
}
}
// Calculate sunrise and sunset for given coordinates and date for the default twilight.
func SunCal(coords GeoCoordinates, date time.Time) SunInfo {
jd := mkJulianDate(date)
t := (jd - jd2000) / 36525.0
// default -50, civil -6, astronomic -18, nautic -12 arcs
// h := float64(twilightKind) / 60.0 * Pi / 180
h := -50.0 / 60.0 * Pi / 180
lat := coords.Latitude * Pi / 180
lon := coords.Longitude
timeEqu, dk := calcTimeEquation(t)
timeDiff := 12.0 * Acos((Sin(h)-Sin(lat)*Sin(dk))/(Cos(lat)*Cos(dk))) / Pi
zoneTimeRise := 12.0 - timeDiff - timeEqu
zoneTimeDawn := 12.0 + timeDiff - timeEqu
worldTimeRise := zoneTimeRise - lon/15.0
worldTimeDawn := zoneTimeDawn - lon/15.0
var rise float64 = applyTimezone(worldTimeRise, date)
var dawn float64 = applyTimezone(worldTimeDawn, date)
dtRise := timeFromFloatTime(date, rise)
dtDawn := timeFromFloatTime(date, dawn)
return SunInfo{dtRise, dtDawn}
// Compared with CalSky.com
// Rise: 7h18.4m
// Set: 19h00.6m
}
// EOF | suncal.go | 0.76207 | 0.487307 | suncal.go | starcoder |
package bookingclient
import (
"encoding/json"
"time"
)
// ReservationAssignedUnitTimeRangeModel struct for ReservationAssignedUnitTimeRangeModel
type ReservationAssignedUnitTimeRangeModel struct {
// The start date and time of the period for which the unit is assigned to the reservation<br />A date and time (without fractional second part) in UTC or with UTC offset as defined in <a href=\"https://en.wikipedia.org/wiki/ISO_8601\">ISO8601:2004</a>
From time.Time `json:"from"`
// The end date and time of the period for which the unit is assigned to the reservation<br />A date and time (without fractional second part) in UTC or with UTC offset as defined in <a href=\"https://en.wikipedia.org/wiki/ISO_8601\">ISO8601:2004</a>
To time.Time `json:"to"`
}
// NewReservationAssignedUnitTimeRangeModel instantiates a new ReservationAssignedUnitTimeRangeModel object
// This constructor will assign default values to properties that have it defined,
// and makes sure properties required by API are set, but the set of arguments
// will change when the set of required properties is changed
func NewReservationAssignedUnitTimeRangeModel(from time.Time, to time.Time) *ReservationAssignedUnitTimeRangeModel {
this := ReservationAssignedUnitTimeRangeModel{}
this.From = from
this.To = to
return &this
}
// NewReservationAssignedUnitTimeRangeModelWithDefaults instantiates a new ReservationAssignedUnitTimeRangeModel object
// This constructor will only assign default values to properties that have it defined,
// but it doesn't guarantee that properties required by API are set
func NewReservationAssignedUnitTimeRangeModelWithDefaults() *ReservationAssignedUnitTimeRangeModel {
this := ReservationAssignedUnitTimeRangeModel{}
return &this
}
// GetFrom returns the From field value
func (o *ReservationAssignedUnitTimeRangeModel) GetFrom() time.Time {
if o == nil {
var ret time.Time
return ret
}
return o.From
}
// GetFromOk returns a tuple with the From field value
// and a boolean to check if the value has been set.
func (o *ReservationAssignedUnitTimeRangeModel) GetFromOk() (*time.Time, bool) {
if o == nil {
return nil, false
}
return &o.From, true
}
// SetFrom sets field value
func (o *ReservationAssignedUnitTimeRangeModel) SetFrom(v time.Time) {
o.From = v
}
// GetTo returns the To field value
func (o *ReservationAssignedUnitTimeRangeModel) GetTo() time.Time {
if o == nil {
var ret time.Time
return ret
}
return o.To
}
// GetToOk returns a tuple with the To field value
// and a boolean to check if the value has been set.
func (o *ReservationAssignedUnitTimeRangeModel) GetToOk() (*time.Time, bool) {
if o == nil {
return nil, false
}
return &o.To, true
}
// SetTo sets field value
func (o *ReservationAssignedUnitTimeRangeModel) SetTo(v time.Time) {
o.To = v
}
func (o ReservationAssignedUnitTimeRangeModel) MarshalJSON() ([]byte, error) {
toSerialize := map[string]interface{}{}
if true {
toSerialize["from"] = o.From
}
if true {
toSerialize["to"] = o.To
}
return json.Marshal(toSerialize)
}
type NullableReservationAssignedUnitTimeRangeModel struct {
value *ReservationAssignedUnitTimeRangeModel
isSet bool
}
func (v NullableReservationAssignedUnitTimeRangeModel) Get() *ReservationAssignedUnitTimeRangeModel {
return v.value
}
func (v *NullableReservationAssignedUnitTimeRangeModel) Set(val *ReservationAssignedUnitTimeRangeModel) {
v.value = val
v.isSet = true
}
func (v NullableReservationAssignedUnitTimeRangeModel) IsSet() bool {
return v.isSet
}
func (v *NullableReservationAssignedUnitTimeRangeModel) Unset() {
v.value = nil
v.isSet = false
}
func NewNullableReservationAssignedUnitTimeRangeModel(val *ReservationAssignedUnitTimeRangeModel) *NullableReservationAssignedUnitTimeRangeModel {
return &NullableReservationAssignedUnitTimeRangeModel{value: val, isSet: true}
}
func (v NullableReservationAssignedUnitTimeRangeModel) MarshalJSON() ([]byte, error) {
return json.Marshal(v.value)
}
func (v *NullableReservationAssignedUnitTimeRangeModel) UnmarshalJSON(src []byte) error {
v.isSet = true
return json.Unmarshal(src, &v.value)
} | api/clients/bookingclient/model_reservation_assigned_unit_time_range_model.go | 0.790409 | 0.469703 | model_reservation_assigned_unit_time_range_model.go | starcoder |
package main
import (
"fmt"
"io"
)
func mainUsage(f io.Writer) {
fmt.Fprint(f, mainHelp)
}
var mainHelp = `
gg is a cache-based wrapper around go generate directives.
Usage:
gg [-p n] [-r n] [-trace] [-skipCache] [-tags 'tag list'] [packages]
gg runs go generate directives found in packages according to the reverse
dependency graph implied by those packages' imports, and the dependencies of
the go generate directives. gg repeatedly runs the directives in a given
package until a fixed point is reached.
gg works in both GOPATH and modules modes.
gg identifies generated artefacts by filename. Generated files have a gen_
prefix and can have any extension. The directive command name is used as the
pre-extension suffix. For example, given the command name mygen, the following
are the names of generated artefacts:
gen_mygen.go
gen_something_mygen_test.go
gen_another_mygen.json
The packages argument is similar to the packages argument for the go command;
see 'go help packages' for more information. In module mode, it is an error if
packages resolves to packages outside of the main module.
The -tags flag is similar to the build flag that can be passed to the go
command. It takes a space-separated list of build tags to consider satisfied as
gg runs, and can appear multiple times.
The -p flag controls the concurrency level of gg. By default will assume a -p
value of GOMAXPROCS. go generate directives only ever run in serial and never
concurrently with other work (this may be relaxed in the future to allow
concurrent execution of go generate directives). A -p value of 1 implies serial
execution of work in a well defined order.
The -trace flag outputs a log of work being executed by gg. It is most useful
when specified along with -p 1 (else the order of execution of work is not well
defined).
The -skipCache flag causes gg to skip checking for cache hits. Consequently,
all generators are run, regardless of cache state, until a fixed point is
reached. The cache is updated after each iteration in a package. As such, this
flag can be used to heal a broken cache, i.e. correct the delta for a given
cache key.
Note: at present, gg does not understand the GOFLAGS environment variable.
Neither does it pass the effective build tags via GOFLAGS to each go generate
directive. For more details see:
https://github.com/golang/go/issues/26849#issuecomment-460301061
go generate directives can take three forms:
//go:generate command ...
//go:generate gobin -run main_pkg[@version] ...
//go:generate gobin -m -run main_pkg[@version] ...
The first form, a simple command-based directive, is a relative or absolute
PATH-resolved command.
The second form similar to the command-based directive, except that the path of
the resulting command is resolved via gobin's semantics (see gobin -help).
The third form uses the main module for resolution of the command and its
dependencies. Those dependencies take part in the reverse dependency graph. Use
of this form is, by definition, only possible in module mode.
For gobin-based directives, the command name, for the purposes of identifying
generated artefacts, is the base of the main package.
For all three forms, gg understands how to parse two forms of flags. Flags
prefixed with -infiles: are interpreted as glob patterns of files the directive
will consume. The expansion of the glob must result in files contained in
directories that are dependencies of the package. For example:
//go:generate mygen -infiles:all *.json
If the output of a generator is the function of any files other than those
understood by go list, it must use -infiles: prefixed flags to declare those
inputs, else gg will not consider those files as part of its cache key.
Similarly, flags prefixed with -outdir: tell gg that the directive will generate
files to the named directory in addition to the current package's directory. For example:
//go:generate anothergen -outdir:apples ./adir
If a generator places results in any directory other than the current directory
(i.e. the directory containing the package delcaring the directive) then it
must use -outdir: prefixed flags to declare those directories, else gg will
miss artefacts generated by the directive.
gg also understands a special form of directive:
//go:generate:gg [cond] break
This special directives include a [cond] prefix. At present, a single command
is understood: break. If the preceding conditions are satisfied, no further
go:generate directives are exectuted in this iteration. Note, if spaces are
required in [cond] it must be double-quoted.
The predefined conditions are:
[exists:file] for whether the (relative) file path exists
[exec:prog] for whether prog is available for execution (found by
exec.LookPath)
Where the third form of go generate directive is used, it may be necessary to
declare tool dependencies in your main module. For more information on how to
do this see:
https://github.com/golang/go/wiki/Modules#how-can-i-track-tool-dependencies-for-a-module
By default, gg uses the directory gg-artefacts under your user cache directory.
See the documentation for os.UserCacheDir for OS-specific details on how to
configure its location. Setting GGCACHE overrides the default.
TODO
The following is a rough list of TODOs for gg:
* add support for parsing of GOFLAGS
* add support for setting of GOFLAGS for go generate directives
* consider supporting concurrent execution of go generate directives
* define semantics for when generated files are removed by a generator
* add full tests for cgo
`[1:] | cmd/gg/help.go | 0.589362 | 0.437703 | help.go | starcoder |
package geometry
type Rect struct {
Min, Max Point
}
func (rect Rect) Move(deltaX, deltaY float64) Rect {
return Rect{
Min: Point{X: rect.Min.X + deltaX, Y: rect.Min.Y + deltaY},
Max: Point{X: rect.Max.X + deltaX, Y: rect.Max.Y + deltaY},
}
}
func (rect Rect) Index() []byte {
return nil
}
func (rect Rect) Clockwise() bool {
return false
}
func (rect Rect) Center() Point {
return Point{(rect.Max.X + rect.Min.X) / 2, (rect.Max.Y + rect.Min.Y) / 2}
}
func (rect Rect) Area() float64 {
return (rect.Max.X - rect.Min.X) * (rect.Max.Y - rect.Min.Y)
}
func (rect Rect) NumPoints() int {
return 5
}
func (rect Rect) NumSegments() int {
return 4
}
func (rect Rect) PointAt(index int) Point {
switch index {
default:
return []Point{}[0]
case 0:
return Point{rect.Min.X, rect.Min.Y}
case 1:
return Point{rect.Max.X, rect.Min.Y}
case 2:
return Point{rect.Max.X, rect.Max.Y}
case 3:
return Point{rect.Min.X, rect.Max.Y}
case 4:
return Point{rect.Min.X, rect.Min.Y}
}
}
func (rect Rect) RawPoints() []Point {
return []Point{
{rect.Min.X, rect.Min.Y},
{rect.Max.X, rect.Min.Y},
{rect.Max.X, rect.Max.Y},
{rect.Min.X, rect.Max.Y},
{rect.Min.X, rect.Min.Y},
}
}
func (rect Rect) NW() Point { return Point{rect.Min.X, rect.Max.Y} }
func (rect Rect) SW() Point { return rect.Min }
func (rect Rect) SE() Point { return Point{rect.Max.X, rect.Min.Y} }
func (rect Rect) NE() Point { return rect.Max }
func (rect Rect) South() Segment { return Segment{rect.SW(), rect.SE()} }
func (rect Rect) East() Segment { return Segment{rect.SE(), rect.NE()} }
func (rect Rect) North() Segment { return Segment{rect.NE(), rect.NW()} }
func (rect Rect) West() Segment { return Segment{rect.NW(), rect.SW()} }
func (rect Rect) Closed() bool {
return true
}
func (rect Rect) SegmentAt(index int) Segment {
switch index {
default:
return []Segment{}[0] // intentional panic
case 0:
return rect.South()
case 1:
return rect.East()
case 2:
return rect.North()
case 3:
return rect.West()
}
}
func (rect Rect) Search(target Rect, iter func(seg Segment, idx int) bool) {
var idx int
rectNumSegments := rect.NumSegments()
for i := 0; i < rectNumSegments; i++ {
seg := rect.SegmentAt(i)
if seg.Rect().IntersectsRect(target) {
if !iter(seg, idx) {
break
}
}
idx++
}
}
func (rect Rect) Empty() bool {
return false
}
func (rect Rect) Rect() Rect {
return rect
}
func (rect Rect) Convex() bool {
return true
}
func (rect Rect) ContainsPoint(point Point) bool {
return point.X >= rect.Min.X && point.X <= rect.Max.X &&
point.Y >= rect.Min.Y && point.Y <= rect.Max.Y
}
func (rect Rect) IntersectsPoint(point Point) bool {
return rect.ContainsPoint(point)
}
func (rect Rect) ContainsRect(other Rect) bool {
if other.Min.X < rect.Min.X || other.Max.X > rect.Max.X {
return false
}
if other.Min.Y < rect.Min.Y || other.Max.Y > rect.Max.Y {
return false
}
return true
}
func (rect Rect) IntersectsRect(other Rect) bool {
if rect.Min.Y > other.Max.Y || rect.Max.Y < other.Min.Y {
return false
}
if rect.Min.X > other.Max.X || rect.Max.X < other.Min.X {
return false
}
return true
}
func (rect Rect) ContainsLine(line *Line) bool {
if line == nil {
return false
}
return !line.Empty() && rect.ContainsRect(line.Rect())
}
func (rect Rect) IntersectsLine(line *Line) bool {
if line == nil {
return false
}
return ringIntersectsLine(rect, line, true)
}
func (rect Rect) ContainsPoly(poly *Poly) bool {
if poly == nil {
return false
}
return !poly.Empty() && rect.ContainsRect(poly.Rect())
}
func (rect Rect) IntersectsPoly(poly *Poly) bool {
if poly == nil {
return false
}
return poly.IntersectsRect(rect)
}
func (rect Rect) Union(other Rect) Rect {
if other.Min.X < rect.Min.X {
rect.Min.X = other.Min.X
}
if other.Min.Y < rect.Min.Y {
rect.Min.Y = other.Min.Y
}
if other.Max.X > rect.Max.X {
rect.Max.X = other.Max.X
}
if other.Max.Y > rect.Max.Y {
rect.Max.Y = other.Max.Y
}
return rect
}
// // Distance returns a distance to the outer boundary of the rectangle.
// // Check out Series.Distance for more information
// func (rect Rect) Distance(
// distToRect func(rect Rect) float64,
// distToSegment func(seg Segment) float64,
// ) (seg Segment, idx int, dist float64) {
// return seriesDistance(rect, distToRect, distToSegment)
// } | rect.go | 0.868562 | 0.750404 | rect.go | starcoder |
package kdbush
// Interface, that should be implemented by indexing structure
// It's just simply returns points coordinates
// Called once, only when index created, so you could calc values on the fly for this interface
type Point interface {
Coordinates() (X, Y float64)
}
// SimplePoint minimal struct, that implements Point interface
type SimplePoint struct {
X, Y float64
}
// Coordinates to make SimplePoint's implementation of Point interface satisfied
func (sp *SimplePoint) Coordinates() (float64, float64) {
return sp.X, sp.Y
}
// KDBush a very fast static spatial index for 2D points based on a flat KD-tree.
// Points only, no rectangles
// static (no add, remove items)
// 2 dimensional
// indexing 16-40 times faster then rtreego(https://github.com/dhconnelly/rtreego) (TODO: benchmark)
type KDBush struct {
NodeSize int
Points []Point
idxs []int //array of indexes
coords []float64 //array of coordinates
}
// NewBush create new index from points
// Structure don't copy points itself, copy only coordinates
// Returns pointer to new KDBush index object, all data in it already indexed
// Input:
// points - slice of objects, that implements Point interface
// nodeSize - size of the KD-tree node, 64 by default. Higher means faster indexing but slower search, and vise versa.
func NewBush(points []Point, nodeSize int) *KDBush {
b := KDBush{}
b.buildIndex(points, nodeSize)
return &b
}
// Range finds all items within the given bounding box and returns an array of indices that refer to the items in the original points input slice.
func (bush *KDBush) Range(minX, minY, maxX, maxY float64) []int {
stack := []int{0, len(bush.idxs) - 1, 0}
result := []int{}
var x, y float64
for len(stack) > 0 {
axis := stack[len(stack)-1]
stack = stack[:len(stack)-1]
right := stack[len(stack)-1]
stack = stack[:len(stack)-1]
left := stack[len(stack)-1]
stack = stack[:len(stack)-1]
if right-left <= bush.NodeSize {
for i := left; i <= right; i++ {
x = bush.coords[2*i]
y = bush.coords[2*i+1]
if x >= minX && x <= maxX && y >= minY && y <= maxY {
result = append(result, bush.idxs[i])
}
}
continue
}
m := floor(float64(left+right) / 2.0)
x = bush.coords[2*m]
y = bush.coords[2*m+1]
if x >= minX && x <= maxX && y >= minY && y <= maxY {
result = append(result, bush.idxs[m])
}
nextAxis := (axis + 1) % 2
if (axis == 0 && minX <= x) || (axis != 0 && minY <= y) {
stack = append(stack, left)
stack = append(stack, m-1)
stack = append(stack, nextAxis)
}
if (axis == 0 && maxX >= x) || (axis != 0 && maxY >= y) {
stack = append(stack, m+1)
stack = append(stack, right)
stack = append(stack, nextAxis)
}
}
return result
}
// Within finds all items within a given radius from the query point and returns an array of indices.
func (bush *KDBush) Within(point Point, radius float64) []int {
stack := []int{0, len(bush.idxs) - 1, 0}
result := []int{}
r2 := radius * radius
qx, qy := point.Coordinates()
for len(stack) > 0 {
axis := stack[len(stack)-1]
stack = stack[:len(stack)-1]
right := stack[len(stack)-1]
stack = stack[:len(stack)-1]
left := stack[len(stack)-1]
stack = stack[:len(stack)-1]
if right-left <= bush.NodeSize {
for i := left; i <= right; i++ {
dst := sqrtDist(bush.coords[2*i], bush.coords[2*i+1], qx, qy)
if dst <= r2 {
result = append(result, bush.idxs[i])
}
}
continue
}
m := floor(float64(left+right) / 2.0)
x := bush.coords[2*m]
y := bush.coords[2*m+1]
if sqrtDist(x, y, qx, qy) <= r2 {
result = append(result, bush.idxs[m])
}
nextAxis := (axis + 1) % 2
if (axis == 0 && (qx-radius <= x)) || (axis != 0 && (qy-radius <= y)) {
stack = append(stack, left)
stack = append(stack, m-1)
stack = append(stack, nextAxis)
}
if (axis == 0 && (qx+radius >= x)) || (axis != 0 && (qy+radius >= y)) {
stack = append(stack, m+1)
stack = append(stack, right)
stack = append(stack, nextAxis)
}
}
return result
}
func (bush *KDBush) buildIndex(points []Point, nodeSize int) {
bush.NodeSize = nodeSize
bush.Points = points
bush.idxs = make([]int, len(points))
bush.coords = make([]float64, 2*len(points))
for i, v := range points {
bush.idxs[i] = i
x, y := v.Coordinates()
bush.coords[i*2] = x
bush.coords[i*2+1] = y
}
sort(bush.idxs, bush.coords, bush.NodeSize, 0, len(bush.idxs)-1, 0)
} | kdbush.go | 0.646349 | 0.55254 | kdbush.go | starcoder |
package iso20022
// Account between an investor(s) and a fund manager or a fund. The account can contain holdings in any investment fund or investment fund class managed (or distributed) by the fund manager, within the same fund family.
type InvestmentAccount29 struct {
// Name of the account. It provides an additional means of identification, and is designated by the account servicer in agreement with the account owner.
Name *Max35Text `xml:"Nm,omitempty"`
// Supplementary registration information applying to a specific block of units for dealing and reporting purposes. The supplementary registration information may be used when all the units are registered, for example, to a funds supermarket, but holdings for each investor have to reconciled individually.
Designation *Max35Text `xml:"Dsgnt,omitempty"`
// Legal form of the fund, eg, UCITS, SICAV, OEIC, Unit Trust, and FCP.
FundType *Max35Text `xml:"FndTp,omitempty"`
// Name of the investment fund family.
FundFamilyName *Max350Text `xml:"FndFmlyNm,omitempty"`
// Detailed information about the investment fund associated to the account.
SecurityDetails *FinancialInstrument10 `xml:"SctyDtls,omitempty"`
// Identification of an individual person whom legally owns the account.
IndividualOwnerIdentification *IndividualPersonIdentificationChoice `xml:"IndvOwnrId,omitempty"`
// Identification of an organisation that legally owns the account.
OrganisationOwnerIdentification *PartyIdentification5Choice `xml:"OrgOwnrId,omitempty"`
// Party that provides services relating to financial products to investors, eg, advice on products and placement of orders for the investment fund.
Intermediary []*Intermediary7 `xml:"Intrmy,omitempty"`
// Party that manages the account on behalf of the account owner, that is manages the registration and booking of entries on the account, calculates balances on the account and provides information about the account.
AccountServicer *PartyIdentification2Choice `xml:"AcctSvcr,omitempty"`
}
func (i *InvestmentAccount29) SetName(value string) {
i.Name = (*Max35Text)(&value)
}
func (i *InvestmentAccount29) SetDesignation(value string) {
i.Designation = (*Max35Text)(&value)
}
func (i *InvestmentAccount29) SetFundType(value string) {
i.FundType = (*Max35Text)(&value)
}
func (i *InvestmentAccount29) SetFundFamilyName(value string) {
i.FundFamilyName = (*Max350Text)(&value)
}
func (i *InvestmentAccount29) AddSecurityDetails() *FinancialInstrument10 {
i.SecurityDetails = new(FinancialInstrument10)
return i.SecurityDetails
}
func (i *InvestmentAccount29) AddIndividualOwnerIdentification() *IndividualPersonIdentificationChoice {
i.IndividualOwnerIdentification = new(IndividualPersonIdentificationChoice)
return i.IndividualOwnerIdentification
}
func (i *InvestmentAccount29) AddOrganisationOwnerIdentification() *PartyIdentification5Choice {
i.OrganisationOwnerIdentification = new(PartyIdentification5Choice)
return i.OrganisationOwnerIdentification
}
func (i *InvestmentAccount29) AddIntermediary() *Intermediary7 {
newValue := new(Intermediary7)
i.Intermediary = append(i.Intermediary, newValue)
return newValue
}
func (i *InvestmentAccount29) AddAccountServicer() *PartyIdentification2Choice {
i.AccountServicer = new(PartyIdentification2Choice)
return i.AccountServicer
} | InvestmentAccount29.go | 0.695441 | 0.447581 | InvestmentAccount29.go | starcoder |
package genworldvoronoi
import (
"github.com/Flokey82/go_gens/vectors"
"github.com/fogleman/delaunay"
"log"
"math"
"math/rand"
)
// generateFibonacciSphere generates a number of points along a spiral on a sphere.
func generateFibonacciSphere(seed int64, numPoints int, jitter float64) []float64 {
rnd := rand.New(rand.NewSource(seed))
var a_latlong []float64
_randomLat := make(map[int]float64)
_randomLon := make(map[int]float64)
// Second algorithm from http://web.archive.org/web/20120421191837/http://www.cgafaq.info/wiki/Evenly_distributed_points_on_sphere
s := 3.6 / math.Sqrt(float64(numPoints))
dlong := math.Pi * (3 - math.Sqrt(5)) /* ~2.39996323 */
dz := 2.0 / float64(numPoints)
for k, long, z := 0, 0.0, 1-(dz/2); k != numPoints; k++ {
r := math.Sqrt(1 - z*z)
latDeg := math.Asin(z) * 180 / math.Pi
lonDeg := long * 180 / math.Pi
if _, ok := _randomLat[k]; !ok {
_randomLat[k] = rnd.Float64() - rnd.Float64()
}
if _, ok := _randomLon[k]; !ok {
_randomLon[k] = rnd.Float64() - rnd.Float64()
}
latDeg += jitter * _randomLat[k] * (latDeg - math.Asin(math.Max(-1, z-dz*2*math.Pi*r/s))*180/math.Pi)
lonDeg += jitter * _randomLon[k] * (s / r * 180 / math.Pi)
a_latlong = append(a_latlong, latDeg, math.Mod(lonDeg, 360.0))
long += dlong
z -= dz
}
return a_latlong
}
// pushCartesianFromSpherical calculates x,y,z from spherical coordinates lat,lon and then push
// them onto out array; for one-offs pass nil as the first argument
func pushCartesianFromSpherical(out []float64, latDeg, lonDeg float64) []float64 {
return append(out, latLonToCartesian(latDeg, lonDeg)...)
}
// latLonToCartesian converts latitude and longitude to x, y, z coordinates.
// See: https://rbrundritt.wordpress.com/2008/10/14/conversion-between-spherical-and-cartesian-coordinates-systems/
func latLonToCartesian(latDeg, lonDeg float64) []float64 {
latRad := (latDeg / 180.0) * math.Pi
lonRad := (lonDeg / 180.0) * math.Pi
return []float64{
math.Cos(latRad) * math.Cos(lonRad),
math.Cos(latRad) * math.Sin(lonRad),
math.Sin(latRad),
}
}
// latLonFromVec3 converts a vectors.Vec3 to latitude and longitude.
// See: https://rbrundritt.wordpress.com/2008/10/14/conversion-between-spherical-and-cartesian-coordinates-systems/
func latLonFromVec3(position vectors.Vec3, sphereRadius float64) (float64, float64) {
// See https://stackoverflow.com/questions/46247499/vector3-to-latitude-longitude
lat := math.Asin(position.Z / sphereRadius) //theta
lon := math.Atan2(position.Y, position.X) //phi
return radToDeg(lat), radToDeg(lon)
}
/** Add south pole back into the mesh.
*
* We run the Delaunay Triangulation on all points *except* the south
* pole, which gets mapped to infinity with the stereographic
* projection. This function adds the south pole into the
* triangulation. The Delaunator guide explains how the halfedges have
* to be connected to make the mesh work.
* <https://mapbox.github.io/delaunator/>
*
* Returns the new {triangles, halfedges} for the triangulation with
* one additional point added around the convex hull.
*/
func addSouthPoleToMesh(southPoleId int, d *delaunay.Triangulation) *delaunay.Triangulation {
// This logic is from <https://github.com/redblobgames/dual-mesh>,
// where I use it to insert a "ghost" region on the "back" side of
// the planar map. The same logic works here. In that code I use
// "s" for edges ("sides"), "r" for regions ("points"), t for triangles
triangles := d.Triangles
numSides := len(triangles)
s_next_s := func(s int) int {
if s%3 == 2 {
return s - 2
}
return s + 1
}
halfedges := d.Halfedges
numUnpairedSides := 0
firstUnpairedSide := -1
pointIdToSideId := make(map[int]int) // seed to side
for s := 0; s < numSides; s++ {
if halfedges[s] == -1 {
numUnpairedSides++
pointIdToSideId[triangles[s]] = s
firstUnpairedSide = s
}
}
newTriangles := make([]int, numSides+3*numUnpairedSides)
newHalfedges := make([]int, numSides+3*numUnpairedSides)
copy(newTriangles, triangles) //newTriangles.set(triangles)
copy(newHalfedges, halfedges) //newHalfedges.set(halfedges)
for i, s := 0, firstUnpairedSide; i < numUnpairedSides; i++ {
log.Println(i)
// Construct a pair for the unpaired side s
newSide := numSides + 3*i
newHalfedges[s] = newSide
newHalfedges[newSide] = s
newTriangles[newSide] = newTriangles[s_next_s(s)]
// Construct a triangle connecting the new side to the south pole
newTriangles[newSide+1] = newTriangles[s]
newTriangles[newSide+2] = southPoleId
k := numSides + (3*i+4)%(3*numUnpairedSides)
newHalfedges[newSide+2] = k
newHalfedges[k] = newSide + 2
s = pointIdToSideId[newTriangles[s_next_s(s)]]
}
return &delaunay.Triangulation{
Triangles: newTriangles,
Halfedges: newHalfedges,
}
}
// stereographicProjection converts 3d coordinates into two dimensions.
func stereographicProjection(r_xyz []float64) []float64 {
// See <https://en.wikipedia.org/wiki/Stereographic_projection>
numPoints := len(r_xyz) / 3
var r_XY []float64
for r := 0; r < numPoints; r++ {
x := r_xyz[3*r]
y := r_xyz[3*r+1]
z := r_xyz[3*r+2]
X := x / (1 - z)
Y := y / (1 - z)
r_XY = append(r_XY, X, Y)
}
return r_XY
}
type SphereMesh struct {
mesh *TriangleMesh
r_xyz []float64
r_latLon [][2]float64
}
func MakeSphere(seed int64, numPoints int, jitter float64) (*SphereMesh, error) {
latlong := generateFibonacciSphere(seed, numPoints, jitter)
var r_xyz []float64
var r_latLon [][2]float64
for r := 0; r < len(latlong); r += 2 {
// HACKY! Fix this properly!
nla, nlo := latLonFromVec3(convToVec3(latLonToCartesian(latlong[r], latlong[r+1])).Normalize(), 1.0)
r_latLon = append(r_latLon, [2]float64{nla, nlo})
r_xyz = pushCartesianFromSpherical(r_xyz, latlong[r], latlong[r+1])
}
xy := stereographicProjection(r_xyz)
var pts []delaunay.Point
for i := 0; i < len(xy); i += 2 {
pts = append(pts, delaunay.Point{X: xy[i], Y: xy[i+1]})
}
tri, err := delaunay.Triangulate(pts)
if err != nil {
return nil, err
}
// TODO: rotate an existing point into this spot instead of creating one.
r_xyz = append(r_xyz, 0, 0, 1)
r_latLon = append(r_latLon, [2]float64{-90.0, 45.0})
tri = addSouthPoleToMesh((len(r_xyz)/3)-1, tri)
mesh := NewTriangleMesh(0, len(tri.Triangles), make([]Vertex, numPoints+1), tri.Triangles, tri.Halfedges)
return &SphereMesh{
mesh: mesh,
r_xyz: r_xyz,
r_latLon: r_latLon,
}, nil
} | genworldvoronoi/sphere_mesh.go | 0.841403 | 0.48749 | sphere_mesh.go | starcoder |
package main
import "fmt"
// An interface that has a single method, Invert
type Inverter interface {
Invert()
}
// Type TwoDPoint implements the Inverter interface
type TwoDPoint struct {
X, Y float64
}
// Implicit implementation of the Inverter interface
func (tdp *TwoDPoint) Invert() {
tdp.X = -tdp.X
tdp.Y = -tdp.Y
}
// Type OneDPoint implements the Inverter interface
type OneDPoint struct {
X float64
}
// Implicit implementation of the Inverter interface
func (odp *OneDPoint) Invert() {
odp.X = -odp.X
}
func main() {
// Create Inverter, TwoDPoint and OneDPoint variables
var i1, i2 Inverter
p1 := TwoDPoint{1, 2}
p2 := OneDPoint{3}
i1 = &p1 // Only *TwoDPoint implements Inverter, not TwoDPoint
i2 = &p2 // Only *OneDPoint implements Inverter, not OneDPoint
i1.Invert()
i2.Invert()
fmt.Println("*TwoDPoint type var p1 implements Inverter:", i1)
fmt.Println("*OneDPoint type var mf1 implements Inverter:", i2)
// Check interface values and types
fmt.Printf("Value and type of i1 interface: (%v, %T)\n", i1, i1)
fmt.Printf("Value and type of i2 interface: (%v, %T)\n", i2, i2)
// Interface with nil value
var (
i3 Inverter
p3 *TwoDPoint
)
i3 = p3
fmt.Printf("Value and type of i3 interface: (%v, %T)\n", i3, i3)
// Nil interface
var i4 Inverter
fmt.Printf("Value and type of i4 interface: (%v, %T)\n", i4, i4)
// Calling Invert on i4 causes run-time error: i4 doesn't have a type
// i4.Invert()
// Empty interface
var i5 interface{}
fmt.Printf("Value and type of i5 interface: (%v, %T)\n", i5, i5)
i5 = "hi"
fmt.Printf("Value and type of i5 interface: (%v, %T)\n", i5, i5)
i5 = 5
fmt.Printf("Value and type of i5 interface: (%v, %T)\n", i5, i5)
// Type assertions
var i6 interface{} = 88.88
t, ok := i6.(float64) // ok can be omitted, can be written t := i6.(float64)
if ok {
fmt.Printf("Type assertion passed: i6 (%v, %T)\n", t, i6)
}
// The following line triggers a panic
// t1 := i6.(string)
// Type switch
switch v := i6.(type) {
case int:
fmt.Printf("INT! i6 is of type %T with value %v\n", v, v)
case float64:
fmt.Printf("FLOAT64! i6 is of type %T with value %v\n", v, v)
default:
fmt.Printf("DEFAULT CASE! i6 is of type %T!\n", v)
}
} | go-code-examples/methods-interfaces/interfaces/interfaces.go | 0.644001 | 0.51013 | interfaces.go | starcoder |
package otkafka
import (
"time"
"github.com/go-kit/kit/metrics"
"github.com/segmentio/kafka-go"
)
type writerCollector struct {
factory WriterFactory
stats *WriterStats
interval time.Duration
}
// WriterStats is a collection of metrics for kafka writer info.
type WriterStats struct {
Writes metrics.Counter
Messages metrics.Counter
Bytes metrics.Counter
Errors metrics.Counter
MaxAttempts metrics.Gauge
MaxBatchSize metrics.Gauge
BatchTimeout metrics.Gauge
ReadTimeout metrics.Gauge
WriteTimeout metrics.Gauge
RequiredAcks metrics.Gauge
Async metrics.Gauge
BatchTime ThreeStats
WriteTime ThreeStats
WaitTime ThreeStats
Retries ThreeStats
BatchSize ThreeStats
BatchBytes ThreeStats
}
// newCollector creates a new kafka writer wrapper containing the name of the reader.
func newWriterCollector(factory WriterFactory, stats *WriterStats, interval time.Duration) *writerCollector {
return &writerCollector{
factory: factory,
stats: stats,
interval: interval,
}
}
// collectConnectionStats collects kafka writer info for Prometheus to scrape.
func (d *writerCollector) collectConnectionStats() {
for k, v := range d.factory.List() {
writer := v.Conn.(*kafka.Writer)
stats := writer.Stats()
withValues := []string{"writer", k, "topic", stats.Topic}
d.stats.Writes.With(withValues...).Add(float64(stats.Writes))
d.stats.Messages.With(withValues...).Add(float64(stats.Messages))
d.stats.Bytes.With(withValues...).Add(float64(stats.Bytes))
d.stats.Errors.With(withValues...).Add(float64(stats.Errors))
d.stats.BatchTime.Min.With(withValues...).Add(stats.BatchTime.Min.Seconds())
d.stats.BatchTime.Max.With(withValues...).Add(stats.BatchTime.Max.Seconds())
d.stats.BatchTime.Avg.With(withValues...).Add(stats.BatchTime.Avg.Seconds())
d.stats.WriteTime.Min.With(withValues...).Add(stats.WriteTime.Min.Seconds())
d.stats.WriteTime.Max.With(withValues...).Add(stats.WriteTime.Max.Seconds())
d.stats.WriteTime.Avg.With(withValues...).Add(stats.WriteTime.Avg.Seconds())
d.stats.WaitTime.Min.With(withValues...).Add(stats.WaitTime.Min.Seconds())
d.stats.WaitTime.Max.With(withValues...).Add(stats.WaitTime.Max.Seconds())
d.stats.WaitTime.Avg.With(withValues...).Add(stats.WaitTime.Avg.Seconds())
d.stats.Retries.Min.With(withValues...).Add(float64(stats.Retries.Min))
d.stats.Retries.Max.With(withValues...).Add(float64(stats.Retries.Max))
d.stats.Retries.Avg.With(withValues...).Add(float64(stats.Retries.Avg))
d.stats.BatchSize.Min.With(withValues...).Add(float64(stats.BatchSize.Min))
d.stats.BatchSize.Max.With(withValues...).Add(float64(stats.BatchSize.Max))
d.stats.BatchSize.Avg.With(withValues...).Add(float64(stats.BatchSize.Avg))
d.stats.BatchBytes.Min.With(withValues...).Add(float64(stats.BatchBytes.Min))
d.stats.BatchBytes.Max.With(withValues...).Add(float64(stats.BatchBytes.Max))
d.stats.BatchBytes.Avg.With(withValues...).Add(float64(stats.BatchBytes.Avg))
d.stats.MaxAttempts.With(withValues...).Set(float64(stats.MaxAttempts))
d.stats.MaxBatchSize.With(withValues...).Set(float64(stats.MaxBatchSize))
d.stats.BatchTimeout.With(withValues...).Set(stats.BatchTimeout.Seconds())
d.stats.ReadTimeout.With(withValues...).Set(stats.ReadTimeout.Seconds())
d.stats.WriteTimeout.With(withValues...).Set(stats.WriteTimeout.Seconds())
d.stats.RequiredAcks.With(withValues...).Set(float64(stats.RequiredAcks))
var async float64
if stats.Async {
async = 1.0
}
d.stats.Async.With(withValues...).Set(async)
}
} | otkafka/writer_metrics.go | 0.54359 | 0.441553 | writer_metrics.go | starcoder |
package renderer
import (
"strings"
"github.com/stackrox/rox/pkg/features"
"github.com/stackrox/rox/pkg/images/defaults"
"github.com/stackrox/rox/pkg/stringutils"
)
// ComputeImageOverrides takes in a full image reference as well as default registries, names,
// and tags, and computes the components of the image which are different. I.e., if
// `fullImageRef` is `<defRegistry>/<defName>:<defTag>`, an empty map is returned; if, for
// example, only the tag is different, a map containing only the non-default "Tag" is returned
// etc.
func ComputeImageOverrides(fullImageRef, defRegistry, defName, defTag string) map[string]string {
var remoteAndRepo, tag string
// See the goal of the override computation explained in the `configureImageOverrides`
// comment below. This somewhat creative approach is one of the reasons why we are not
// directly using the existing image ref parsing functions above. Another reason is
// avoiding validation and parsing failures. See grammar definition at
// https://github.com/docker/distribution/blob/master/reference/reference.go.
// Cut off digest because it contains ':' and hence can interfere with tag detection.
noDigestImageRef, digest := stringutils.Split2(fullImageRef, "@")
// If present, port's ':' and tag's ':' are always separated by at least one '/'.
parts := strings.SplitN(noDigestImageRef, "/", 2)
parts[len(parts)-1], tag = stringutils.Split2(parts[len(parts)-1], ":")
remoteAndRepo = strings.Join(parts, "/")
if digest != "" {
tag += "@" + digest
}
overrides := map[string]string{}
if tag == "" {
tag = "latest"
}
if tag != defTag {
overrides["Tag"] = tag
}
if stringutils.ConsumeSuffix(&remoteAndRepo, "/"+defName) {
if remoteAndRepo != defRegistry {
overrides["Registry"] = remoteAndRepo
}
} else if stringutils.ConsumePrefix(&remoteAndRepo, defRegistry+"/") {
overrides["Name"] = remoteAndRepo
} else {
registry, name := stringutils.Split2Last(remoteAndRepo, "/")
overrides["Registry"] = registry
overrides["Name"] = name
}
if len(overrides) == 0 {
return nil
}
return overrides
}
// configureImageOverrides sets the `c.K8sConfig.ImageOverrides` property based on the actually
// configured images as well as the default image values.
// The terms "registry" and "image name" in the configuration are used in a less than strict
// fashion, and the goal is to arrive at a configuration that appears natural and minimizes
// repetitions.
// For example, if the central and scanner images are `docker.io/stackrox/main` and
// `docker.io/stackrox/scanner`, the inferred "registry" is `docker.io/stackrox`, and no image
// name overrides need to be inferred. However, if the images are `us.gcr.io/stackrox-main/my-main`
// and `us.gcr.io/stackrox-scanner/my-scanner`, the "registry" is `us.gcr.io`, and the image name
// overrides are `stackrox-main/my-main` and `stackrox-scanner/my-scanner` respectively (since the
// names have to be overridden anyway). If, on the other hand, the images are
// `us.gcr.io/stackrox-main/main` and `us.gcr.io/stackrox-scanner/scanner`, no name overrides are
// inferred, and instead the inferred central and scanner "registries" are
// `us.gcr.io/stackrox-main` and `us.gcr.io/stackrox-scanner`.
func configureImageOverrides(c *Config, imageFlavor defaults.ImageFlavor) {
imageOverrides := make(map[string]interface{})
mainOverrides := ComputeImageOverrides(c.K8sConfig.MainImage, imageFlavor.MainRegistry, imageFlavor.MainImageName,
imageFlavor.MainImageTag)
registry := mainOverrides["Registry"]
if registry == "" {
registry = imageFlavor.MainRegistry
} else {
imageOverrides["MainRegistry"] = registry
delete(mainOverrides, "Registry")
}
imageOverrides["Main"] = mainOverrides
if features.PostgresDatastore.Enabled() {
imageOverrides["CentralDB"] = ComputeImageOverrides(c.K8sConfig.CentralDBImage, registry, imageFlavor.CentralDBImageName,
imageFlavor.CentralDBImageTag)
}
imageOverrides["Scanner"] = ComputeImageOverrides(c.K8sConfig.ScannerImage, registry, imageFlavor.ScannerImageName,
imageFlavor.ScannerImageTag)
imageOverrides["ScannerDB"] = ComputeImageOverrides(c.K8sConfig.ScannerDBImage, registry, imageFlavor.ScannerDBImageName,
imageFlavor.ScannerImageTag)
c.K8sConfig.ImageOverrides = imageOverrides
} | pkg/renderer/images.go | 0.720958 | 0.438845 | images.go | starcoder |
package main
import (
"github.com/ReconfigureIO/fixed"
"github.com/ReconfigureIO/math/rand"
)
// Ret is our return structure, which is the output of our mapper.
// In order to simplify the implementation, we'll just calculate the
// sum FPGA side, and divide by length to get the mean on the CPU. A
// more robust implementation would use a streaming mean algorithm.
type Ret struct {
avg fixed.Int26_6 // Our running avg. Note that we'll divide this by length CPU side
zero_trials uint32 // The number of zero trials we got
}
// RetInit provides the intiial value for Ret.
// In abstract algebra, this would be the identity element of the monoid
func RetInit() Ret {
return Ret{avg: 0, zero_trials: 0}
}
// Payoff joins two Rets into a single Ret by addition.
// In abstract algebra, this would be the binary operation of the monoid
func Payoff(a Ret, b Ret) Ret {
return Ret{
avg: a.avg + b.avg,
zero_trials: a.zero_trials + b.zero_trials,
}
}
// Serialize takes our stream of Ret and produces a stream of uint32s
func Serialize(inputChan <-chan Ret, outputChan chan<- uint32) {
for {
ret := <-inputChan
outputChan <- uint32(ret.avg)
outputChan <- uint32(ret.zero_trials)
}
}
// Param is the input structure to our mapper.
// It represents all the parameters to our simulation.
type Param struct {
s0 fixed.Int26_6 // The initial price
drift fixed.Int26_6 // Daily drift term
volatility fixed.Int26_6 // Daily volatility
k fixed.Int26_6 // Strike price
days uint32 // number of days to simulate
}
// Deserialize takes our stream of uint32s and produces a stream of Params
func Deserialize(inputChan <-chan uint32, outputChan chan<- Param) {
for {
ps := [5]uint32{}
for i := 0; i < 5; i++ {
ps[i] = <-inputChan
}
outputChan <- Param{
s0: fixed.Int26_6(ps[0]),
drift: fixed.Int26_6(ps[1]),
volatility: fixed.Int26_6(ps[2]),
k: fixed.Int26_6(ps[3]),
days: ps[4],
}
}
}
// Rands takes our initial seed, and produces a stream of normally distributed random numbers.
func Rands(seed uint32, out chan<- fixed.Int26_6) {
r := rand.New(seed)
r.Normals(out)
}
// Sim takes a stream of rands, and a Param, and runs the specified simulation.
func Sim(rands <-chan fixed.Int26_6, p Param) Ret {
// An iterative model, calculates some integral over 'period'
// We'll split our pipeline a bit for more parallelism.
intermediates := make(chan fixed.Int26_6, 1)
go func() {
// explanation of + 1 following
d := p.drift + fixed.I26(1)
v := p.volatility
for i := uint16(p.days); i != 0; i-- {
W := <-rands
// The original formulation of this is as follows
// s0 = s0 + d.Mul(s0) + W.Mul(v.Mul(s0))
// we can factor out s0 to give the following
// s0 = s0.Mul(1 + d + W.Mul(v))
// 1 + d is constant, so refactor out
// hence the following
// We'll separate out the m aggregator
// on s0 in the next for loop.
intermediates <- d + W.Mul(v)
}
}()
s0 := p.s0
for i := uint16(p.days); i != 0; i-- {
interm := <-intermediates
// Aggregate all the `s0 *= intermediate` operations here
s0 = s0.Mul(interm)
}
k := p.k
var ret Ret
if s0 > k {
// The multiplication with exp(-r/t_*days) to be calculated by the host
ret = Ret{avg: s0 - k}
} else {
ret = Ret{zero_trials: 1}
}
return ret
}
// BenchmarkSim is to show an example usage.
func BenchmarkSim(n uint32) {
rs := make(chan fixed.Int26_6, 1)
go Rands(42, rs)
Sim(rs, Param{days: n})
} | examples/monte-carlo/input.go | 0.663124 | 0.701956 | input.go | starcoder |
package keeper
import (
"fmt"
sdk "github.com/cosmos/cosmos-sdk/types"
"github.com/kava-labs/kava/x/incentive/types"
)
// AccumulateHardDelegatorRewards updates the rewards accumulated for the input reward period
func (k Keeper) AccumulateHardDelegatorRewards(ctx sdk.Context, rewardPeriod types.RewardPeriod) error {
previousAccrualTime, found := k.GetPreviousHardDelegatorRewardAccrualTime(ctx, rewardPeriod.CollateralType)
if !found {
k.SetPreviousHardDelegatorRewardAccrualTime(ctx, rewardPeriod.CollateralType, ctx.BlockTime())
return nil
}
timeElapsed := CalculateTimeElapsed(rewardPeriod.Start, rewardPeriod.End, ctx.BlockTime(), previousAccrualTime)
if timeElapsed.IsZero() {
return nil
}
if rewardPeriod.RewardsPerSecond.Amount.IsZero() {
k.SetPreviousHardDelegatorRewardAccrualTime(ctx, rewardPeriod.CollateralType, ctx.BlockTime())
return nil
}
totalBonded := k.stakingKeeper.TotalBondedTokens(ctx).ToDec()
if totalBonded.IsZero() {
k.SetPreviousHardDelegatorRewardAccrualTime(ctx, rewardPeriod.CollateralType, ctx.BlockTime())
return nil
}
newRewards := timeElapsed.Mul(rewardPeriod.RewardsPerSecond.Amount)
rewardFactor := newRewards.ToDec().Quo(totalBonded)
previousRewardFactor, found := k.GetHardDelegatorRewardFactor(ctx, rewardPeriod.CollateralType)
if !found {
previousRewardFactor = sdk.ZeroDec()
}
newRewardFactor := previousRewardFactor.Add(rewardFactor)
k.SetHardDelegatorRewardFactor(ctx, rewardPeriod.CollateralType, newRewardFactor)
k.SetPreviousHardDelegatorRewardAccrualTime(ctx, rewardPeriod.CollateralType, ctx.BlockTime())
return nil
}
// InitializeHardDelegatorReward initializes the delegator reward index of a hard claim
func (k Keeper) InitializeHardDelegatorReward(ctx sdk.Context, delegator sdk.AccAddress) {
delegatorFactor, foundDelegatorFactor := k.GetHardDelegatorRewardFactor(ctx, types.BondDenom)
if !foundDelegatorFactor { // Should always be found...
delegatorFactor = sdk.ZeroDec()
}
delegatorRewardIndexes := types.NewRewardIndex(types.BondDenom, delegatorFactor)
claim, found := k.GetHardLiquidityProviderClaim(ctx, delegator)
if !found {
// Instantiate claim object
claim = types.NewHardLiquidityProviderClaim(delegator, sdk.Coins{}, nil, nil, nil)
} else {
k.SynchronizeHardDelegatorRewards(ctx, delegator, nil, false)
claim, _ = k.GetHardLiquidityProviderClaim(ctx, delegator)
}
claim.DelegatorRewardIndexes = types.RewardIndexes{delegatorRewardIndexes}
k.SetHardLiquidityProviderClaim(ctx, claim)
}
// SynchronizeHardDelegatorRewards updates the claim object by adding any accumulated rewards, and setting the reward indexes to the global values.
// valAddr and shouldIncludeValidator are used to ignore or include delegations to a particular validator when summing up the total delegation.
// Normally only delegations to Bonded validators are included in the total. This is needed as staking hooks are sometimes called on the wrong side of a validator's state update (from this module's perspective).
func (k Keeper) SynchronizeHardDelegatorRewards(ctx sdk.Context, delegator sdk.AccAddress, valAddr sdk.ValAddress, shouldIncludeValidator bool) {
claim, found := k.GetHardLiquidityProviderClaim(ctx, delegator)
if !found {
return
}
delagatorFactor, found := k.GetHardDelegatorRewardFactor(ctx, types.BondDenom)
if !found {
return
}
delegatorIndex, hasDelegatorRewardIndex := claim.HasDelegatorRewardIndex(types.BondDenom)
if !hasDelegatorRewardIndex {
return
}
userRewardFactor := claim.DelegatorRewardIndexes[delegatorIndex].RewardFactor
rewardsAccumulatedFactor := delagatorFactor.Sub(userRewardFactor)
if rewardsAccumulatedFactor.IsNegative() {
panic(fmt.Sprintf("reward accumulation factor cannot be negative: %s", rewardsAccumulatedFactor))
}
claim.DelegatorRewardIndexes[delegatorIndex].RewardFactor = delagatorFactor
totalDelegated := sdk.ZeroDec()
delegations := k.stakingKeeper.GetDelegatorDelegations(ctx, delegator, 200)
for _, delegation := range delegations {
validator, found := k.stakingKeeper.GetValidator(ctx, delegation.GetValidatorAddr())
if !found {
continue
}
if valAddr == nil {
// Delegators don't accumulate rewards if their validator is unbonded
if validator.GetStatus() != sdk.Bonded {
continue
}
} else {
if !shouldIncludeValidator && validator.OperatorAddress.Equals(valAddr) {
// ignore tokens delegated to the validator
continue
}
}
if validator.GetTokens().IsZero() {
continue
}
delegatedTokens := validator.TokensFromShares(delegation.GetShares())
if delegatedTokens.IsNegative() {
continue
}
totalDelegated = totalDelegated.Add(delegatedTokens)
}
rewardsEarned := rewardsAccumulatedFactor.Mul(totalDelegated).RoundInt()
// Add rewards to delegator's hard claim
newRewardsCoin := sdk.NewCoin(types.HardLiquidityRewardDenom, rewardsEarned)
claim.Reward = claim.Reward.Add(newRewardsCoin)
k.SetHardLiquidityProviderClaim(ctx, claim)
} | x/incentive/keeper/rewards_delegator.go | 0.733547 | 0.422088 | rewards_delegator.go | starcoder |
package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
type tile struct {
x, y int
}
func (t tile) String() string {
return strconv.Itoa(t.x) + "," + strconv.Itoa(t.y)
}
const (
black bool = true
white bool = false
e string = "e"
ne string = "ne"
se string = "se"
w string = "w"
sw string = "sw"
nw string = "nw"
)
var directions = []string{e, ne, se, w, sw, nw}
var dirs = map[string]tile{
e: {x: 2, y: 0},
ne: {x: 1, y: 1},
se: {x: 1, y: -1},
w: {x: -2, y: 0},
sw: {x: -1, y: -1},
nw: {x: -1, y: 1},
}
func toPosition(position string) tile {
coord := strings.Split(position, ",")
x, _ := strconv.Atoi(coord[0])
y, _ := strconv.Atoi(coord[1])
return tile{x, y}
}
func dailyFlip(tiles map[string]bool) map[string]bool {
var blackNeighbours = map[string]int{}
for pos, color := range tiles {
if color == black {
pTile := toPosition(pos)
for _, d := range dirs {
t := tile{pTile.x + d.x, pTile.y + d.y}
blackNeighbours[t.String()]++
}
}
}
var newBlackTiles = map[string]bool{}
for pos, count := range blackNeighbours {
if (tiles[pos] == black && !(count == 0 || count > 2)) || (tiles[pos] == white && count == 2) {
newBlackTiles[pos] = black
}
}
return newBlackTiles
}
func processDays(tiles map[string]bool, days int) {
result := 0
for _, color := range tiles {
if color == black {
result++
}
}
fmt.Printf("Number of black tiles (1): %d\n", result)
for day := 0; day < days; day++ {
result = 0
tiles = dailyFlip(tiles)
for _, color := range tiles {
if color == black {
result++
}
}
}
fmt.Printf("Number of black tiles in day %d (2): %d\n", days, result)
}
func main() {
file, _ := os.Open("input.txt")
defer file.Close()
scanner := bufio.NewScanner(file)
var tiles = map[string]bool{}
for scanner.Scan() {
rule := scanner.Text()
pTile := tile{0, 0}
for rule != "" {
for _, d := range directions {
if strings.HasPrefix(rule, d) {
pTile.x += dirs[d].x
pTile.y += dirs[d].y
if len(rule) == len(d) {
tiles[pTile.String()] = !tiles[pTile.String()]
}
rule = rule[len(d):]
}
}
}
}
processDays(tiles, 100)
} | day_24/main.go | 0.502197 | 0.407392 | main.go | starcoder |
package timestore
import (
"sort"
"time"
)
type BoolSamples struct {
times []time.Time
data []bool
}
func (s *BoolSamples) Len() int {
return len(s.data)
}
func (s *BoolSamples) All() ([]bool, []time.Time) {
return s.data, s.times
}
func (s *BoolSamples) Add(t time.Time, data bool) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]bool{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]bool{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *BoolSamples) ClosestAfter(t time.Time) (bool, time.Time) {
// Nil value for unable to find
var v bool
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *BoolSamples) ClosestBefore(t time.Time) (bool, time.Time) {
// Nil value for unable to find
var v bool
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *BoolSamples) AllAfter(t time.Time) ([]bool, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []bool{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *BoolSamples) AllBefore(t time.Time) ([]bool, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []bool{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewBoolBinary() *BoolSamples {
return &BoolSamples{
times: []time.Time{},
data: []bool{},
}
}
type ByteSamples struct {
times []time.Time
data []byte
}
func (s *ByteSamples) Len() int {
return len(s.data)
}
func (s *ByteSamples) All() ([]byte, []time.Time) {
return s.data, s.times
}
func (s *ByteSamples) Add(t time.Time, data byte) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]byte{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]byte{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *ByteSamples) ClosestAfter(t time.Time) (byte, time.Time) {
// Nil value for unable to find
var v byte
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *ByteSamples) ClosestBefore(t time.Time) (byte, time.Time) {
// Nil value for unable to find
var v byte
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *ByteSamples) AllAfter(t time.Time) ([]byte, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []byte{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *ByteSamples) AllBefore(t time.Time) ([]byte, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []byte{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewByteBinary() *ByteSamples {
return &ByteSamples{
times: []time.Time{},
data: []byte{},
}
}
type Complex128Samples struct {
times []time.Time
data []complex128
}
func (s *Complex128Samples) Len() int {
return len(s.data)
}
func (s *Complex128Samples) All() ([]complex128, []time.Time) {
return s.data, s.times
}
func (s *Complex128Samples) Add(t time.Time, data complex128) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]complex128{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]complex128{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Complex128Samples) ClosestAfter(t time.Time) (complex128, time.Time) {
// Nil value for unable to find
var v complex128
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Complex128Samples) ClosestBefore(t time.Time) (complex128, time.Time) {
// Nil value for unable to find
var v complex128
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Complex128Samples) AllAfter(t time.Time) ([]complex128, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []complex128{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Complex128Samples) AllBefore(t time.Time) ([]complex128, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []complex128{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewComplex128Binary() *Complex128Samples {
return &Complex128Samples{
times: []time.Time{},
data: []complex128{},
}
}
type Complex64Samples struct {
times []time.Time
data []complex64
}
func (s *Complex64Samples) Len() int {
return len(s.data)
}
func (s *Complex64Samples) All() ([]complex64, []time.Time) {
return s.data, s.times
}
func (s *Complex64Samples) Add(t time.Time, data complex64) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]complex64{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]complex64{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Complex64Samples) ClosestAfter(t time.Time) (complex64, time.Time) {
// Nil value for unable to find
var v complex64
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Complex64Samples) ClosestBefore(t time.Time) (complex64, time.Time) {
// Nil value for unable to find
var v complex64
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Complex64Samples) AllAfter(t time.Time) ([]complex64, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []complex64{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Complex64Samples) AllBefore(t time.Time) ([]complex64, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []complex64{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewComplex64Binary() *Complex64Samples {
return &Complex64Samples{
times: []time.Time{},
data: []complex64{},
}
}
type ErrorSamples struct {
times []time.Time
data []error
}
func (s *ErrorSamples) Len() int {
return len(s.data)
}
func (s *ErrorSamples) All() ([]error, []time.Time) {
return s.data, s.times
}
func (s *ErrorSamples) Add(t time.Time, data error) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]error{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]error{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *ErrorSamples) ClosestAfter(t time.Time) (error, time.Time) {
// Nil value for unable to find
var v error
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *ErrorSamples) ClosestBefore(t time.Time) (error, time.Time) {
// Nil value for unable to find
var v error
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *ErrorSamples) AllAfter(t time.Time) ([]error, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []error{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *ErrorSamples) AllBefore(t time.Time) ([]error, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []error{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewErrorBinary() *ErrorSamples {
return &ErrorSamples{
times: []time.Time{},
data: []error{},
}
}
type Float32Samples struct {
times []time.Time
data []float32
}
func (s *Float32Samples) Len() int {
return len(s.data)
}
func (s *Float32Samples) All() ([]float32, []time.Time) {
return s.data, s.times
}
func (s *Float32Samples) Add(t time.Time, data float32) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]float32{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]float32{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Float32Samples) ClosestAfter(t time.Time) (float32, time.Time) {
// Nil value for unable to find
var v float32
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Float32Samples) ClosestBefore(t time.Time) (float32, time.Time) {
// Nil value for unable to find
var v float32
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Float32Samples) AllAfter(t time.Time) ([]float32, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []float32{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Float32Samples) AllBefore(t time.Time) ([]float32, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []float32{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewFloat32Binary() *Float32Samples {
return &Float32Samples{
times: []time.Time{},
data: []float32{},
}
}
type Float64Samples struct {
times []time.Time
data []float64
}
func (s *Float64Samples) Len() int {
return len(s.data)
}
func (s *Float64Samples) All() ([]float64, []time.Time) {
return s.data, s.times
}
func (s *Float64Samples) Add(t time.Time, data float64) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]float64{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]float64{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Float64Samples) ClosestAfter(t time.Time) (float64, time.Time) {
// Nil value for unable to find
var v float64
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Float64Samples) ClosestBefore(t time.Time) (float64, time.Time) {
// Nil value for unable to find
var v float64
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Float64Samples) AllAfter(t time.Time) ([]float64, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []float64{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Float64Samples) AllBefore(t time.Time) ([]float64, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []float64{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewFloat64Binary() *Float64Samples {
return &Float64Samples{
times: []time.Time{},
data: []float64{},
}
}
type IntSamples struct {
times []time.Time
data []int
}
func (s *IntSamples) Len() int {
return len(s.data)
}
func (s *IntSamples) All() ([]int, []time.Time) {
return s.data, s.times
}
func (s *IntSamples) Add(t time.Time, data int) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]int{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]int{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *IntSamples) ClosestAfter(t time.Time) (int, time.Time) {
// Nil value for unable to find
var v int
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *IntSamples) ClosestBefore(t time.Time) (int, time.Time) {
// Nil value for unable to find
var v int
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *IntSamples) AllAfter(t time.Time) ([]int, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []int{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *IntSamples) AllBefore(t time.Time) ([]int, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []int{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewIntBinary() *IntSamples {
return &IntSamples{
times: []time.Time{},
data: []int{},
}
}
type Int16Samples struct {
times []time.Time
data []int16
}
func (s *Int16Samples) Len() int {
return len(s.data)
}
func (s *Int16Samples) All() ([]int16, []time.Time) {
return s.data, s.times
}
func (s *Int16Samples) Add(t time.Time, data int16) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]int16{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]int16{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Int16Samples) ClosestAfter(t time.Time) (int16, time.Time) {
// Nil value for unable to find
var v int16
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int16Samples) ClosestBefore(t time.Time) (int16, time.Time) {
// Nil value for unable to find
var v int16
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int16Samples) AllAfter(t time.Time) ([]int16, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []int16{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Int16Samples) AllBefore(t time.Time) ([]int16, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []int16{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewInt16Binary() *Int16Samples {
return &Int16Samples{
times: []time.Time{},
data: []int16{},
}
}
type Int32Samples struct {
times []time.Time
data []int32
}
func (s *Int32Samples) Len() int {
return len(s.data)
}
func (s *Int32Samples) All() ([]int32, []time.Time) {
return s.data, s.times
}
func (s *Int32Samples) Add(t time.Time, data int32) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]int32{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]int32{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Int32Samples) ClosestAfter(t time.Time) (int32, time.Time) {
// Nil value for unable to find
var v int32
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int32Samples) ClosestBefore(t time.Time) (int32, time.Time) {
// Nil value for unable to find
var v int32
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int32Samples) AllAfter(t time.Time) ([]int32, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []int32{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Int32Samples) AllBefore(t time.Time) ([]int32, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []int32{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewInt32Binary() *Int32Samples {
return &Int32Samples{
times: []time.Time{},
data: []int32{},
}
}
type Int64Samples struct {
times []time.Time
data []int64
}
func (s *Int64Samples) Len() int {
return len(s.data)
}
func (s *Int64Samples) All() ([]int64, []time.Time) {
return s.data, s.times
}
func (s *Int64Samples) Add(t time.Time, data int64) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]int64{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]int64{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Int64Samples) ClosestAfter(t time.Time) (int64, time.Time) {
// Nil value for unable to find
var v int64
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int64Samples) ClosestBefore(t time.Time) (int64, time.Time) {
// Nil value for unable to find
var v int64
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int64Samples) AllAfter(t time.Time) ([]int64, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []int64{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Int64Samples) AllBefore(t time.Time) ([]int64, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []int64{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewInt64Binary() *Int64Samples {
return &Int64Samples{
times: []time.Time{},
data: []int64{},
}
}
type Int8Samples struct {
times []time.Time
data []int8
}
func (s *Int8Samples) Len() int {
return len(s.data)
}
func (s *Int8Samples) All() ([]int8, []time.Time) {
return s.data, s.times
}
func (s *Int8Samples) Add(t time.Time, data int8) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]int8{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]int8{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Int8Samples) ClosestAfter(t time.Time) (int8, time.Time) {
// Nil value for unable to find
var v int8
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int8Samples) ClosestBefore(t time.Time) (int8, time.Time) {
// Nil value for unable to find
var v int8
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Int8Samples) AllAfter(t time.Time) ([]int8, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []int8{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Int8Samples) AllBefore(t time.Time) ([]int8, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []int8{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewInt8Binary() *Int8Samples {
return &Int8Samples{
times: []time.Time{},
data: []int8{},
}
}
type RuneSamples struct {
times []time.Time
data []rune
}
func (s *RuneSamples) Len() int {
return len(s.data)
}
func (s *RuneSamples) All() ([]rune, []time.Time) {
return s.data, s.times
}
func (s *RuneSamples) Add(t time.Time, data rune) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]rune{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]rune{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *RuneSamples) ClosestAfter(t time.Time) (rune, time.Time) {
// Nil value for unable to find
var v rune
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *RuneSamples) ClosestBefore(t time.Time) (rune, time.Time) {
// Nil value for unable to find
var v rune
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *RuneSamples) AllAfter(t time.Time) ([]rune, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []rune{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *RuneSamples) AllBefore(t time.Time) ([]rune, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []rune{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewRuneBinary() *RuneSamples {
return &RuneSamples{
times: []time.Time{},
data: []rune{},
}
}
type StringSamples struct {
times []time.Time
data []string
}
func (s *StringSamples) Len() int {
return len(s.data)
}
func (s *StringSamples) All() ([]string, []time.Time) {
return s.data, s.times
}
func (s *StringSamples) Add(t time.Time, data string) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]string{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]string{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *StringSamples) ClosestAfter(t time.Time) (string, time.Time) {
// Nil value for unable to find
var v string
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *StringSamples) ClosestBefore(t time.Time) (string, time.Time) {
// Nil value for unable to find
var v string
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *StringSamples) AllAfter(t time.Time) ([]string, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []string{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *StringSamples) AllBefore(t time.Time) ([]string, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []string{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewStringBinary() *StringSamples {
return &StringSamples{
times: []time.Time{},
data: []string{},
}
}
type UintSamples struct {
times []time.Time
data []uint
}
func (s *UintSamples) Len() int {
return len(s.data)
}
func (s *UintSamples) All() ([]uint, []time.Time) {
return s.data, s.times
}
func (s *UintSamples) Add(t time.Time, data uint) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]uint{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]uint{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *UintSamples) ClosestAfter(t time.Time) (uint, time.Time) {
// Nil value for unable to find
var v uint
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *UintSamples) ClosestBefore(t time.Time) (uint, time.Time) {
// Nil value for unable to find
var v uint
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *UintSamples) AllAfter(t time.Time) ([]uint, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []uint{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *UintSamples) AllBefore(t time.Time) ([]uint, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []uint{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewUintBinary() *UintSamples {
return &UintSamples{
times: []time.Time{},
data: []uint{},
}
}
type Uint16Samples struct {
times []time.Time
data []uint16
}
func (s *Uint16Samples) Len() int {
return len(s.data)
}
func (s *Uint16Samples) All() ([]uint16, []time.Time) {
return s.data, s.times
}
func (s *Uint16Samples) Add(t time.Time, data uint16) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]uint16{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]uint16{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Uint16Samples) ClosestAfter(t time.Time) (uint16, time.Time) {
// Nil value for unable to find
var v uint16
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint16Samples) ClosestBefore(t time.Time) (uint16, time.Time) {
// Nil value for unable to find
var v uint16
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint16Samples) AllAfter(t time.Time) ([]uint16, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []uint16{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Uint16Samples) AllBefore(t time.Time) ([]uint16, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []uint16{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewUint16Binary() *Uint16Samples {
return &Uint16Samples{
times: []time.Time{},
data: []uint16{},
}
}
type Uint32Samples struct {
times []time.Time
data []uint32
}
func (s *Uint32Samples) Len() int {
return len(s.data)
}
func (s *Uint32Samples) All() ([]uint32, []time.Time) {
return s.data, s.times
}
func (s *Uint32Samples) Add(t time.Time, data uint32) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]uint32{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]uint32{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Uint32Samples) ClosestAfter(t time.Time) (uint32, time.Time) {
// Nil value for unable to find
var v uint32
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint32Samples) ClosestBefore(t time.Time) (uint32, time.Time) {
// Nil value for unable to find
var v uint32
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint32Samples) AllAfter(t time.Time) ([]uint32, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []uint32{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Uint32Samples) AllBefore(t time.Time) ([]uint32, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []uint32{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewUint32Binary() *Uint32Samples {
return &Uint32Samples{
times: []time.Time{},
data: []uint32{},
}
}
type Uint64Samples struct {
times []time.Time
data []uint64
}
func (s *Uint64Samples) Len() int {
return len(s.data)
}
func (s *Uint64Samples) All() ([]uint64, []time.Time) {
return s.data, s.times
}
func (s *Uint64Samples) Add(t time.Time, data uint64) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]uint64{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]uint64{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Uint64Samples) ClosestAfter(t time.Time) (uint64, time.Time) {
// Nil value for unable to find
var v uint64
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint64Samples) ClosestBefore(t time.Time) (uint64, time.Time) {
// Nil value for unable to find
var v uint64
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint64Samples) AllAfter(t time.Time) ([]uint64, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []uint64{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Uint64Samples) AllBefore(t time.Time) ([]uint64, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []uint64{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewUint64Binary() *Uint64Samples {
return &Uint64Samples{
times: []time.Time{},
data: []uint64{},
}
}
type Uint8Samples struct {
times []time.Time
data []uint8
}
func (s *Uint8Samples) Len() int {
return len(s.data)
}
func (s *Uint8Samples) All() ([]uint8, []time.Time) {
return s.data, s.times
}
func (s *Uint8Samples) Add(t time.Time, data uint8) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]uint8{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]uint8{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *Uint8Samples) ClosestAfter(t time.Time) (uint8, time.Time) {
// Nil value for unable to find
var v uint8
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint8Samples) ClosestBefore(t time.Time) (uint8, time.Time) {
// Nil value for unable to find
var v uint8
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *Uint8Samples) AllAfter(t time.Time) ([]uint8, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []uint8{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *Uint8Samples) AllBefore(t time.Time) ([]uint8, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []uint8{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewUint8Binary() *Uint8Samples {
return &Uint8Samples{
times: []time.Time{},
data: []uint8{},
}
}
type UintptrSamples struct {
times []time.Time
data []uintptr
}
func (s *UintptrSamples) Len() int {
return len(s.data)
}
func (s *UintptrSamples) All() ([]uintptr, []time.Time) {
return s.data, s.times
}
func (s *UintptrSamples) Add(t time.Time, data uintptr) {
// If this is our first data point or the new latest, add to the end
if len(s.times) == 0 || s.times[len(s.times)-1].Before(t) {
s.data = append(s.data, data)
s.times = append(s.times, t)
return
}
// If this is before our earliest sample, add it to the start
if s.times[0].After(t) {
s.data = append([]uintptr{data}, s.data...)
s.times = append([]time.Time{t}, s.times...)
return
}
// Binary search
i := sort.Search(len(s.times)-1, func(i int) bool {
return s.times[i].After(t)
})
s.data = append(s.data[:i], append([]uintptr{data}, s.data[i:]...)...)
s.times = append(s.times[:i], append([]time.Time{t}, s.times[i:]...)...)
return
}
func (s *UintptrSamples) ClosestAfter(t time.Time) (uintptr, time.Time) {
// Nil value for unable to find
var v uintptr
i := indexAfter(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *UintptrSamples) ClosestBefore(t time.Time) (uintptr, time.Time) {
// Nil value for unable to find
var v uintptr
i := indexBefore(s.times, t)
if i < 0 {
return v, time.Time{}
}
return s.data[i], s.times[i]
}
func (s *UintptrSamples) AllAfter(t time.Time) ([]uintptr, []time.Time) {
i := indexAfter(s.times, t)
if i < 0 {
return []uintptr{}, []time.Time{}
}
return s.data[i:], s.times[i:]
}
func (s *UintptrSamples) AllBefore(t time.Time) ([]uintptr, []time.Time) {
i := indexBefore(s.times, t)
if i < 0 {
return []uintptr{}, []time.Time{}
}
return s.data[:i+1], s.times[:i+1]
}
func NewUintptrBinary() *UintptrSamples {
return &UintptrSamples{
times: []time.Time{},
data: []uintptr{},
}
} | generated-binary.go | 0.670716 | 0.461017 | generated-binary.go | starcoder |
package node
// Parse tree - a binary tree of objects of type Node,
// and associated utility functions and methods.
import (
"bytes"
"fmt"
"io"
"tableaux-in-go/src/lexer"
)
// Node has all elements exported, everything reaches inside instances
// of Node to find things out, or to change Left and Right. Private
// elements would cost me gross ol' getter and setter boilerplate.
type Node struct {
Op lexer.TokenType
Ident string
Left *Node
Right *Node
}
// NewOpNode creates interior nodes of a parse tree, which will
// all have a &, ~, |, >, = operator associated.
func NewOpNode(op lexer.TokenType) *Node {
return &Node{Op: op}
}
// NewIdentNode creates leaf nodes of a parse tree, which should all be
// lexer.IDENT identifier nodes.
func NewIdentNode(identifier string) *Node {
return &Node{
Op: lexer.IDENT,
Ident: identifier,
}
}
// Print puts a human-readable, nicely formatted string representation
// of a parse tree onto the io.Writer, w. Essentially just an in-order
// traversal of a binary tree, with accommodating a few oddities, like
// parenthesization, and the "~" (not) operator being a prefix.
func (p *Node) Print(w io.Writer) {
if p.Op == lexer.NOT {
fmt.Fprintf(w, "~")
}
if p.Left != nil {
printParen := false
if p.Left.Op != lexer.IDENT && p.Left.Op != lexer.NOT {
fmt.Fprintf(w, "(")
printParen = true
}
p.Left.Print(w)
if printParen {
fmt.Fprintf(w, ")")
}
}
var oper rune
switch p.Op {
case lexer.IMPLIES:
oper = '>'
case lexer.AND:
oper = '&'
case lexer.OR:
oper = '|'
case lexer.EQUIV:
oper = '='
}
if oper != 0 {
fmt.Fprintf(w, " %c ", oper)
}
if p.Op == lexer.IDENT {
fmt.Fprintf(w, "%s", p.Ident)
}
if p.Right != nil {
printParen := false
if p.Right.Op != lexer.IDENT && p.Right.Op != lexer.NOT {
fmt.Fprintf(w, "(")
printParen = true
}
p.Right.Print(w)
if printParen {
fmt.Fprintf(w, ")")
}
}
}
// ExpressionToString creates a Golang string with a human readable
// representation of a parse tree in it.
func ExpressionToString(root *Node) string {
var sb bytes.Buffer
root.Print(&sb)
return sb.String()
}
func (p *Node) graphNode(w io.Writer) {
var label string
switch p.Op {
case lexer.IDENT:
label = p.Ident
case lexer.IMPLIES:
label = ">"
case lexer.AND:
label = "&"
case lexer.OR:
label = "|"
case lexer.EQUIV:
label = "="
case lexer.NOT:
label = "~"
}
fmt.Fprintf(w, "n%p [label=\"%s\"];\n", p, label)
if p.Left != nil {
p.Left.graphNode(w)
fmt.Fprintf(w, "n%p -> n%p;\n", p, p.Left)
}
if p.Right != nil {
p.Right.graphNode(w)
fmt.Fprintf(w, "n%p -> n%p;\n", p, p.Right)
}
}
// GraphNode puts a dot-format text representation of
// a parse tree on w io.Writer.
func (p *Node) GraphNode(w io.Writer) {
fmt.Fprintf(w, "digraph g {\n")
p.graphNode(w)
fmt.Fprintf(w, "}\n")
} | src/node/node.go | 0.59514 | 0.428233 | node.go | starcoder |
package dataaccess
// FmtDef defines the format of a csv data file for a security.
type FmtDef struct {
delimiter string
header int
columns int
date string
time string
decimalDigits int
}
// Delimiter gets the delimiter of the csv file.
func (fd FmtDef) Delimiter() string {
return fd.delimiter
}
// Hdr gets the number of header rows in the csv file.
func (fd FmtDef) Hdr() int {
return fd.header
}
// Columns gets the number of columns in the csv file.
func (fd FmtDef) Columns() int {
return fd.columns
}
// Date gets the date format in the csv file's date column.
func (fd FmtDef) Date() string {
return fd.date
}
// Time gets the time format in the csv file's time column, if time column is not present, empty string is returned.
func (fd FmtDef) Time() string {
return fd.time
}
// DecimalDigits gets the number of decimal digits in the csv file's price fields.
func (fd FmtDef) DecimalDigits() int {
return fd.decimalDigits
}
// TargetDef defines the targets; source and destination of a csv data file for a security.
// If the file is source file the Dest field contains the ID of the file to be synched.
type TargetDef struct {
isSrc bool
dest string
}
// IsSrc gets if the csv file is source data file.
func (td TargetDef) IsSrc() bool {
return td.isSrc
}
// Dest gets the definition ID of the csv file to sync if this is sourcs data file definition; othewise, empty string is returned.
func (td TargetDef) Dest() string {
return td.dest
}
// FileDef defines a csv data file for a security.
type FileDef struct {
id string
kind string
timeFrame string
symbol string
name string
desc string
path string
target TargetDef
format FmtDef
}
// ID gets the definition ID of the csv file.
func (fd FileDef) ID() string {
return fd.id
}
// Kind gets the security kind, index or currency.
func (fd FileDef) Kind() string {
return fd.kind
}
// TimeFrame gets the data time frame; daily, 5/30/120 minutes and so on.
func (fd FileDef) TimeFrame() string {
return fd.timeFrame
}
// Symbol gets the security symbol.
func (fd FileDef) Symbol() string {
return fd.symbol
}
// Name gets the security name.
func (fd FileDef) Name() string {
return fd.name
}
// Desc gets the descrition about the security.
func (fd FileDef) Desc() string {
return fd.desc
}
// Path gets the path to the security csv data file.
func (fd FileDef) Path() string {
return fd.path
}
// Target gets the target definition of the csv data file.
func (fd FileDef) Target() TargetDef {
return fd.target
}
// Fmt gets the csv data file format definition.
func (fd FileDef) Fmt() FmtDef {
return fd.format
}
// FileDefs holds a map of file definitions.
type FileDefs struct {
defs map[string]FileDef
}
// Contains gets if an item with the specified ID is contained in the map.
func (fds FileDefs) Contains(defID string) bool {
_, ok := fds.defs[defID]
return ok
}
// Get gets the item associated to the specified ID; otherwise, false.
func (fds FileDefs) Get(defID string) (FileDef, bool) {
fd, ok := fds.defs[defID]
return fd, ok
}
// SrcDefs gets all the items that are source csv data files.
func (fds FileDefs) SrcDefs() []FileDef {
rv := make([]FileDef, 0, len(fds.defs))
for _, v := range fds.defs {
if v.Target().isSrc {
rv = append(rv, v)
}
}
return rv
}
func (fds FileDefs) add(fd FileDef) {
if id := fd.ID(); !fds.Contains(id) {
fds.defs[id] = fd
}
}
func createFileDefs() FileDefs {
return FileDefs{
defs: make(map[string]FileDef),
}
} | dataaccess/filedefs.go | 0.640861 | 0.569793 | filedefs.go | starcoder |
package geojson
import (
"encoding/json"
"errors"
"fmt"
"strconv"
)
// Position represents a longitude and latitude with optional elevation/altitude.
type Position struct {
Longitude float64
Latitude float64
Elevation OptionalFloat64
}
// NewPosition from longitude and latitude.
func NewPosition(long, lat float64) Position {
return Position{
Longitude: long,
Latitude: lat,
}
}
// NewPositionWithElevation from longitude, latitude and elevation.
func NewPositionWithElevation(long, lat, elevation float64) Position {
return Position{
Longitude: long,
Latitude: lat,
Elevation: NewOptionalFloat64(elevation),
}
}
// MarshalJSON returns the JSON encoding of the Position.
// The JSON encoding is an array of numbers with the longitude followed by the latitude, and optional elevation.
func (p *Position) MarshalJSON() ([]byte, error) {
if p.Elevation.IsSet() {
return json.Marshal(&position{
p.Longitude,
p.Latitude,
p.Elevation.Value(),
})
}
return json.Marshal(&position{
p.Longitude,
p.Latitude,
})
}
// UnmarshalJSON parses the JSON-encoded data and stores the results.
func (p *Position) UnmarshalJSON(data []byte) error {
pos := position{}
if err := json.Unmarshal(data, &pos); err != nil {
return err
}
switch len(pos) {
case 3:
p.Elevation = NewOptionalFloat64(pos[2])
fallthrough
case 2:
p.Longitude = pos[0]
p.Latitude = pos[1]
default:
return errors.New("invalid position")
}
return nil
}
func (p Position) String() string {
if p.Elevation.IsSet() {
return fmt.Sprintf("[%G, %G, %G]", p.Longitude, p.Latitude, p.Elevation.Value())
}
return fmt.Sprintf("[%G, %G]", p.Longitude, p.Latitude)
}
// OptionalFloat64 is a type that represents a float64 that can be optionally set.
type OptionalFloat64 struct {
value *float64
}
// NewOptionalFloat64 creates a new OptionalFloat64 set to the specified value.
func NewOptionalFloat64(val float64) OptionalFloat64 {
return OptionalFloat64{value: &val}
}
// Value returns the value. Should call this method if OptionalFloat64.IsSet() returns true.
func (o OptionalFloat64) Value() float64 {
return *o.value
}
// IsSet returns true if the value is set, and false if not.
func (o OptionalFloat64) IsSet() bool {
return o.value != nil
}
// Get the float64 value and whether or not it's set.
func (o OptionalFloat64) Get() (float64, bool) {
if o.value == nil {
return 0, false
}
return *o.value, true
}
func (o OptionalFloat64) String() string {
if o.IsSet() {
return strconv.FormatFloat(o.Value(), 'f', -1, 64)
}
return "{unset}"
}
type position []float64 | position.go | 0.916437 | 0.679069 | position.go | starcoder |
package proto
import (
"encoding/json"
"time"
)
// TimeSinceEpoch UTC time in seconds, counted from January 1, 1970.
// To convert a time.Time to TimeSinceEpoch, for example:
// proto.TimeSinceEpoch(time.Now().Unix())
// For session cookie, the value should be -1.
type TimeSinceEpoch float64
// Time interface
func (t TimeSinceEpoch) Time() time.Time {
return (time.Unix(0, 0)).Add(
time.Duration(t * TimeSinceEpoch(time.Second)),
)
}
// String interface
func (t TimeSinceEpoch) String() string {
return t.Time().String()
}
// MonotonicTime Monotonically increasing time in seconds since an arbitrary point in the past.
type MonotonicTime float64
// Duration interface
func (t MonotonicTime) Duration() time.Duration {
return time.Duration(t * MonotonicTime(time.Second))
}
// String interface
func (t MonotonicTime) String() string {
return t.Duration().String()
}
type inputDispatchMouseEvent struct {
Type InputDispatchMouseEventType `json:"type"`
X float64 `json:"x"`
Y float64 `json:"y"`
Modifiers int `json:"modifiers,omitempty"`
Timestamp TimeSinceEpoch `json:"timestamp,omitempty"`
Button InputMouseButton `json:"button,omitempty"`
Buttons int `json:"buttons,omitempty"`
ClickCount int `json:"clickCount,omitempty"`
Force float64 `json:"force,omitempty"`
TangentialPressure float64 `json:"tangentialPressure,omitempty"`
TiltX int `json:"tiltX,omitempty"`
TiltY int `json:"tiltY,omitempty"`
Twist int `json:"twist,omitempty"`
DeltaX float64 `json:"deltaX,omitempty"`
DeltaY float64 `json:"deltaY,omitempty"`
PointerType InputDispatchMouseEventPointerType `json:"pointerType,omitempty"`
}
type inputDispatchMouseWheelEvent struct {
Type InputDispatchMouseEventType `json:"type"`
X float64 `json:"x"`
Y float64 `json:"y"`
Modifiers int `json:"modifiers,omitempty"`
Timestamp TimeSinceEpoch `json:"timestamp,omitempty"`
Button InputMouseButton `json:"button,omitempty"`
Buttons int `json:"buttons,omitempty"`
ClickCount int `json:"clickCount,omitempty"`
Force float64 `json:"force,omitempty"`
TangentialPressure float64 `json:"tangentialPressure,omitempty"`
TiltX int `json:"tiltX,omitempty"`
TiltY int `json:"tiltY,omitempty"`
Twist int `json:"twist,omitempty"`
DeltaX float64 `json:"deltaX"`
DeltaY float64 `json:"deltaY"`
PointerType InputDispatchMouseEventPointerType `json:"pointerType,omitempty"`
}
// MarshalJSON interface
// TODO: make sure deltaX and deltaY are never omitted. Or it will cause a browser bug.
func (e InputDispatchMouseEvent) MarshalJSON() ([]byte, error) {
var ee interface{}
if e.Type == InputDispatchMouseEventTypeMouseWheel {
ee = &inputDispatchMouseWheelEvent{
Type: e.Type,
X: e.X,
Y: e.Y,
Modifiers: e.Modifiers,
Timestamp: e.Timestamp,
Button: e.Button,
Buttons: e.Buttons,
ClickCount: e.ClickCount,
Force: e.Force,
TangentialPressure: e.TangentialPressure,
TiltX: e.TiltX,
TiltY: e.TiltY,
Twist: e.Twist,
DeltaX: e.DeltaX,
DeltaY: e.DeltaY,
PointerType: e.PointerType,
}
} else {
ee = &inputDispatchMouseEvent{
Type: e.Type,
X: e.X,
Y: e.Y,
Modifiers: e.Modifiers,
Timestamp: e.Timestamp,
Button: e.Button,
Buttons: e.Buttons,
ClickCount: e.ClickCount,
Force: e.Force,
TangentialPressure: e.TangentialPressure,
TiltX: e.TiltX,
TiltY: e.TiltY,
Twist: e.Twist,
DeltaX: e.DeltaX,
DeltaY: e.DeltaY,
PointerType: e.PointerType,
}
}
return json.Marshal(ee)
}
// Point from the origin (0, 0)
type Point struct {
X float64 `json:"x"`
Y float64 `json:"y"`
}
// Len is the number of vertices
func (q DOMQuad) Len() int {
return len(q) / 2
}
// Each point
func (q DOMQuad) Each(fn func(pt Point, i int)) {
for i := 0; i < q.Len(); i++ {
fn(Point{q[i*2], q[i*2+1]}, i)
}
}
// Center of the polygon
func (q DOMQuad) Center() Point {
var x, y float64
q.Each(func(pt Point, _ int) {
x += pt.X
y += pt.Y
})
return Point{x / float64(q.Len()), y / float64(q.Len())}
}
// Area of the polygon
// https://en.wikipedia.org/wiki/Polygon#Area
func (q DOMQuad) Area() float64 {
area := 0.0
l := len(q)/2 - 1
for i := 0; i < l; i++ {
area += q[i*2]*q[i*2+3] - q[i*2+2]*q[i*2+1]
}
area += q[l*2]*q[1] - q[0]*q[l*2+1]
return area / 2
}
// OnePointInside the shape
func (res *DOMGetContentQuadsResult) OnePointInside() *Point {
for _, q := range res.Quads {
if q.Area() >= 1 {
pt := q.Center()
return &pt
}
}
return nil
}
// Box returns the smallest leveled rectangle that can cover the whole shape.
func (res *DOMGetContentQuadsResult) Box() (box *DOMRect) {
return Shape(res.Quads).Box()
}
// Shape is a list of DOMQuad
type Shape []DOMQuad
// Box returns the smallest leveled rectangle that can cover the whole shape.
func (qs Shape) Box() (box *DOMRect) {
if len(qs) == 0 {
return
}
left := qs[0][0]
top := qs[0][1]
right := left
bottom := top
for _, q := range qs {
q.Each(func(pt Point, _ int) {
if pt.X < left {
left = pt.X
}
if pt.Y < top {
top = pt.Y
}
if pt.X > right {
right = pt.X
}
if pt.Y > bottom {
bottom = pt.Y
}
})
}
box = &DOMRect{left, top, right - left, bottom - top}
return
}
// MoveTo X and Y to x and y
func (p *InputTouchPoint) MoveTo(x, y float64) {
p.X = x
p.Y = y
}
// CookiesToParams converts Cookies list to NetworkCookieParam list
func CookiesToParams(cookies []*NetworkCookie) []*NetworkCookieParam {
list := []*NetworkCookieParam{}
for _, c := range cookies {
list = append(list, &NetworkCookieParam{
Name: c.Name,
Value: c.Value,
Domain: c.Domain,
Path: c.Path,
Secure: c.Secure,
HTTPOnly: c.HTTPOnly,
SameSite: c.SameSite,
Expires: c.Expires,
Priority: c.Priority,
})
}
return list
} | lib/proto/patch.go | 0.694717 | 0.418281 | patch.go | starcoder |
package lavatubes
import (
"sort"
"github.com/sneils/adventofcode2021/convert"
)
type LavaTube struct {
x, y, z int
}
type Region struct {
tubes []LavaTube
x, y int
}
func Parse(inputs []string) Region {
region := Region{}
region.x = len(inputs[0])
region.y = len(inputs)
for y, row := range inputs {
for x, col := range row {
z := convert.ToInt(string(col))
tube := LavaTube{x, y, z}
region.tubes = append(region.tubes, tube)
}
}
return region
}
func (region Region) Get(x, y int) LavaTube {
for _, tube := range region.tubes {
if tube.x == x && tube.y == y {
return tube
}
}
panic("LavaTube not found :x")
}
func (region Region) getNeighbors(tube LavaTube) []LavaTube {
neighbors := []LavaTube{}
x, y := tube.x, tube.y
if y > 0 {
neighbor := region.Get(x, y-1)
neighbors = append(neighbors, neighbor)
}
if x > 0 {
neighbor := region.Get(x-1, y)
neighbors = append(neighbors, neighbor)
}
if x < region.x-1 {
neighbor := region.Get(x+1, y)
neighbors = append(neighbors, neighbor)
}
if y < region.y-1 {
neighbor := region.Get(x, y+1)
neighbors = append(neighbors, neighbor)
}
return neighbors
}
func (region Region) getLowpoints() []LavaTube {
lowpoints := []LavaTube{}
for _, tube := range region.tubes {
isLowpoint := true
for _, neighbor := range region.getNeighbors(tube) {
if neighbor.z <= tube.z {
isLowpoint = false
break
}
}
if isLowpoint {
lowpoints = append(lowpoints, tube)
}
}
return lowpoints
}
func (region Region) CalculateRisk() int {
count := 0
for _, lowpoint := range region.getLowpoints() {
count += lowpoint.z + 1
}
return count
}
func contains(tubes []LavaTube, find LavaTube) bool {
for _, tube := range tubes {
if find.x == tube.x && find.y == tube.y {
return true
}
}
return false
}
func (region Region) getBasin(tube LavaTube, basin []LavaTube) []LavaTube {
if tube.z == 9 {
return basin
}
if contains(basin, tube) {
return basin
}
basin = append(basin, tube)
for _, neighbor := range region.getNeighbors(tube) {
basin = region.getBasin(neighbor, basin)
}
return basin
}
func (region Region) getBasins() [][]LavaTube {
basins := [][]LavaTube{}
for _, lowpoint := range region.getLowpoints() {
basin := region.getBasin(lowpoint, []LavaTube{})
basins = append(basins, basin)
}
return basins
}
func (region Region) GetBiggestThreeBasinSizes() []int {
sizes := []int{}
for _, basin := range region.getBasins() {
sizes = append(sizes, len(basin))
}
sort.Ints(sizes)
return sizes[len(sizes)-3:]
} | lavatubes/lavatubes.go | 0.568655 | 0.451568 | lavatubes.go | starcoder |
package ixconfig
import (
"strconv"
)
// String stores v in a new string value and returns a pointer to it.
func String(v string) *string { return &v }
// Bool stores v in a new bool value and returns a pointer to it.
func Bool(v bool) *bool { return &v }
// NumberInt stores v in a new float32 value and returns a pointer to it.
func NumberInt(v int) *float32 {
f := float32(v)
return &f
}
// NumberFloat64 stores v in a new float32 value and returns a pointer to it.
func NumberFloat64(v float64) *float32 {
f := float32(v)
return &f
}
// NumberUint32 stores v in a new float32 value and returns a pointer to it.
func NumberUint32(v uint32) *float32 {
f := float32(v)
return &f
}
// NumberUint64 stores v in a new float32 value and returns a pointer to it.
func NumberUint64(v uint64) *float32 {
f := float32(v)
return &f
}
// MultivalueStr returns a single-valued Multivalue whose value is the given string.
func MultivalueStr(val string) *Multivalue {
return &Multivalue{
SingleValue: &MultivalueSingleValue{
Value: String(val),
},
}
}
// MultivalueBool returns a single-valued Multivalue whose value is the given bool.
func MultivalueBool(val bool) *Multivalue {
return MultivalueStr(strconv.FormatBool(val))
}
// MultivalueTrue returns a single-valued Multivalue representing a boolean 'true'.
func MultivalueTrue() *Multivalue {
return MultivalueStr("true")
}
// MultivalueFalse returns a single-valued Multivalue representing a boolean 'false'.
func MultivalueFalse() *Multivalue {
return MultivalueStr("false")
}
// MultivalueUint32 returns a single-valued Multivalue whose value is the given int.
func MultivalueUint32(val uint32) *Multivalue {
return MultivalueStr(strconv.FormatUint(uint64(val), 10))
}
// MultivalueStrList returns a list-valued Multivalue containing all given strings.
func MultivalueStrList(vals ...string) *Multivalue {
mv := &MultivalueValueList{}
for _, v := range vals {
mv.Values = append(mv.Values, v)
}
return &Multivalue{Pattern: String("valueList"), ValueList: mv}
}
// MultivalueBoolList returns a list-valued Multivalue containing all given bools.
func MultivalueBoolList(vals ...bool) *Multivalue {
mv := &MultivalueValueList{}
for _, v := range vals {
mv.Values = append(mv.Values, strconv.FormatBool(v))
}
return &Multivalue{Pattern: String("valueList"), ValueList: mv}
}
// MultivalueUintList returns a list-valued Multivalue containing all given uints.
func MultivalueUintList(vals ...uint32) *Multivalue {
mv := &MultivalueValueList{}
for _, v := range vals {
mv.Values = append(mv.Values, strconv.FormatUint(uint64(v), 10))
}
return &Multivalue{Pattern: String("valueList"), ValueList: mv}
}
// MultivalueIntList returns a list-valued Multivalue containing all given ints.
func MultivalueIntList(vals ...int) *Multivalue {
mv := &MultivalueValueList{}
for _, v := range vals {
mv.Values = append(mv.Values, strconv.Itoa(v))
}
return &Multivalue{Pattern: String("valueList"), ValueList: mv}
}
// MultivalueStrIncCounter returns an incrementing Multivalue with the given
// start/step values.
func MultivalueStrIncCounter(start, step string) *Multivalue {
return &Multivalue{
Pattern: String("counter"),
Counter: &MultivalueCounter{
Direction: String("increment"),
Start: String(start),
Step: String(step),
},
}
} | internal/ixconfig/multivalue.go | 0.848408 | 0.435361 | multivalue.go | starcoder |
package decoder
import (
"fmt"
)
var feminineLeaning = `
This job description uses more words that are stereotypically feminine
than words that are stereotypically masculine. Research suggests
this will have only a slight effect on how appealing the job is
to men, and will encourage women applicants. `
var masculineLeaning = `
This job description uses more words that are stereotypically masculine
than words that are stereotypically feminine. It risks putting women off
applying, but will probably encourage men to apply. `
var neutralMessage = `
This job description uses an equal number of words that are
stereotypically masculine and stereotypically feminine. It probably won't
be off-putting to men or women applicants. `
var cleanMessage = `
This job description doesn't use any words that are stereotypically
masculine and stereotypically feminine. It probably won't be off-putting
to men or women applicants. `
type Results struct {
filepath string
masculineCodedWords map[string]bool
feminineCodedWords map[string]bool
hyphenatedCodedWords map[string]bool
}
func NewResults(filepath string) *Results {
return &Results{
filepath: filepath,
// initialize the maps
// The intent is to use the map keys like a Set to avoid duplicate entries
masculineCodedWords: make(map[string]bool),
feminineCodedWords: make(map[string]bool),
hyphenatedCodedWords: make(map[string]bool),
}
}
func (r *Results) foundMasculineWord(w string) {
r.masculineCodedWords[w] = true
}
func (r *Results) foundFeminineWord(w string) {
r.feminineCodedWords[w] = true
}
func (r *Results) foundHyphenatedWord(w string) {
r.hyphenatedCodedWords[w] = true
}
func (r *Results) Explain() {
var result, explanation string
if len(r.masculineCodedWords) > len(r.feminineCodedWords) {
// mostly masculine
result = "masculine"
explanation = masculineLeaning
} else if len(r.masculineCodedWords) < len(r.feminineCodedWords) {
// mostly feminine
result = "feminine"
explanation = feminineLeaning
} else {
// neutral
result = "neutral"
explanation = neutralMessage
}
if len(r.masculineCodedWords) == 0 && len(r.feminineCodedWords) == 0 {
// clean !!!
result = "clean"
explanation = cleanMessage
}
fmt.Println("")
fmt.Println("File:", r.filepath)
fmt.Println("Result:", result)
fmt.Println("Explanation:", explanation)
fmt.Println("masculine words: ", getKeys(r.masculineCodedWords))
fmt.Println("feminine words", getKeys(r.feminineCodedWords))
} | pkg/decoder/results.go | 0.555194 | 0.427815 | results.go | starcoder |
package world
import (
"github.com/cebarks/TinGrizzly/internal/util"
"github.com/cebarks/TinGrizzly/internal/world/tiles"
"github.com/kelindar/tile"
"github.com/rs/zerolog/log"
)
type World struct {
Lookup map[uint32]*TileData
Grid *tile.Grid
State *State
Entities []*Entity
}
type tileUpdate struct {
w *World
td *TileData
delta float64
p tile.Point
}
func (w *World) Update(delta float64) error {
return nil
}
//NewWorld creates an world of the given size with blank tiles. World size must be a multiple of 3.
func NewWorld(sizeX, sizeY int16) *World { //TODO: support bigger maps backed by multiple grids?
world := &World{
Lookup: make(map[uint32]*TileData, sizeX*sizeY),
Entities: make([]*Entity, 42),
Grid: tile.NewGrid(sizeX, sizeY),
}
world.Grid.Each(func(p tile.Point, t tile.Tile) {
initEmptyTile(world, p)
})
return world
}
//TileDataLookup returns the TileData associated with the coordinates
func (w *World) TileDataLookup(x, y int16) *TileData {
t, _ := w.Grid.At(x, y)
return w.TileDataLookupFromTile(t)
}
//TileDataLookupFromPoint returns the TileData associated with the coordinates
func (w *World) TileDataLookupFromPoint(p tile.Point) *TileData {
return w.TileDataLookup(p.X, p.Y)
}
//TileDataLookupFromTile returns the TileData associated with the given tile
func (w *World) TileDataLookupFromTile(t tile.Tile) *TileData {
header := HeaderFromTile(t)
tileData := w.Lookup[header.Index]
tileData.Header = header
return tileData
}
//Index returns the key used for (*world.World).Lookup
func (td *TileData) Index() uint32 {
state, err := td.State.Get("location")
if util.DebugError(err) {
log.Error().Err(err).Msg("couldn't generate index for tiledata")
}
return state.(*tile.Point).Integer()
}
//initTile inits TileData for all tiles in the grid and saves a header pointing to it in the Lookup map.
func initEmptyTile(world *World, p tile.Point) {
td := newTileData(p)
if td2 := world.Lookup[td.Index()]; td2 != nil {
log.Panic().Msgf("Duplicate tiledata index (%v): %+v, %+v", td.Index(), td, td2)
}
td.State.Set("type", "empty")
td.Save(world.Grid)
world.Lookup[td.Index()] = td
}
func newTileData(p tile.Point) *TileData {
td := &TileData{
State: NewState(),
Header: &TileHeader{
Index: p.Integer(),
Bitmask: FlagActive,
},
}
td.State.Set("location", &p)
td.State.Set("type", "empty")
return td
}
func (w *World) SetTileTo(p tile.Point, typeId string) *TileData {
td := w.TileDataLookup(p.X, p.Y)
td.State.Set("type", tiles.TileTypes[typeId])
return td
} | internal/world/world.go | 0.565299 | 0.536313 | world.go | starcoder |
package graph
// Graph represents a corresponding abstract data structure
type Graph struct {
vertexes map[int]Vertex
edges map[string]Edge
}
// Vertex represents a graph node
type Vertex struct {
Value int
Edges []*Edge
}
// Vertex represents a graph relation
type Edge struct {
Label string
X, Y *Vertex
}
// NewGraph is a function that creates new "instance" for structure
func NewGraph(values ...int) *Graph {
graph := &Graph{
make(map[int]Vertex),
make(map[string]Edge),
}
if len(values) > 0 {
for _, value := range values {
graph.AddVertex(value)
}
}
return graph
}
// AddVertex is a function that creates new vertex with provided value
func (g *Graph) AddVertex(value int) {
g.vertexes[value] = Vertex{value, []*Edge{}}
}
// RemoveVertex is a function that removes vertex by provided value
func (g *Graph) RemoveVertex(value int) {
delete(g.vertexes, value)
}
// AddEdge is a function that set relation between 2 vertexes
func (g *Graph) AddEdge(label string, x, y int) {
xVertex := g.getVertex(x)
yVertex := g.getVertex(y)
if _, exists := g.edges[label]; exists == true {
// Edge is already exist
return
}
edge := Edge{label, xVertex, yVertex}
g.edges[label] = edge
xVertex.Edges = append(xVertex.Edges, &edge)
yVertex.Edges = append(yVertex.Edges, &edge)
g.vertexes[x] = *xVertex
g.vertexes[y] = *yVertex
}
// RemoveEdge is a function that removes previously set relation
func (g *Graph) RemoveEdge(label string) {
edge, exist := g.edges[label]
if !exist {
// Edge is not exist
return
}
delete(g.edges, label)
g.removeVertexEdge(edge.X, edge)
g.removeVertexEdge(edge.Y, edge)
}
// Neighbors is a function that returns list of vertex related values
func (g *Graph) Neighbors(value int) []int {
vertex := g.getVertex(value)
var neighbors []int
for _, edge := range vertex.Edges {
if edge.X.Value == value {
neighbors = append(neighbors, edge.Y.Value)
continue;
}
neighbors = append(neighbors, edge.X.Value)
}
return neighbors
}
func (g *Graph) getVertex(value int) *Vertex {
vertex, ok := g.vertexes[value]
if !ok {
g.AddVertex(value)
return g.getVertex(value)
}
return &vertex
}
func (g *Graph) removeVertexEdge(vertex *Vertex, edge Edge) {
for i, vEdge := range vertex.Edges {
if *vEdge == edge {
vertex.Edges[i] = vertex.Edges[len(vertex.Edges) - 1] // Copy last element to target position
vertex.Edges = vertex.Edges[:len(vertex.Edges)-1]
break
}
}
g.vertexes[vertex.Value] = *vertex
} | Graph/graph.go | 0.837221 | 0.684111 | graph.go | starcoder |
package popper
import "errors"
var (
// ErrEmptyElements is returned when a pop operation is attempted on an empty set of elements.
ErrEmptyElements = errors.New("empty elements")
// ErrElementNotFound is returned when the element designated to pop out of the collection is not found.
ErrElementNotFound = errors.New("element not found")
// ErrIndexOutOfBounds is returned when the index specified exceeds the length of the underlying collection of elements.
ErrIndexOutOfBounds = errors.New("index out of bounds")
)
type (
// Popper is an interface used for modifying a collection of elements.
Popper[T comparable] interface {
// PopFirst removes the first element from the underlying collection and returns the removed element.
PopFirst() (T, error)
// PopLast removes the last element from the underlying collection and returns the removed element.
PopLast() (T, error)
// PopElement removes element from the collection. If element does not exist in the collection, a popper.ErrElementNotFound is returned.
PopElement(element T) error
// PopIndex removes the element at index in the collection and returns the removed element.
// If the index exceeds the length of the collection of elements, a popper.ErrIndexOutOfBounds is returned.
PopIndex(index int) (T, error)
// Elements returns the underlying collection of elements.
Elements() []T
// Len returns the number of elements.
Len() int
}
popper[T comparable] struct{ elements []T }
)
// New initializes a new Popper for a generic collection of elements.
func New[T comparable](elements []T) Popper[T] {
i := new(popper[T])
i.elements = elements
return i
}
func (p *popper[T]) PopFirst() (T, error) {
var first T
if len(p.elements) == 0 {
return first, ErrEmptyElements
}
first = p.elements[0]
p.elements = p.elements[1:]
return first, nil
}
func (p *popper[T]) PopLast() (T, error) {
var last T
if len(p.elements) == 0 {
return last, ErrEmptyElements
}
last = p.elements[len(p.elements)-1]
p.elements = p.elements[0 : len(p.elements)-1]
return last, nil
}
func (p *popper[T]) PopElement(element T) error {
if len(p.elements) == 0 {
return ErrEmptyElements
}
var found bool
for i := range p.elements {
if p.elements[i] == element {
found = true
p.elements = append(p.elements[:i], p.elements[i+1:]...)
break
}
}
if !found {
return ErrElementNotFound
}
return nil
}
func (p *popper[T]) PopIndex(index int) (T, error) {
var element T
if len(p.elements) == 0 {
return element, ErrEmptyElements
}
if index > len(p.elements)-1 {
return element, ErrIndexOutOfBounds
}
element = p.elements[index]
p.elements = append(p.elements[:index], p.elements[index+1:]...)
return element, nil
}
func (p *popper[T]) Elements() []T { return p.elements }
func (p *popper[T]) Len() int { return len(p.elements) } | popper.go | 0.693265 | 0.540499 | popper.go | starcoder |
package main
import (
"fmt"
"math"
"regexp"
"strconv"
)
func main() {
// expected answer = 17
input := []string{
"1, 1",
"1, 6",
"8, 3",
"3, 4",
"5, 5",
"8, 9",
}
coordinates := parseInput(input)
grid := initGrid(coordinates)
for y, row := range grid {
for x := range row {
closestInd := determineClosest(coordinates, x, y)
grid[y][x] = closestInd
}
}
count := getCount(grid, coordinates)
//print grid
alphabet := "abcdefgh"
for _, row := range grid {
for _, value := range row {
var char string
if value < 0 {
char = "."
} else {
char = string(alphabet[value])
}
fmt.Printf("%s", char)
}
fmt.Println()
}
fmt.Printf("max count = %v\n", count)
}
func determineClosest(coordinates []pos, currentX int, currentY int) int {
closestInd := -1
closestDistance := -1
duplicate := false
for ind, p := range coordinates {
distance := int(math.Abs(float64(p.X-currentX))) + int(math.Abs(float64(p.Y-currentY)))
if distance == closestDistance {
duplicate = true
}
if closestDistance == -1 || distance < closestDistance {
closestDistance = distance
closestInd = ind
duplicate = false
}
}
if duplicate {
return -1
}
return closestInd
}
func getCount(grid [][]int, coordinates []pos) (max int) {
excluded := getExcludedCoordinateInds(grid)
count := make([]int, len(coordinates))
for _, row := range grid {
for _, value := range row {
if value >= 0 && !isExcluded(excluded, value) {
count[value]++
}
}
}
for _, c := range count {
if c > max {
max = c
}
}
return
}
func isExcluded(excluded []int, item int) bool {
for _, e := range excluded {
if e == item {
return true
}
}
return false
}
func getExcludedCoordinateInds(grid [][]int) (excluded []int) {
m := make(map[int]bool)
max := len(grid) - 1
for i := 0; i <= max; i++ {
m[grid[0][i]] = true
m[grid[max][i]] = true
m[grid[i][0]] = true
m[grid[i][max]] = true
}
for key := range m {
excluded = append(excluded, key)
}
return
}
func initGrid(c []pos) [][]int {
// find max
max := 0
for _, p := range c {
if p.X > max {
max = p.X
}
if p.Y > max {
max = p.Y
}
}
coefficient := 2
output := make([][]int, max*coefficient)
for ind := range output {
output[ind] = make([]int, max*coefficient)
}
return output
}
type pos struct {
X int
Y int
}
func parseInput(str []string) (output []pos) {
regex, _ := regexp.Compile("(\\d+), (\\d+)")
for _, s := range str {
matches := regex.FindAllStringSubmatch(s, 5)
output = append(output, pos{X: atoi(matches[0][1]), Y: atoi(matches[0][2])})
}
return
}
func atoi(str string) (i int) {
i, _ = strconv.Atoi(str)
return
} | cmd/06a/06a.go | 0.520009 | 0.414247 | 06a.go | starcoder |
package v1alpha1
// AcceleratorListerExpansion allows custom methods to be added to
// AcceleratorLister.
type AcceleratorListerExpansion interface{}
// AcceleratorNamespaceListerExpansion allows custom methods to be added to
// AcceleratorNamespaceLister.
type AcceleratorNamespaceListerExpansion interface{}
// BandwidthPackageListerExpansion allows custom methods to be added to
// BandwidthPackageLister.
type BandwidthPackageListerExpansion interface{}
// BandwidthPackageNamespaceListerExpansion allows custom methods to be added to
// BandwidthPackageNamespaceLister.
type BandwidthPackageNamespaceListerExpansion interface{}
// BandwidthPackageAttachmentListerExpansion allows custom methods to be added to
// BandwidthPackageAttachmentLister.
type BandwidthPackageAttachmentListerExpansion interface{}
// BandwidthPackageAttachmentNamespaceListerExpansion allows custom methods to be added to
// BandwidthPackageAttachmentNamespaceLister.
type BandwidthPackageAttachmentNamespaceListerExpansion interface{}
// EndpointGroupListerExpansion allows custom methods to be added to
// EndpointGroupLister.
type EndpointGroupListerExpansion interface{}
// EndpointGroupNamespaceListerExpansion allows custom methods to be added to
// EndpointGroupNamespaceLister.
type EndpointGroupNamespaceListerExpansion interface{}
// ForwardingRuleListerExpansion allows custom methods to be added to
// ForwardingRuleLister.
type ForwardingRuleListerExpansion interface{}
// ForwardingRuleNamespaceListerExpansion allows custom methods to be added to
// ForwardingRuleNamespaceLister.
type ForwardingRuleNamespaceListerExpansion interface{}
// IpSetListerExpansion allows custom methods to be added to
// IpSetLister.
type IpSetListerExpansion interface{}
// IpSetNamespaceListerExpansion allows custom methods to be added to
// IpSetNamespaceLister.
type IpSetNamespaceListerExpansion interface{}
// ListenerListerExpansion allows custom methods to be added to
// ListenerLister.
type ListenerListerExpansion interface{}
// ListenerNamespaceListerExpansion allows custom methods to be added to
// ListenerNamespaceLister.
type ListenerNamespaceListerExpansion interface{} | client/listers/ga/v1alpha1/expansion_generated.go | 0.590307 | 0.425963 | expansion_generated.go | starcoder |
package main
import (
"fmt"
"image"
"image/color"
"math"
"os"
"sort"
"golang.org/x/image/font"
"golang.org/x/image/font/basicfont"
"golang.org/x/image/math/fixed"
"github.com/google/hilbert"
)
// Source: https://gist.github.com/sergiotapia/7882944
func getImageFileDimension(imagePath string) (int, int, error) {
file, err := os.Open(imagePath)
if err != nil {
return 0, 0, fmt.Errorf("Can't open file %v: %w", imagePath, err)
}
defer file.Close()
image, _, err := image.DecodeConfig(file)
if err != nil {
return 0, 0, fmt.Errorf("Error decoding config of image file %v: %w", imagePath, err)
}
return image.Width, image.Height, nil
}
// getImageDifferenceValue returns the average quadratic difference of the (sub)pixels.
// 0 means the images are identical, +inf means that the images don't intersect.
func getImageDifferenceValue(a, b *image.RGBA, offsetA image.Point) float64 {
intersection := a.Bounds().Add(offsetA).Intersect(b.Bounds())
if intersection.Empty() {
return math.Inf(1)
}
aSub := a.SubImage(intersection.Sub(offsetA)).(*image.RGBA)
bSub := b.SubImage(intersection).(*image.RGBA)
intersectionWidth := intersection.Dx() * 4
intersectionHeight := intersection.Dy()
var value int64
for iy := 0; iy < intersectionHeight; iy++ {
aSlice := aSub.Pix[iy*aSub.Stride : iy*aSub.Stride+intersectionWidth]
bSlice := bSub.Pix[iy*bSub.Stride : iy*bSub.Stride+intersectionWidth]
for ix := 0; ix < intersectionWidth; ix += 3 {
diff := int64(aSlice[ix]) - int64(bSlice[ix])
value += diff * diff
}
}
return float64(value) / float64(intersectionWidth*intersectionHeight)
}
func gridifyRectangle(rect image.Rectangle, gridSize int) (result []image.Rectangle) {
for y := divideFloor(rect.Min.Y, gridSize); y < divideCeil(rect.Max.Y, gridSize); y++ {
for x := divideFloor(rect.Min.X, gridSize); x < divideCeil(rect.Max.X, gridSize); x++ {
tempRect := image.Rect(x*gridSize, y*gridSize, (x+1)*gridSize, (y+1)*gridSize)
if tempRect.Overlaps(rect) {
result = append(result, tempRect)
}
}
}
return
}
func hilbertifyRectangle(rect image.Rectangle, gridSize int) ([]image.Rectangle, error) {
grid := gridifyRectangle(rect, gridSize)
gridX := divideFloor(rect.Min.X, gridSize)
gridY := divideFloor(rect.Min.Y, gridSize)
// Size of the grid in chunks
gridWidth := divideCeil(rect.Max.X, gridSize) - divideFloor(rect.Min.X, gridSize)
gridHeight := divideCeil(rect.Max.Y, gridSize) - divideFloor(rect.Min.Y, gridSize)
s, err := hilbert.NewHilbert(int(math.Pow(2, math.Ceil(math.Log2(math.Max(float64(gridWidth), float64(gridHeight)))))))
if err != nil {
return nil, err
}
sort.Slice(grid, func(i, j int) bool {
// Ignore out of range errors, as they shouldn't happen.
hilbertIndexA, _ := s.MapInverse(grid[i].Min.X/gridSize-gridX, grid[i].Min.Y/gridSize-gridY)
hilbertIndexB, _ := s.MapInverse(grid[j].Min.X/gridSize-gridX, grid[j].Min.Y/gridSize-gridY)
return hilbertIndexA < hilbertIndexB
})
return grid, nil
}
func drawLabel(img *image.RGBA, x, y int, label string) {
col := color.RGBA{200, 100, 0, 255}
point := fixed.Point26_6{X: fixed.Int26_6(x * 64), Y: fixed.Int26_6(y * 64)}
d := &font.Drawer{
Dst: img,
Src: image.NewUniform(col),
Face: basicfont.Face7x13,
Dot: point,
}
d.DrawString(label)
}
func intAbs(x int) int {
if x < 0 {
return -x
}
return x
}
func pointAbs(p image.Point) image.Point {
if p.X < 0 {
p.X = -p.X
}
if p.Y < 0 {
p.Y = -p.Y
}
return p
}
// Integer division that rounds to the next integer towards negative infinity.
func divideFloor(a, b int) int {
temp := a / b
if ((a ^ b) < 0) && (a%b != 0) {
return temp - 1
}
return temp
}
// Integer division that rounds to the next integer towards positive infinity.
func divideCeil(a, b int) int {
temp := a / b
if ((a ^ b) >= 0) && (a%b != 0) {
return temp + 1
}
return temp
}
func maxInt(x, y int) int {
if x > y {
return x
}
return y
} | bin/stitch/util.go | 0.770896 | 0.431824 | util.go | starcoder |
package models
import (
i336074805fc853987abe6f7fe3ad97a6a6f3077a16391fec744f671a015fbd7e "time"
i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91 "github.com/microsoft/kiota-abstractions-go/serialization"
)
// ExpirationPattern
type ExpirationPattern struct {
// Stores additional data not described in the OpenAPI description found when deserializing. Can be used for serialization as well.
additionalData map[string]interface{}
// The requestor's desired duration of access represented in ISO 8601 format for durations. For example, PT3H refers to three hours. If specified in a request, endDateTime should not be present and the type property should be set to afterDuration.
duration *i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ISODuration
// Timestamp of date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z.
endDateTime *i336074805fc853987abe6f7fe3ad97a6a6f3077a16391fec744f671a015fbd7e.Time
// The requestor's desired expiration pattern type.
type_escaped *ExpirationPatternType
}
// NewExpirationPattern instantiates a new expirationPattern and sets the default values.
func NewExpirationPattern()(*ExpirationPattern) {
m := &ExpirationPattern{
}
m.SetAdditionalData(make(map[string]interface{}));
return m
}
// CreateExpirationPatternFromDiscriminatorValue creates a new instance of the appropriate class based on discriminator value
func CreateExpirationPatternFromDiscriminatorValue(parseNode i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.Parsable, error) {
return NewExpirationPattern(), nil
}
// GetAdditionalData gets the additionalData property value. Stores additional data not described in the OpenAPI description found when deserializing. Can be used for serialization as well.
func (m *ExpirationPattern) GetAdditionalData()(map[string]interface{}) {
if m == nil {
return nil
} else {
return m.additionalData
}
}
// GetDuration gets the duration property value. The requestor's desired duration of access represented in ISO 8601 format for durations. For example, PT3H refers to three hours. If specified in a request, endDateTime should not be present and the type property should be set to afterDuration.
func (m *ExpirationPattern) GetDuration()(*i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ISODuration) {
if m == nil {
return nil
} else {
return m.duration
}
}
// GetEndDateTime gets the endDateTime property value. Timestamp of date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z.
func (m *ExpirationPattern) GetEndDateTime()(*i336074805fc853987abe6f7fe3ad97a6a6f3077a16391fec744f671a015fbd7e.Time) {
if m == nil {
return nil
} else {
return m.endDateTime
}
}
// GetFieldDeserializers the deserialization information for the current model
func (m *ExpirationPattern) GetFieldDeserializers()(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error)) {
res := make(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error))
res["duration"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {
val, err := n.GetISODurationValue()
if err != nil {
return err
}
if val != nil {
m.SetDuration(val)
}
return nil
}
res["endDateTime"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {
val, err := n.GetTimeValue()
if err != nil {
return err
}
if val != nil {
m.SetEndDateTime(val)
}
return nil
}
res["type"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {
val, err := n.GetEnumValue(ParseExpirationPatternType)
if err != nil {
return err
}
if val != nil {
m.SetType(val.(*ExpirationPatternType))
}
return nil
}
return res
}
// GetType gets the type property value. The requestor's desired expiration pattern type.
func (m *ExpirationPattern) GetType()(*ExpirationPatternType) {
if m == nil {
return nil
} else {
return m.type_escaped
}
}
// Serialize serializes information the current object
func (m *ExpirationPattern) Serialize(writer i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.SerializationWriter)(error) {
{
err := writer.WriteISODurationValue("duration", m.GetDuration())
if err != nil {
return err
}
}
{
err := writer.WriteTimeValue("endDateTime", m.GetEndDateTime())
if err != nil {
return err
}
}
if m.GetType() != nil {
cast := (*m.GetType()).String()
err := writer.WriteStringValue("type", &cast)
if err != nil {
return err
}
}
{
err := writer.WriteAdditionalData(m.GetAdditionalData())
if err != nil {
return err
}
}
return nil
}
// SetAdditionalData sets the additionalData property value. Stores additional data not described in the OpenAPI description found when deserializing. Can be used for serialization as well.
func (m *ExpirationPattern) SetAdditionalData(value map[string]interface{})() {
if m != nil {
m.additionalData = value
}
}
// SetDuration sets the duration property value. The requestor's desired duration of access represented in ISO 8601 format for durations. For example, PT3H refers to three hours. If specified in a request, endDateTime should not be present and the type property should be set to afterDuration.
func (m *ExpirationPattern) SetDuration(value *i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ISODuration)() {
if m != nil {
m.duration = value
}
}
// SetEndDateTime sets the endDateTime property value. Timestamp of date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z.
func (m *ExpirationPattern) SetEndDateTime(value *i336074805fc853987abe6f7fe3ad97a6a6f3077a16391fec744f671a015fbd7e.Time)() {
if m != nil {
m.endDateTime = value
}
}
// SetType sets the type property value. The requestor's desired expiration pattern type.
func (m *ExpirationPattern) SetType(value *ExpirationPatternType)() {
if m != nil {
m.type_escaped = value
}
} | models/expiration_pattern.go | 0.70253 | 0.402392 | expiration_pattern.go | starcoder |
package knot
import "errors"
var (
SlideError = errors.New("knot: cannot slide arc: must be next to the cross")
UntwistError = errors.New("knot: cannot untwist cross: arc must cross itself")
)
// Twist performs the first Reidemeister move.
// The resulting new cross is returned for convenience.
func Twist(a *Arc, h Handedness) *Cross {
if a.Start == nil && a.Stop == nil {
// Unknot. Create the first cross and return.
c := Cross{In: a, Out: a, Over: a, Handedness: h}
a.Start = &c
a.Stop = &c
return &c
}
c := Cross{In: a, Handedness: h}
c.Out = &Arc{Start: &c, Stop: a.Stop}
if h == Right {
c.Over = c.Out
} else {
c.Over = a
}
a.Stop.In = c.Out
a.Stop = &c
return &c
}
// TwistLeft is a shortcut for calling Twist with left handedness.
func TwistLeft(a *Arc) *Cross { return Twist(a, Left) }
// TwistRight is a shortcut for calling Twist with right handedness.
func TwistRight(a *Arc) *Cross { return Twist(a, Right) }
// Untwist undoes the Twist() operation.
func Untwist(c *Cross) error {
if c.Over == c.In {
// Untwist Twist(a, over=true)
c.Over.Stop = c.Out.Stop
} else if c.Over == c.Out {
// Untwist Twist(a, over=false)
c.Over.Start = c.In.Start
} else {
return UntwistError
}
return nil
}
// Poke performs the second Reidemeister move.
// The first parameter, 'over', ends up going over in both crosses.
// Note that no validation is done on whether the poke is a possible move, i.e. whether there is another arc that
// separates the two args passed in as parameters. The resulting two new crosses are returned for convenience.
func Poke(over, under *Arc) (*Cross, *Cross) {
c1 := Cross{Over: over, In: under}
c2 := Cross{Over: over}
c1.Out = &Arc{Start: &c1, Stop: &c2}
c2.In = c1.Out
c2.Out = &Arc{Start: &c2, Stop: under.Stop}
under.Stop.In = c2.Out
under.Stop = &c1
return &c1, &c2
}
// Slide performs the third Reidemeister move.
// Repeating the same operation twice undoes the slide.
func Slide(a *Arc, c *Cross) error {
if (a.Start.Over == c.Over) && (a.Stop.Over == c.In || a.Stop.Over == c.Out) {
slideCrosses(c, a.Stop, a.Start)
} else if (a.Start.Over == c.In || a.Start.Over == c.Out) && (a.Stop.Over == c.Over) {
slideCrosses(c, a.Start, a.Stop)
} else {
return SlideError
}
return nil
}
// Slide using three crosses. Parameters are:
// c1: top + middle arc.
// c2: top + bottom arc.
// c3: middle + bottom arc.
func slideCrosses(c1, c2, c3 *Cross) {
c3.Over = c1.Over
if c2.Over == c1.In {
c2.Over = c1.Out
} else {
c2.Over = c1.In
}
} | go/knot/reidemeister_moves.go | 0.772917 | 0.434941 | reidemeister_moves.go | starcoder |
package parser
import (
"strconv"
)
type NumericLiteral struct {
Node
tok token
}
func (this *NumericLiteral) token() token {
return this.tok
}
func (this *NumericLiteral) String() string {
return this.tok.value
}
func (this *NumericLiteral) Float64Value() float64 {
if len(this.tok.value) >= 3 && this.tok.value[0] == '0' && this.tok.value[1] == 'x' {
v := rune(0)
for i := 2; i < len(this.tok.value); i++ {
val := hex2dec(this.tok.value[i])
v = v<<4 | val
}
return float64(v)
}
v, _ := strconv.ParseFloat(this.tok.value, 64)
return v
}
type IdentifierLiteral struct {
Node
tok token
}
func (this *IdentifierLiteral) token() token {
return this.tok
}
func (this *IdentifierLiteral) String() string {
return this.tok.value
}
type StringLiteral struct {
Node
tok token
}
func (this *StringLiteral) token() token {
return this.tok
}
func (this *StringLiteral) String() string {
return this.tok.value
}
type FalseLiteral struct {
Node
tok token
}
func (this *FalseLiteral) token() token {
return this.tok
}
type TrueLiteral struct {
Node
tok token
}
func (this *TrueLiteral) token() token {
return this.tok
}
type ThisLiteral struct {
Node
tok token
}
func (this *ThisLiteral) token() token {
return this.tok
}
type NullLiteral struct {
Node
tok token
}
func (this *NullLiteral) token() token {
return this.tok
}
type ArrayLiteral struct {
Node
tok token
Elements []Node
}
func (this *ArrayLiteral) token() token {
return this.tok
}
type ObjectPropertyType int
const (
Normal ObjectPropertyType = iota
Get
Set
)
type ObjectPropertyLiteral struct {
Key Node
Type ObjectPropertyType
X Node
}
type ObjectLiteral struct {
Node
tok token
Properties []ObjectPropertyLiteral
}
func (this *ObjectLiteral) token() token {
return this.tok
}
type RegExpFlag int
func (this RegExpFlag) String() string {
b := ""
if this&GlobalRegExp != 0 {
b += "g"
}
if this&IgnoreCaseRegExp != 0 {
b += "i"
}
if this&MultilineRegExp != 0 {
b += "m"
}
return b
}
const (
NoFlagsRegExp RegExpFlag = iota
GlobalRegExp
IgnoreCaseRegExp
MultilineRegExp
)
type RegExpLiteral struct {
Node
tok token
RegExp string
Flags RegExpFlag
}
func (this *RegExpLiteral) token() token {
return this.tok
} | parser/ast_literals.go | 0.586404 | 0.435902 | ast_literals.go | starcoder |
package gt
import (
"database/sql/driver"
"encoding/json"
"strconv"
)
/*
Shortcut: parses successfully or panics. Should be used only in root scope. When
error handling is relevant, use `.Parse`.
*/
func ParseNullUint(src string) (val NullUint) {
try(val.Parse(src))
return
}
/*
Variant of `uint64` where zero value is considered empty in text, and null in
JSON and SQL. Use this for fields where 0 is not allowed, such as primary and
foreign keys, or unique bigserials.
Unlike `uint64`, encoding/decoding is not always reversible:
JSON 0 → Go 0 → JSON null
SQL 0 → Go 0 → SQL null
In your data model, positive numeric fields should be either:
* Non-nullable; zero value = 0; use `uint64`.
* Nullable; zero value = `null`; 0 is not allowed; use `gt.NullUint`.
Avoid `*uintN`.
*/
type NullUint uint64
var (
_ = Encodable(NullUint(0))
_ = Decodable((*NullUint)(nil))
)
// Implement `gt.Zeroable`. Equivalent to `reflect.ValueOf(self).IsZero()`.
func (self NullUint) IsZero() bool { return self == 0 }
// Implement `gt.Nullable`. True if zero.
func (self NullUint) IsNull() bool { return self.IsZero() }
// Implement `gt.PtrGetter`, returning `*uint64`.
func (self *NullUint) GetPtr() interface{} { return (*uint64)(self) }
// Implement `gt.Getter`. If zero, returns `nil`, otherwise returns `uint64`.
func (self NullUint) Get() interface{} {
if self.IsNull() {
return nil
}
return uint64(self)
}
// Implement `gt.Setter`, using `.Scan`. Panics on error.
func (self *NullUint) Set(src interface{}) { try(self.Scan(src)) }
// Implement `gt.Zeroer`, zeroing the receiver.
func (self *NullUint) Zero() {
if self != nil {
*self = 0
}
}
/*
Implement `fmt.Stringer`. If zero, returns an empty string. Otherwise formats
using `strconv.FormatUint`.
*/
func (self NullUint) String() string {
if self.IsNull() {
return ``
}
return strconv.FormatUint(uint64(self), 10)
}
/*
Implement `gt.Parser`. If the input is empty, zeroes the receiver. Otherwise
parses the input using `strconv.ParseUint`.
*/
func (self *NullUint) Parse(src string) error {
if len(src) == 0 {
self.Zero()
return nil
}
val, err := strconv.ParseUint(src, 10, 64)
if err != nil {
return err
}
*self = NullUint(val)
return nil
}
// Implement `gt.Appender`, using the same representation as `.String`.
func (self NullUint) Append(buf []byte) []byte {
if self.IsNull() {
return buf
}
return strconv.AppendUint(buf, uint64(self), 10)
}
/*
Implement `encoding.TextMarhaler`. If zero, returns nil. Otherwise returns the
same representation as `.String`.
*/
func (self NullUint) MarshalText() ([]byte, error) {
if self.IsNull() {
return nil, nil
}
return self.Append(nil), nil
}
// Implement `encoding.TextUnmarshaler`, using the same algorithm as `.Parse`.
func (self *NullUint) UnmarshalText(src []byte) error {
return self.Parse(bytesString(src))
}
/*
Implement `json.Marshaler`. If zero, returns bytes representing `null`.
Otherwise uses the default `json.Marshal` behavior for `uint64`.
*/
func (self NullUint) MarshalJSON() ([]byte, error) {
if self.IsNull() {
return bytesNull, nil
}
return json.Marshal(self.Get())
}
/*
Implement `json.Unmarshaler`. If the input is empty or represents JSON `null`,
zeroes the receiver. Otherwise uses the default `json.Unmarshal` behavior
for `*uint64`.
*/
func (self *NullUint) UnmarshalJSON(src []byte) error {
if isJsonEmpty(src) {
self.Zero()
return nil
}
return json.Unmarshal(src, self.GetPtr())
}
// Implement `driver.Valuer`, using `.Get`.
func (self NullUint) Value() (driver.Value, error) {
return self.Get(), nil
}
/*
Implement `sql.Scanner`, converting an arbitrary input to `gt.NullUint` and
modifying the receiver. Acceptable inputs:
* `nil` -> use `.Zero`
* `string` -> use `.Parse`
* `[]byte` -> use `.UnmarshalText`
* `uintN` -> convert and assign
* `*uintN` -> use `.Zero` or convert and assign
* `NullUint` -> assign
* `gt.Getter` -> scan underlying value
*/
func (self *NullUint) Scan(src interface{}) error {
switch src := src.(type) {
case nil:
self.Zero()
return nil
case string:
return self.Parse(src)
case []byte:
return self.UnmarshalText(src)
case uint:
*self = NullUint(src)
return nil
case *uint:
if src == nil {
self.Zero()
} else {
*self = NullUint(*src)
}
return nil
case uint8:
*self = NullUint(src)
return nil
case *uint8:
if src == nil {
self.Zero()
} else {
*self = NullUint(*src)
}
return nil
case uint16:
*self = NullUint(src)
return nil
case *uint16:
if src == nil {
self.Zero()
} else {
*self = NullUint(*src)
}
return nil
case uint32:
*self = NullUint(src)
return nil
case *uint32:
if src == nil {
self.Zero()
} else {
*self = NullUint(*src)
}
return nil
case uint64:
*self = NullUint(src)
return nil
case *uint64:
if src == nil {
self.Zero()
} else {
*self = NullUint(*src)
}
return nil
case NullUint:
*self = src
return nil
default:
val, ok := get(src)
if ok {
return self.Scan(val)
}
return errScanType(self, src)
}
}
/*
Free cast to the underlying `uint64`. Sometimes handy when this type is embedded
in a struct.
*/
func (self NullUint) Uint64() uint64 { return uint64(self) } | gt_null_uint.go | 0.751283 | 0.604107 | gt_null_uint.go | starcoder |
package cron
import (
"time"
)
type job struct {
Month, Day, Weekday int8
Hour, Minute, Second int8
Task func(time.Time)
}
const any = -1
var (
jobs []job
CheckDelay = time.Duration(1 * time.Second) // minimum delay between checks
)
// This function creates a new job that occurs at the given day and the given
// 24hour time. Any of the values may be -1 as an "any" match, so passing in
// a day of -1, the event occurs every day; passing in a second value of -1, the
// event will fire every second that the other parameters match.
func NewCronJob(month, day, weekday, hour, minute, second int8, task func(time.Time)) {
cj := job{month, day, weekday, hour, minute, second, task}
jobs = append(jobs, cj)
}
// NewYearlyJob creates a job that fires yearly at a given time on a given month and day.
// Birthday reminder.
func NewYearlyJob(month, day, hour, minute, second int8, task func(time.Time)) {
NewCronJob(month, day, any, hour, minute, second, task)
}
// NewMonthlyJob creates a job that fires monthly at a given time on a given day.
// Pay the rent on the 5th of the month.
func NewMonthlyJob(day, hour, minute, second int8, task func(time.Time)) {
NewCronJob(any, day, any, hour, minute, second, task)
}
// NewWeeklyJob creates a job that fires on the given day of the week and time.
// Go to spinning class at the Y on Tuesday.
func NewWeeklyJob(weekday, hour, minute, second int8, task func(time.Time)) {
NewCronJob(any, any, weekday, hour, minute, second, task)
}
// NewDailyJob creates a job that fires daily at a specified time.
// Take a vitamin pill reminder.
func NewDailyJob(hour, minute, second int8, task func(time.Time)) {
NewCronJob(any, any, any, hour, minute, second, task)
}
// Matches returns true if the job time has arrived (Alarm clock rings)
func (cj job) Matches(t time.Time) (ok bool) {
return (cj.Month == any || cj.Month == int8(t.Month())) &&
(cj.Day == any || cj.Day == int8(t.Day())) &&
(cj.Weekday == any || cj.Weekday == int8(t.Weekday())) &&
(cj.Hour == any || cj.Hour == int8(t.Hour())) &&
(cj.Minute == any || cj.Minute == int8(t.Minute())) &&
(cj.Second == any || cj.Second == int8(t.Second()))
}
func processJobs() {
for {
now := time.Now()
for _, j := range jobs {
// execute all our cron tasks asynchronously
if j.Matches(now) {
go j.Task(now)
}
}
time.Sleep(CheckDelay)
}
}
func init() {
go processJobs()
} | cron.go | 0.605099 | 0.418697 | cron.go | starcoder |
package schema
import (
"context"
"fmt"
)
// EncodeScalar is a function that is capable of turning a Go value into
// a literal value
type EncodeScalar func(ctx context.Context, v interface{}) (LiteralValue, error)
// DecodeScalar is a function that is capable of turning a literal value
// into a Go value
type DecodeScalar func(ctx context.Context, v LiteralValue) (interface{}, error)
// ScalarMarshaler defines a value that can be converted to a GraphQL scalar type
type ScalarMarshaler interface {
ToLiteralValue() (LiteralValue, error)
}
// EncodeScalarMarshaler is a EncodeScalar for values that implements ScalarConvertible
func EncodeScalarMarshaler(ctx context.Context, v interface{}) (LiteralValue, error) {
cv, ok := v.(ScalarMarshaler)
if !ok {
return nil, fmt.Errorf("%v is not convertible to a scalar", v)
}
return cv.ToLiteralValue()
}
// ScalarUnmarshaler defines a value that can be converted from a GraphQL scalar type
type ScalarUnmarshaler interface {
FromLiteralValue(LiteralValue) error
}
// A ScalarCollector is an object that can receive a scalar value
type ScalarCollector interface {
Int(v int64)
Float(v float64)
Bool(v bool)
String(v string)
}
// A CollectableScalar is a scalar that can be collected into a ScalarCollector
type CollectableScalar interface {
CollectInto(col ScalarCollector)
}
var _ Type = (*ScalarType)(nil)
// A ScalarType represents a GraphQL Scalar
type ScalarType struct {
named
schemaElement
encode EncodeScalar
decode DecodeScalar
listCreator InputListCreator
}
func (t *ScalarType) isType() {}
// Encode translates a Go value into a literal value
func (t *ScalarType) Encode(ctx context.Context, v interface{}) (LiteralValue, error) {
return t.encode(ctx, v)
}
// Decode translates a literal value into a Go value
func (t *ScalarType) Decode(ctx context.Context, v LiteralValue) (interface{}, error) {
return t.decode(ctx, v)
}
// InputListCreator returns a creator for lists of this scalar type
func (t *ScalarType) InputListCreator() InputListCreator {
return t.listCreator
}
func (t *ScalarType) signature() string {
return t.name
}
func (t *ScalarType) writeSchemaDefinition(w *schemaWriter) {
w.writeDescription(t.description)
w.writeIndent()
fmt.Fprintf(w, "scalar %s", t.name)
for _, e := range t.directives {
w.write(" ")
e.writeSchemaDefinition(w)
}
} | schema/scalar.go | 0.777764 | 0.421611 | scalar.go | starcoder |
package model
import (
"sort"
)
// SeparatorByte is a byte that cannot occur in valid UTF-8 sequences and is
// used to separate label names, label values, and other strings from each other
// when calculating their combined hash value (aka signature aka fingerprint).
const SeparatorByte byte = 255
var (
// cache the signature of an empty label set.
emptyLabelSignature = hashNew()
)
// LabelsToSignature returns a quasi-unique signature (i.e., fingerprint) for a
// given label set. (Collisions are possible but unlikely if the number of label
// sets the function is applied to is small.)
func LabelsToSignature(labels map[string]string) uint64 {
if len(labels) == 0 {
return emptyLabelSignature
}
labelNames := make([]string, 0, len(labels))
for labelName := range labels {
labelNames = append(labelNames, labelName)
}
sort.Strings(labelNames)
sum := hashNew()
for _, labelName := range labelNames {
sum = hashAdd(sum, labelName)
sum = hashAddByte(sum, SeparatorByte)
sum = hashAdd(sum, labels[labelName])
sum = hashAddByte(sum, SeparatorByte)
}
return sum
}
// labelSetToFingerprint works exactly as LabelsToSignature but takes a LabelSet as
// parameter (rather than a label map) and returns a Fingerprint.
func labelSetToFingerprint(ls LabelSet) Fingerprint {
if len(ls) == 0 {
return Fingerprint(emptyLabelSignature)
}
labelNames := make(LabelNames, 0, len(ls))
for labelName := range ls {
labelNames = append(labelNames, labelName)
}
sort.Sort(labelNames)
sum := hashNew()
for _, labelName := range labelNames {
sum = hashAdd(sum, string(labelName))
sum = hashAddByte(sum, SeparatorByte)
sum = hashAdd(sum, string(ls[labelName]))
sum = hashAddByte(sum, SeparatorByte)
}
return Fingerprint(sum)
}
// labelSetToFastFingerprint works similar to labelSetToFingerprint but uses a
// faster and less allocation-heavy hash function, which is more susceptible to
// create hash collisions. Therefore, collision detection should be applied.
func labelSetToFastFingerprint(ls LabelSet) Fingerprint {
if len(ls) == 0 {
return Fingerprint(emptyLabelSignature)
}
var result uint64
for labelName, labelValue := range ls {
sum := hashNew()
sum = hashAdd(sum, string(labelName))
sum = hashAddByte(sum, SeparatorByte)
sum = hashAdd(sum, string(labelValue))
result ^= sum
}
return Fingerprint(result)
}
// SignatureForLabels works like LabelsToSignature but takes a Metric as
// parameter (rather than a label map) and only includes the labels with the
// specified LabelNames into the signature calculation. The labels passed in
// will be sorted by this function.
func SignatureForLabels(m Metric, labels ...LabelName) uint64 {
if len(m) == 0 || len(labels) == 0 {
return emptyLabelSignature
}
sort.Sort(LabelNames(labels))
sum := hashNew()
for _, label := range labels {
sum = hashAdd(sum, string(label))
sum = hashAddByte(sum, SeparatorByte)
sum = hashAdd(sum, string(m[label]))
sum = hashAddByte(sum, SeparatorByte)
}
return sum
}
// SignatureWithoutLabels works like LabelsToSignature but takes a Metric as
// parameter (rather than a label map) and excludes the labels with any of the
// specified LabelNames from the signature calculation.
func SignatureWithoutLabels(m Metric, labels map[LabelName]struct{}) uint64 {
if len(m) == 0 {
return emptyLabelSignature
}
labelNames := make(LabelNames, 0, len(m))
for labelName := range m {
if _, exclude := labels[labelName]; !exclude {
labelNames = append(labelNames, labelName)
}
}
if len(labelNames) == 0 {
return emptyLabelSignature
}
sort.Sort(labelNames)
sum := hashNew()
for _, labelName := range labelNames {
sum = hashAdd(sum, string(labelName))
sum = hashAddByte(sum, SeparatorByte)
sum = hashAdd(sum, string(m[labelName]))
sum = hashAddByte(sum, SeparatorByte)
}
return sum
} | vendor/gx/ipfs/QmSERhEpow33rKAUMJq8yfJVQjLmdABGg899cXg7GcX1Bk/common/model/signature.go | 0.761006 | 0.600716 | signature.go | starcoder |
package main
// SimulationShader defines shader sources for a simulation.
// This implements the Wireworld rules.
var SimulationShader = ShaderSource{
Vertex: `
#version 420
layout(location = 0) in vec2 vertPos;
layout(location = 1) in vec2 vertUV;
out vec2 fragUV;
void main() {
gl_Position = vec4(vertPos, 0, 1);
fragUV = vertUV;
}
`,
Fragment: `
#version 420
$INCLUDE_SHARED$
layout (binding = 0) uniform sampler2D input;
in vec2 fragUV;
out vec4 output;
// countHeadNeighbours checks texels surrounding fragUV and
// counts those which have the cellHead state.
uint countHeadNeighbours() {
// The sampled red components are converted to uint and in
// the process are truncated to 0 if their value is < 1.0.
// 1.0 happens to be the value of the CellHead state we are
// interested in. All other states are discarded.
// top row
uint r00 = uint(textureOffset(input, fragUV, ivec2(-1, 1)).r);
uint r01 = uint(textureOffset(input, fragUV, ivec2( 0, 1)).r);
uint r02 = uint(textureOffset(input, fragUV, ivec2( 1, 1)).r);
// middle row
uint r10 = uint(textureOffset(input, fragUV, ivec2(-1, 0)).r);
uint r12 = uint(textureOffset(input, fragUV, ivec2( 1, 0)).r);
// bottom row
uint r20 = uint(textureOffset(input, fragUV, ivec2(-1,-1)).r);
uint r21 = uint(textureOffset(input, fragUV, ivec2( 0,-1)).r);
uint r22 = uint(textureOffset(input, fragUV, ivec2( 1,-1)).r);
// Sum all the cell states. At this point we only have non-zero
// values for CellHead neighbours. So the function returns the
// total number of neighbouring CellHeads and nothing more.
return r00 + r01 + r02 +
r10 + r12 +
r20 + r21 + r22;
}
void main() {
uint cell = uint(texture2D(input, fragUV).r * 255);
switch (cell) {
case CellWire:
uint heads = countHeadNeighbours();
if (heads == 1 || heads == 2) {
cell = CellHead;
}
break;
case CellHead:
cell = CellTail;
break;
case CellTail:
cell = CellWire;
break;
}
output = vec4(float(cell) / 255, 0, 0, 1);
}
`,
} | shader_simulation.go | 0.650689 | 0.568356 | shader_simulation.go | starcoder |
package solver
import (
"fmt"
)
// A Problem is a list of clauses & a nb of vars.
type Problem struct {
NbVars int // Total nb of vars
Clauses []*Clause // List of non-empty, non-unit clauses
Status Status // Status of the problem. Can be trivially UNSAT (if empty clause was met or inferred by UP) or Indet.
Units []Lit // List of unit literal found in the problem.
Model []decLevel // For each var, its inferred binding. 0 means unbound, 1 means bound to true, -1 means bound to false.
minLits []Lit // For an optimisation problem, the list of lits whose sum must be minimized
minWeights []int // For an optimisation problem, the weight of each lit.
}
// Optim returns true iff pb is an optimisation problem, ie
// a problem for which we not only want to find a model, but also
// the best possible model according to an optimization constraint.
func (pb *Problem) Optim() bool {
return pb.minLits != nil
}
// CNF returns a DIMACS CNF representation of the problem.
func (pb *Problem) CNF() string {
res := fmt.Sprintf("p cnf %d %d\n", pb.NbVars, len(pb.Clauses)+len(pb.Units))
for _, unit := range pb.Units {
res += fmt.Sprintf("%d 0\n", unit.Int())
}
for _, clause := range pb.Clauses {
res += fmt.Sprintf("%s\n", clause.CNF())
}
return res
}
// PBString returns a representation of the problem as a pseudo-boolean problem.
func (pb *Problem) PBString() string {
res := pb.costFuncString()
for _, unit := range pb.Units {
sign := ""
if !unit.IsPositive() {
sign = "~"
unit = unit.Negation()
}
res += fmt.Sprintf("1 %sx%d = 1 ;\n", sign, unit.Int())
}
for _, clause := range pb.Clauses {
res += fmt.Sprintf("%s\n", clause.PBString())
}
return res
}
// SetCostFunc sets the function to minimize when optimizing the problem.
// If all weights are 1, weights can be nil.
// In all other cases, len(lits) must be the same as len(weights).
func (pb *Problem) SetCostFunc(lits []Lit, weights []int) {
if weights != nil && len(lits) != len(weights) {
panic("length of lits and of weights don't match")
}
pb.minLits = lits
pb.minWeights = weights
}
// costFuncString returns a string representation of the cost function of the problem, if any, followed by a \n.
// If there is no cost function, the empty string will be returned.
func (pb *Problem) costFuncString() string {
if pb.minLits == nil {
return ""
}
res := "min: "
for i, lit := range pb.minLits {
w := 1
if pb.minWeights != nil {
w = pb.minWeights[i]
}
sign := ""
if w >= 0 && i != 0 { // No plus sign for the first term or for negative terms.
sign = "+"
}
val := lit.Int()
neg := ""
if val < 0 {
val = -val
neg = "~"
}
res += fmt.Sprintf("%s%d %sx%d", sign, w, neg, val)
}
res += " ;\n"
return res
}
func (pb *Problem) updateStatus(nbClauses int) {
pb.Clauses = pb.Clauses[:nbClauses]
if pb.Status == Indet && nbClauses == 0 {
pb.Status = Sat
}
}
func (pb *Problem) simplify() {
idxClauses := make([][]int, pb.NbVars*2) // For each lit, indexes of clauses it appears in
removed := make([]bool, len(pb.Clauses)) // Clauses that have to be removed
for i := range pb.Clauses {
pb.simplifyClause(i, idxClauses, removed)
if pb.Status == Unsat {
return
}
}
for i := 0; i < len(pb.Units); i++ {
lit := pb.Units[i]
neg := lit.Negation()
clauses := idxClauses[neg]
for j := range clauses {
pb.simplifyClause(j, idxClauses, removed)
}
}
pb.rmClauses(removed)
}
func (pb *Problem) simplifyClause(idx int, idxClauses [][]int, removed []bool) {
c := pb.Clauses[idx]
k := 0
sat := false
for j := 0; j < c.Len(); j++ {
lit := c.Get(j)
v := lit.Var()
if pb.Model[v] == 0 {
c.Set(k, c.Get(j))
k++
idxClauses[lit] = append(idxClauses[lit], idx)
} else if (pb.Model[v] > 0) == lit.IsPositive() {
sat = true
break
}
}
if sat {
removed[idx] = true
return
}
if k == 0 {
pb.Status = Unsat
return
}
if k == 1 {
pb.addUnit(c.First())
if pb.Status == Unsat {
return
}
removed[idx] = true
}
c.Shrink(k)
}
// rmClauses removes clauses that are already satisfied after simplification.
func (pb *Problem) rmClauses(removed []bool) {
j := 0
for i, rm := range removed {
if !rm {
pb.Clauses[j] = pb.Clauses[i]
j++
}
}
pb.Clauses = pb.Clauses[:j]
}
// simplify simplifies the pure SAT problem, i.e runs unit propagation if possible.
func (pb *Problem) simplify2() {
nbClauses := len(pb.Clauses)
restart := true
for restart {
restart = false
i := 0
for i < nbClauses {
c := pb.Clauses[i]
nbLits := c.Len()
clauseSat := false
j := 0
for j < nbLits {
lit := c.Get(j)
if pb.Model[lit.Var()] == 0 {
j++
} else if (pb.Model[lit.Var()] == 1) == lit.IsPositive() {
clauseSat = true
break
} else {
nbLits--
c.Set(j, c.Get(nbLits))
}
}
if clauseSat {
nbClauses--
pb.Clauses[i] = pb.Clauses[nbClauses]
} else if nbLits == 0 {
pb.Status = Unsat
return
} else if nbLits == 1 { // UP
pb.addUnit(c.First())
if pb.Status == Unsat {
return
}
nbClauses--
pb.Clauses[i] = pb.Clauses[nbClauses]
restart = true // Must restart, since this lit might have made one more clause Unit or SAT.
} else { // nb lits unbound > cardinality
if c.Len() != nbLits {
c.Shrink(nbLits)
}
i++
}
}
}
pb.updateStatus(nbClauses)
}
// simplifyCard simplifies the problem, i.e runs unit propagation if possible.
func (pb *Problem) simplifyCard() {
nbClauses := len(pb.Clauses)
restart := true
for restart {
restart = false
i := 0
for i < nbClauses {
c := pb.Clauses[i]
nbLits := c.Len()
card := c.Cardinality()
clauseSat := false
nbSat := 0
j := 0
for j < nbLits {
lit := c.Get(j)
if pb.Model[lit.Var()] == 0 {
j++
} else if (pb.Model[lit.Var()] == 1) == lit.IsPositive() {
nbSat++
if nbSat == card {
clauseSat = true
break
}
} else {
nbLits--
c.Set(j, c.Get(nbLits))
}
}
if clauseSat {
nbClauses--
pb.Clauses[i] = pb.Clauses[nbClauses]
} else if nbLits < card {
pb.Status = Unsat
return
} else if nbLits == card { // UP
pb.addUnits(c, nbLits)
if pb.Status == Unsat {
return
}
nbClauses--
pb.Clauses[i] = pb.Clauses[nbClauses]
restart = true // Must restart, since this lit might have made one more clause Unit or SAT.
} else { // nb lits unbound > cardinality
if c.Len() != nbLits {
c.Shrink(nbLits)
}
i++
}
}
}
pb.updateStatus(nbClauses)
}
func (pb *Problem) simplifyPB() {
modified := true
for modified {
modified = false
i := 0
for i < len(pb.Clauses) {
c := pb.Clauses[i]
j := 0
card := c.Cardinality()
wSum := c.WeightSum()
for j < c.Len() {
lit := c.Get(j)
v := lit.Var()
w := c.Weight(j)
if pb.Model[v] == 0 { // Literal not assigned: is it unit?
if wSum-w < card { // Lit must be true for the clause to be satisfiable
pb.addUnit(lit)
if pb.Status == Unsat {
return
}
c.removeLit(j)
card -= w
c.updateCardinality(-w)
wSum -= w
modified = true
} else {
j++
}
} else { // Bound literal: remove it and update, if needed, cardinality
wSum -= w
if (pb.Model[v] == 1) == lit.IsPositive() {
card -= w
c.updateCardinality(-w)
}
c.removeLit(j)
modified = true
}
}
if card <= 0 { // Clause is Sat
pb.Clauses[i] = pb.Clauses[len(pb.Clauses)-1]
pb.Clauses = pb.Clauses[:len(pb.Clauses)-1]
modified = true
} else if wSum < card {
pb.Clauses = nil
pb.Status = Unsat
return
} else {
i++
}
}
}
if pb.Status == Indet && len(pb.Clauses) == 0 {
pb.Status = Sat
}
}
func (pb *Problem) addUnit(lit Lit) {
if lit.IsPositive() {
if pb.Model[lit.Var()] == -1 {
pb.Status = Unsat
return
}
pb.Model[lit.Var()] = 1
} else {
if pb.Model[lit.Var()] == 1 {
pb.Status = Unsat
return
}
pb.Model[lit.Var()] = -1
}
pb.Units = append(pb.Units, lit)
}
func (pb *Problem) addUnits(c *Clause, nbLits int) {
for i := 0; i < nbLits; i++ {
lit := c.Get(i)
pb.addUnit(lit)
}
} | solver/problem.go | 0.644896 | 0.45532 | problem.go | starcoder |
package interpreter
import "piquant/lang/ast"
func specialQuote(e Env, head ast.Node, args []ast.Node) packet {
return respond(args[0])
}
func specialApply(e Env, head ast.Node, args []ast.Node) packet {
f := args[0]
l := toListValue(trampoline(func() packet {
return evalNode(e, args[1])
}))
nodes := append([]ast.Node{f}, l.Nodes...)
return respond(trampoline(func() packet {
return evalList(e, &ast.List{Nodes: nodes}, true)
}))
}
func specialUpdateBang(e Env, head ast.Node, args []ast.Node) packet {
name := toSymbolName(args[0])
rightHandSide := trampoline(func() packet {
return evalNode(e, args[1])
})
if ok := e.Update(name, rightHandSide); !ok {
panicEvalError(head, "Cannot 'update!' an undefined name: "+name)
}
return respond(&ast.Nil{})
}
func specialIf(e Env, head ast.Node, args []ast.Node) packet {
predicate := toBooleanValue(trampoline(func() packet {
return evalNode(e, args[0])
}))
if predicate {
return bounce(func() packet {
return evalNode(e, args[1])
})
}
return bounce(func() packet {
return evalNode(e, args[2])
})
}
func specialCond(e Env, head ast.Node, args []ast.Node) packet {
for i := 0; i < len(args); i += 2 {
predicate := toBooleanValue(trampoline(func() packet {
return evalNode(e, args[i])
}))
if predicate {
return bounce(func() packet {
return evalNode(e, args[i+1])
})
}
}
panicEvalError(head, "No matching cond clause: "+head.String())
return respond(&ast.Nil{})
}
func specialLet(parentEnv Env, head ast.Node, args []ast.Node) packet {
body := args[1]
var variableNodes ast.Nodes
switch val := args[0].(type) {
case ast.Coll:
variableNodes = val.Children()
default:
panicEvalError(head, "Expected list as first argument to 'let': "+val.String())
}
e := NewMapEnv("let", parentEnv)
// Evaluate variable assignments
for i := 0; i < len(variableNodes); i += 2 {
variable := variableNodes[i]
expression := variableNodes[i+1]
variableName := toSymbolName(variable)
e.Set(variableName, trampoline(func() packet {
return evalNode(e, expression)
}))
}
// Evaluate body
return bounce(func() packet {
return evalNode(e, body)
})
}
func specialGo(e Env, head ast.Node, args []ast.Node) packet {
go evalEachNode(e, args)
return respond(&ast.Nil{})
}
func specialBegin(e Env, head ast.Node, args []ast.Node) packet {
results := evalEachNode(e, args)
if len(results) == 0 {
return respond(&ast.Nil{})
}
return respond(results[len(results)-1])
}
func specialDef(e Env, head ast.Node, args []ast.Node) packet {
name := toSymbolName(args[0])
e.Set(name, trampoline(func() packet {
return evalNode(e, args[1])
}))
return respond(&ast.Nil{})
}
func specialEval(e Env, head ast.Node, args []ast.Node) packet {
checkSpecialArgs("eval", head, args, 1, 2)
node := trampoline(func() packet {
return evalNode(e, args[0])
})
switch len(args) {
case 1:
return bounce(func() packet {
return evalNode(e, node)
})
case 2:
nodeArg1 := trampoline(func() packet {
return evalNode(e, args[1])
})
switch environmentNode := nodeArg1.(type) {
case *EnvNode:
return bounce(func() packet {
return evalNode(environmentNode.Env, node)
})
default:
panicEvalError(args[0], "Second arg to 'eval' must be an environment: "+environmentNode.String())
return respond(nil)
}
default:
panicEvalError(args[0], "Unexpected number of args")
return respond(nil)
}
}
func specialFn(e Env, head ast.Node, args []ast.Node) packet {
var parameterNodes ast.Nodes
switch val := args[0].(type) {
case ast.Coll:
parameterNodes = val.Children()
default:
panicEvalError(head, "Expected list as first argument to 'fn': "+val.String())
}
return respond(&Function{
Name: "anonymous",
Parameters: parameterNodes,
Body: args[1],
ParentEnv: e,
})
}
func specialMacro(e Env, head ast.Node, args []ast.Node) packet {
functionNode := trampoline(func() packet {
return evalNode(e, args[0])
})
switch val := functionNode.(type) {
case *Function:
val.IsMacro = true
return respond(val)
default:
panicEvalError(args[0], "macro expects a function argument but got: "+args[0].String())
return respond(nil)
}
}
func specialMacroexpand1(e Env, head ast.Node, args []ast.Node) packet {
expansionNode := trampoline(func() packet {
return evalNode(e, args[0])
})
switch value := expansionNode.(type) {
case *ast.List:
expansionResult := trampoline(func() packet {
return evalList(e, value, false)
})
return respond(expansionResult)
default:
panicEvalError(args[0], "macroexpand1 expected a list but got: "+value.String())
return respond(nil)
}
} | lang/interpreter/specials.go | 0.567937 | 0.402715 | specials.go | starcoder |
package miner
import (
"github.com/filecoin-project/specs-actors/actors/abi"
"github.com/filecoin-project/specs-actors/actors/abi/big"
"github.com/filecoin-project/specs-actors/actors/builtin"
)
// IP = InitialPledgeFactor * BR(precommit time)
var InitialPledgeFactor = big.NewInt(20)
// FF = (DeclaredFaultFactorNum / DeclaredFaultFactorDenom) * BR(t)
var DeclaredFaultFactorNum = big.NewInt(214)
var DeclaredFaultFactorDenom = big.NewInt(100)
// SP = (UndeclaredFaultFactor / DeclaredFaultFactorDenom) * BR(t)
var UndeclaredFaultFactorNum = big.NewInt(5)
var UndeclaredFaultFactorDenom = big.NewInt(1)
// This is the BR(t) value of the given sector for the current epoch.
// It is the expected reward this sector would pay out over a one day period.
// BR(t) = CurrEpochReward(t) * SectorQualityAdjustedPower * EpochsInDay / TotalNetworkQualityAdjustedPower(t)
func ExpectedDayRewardForPower(epochTargetReward abi.TokenAmount, networkQAPower abi.StoragePower, qaSectorPower abi.StoragePower) abi.TokenAmount {
expectedRewardForProvingPeriod := big.Mul(big.NewInt(builtin.EpochsInDay), epochTargetReward)
return big.Div(big.Mul(qaSectorPower, expectedRewardForProvingPeriod), networkQAPower)
}
// This is the FF(t) penalty for a sector expected to be in the fault state either because the fault was declared or because
// it has been previously detected by the network.
// FF(t) = DeclaredFaultFactor * BR(t)
func PledgePenaltyForDeclaredFault(epochTargetReward abi.TokenAmount, networkQAPower abi.StoragePower, qaSectorPower abi.StoragePower) abi.TokenAmount {
return big.Div(
big.Mul(DeclaredFaultFactorNum, ExpectedDayRewardForPower(epochTargetReward, networkQAPower, qaSectorPower)),
DeclaredFaultFactorDenom)
}
// This is the SP(t) penalty for a newly faulty sector that has not been declared.
// SP(t) = UndeclaredFaultFactor * BR(t)
func PledgePenaltyForUndeclaredFault(epochTargetReward abi.TokenAmount, networkQAPower abi.StoragePower, qaSectorPower abi.StoragePower) abi.TokenAmount {
return big.Div(
big.Mul(UndeclaredFaultFactorNum, ExpectedDayRewardForPower(epochTargetReward, networkQAPower, qaSectorPower)),
UndeclaredFaultFactorDenom)
}
// This is the SP(t) penalty for a newly faulty sector that has not been declared later than one deadline.
// SP_late(t) = 2*SP(t)
func PledgePenaltyForLateUndeclaredFault(epochTargetReward abi.TokenAmount, networkQAPower abi.StoragePower, qaSectorPower abi.StoragePower) abi.TokenAmount {
return big.Mul(big.NewInt(2),
PledgePenaltyForUndeclaredFault(epochTargetReward, networkQAPower, qaSectorPower))
}
// Penalty to locked pledge collateral for the termination of a sector before scheduled expiry.
// SectorAge is the time between now and the sector's activation.
func PledgePenaltyForTermination(initialPledge abi.TokenAmount, sectorAge abi.ChainEpoch, epochTargetReward abi.TokenAmount, networkQAPower, qaSectorPower abi.StoragePower) abi.TokenAmount {
// max(SP(t), IP + BR(StartEpoch)*min(SectorAgeInDays, 180))
// where BR(StartEpoch)=IP/InitialPledgeFactor
// and sectorAgeInDays = sectorAge / EpochsInDay
cappedSectorAge := big.NewInt(int64(minEpoch(sectorAge, 180*builtin.EpochsInDay)))
return big.Max(
PledgePenaltyForLateUndeclaredFault(epochTargetReward, networkQAPower, qaSectorPower),
big.Add(
initialPledge,
big.Div(
big.Mul(initialPledge, cappedSectorAge),
big.Mul(InitialPledgeFactor, big.NewInt(builtin.EpochsInDay)))))
}
// Computes the pledge requirement for committing new quality-adjusted power to the network, given the current
// total power, total pledge commitment, epoch block reward, and circulating token supply.
// In plain language, the pledge requirement is a multiple of the block reward expected to be earned by the
// newly-committed power, holding the per-epoch block reward constant (though in reality it will change over time).
// The network total pledge and circulating supply parameters are currently unused, but may be included in a
// future calculation.
func InitialPledgeForPower(qaPower abi.StoragePower, networkQAPower abi.StoragePower, networkTotalPledge abi.TokenAmount, epochTargetReward abi.TokenAmount, networkCirculatingSupply abi.TokenAmount) abi.TokenAmount {
// Details here are still subject to change.
// PARAM_FINISH
// https://github.com/filecoin-project/specs-actors/issues/468
_ = networkCirculatingSupply // TODO: ce use this
_ = networkTotalPledge // TODO: ce use this
if networkQAPower.IsZero() {
return epochTargetReward
}
return big.Mul(InitialPledgeFactor, ExpectedDayRewardForPower(epochTargetReward, networkQAPower, qaPower))
} | actors/builtin/miner/monies.go | 0.580709 | 0.463444 | monies.go | starcoder |
package tracer
import (
"math"
"math/rand"
"github.com/go-gl/mathgl/mgl64"
)
type Bounce struct {
Attenuation mgl64.Vec3
Scattered Ray
}
type Material interface {
Scatter(ray Ray, rec *HitRecord) *Bounce
}
type Lambertian struct {
Albedo mgl64.Vec3
}
func (l Lambertian) Scatter(ray Ray, rec *HitRecord) *Bounce {
target := rec.P.Add(rec.Normal).Add(RandVec3InUnitSphere())
return &Bounce{
Attenuation: l.Albedo,
Scattered: Ray{
Origin: rec.P,
Direction: target.Sub(rec.P),
},
}
}
type Metal struct {
Albedo mgl64.Vec3
Diffusion float64 // 0.0 to 1.0
}
func (m Metal) Scatter(ray Ray, rec *HitRecord) *Bounce {
reflected := Reflect(ray.Direction.Normalize(), rec.Normal)
if reflected.Dot(rec.Normal) < 0 {
return nil
}
// Add diffusion by randomizing direction
direction := reflected.Add(RandVec3InUnitSphere().Mul(m.Diffusion))
return &Bounce{
Attenuation: m.Albedo,
Scattered: Ray{
Origin: rec.P,
Direction: direction,
},
}
}
func schlick(cosine, refractiveIndex float64) float64 {
r0 := (1 - refractiveIndex) / (1 + refractiveIndex)
r0 = r0 * r0
r0 = r0 + (1-r0)*math.Pow(1-cosine, 5)
return r0
}
type Dielectric struct {
RefractiveIndex float64
}
func (d Dielectric) Scatter(ray Ray, rec *HitRecord) *Bounce {
var outwardNormal mgl64.Vec3
var niOverNt float64
var cosine float64
if ray.Direction.Dot(rec.Normal) > 0 {
outwardNormal = Inverse(rec.Normal)
niOverNt = d.RefractiveIndex
cosine = d.RefractiveIndex * ray.Direction.Dot(rec.Normal) / ray.Direction.Len()
} else {
outwardNormal = rec.Normal
niOverNt = 1.0 / d.RefractiveIndex
cosine = -(ray.Direction.Dot(rec.Normal) / ray.Direction.Len())
}
direction := Reflect(ray.Direction, rec.Normal)
if refracted, ok := Refract(ray.Direction, outwardNormal, niOverNt); ok {
reflectProbability := schlick(cosine, d.RefractiveIndex)
if rand.Float64() > reflectProbability {
direction = refracted
}
}
return &Bounce{
Attenuation: mgl64.Vec3{1.0, 1.0, 1.0},
Scattered: Ray{rec.P, direction},
}
} | material.go | 0.800614 | 0.433682 | material.go | starcoder |
package matchers
import (
"fmt"
"reflect"
"github.com/bsm/gomega/format"
)
type PanicMatcher struct {
Expected interface{}
object interface{}
}
func (matcher *PanicMatcher) Match(actual interface{}) (success bool, err error) {
if actual == nil {
return false, fmt.Errorf("PanicMatcher expects a non-nil actual.")
}
actualType := reflect.TypeOf(actual)
if actualType.Kind() != reflect.Func {
return false, fmt.Errorf("PanicMatcher expects a function. Got:\n%s", format.Object(actual, 1))
}
if !(actualType.NumIn() == 0 && actualType.NumOut() == 0) {
return false, fmt.Errorf("PanicMatcher expects a function with no arguments and no return value. Got:\n%s", format.Object(actual, 1))
}
success = false
defer func() {
if e := recover(); e != nil {
matcher.object = e
if matcher.Expected == nil {
success = true
return
}
valueMatcher, valueIsMatcher := matcher.Expected.(omegaMatcher)
if !valueIsMatcher {
valueMatcher = &EqualMatcher{Expected: matcher.Expected}
}
success, err = valueMatcher.Match(e)
if err != nil {
err = fmt.Errorf("PanicMatcher's value matcher failed with:\n%s%s", format.Indent, err.Error())
}
}
}()
reflect.ValueOf(actual).Call([]reflect.Value{})
return
}
func (matcher *PanicMatcher) FailureMessage(actual interface{}) (message string) {
if matcher.Expected == nil {
// We wanted any panic to occur, but none did.
return format.Message(actual, "to panic")
}
if matcher.object == nil {
// We wanted a panic with a specific value to occur, but none did.
switch matcher.Expected.(type) {
case omegaMatcher:
return format.Message(actual, "to panic with a value matching", matcher.Expected)
default:
return format.Message(actual, "to panic with", matcher.Expected)
}
}
// We got a panic, but the value isn't what we expected.
switch matcher.Expected.(type) {
case omegaMatcher:
return format.Message(
actual,
fmt.Sprintf(
"to panic with a value matching\n%s\nbut panicked with\n%s",
format.Object(matcher.Expected, 1),
format.Object(matcher.object, 1),
),
)
default:
return format.Message(
actual,
fmt.Sprintf(
"to panic with\n%s\nbut panicked with\n%s",
format.Object(matcher.Expected, 1),
format.Object(matcher.object, 1),
),
)
}
}
func (matcher *PanicMatcher) NegatedFailureMessage(actual interface{}) (message string) {
if matcher.Expected == nil {
// We didn't want any panic to occur, but one did.
return format.Message(actual, fmt.Sprintf("not to panic, but panicked with\n%s", format.Object(matcher.object, 1)))
}
// We wanted a to ensure a panic with a specific value did not occur, but it did.
switch matcher.Expected.(type) {
case omegaMatcher:
return format.Message(
actual,
fmt.Sprintf(
"not to panic with a value matching\n%s\nbut panicked with\n%s",
format.Object(matcher.Expected, 1),
format.Object(matcher.object, 1),
),
)
default:
return format.Message(actual, "not to panic with", matcher.Expected)
}
} | matchers/panic_matcher.go | 0.744749 | 0.42054 | panic_matcher.go | starcoder |
package function
import (
"fmt"
"regexp"
"runtime"
"strings"
"sync"
)
// Namespace is a representation of a location of a function.
type Namespace string
// NewNamespace creates a new namespace from a string.
func NewNamespace(s string) (ns Namespace) {
ns = Namespace(s)
return ns
}
// DeepCopy creates a copy of a namespace ref.
func (ref *Namespace) DeepCopy() (ns Namespace) {
ns = (*ref)[:len(*ref)] + ""
return ns
}
// String returns a print friendly representation of namespace ref.
func (ref *Namespace) String() (s string) {
s = string(ref.DeepCopy())
return s
}
// Function is a representation of a function.
type Function interface{}
// NamespaceDictionary is a representation for looking up namespaces names.
type NamespaceDictionary struct {
RefLookUp *sync.Map // [*Namespace]Namespace
NameLookUp *sync.Map // [Namespace]*Namespace
}
// FunctionBinding maintains a function binding.
type FunctionBinding struct {
Binding *sync.Map // [*Namespace]Function
}
// LanguageBinding is a structure to maintain a function mapping between two languages.
type LanguageBinding struct {
InternalToExternal *sync.Map // [*Namespace]*Namespace
ExternalToInternal *sync.Map // [*Namespace]*Namespace
}
// Registry represents the available functions between languages.
type Registry struct {
NameDict NamespaceDictionary
FuncBind FunctionBinding
LangBind LanguageBinding
}
// NewNamespaceDictionary creates a two-way dictionary for looking up between a reference of a namespace and namespace itself.
func NewNamespaceDictionary() (nsd NamespaceDictionary) {
rlu := new(sync.Map)
nlu := new(sync.Map)
nsd = NamespaceDictionary{RefLookUp: rlu, NameLookUp: nlu}
return nsd
}
// Add will add a namespace ns to a namespace dictionary nsd.
// Add returns true if the addition of namespace ns was successful, and false otherwise.
func (nsd *NamespaceDictionary) Add(ns Namespace) (status bool) {
nsc := (&ns).DeepCopy()
_, nameExists := (*nsd).NameLookUp.LoadOrStore(nsc, &nsc)
_, refExists := (*nsd).RefLookUp.LoadOrStore(&nsc, nsc)
status = !nameExists && !refExists
return status
}
// Remove will remove a namespace ns from the namespace dictionary nsd.
// Remove returns true if the removal of namespace ns, and false otherwise.
func (nsd *NamespaceDictionary) Remove(ns Namespace) (status bool) {
ref, exists := (*nsd).NameLookUp.Load(ns)
if exists {
(*nsd).RefLookUp.Delete(ref)
(*nsd).NameLookUp.Delete(ns)
}
status = exists
return status
}
// Reference returns a reference ref for the namespace ns from namespace dictionary nsd.
func (nsd *NamespaceDictionary) Reference(ns Namespace) (ref *Namespace) {
r, _ := (*nsd).NameLookUp.Load(ns)
if r != nil {
ref = r.(*Namespace)
} else {
ref = nil
}
return ref
}
// Value returns a namespace value ns from a namespace dictionary nsd given a reference ref.
func (nsd *NamespaceDictionary) Value(ref *Namespace) (ns Namespace) {
n, _ := (*nsd).RefLookUp.Load(ref)
if n != nil {
ns = n.(Namespace)
} else {
ns = Namespace("")
}
return ns
}
// String returns a print friendly representation of a namespace dictionary nsd.
func (nsd NamespaceDictionary) String() (s string) {
var refEntries, nameEntries []string
entries := []string{}
entry := make(chan string)
go func() {
nsd.RefLookUp.Range(func(k, v interface{}) bool {
entry <- fmt.Sprintf("\t%v: %v", k, v)
return true
})
close(entry)
}()
for entry := range entry {
entries = append(entries, entry)
}
refEntries = entries
entries = []string{}
entry = make(chan string)
go func() {
nsd.NameLookUp.Range(func(k, v interface{}) bool {
entry <- fmt.Sprintf("\t%v: %v", k, v)
return true
})
close(entry)
}()
for entry := range entry {
entries = append(entries, entry)
}
nameEntries = entries
refs := strings.Join(refEntries, ",\n")
if refs != "" {
refs = fmt.Sprintf("\n%s\n", refs)
}
names := strings.Join(nameEntries, ",\n")
if names != "" {
names = fmt.Sprintf("\n%s\n", names)
}
s = fmt.Sprintf("%s%s%s%s%s%s", "{", refs, "}", "{", names, "}")
return s
}
// NewFunctionBinding creates a binding between a reference to a namespace and a function.
func NewFunctionBinding() (fb FunctionBinding) {
b := new(sync.Map)
fb = FunctionBinding{Binding: b}
return fb
}
// Add a binding to fb between a namespace ref and function fun.
// Add returns true if the addition of the binding was successful, and false otherwise.
func (fb *FunctionBinding) Add(ref *Namespace, fun *Function) (status bool) {
_, exists := (*fb).Binding.LoadOrStore(ref, fun)
status = !exists
return status
}
// Remove a binding from fb given a namespace reference ref.
// Remove returns true if the removal of the binding was successful, and false otherwise.
func (fb *FunctionBinding) Remove(ref *Namespace) (status bool) {
_, exists := (*fb).Binding.Load(ref)
if exists {
(*fb).Binding.Delete(ref)
}
status = exists
return status
}
// Function returns a pointer to function fun given a namespace reference ref.
// Function returns nil if no function is a attached to the namespace reference ref.
func (fb *FunctionBinding) Function(ref *Namespace) (fun *Function) {
f, exists := (*fb).Binding.Load(ref)
if exists {
fun = f.(*Function)
} else {
fun = nil
}
return fun
}
// String returns a print friendly representation of a function binding fb.
func (fb FunctionBinding) String() (s string) {
entries := []string{}
entry := make(chan string)
go func() {
fb.Binding.Range(func(k, v interface{}) bool {
entry <- fmt.Sprintf("\t%v: %v", k, v)
return true
})
close(entry)
}()
for entry := range entry {
entries = append(entries, entry)
}
binding := strings.Join(entries, ",\n")
if binding != "" {
s = fmt.Sprintf("\n%s\n", binding)
}
s = fmt.Sprintf("%s%s%s", "{", s, "}")
return s
}
// NewLanguageBinding creates a two-way binding lb between two namespaces in two different languages.
func NewLanguageBinding() (lb LanguageBinding) {
ite := new(sync.Map)
eti := new(sync.Map)
lb = LanguageBinding{InternalToExternal: ite, ExternalToInternal: eti}
return lb
}
// Add will add a new language binding between two namespaces a and b.
// Add returns true if the addition of namespace ns was successful, and false otherwise.
func (lb *LanguageBinding) Add(a *Namespace, b *Namespace) (status bool) {
_, existsA := (*lb).InternalToExternal.LoadOrStore(a, b)
_, existsB := (*lb).ExternalToInternal.LoadOrStore(b, a)
status = !existsA && !existsB
return status
}
// RemoveInternal removes a binding for the internal namespace ns from the language bindings dictionary lb.
// RemoveInternal returns true if the removal of the binding namespace ns was successful, and false otherwise.
func (lb *LanguageBinding) RemoveInternal(ns *Namespace) (status bool) {
b, existsB := (*lb).InternalToExternal.Load(ns)
a, existsA := (*lb).ExternalToInternal.Load(b)
if existsA && existsB && ns == a {
(*lb).InternalToExternal.Delete(a)
(*lb).ExternalToInternal.Delete(b)
}
status = !existsA && !existsB && (ns == a)
return status
}
// External returns the external namespace reference exter given an internal namespace reference inter.
// External returns nil if the internal namespace reference inter could not be found.
func (lb *LanguageBinding) External(inter *Namespace) (exter *Namespace) {
b, existsB := (*lb).InternalToExternal.Load(inter)
a, existsA := (*lb).ExternalToInternal.Load(b)
if existsA && existsB && inter == a {
exter = b.(*Namespace)
} else {
exter = nil
}
return exter
}
// Internal returns the internal namespace reference a given an external namespace reference b.
// Internal returns nil if the internal namespace reference a could not be found.
func (lb *LanguageBinding) Internal(exter *Namespace) (inter *Namespace) {
a, existsA := (*lb).ExternalToInternal.Load(exter)
b, existsB := (*lb).InternalToExternal.Load(a)
if existsA && existsB && exter == b {
inter = a.(*Namespace)
} else {
inter = nil
}
return inter
}
// String returns a print friendly representation of a language binding lb.
func (lb LanguageBinding) String() (s string) {
var iteEntries, etiEntries []string
entries := []string{}
entry := make(chan string)
go func() {
lb.InternalToExternal.Range(func(k, v interface{}) bool {
entry <- fmt.Sprintf("\t%v: %v", k, v)
return true
})
close(entry)
}()
for entry := range entry {
entries = append(entries, entry)
}
iteEntries = entries
entries = []string{}
entry = make(chan string)
go func() {
lb.ExternalToInternal.Range(func(k, v interface{}) bool {
entry <- fmt.Sprintf("\t%v: %v", k, v)
return true
})
close(entry)
}()
for entry := range entry {
entries = append(entries, entry)
}
etiEntries = entries
ites := strings.Join(iteEntries, ",\n")
if ites != "" {
ites = fmt.Sprintf("\n%s\n", ites)
}
etis := strings.Join(etiEntries, ",\n")
if etis != "" {
etis = fmt.Sprintf("\n%s\n", etis)
}
s = fmt.Sprintf("%s%s%s%s%s%s", "{", ites, "}", "{", etis, "}")
return s
}
// GlobalRegistry is the global function registry used throughout the library.
var GlobalRegistry *Registry
// NewRegistry creates a function registry.
func NewRegistry() (fr Registry) {
nsd := NewNamespaceDictionary()
fb := NewFunctionBinding()
lb := NewLanguageBinding()
fr = Registry{NameDict: nsd, FuncBind: fb, LangBind: lb}
return fr
}
// Register performs a registring of function fun to function registry fr.
// Register returns true if registring of function fun was succesful, and false otherwise.
func (fr *Registry) Register(fun Function) (status bool) {
internal := internalNamespace(fun)
external := externalNamespace(fun)
addedInternal := (*fr).NameDict.Add(internal)
addedExternal := (*fr).NameDict.Add(external)
if addedInternal && addedExternal {
// Get the namespace references.
refInternal := (*fr).NameDict.Reference(internal)
refExternal := (*fr).NameDict.Reference(external)
// Bind the reference to a namespace to the reference of the function.
bound := (*fr).FuncBind.Add(refInternal, &fun)
// Create a language binding.
if bound {
status = (*fr).LangBind.Add(refInternal, refExternal)
}
}
return status
}
// Unregister performs a unregistring of function fun from function registry fr.
// Unregister returns true if unregistring of function fun was succesful, and false otherwise.
func (fr *Registry) Unregister(fun Function) (status bool) {
internal := internalNamespace(fun)
external := externalNamespace(fun)
refInternal := (*fr).NameDict.Reference(internal)
refExternal := (*fr).NameDict.Reference(external)
if refInternal != nil && refExternal != nil {
// Remove the namespace references.
(*fr).NameDict.Remove(internal)
(*fr).NameDict.Remove(external)
// Remove the binding the reference to a namespace to the reference of the function.
(*fr).FuncBind.Remove(refInternal)
// Remove the language binding.
(*fr).LangBind.RemoveInternal(refInternal)
}
status = refInternal != nil && refExternal != nil
return status
}
// Check performs a check if function fun is registered in function registry fr.
// Check returns true if function fun is registered, and false otherwise.
func (fr *Registry) Check(fun Function) (status bool) {
internal := internalNamespace(fun)
external := externalNamespace(fun)
refInternal := (*fr).NameDict.Reference(internal)
refExternal := (*fr).NameDict.Reference(external)
status = refInternal != nil && refExternal != nil
return status
}
// Encode returns a pointer to an external namespace ns for function fun.
// Encode returns nil if the function could not be encoded.
func (fr *Registry) Encode(fun Function) (exter *Namespace) {
fr.Register(fun)
internal := internalNamespace(fun)
refInternal := (*fr).NameDict.Reference(internal)
refExternal := (*fr).LangBind.External(refInternal)
if refExternal != nil {
refCopy := refExternal.DeepCopy()
exter = &refCopy
} else {
exter = nil
}
return exter
}
// Decode returns a function fun given an external namespace ns.
// Decode returns nil if the function could not be found.
func (fr *Registry) Decode(exter Namespace) (fun *Function) {
refExternal := (*fr).NameDict.Reference(exter)
refInternal := (*fr).LangBind.Internal(refExternal)
fun = (*fr).FuncBind.Function(refInternal)
return fun
}
// interalNamespace returns an internal namespace for a function fun.
func internalNamespace(fun Function) (s Namespace) {
funcName := strings.Replace(Name(fun), " ", "", -1)
funcSign := strings.Replace(Signature(fun), " ", "", -1)
s = Namespace(strings.Join([]string{funcName, ":", funcSign}, ""))
return s
}
// exteralNamespace returns an external namespace for a function fun.
func externalNamespace(fun Function) (s Namespace) {
funcName := strings.Replace(Name(fun), " ", "", -1)
funcSign := strings.Replace(Signature(fun), " ", "", -1)
reVersion := regexp.MustCompile("(\\d)\\.(\\d)(\\.(\\d))?")
goVersion := reVersion.FindString(runtime.Version())
s = Namespace(strings.Join([]string{"func", "://", "golang", ":", goVersion, "/", funcName, ":", funcSign}, ""))
return s
} | function/registry.go | 0.786828 | 0.492005 | registry.go | starcoder |
package slack
import (
"fmt"
"github.com/sbstjn/hanu"
)
/*
Contains some of the "gopher" bot's commands taken from the https://gophers.slack.com/messages/@gopher/.
*/
const gopherNewbieResourcesReply = `Here are some resources you should check out if you are learning / new to Go:
First you should take the language tour: http://tour.golang.org/
Then, you should visit:
- https://golang.org/doc/code.html to learn how to organize your Go workspace
- https://golang.org/doc/effective_go.html be more effective at writing Go
- https://golang.org/ref/spec learn more about the language itself
- https://golang.org/doc/#articles a lot more reading material
There are some awesome websites as well:
- https://blog.gopheracademy.com great resources for Gophers in general
- http://gotime.fm awesome weekly podcast of Go awesomeness
- https://gobyexample.com examples of how to do things in Go
- http://go-database-sql.org how to use SQL databases in Go
- https://dmitri.shuralyov.com/idiomatic-go tips on how to write more idiomatic Go code
- https://divan.github.io/posts/avoid_gotchas will help you avoid gotchas in Go
If you want to learn how to organize your Go project, make sure to read: https://medium.com/@benbjohnson/standard-package-layout-7cdbc8391fc1#.ds38va3pp.
Once you are accustomed to the language and syntax, you can read this series of articles for a walkthrough the various standard library packages: https://medium.com/go-walkthrough.
Finally, https://github.com/golang/go/wiki#learning-more-about-go will give a list of even more resources to learn Go`
// GopherNewbieResourcesCommand shows the newbie resources.
var GopherNewbieResourcesCommand = Command{
Name: "newbie resources",
Description: "get a list of newbie resources",
Handler: func(bot *Slack, c hanu.ConversationInterface) {
c.Reply(gopherNewbieResourcesReply)
},
}
const gopherRecommendedChannelsReply = `Here is a list of recommended channels:
- https://gophers.slack.com/archives/C2E74QX51 -> talk to the Go team about a certain CL
- https://gophers.slack.com/archives/C02A8LZKT -> for newbie resources
- https://gophers.slack.com/archives/C152YB9UZ -> for remote meetup
- https://gophers.slack.com/archives/C02FKRXAK -> for devops related discussions
- https://gophers.slack.com/archives/C04P1FVLT -> for security related discussions
- https://gophers.slack.com/archives/C02A3DRK6 -> tell the world about the thing you are working on
- https://gophers.slack.com/archives/C0VP8EF3R -> anything and everything performance related
- https://gophers.slack.com/archives/C2VU4UTFZ -> get real time udates from the merged CL for Go itself. For a currated list of important / interesting messages follow: https://twitter.com/golang_cls
- https://gophers.slack.com/archives/C0XDYGUN6 -> Go controlling your bbq grill? Yes, we have that
- https://gophers.slack.com/archives/C029WG6AM -> for code reviews
- https://gophers.slack.com/archives/C08786VLJ -> if you are interested in AWS
- https://gophers.slack.com/archives/C0F1752BB -> for the awesome live podcast
- https://gophers.slack.com/archives/C029WKFFW -> for jobs related to Go`
// GopherRecommendedChannelsCommand shows the recommended channels.
var GopherRecommendedChannelsCommand = Command{
Name: "recommended channels",
Description: "get a list of recommended channels",
Handler: func(bot *Slack, c hanu.ConversationInterface) {
c.Reply(gopherRecommendedChannelsReply)
},
}
const gopherDatabaseTutorialReply = `Here's how to work with database/sql in Go: http://go-database-sql.org/`
// GopherDatabaseTutorialCommand shows tuts about sql databases.
var GopherDatabaseTutorialCommand = Command{
Name: "database tutorial",
Description: "tutorial about using sql databases",
Handler: func(bot *Slack, c hanu.ConversationInterface) {
c.Reply(gopherDatabaseTutorialReply)
},
}
const gopherPackageLayoutReply = `These articles will explain how to organize your Go packages:
- https://rakyll.org/style-packages/
- https://medium.com/@benbjohnson/standard-package-layout-7cdbc8391fc1#.ds38va3pp
- https://peter.bourgon.org/go-best-practices-2016/#repository-structure
This article will help you understand the design philosophy for packages: https://www.goinggo.net/2017/02/design-philosophy-on-packaging.html`
// GopherPackageLayoutCommand shows how to structure your Go package.
var GopherPackageLayoutCommand = Command{
Name: "package layout",
Description: "learn how to structure your Go package",
Handler: func(bot *Slack, c hanu.ConversationInterface) {
c.Reply(gopherDatabaseTutorialReply)
},
}
var gopherLibraryForDynamicReply = func(searchTerm string) string {
return fmt.Sprintf("You can try to look here: https://godoc.org/?q=%s or here http://go-search.org/search?q=%s", searchTerm, searchTerm)
}
// GopherLibraryForCommand search a go package that matches <name>.
var GopherLibraryForCommand = Command{
Name: "library for <name>",
Description: "learn how to structure your Go package",
Handler: func(bot *Slack, c hanu.ConversationInterface) {
name, err := c.String("name")
if err != nil {
c.Reply("miss <name> ?")
return
}
c.Reply(gopherLibraryForDynamicReply(name))
},
} | slack/command_gopher.go | 0.715126 | 0.53437 | command_gopher.go | starcoder |
package matchers
import (
"errors"
"fmt"
"github.com/splitio/go-split-commons/dtos"
"github.com/splitio/go-toolkit/injection"
"github.com/splitio/go-toolkit/logging"
)
const (
// MatcherTypeAllKeys string value
MatcherTypeAllKeys = "ALL_KEYS"
// MatcherTypeInSegment string value
MatcherTypeInSegment = "IN_SEGMENT"
// MatcherTypeWhitelist string value
MatcherTypeWhitelist = "WHITELIST"
// MatcherTypeEqualTo string value
MatcherTypeEqualTo = "EQUAL_TO"
// MatcherTypeGreaterThanOrEqualTo string value
MatcherTypeGreaterThanOrEqualTo = "GREATER_THAN_OR_EQUAL_TO"
// MatcherTypeLessThanOrEqualTo string value
MatcherTypeLessThanOrEqualTo = "LESS_THAN_OR_EQUAL_TO"
// MatcherTypeBetween string value
MatcherTypeBetween = "BETWEEN"
// MatcherTypeEqualToSet string value
MatcherTypeEqualToSet = "EQUAL_TO_SET"
// MatcherTypePartOfSet string value
MatcherTypePartOfSet = "PART_OF_SET"
// MatcherTypeContainsAllOfSet string value
MatcherTypeContainsAllOfSet = "CONTAINS_ALL_OF_SET"
// MatcherTypeContainsAnyOfSet string value
MatcherTypeContainsAnyOfSet = "CONTAINS_ANY_OF_SET"
// MatcherTypeStartsWith string value
MatcherTypeStartsWith = "STARTS_WITH"
// MatcherTypeEndsWith string value
MatcherTypeEndsWith = "ENDS_WITH"
// MatcherTypeContainsString string value
MatcherTypeContainsString = "CONTAINS_STRING"
// MatcherTypeInSplitTreatment string value
MatcherTypeInSplitTreatment = "IN_SPLIT_TREATMENT"
// MatcherTypeEqualToBoolean string value
MatcherTypeEqualToBoolean = "EQUAL_TO_BOOLEAN"
// MatcherTypeMatchesString string value
MatcherTypeMatchesString = "MATCHES_STRING"
)
// MatcherInterface should be implemented by all matchers
type MatcherInterface interface {
Match(key string, attributes map[string]interface{}, bucketingKey *string) bool
Negate() bool
base() *Matcher // This method is used to return the embedded matcher when iterating over interfaces
matchingKey(key string, attributes map[string]interface{}) (interface{}, error)
}
// Matcher struct with added logic that wraps around a DTO
type Matcher struct {
*injection.Context
negate bool
attributeName *string
logger logging.LoggerInterface
}
// Negate returns whether this mather is negated or not
func (m *Matcher) Negate() bool {
return m.negate
}
func (m *Matcher) matchingKey(key string, attributes map[string]interface{}) (interface{}, error) {
if m.attributeName == nil {
return key, nil
}
// Reaching this point means WE NEED attributes
if attributes == nil {
return nil, errors.New("Attribute required but no attributes provided")
}
attrValue, found := attributes[*m.attributeName]
if !found {
return nil, fmt.Errorf(
"Attribute \"%s\" required but not present in provided attribute map",
*m.attributeName,
)
}
return attrValue, nil
}
// matcher returns the matcher instance embbeded in structs
func (m *Matcher) base() *Matcher {
return m
}
// BuildMatcher constructs the appropriate matcher based on the MatcherType attribute of the dto
func BuildMatcher(dto *dtos.MatcherDTO, ctx *injection.Context, logger logging.LoggerInterface) (MatcherInterface, error) {
var matcher MatcherInterface
var attributeName *string
if dto.KeySelector != nil {
attributeName = dto.KeySelector.Attribute
}
switch dto.MatcherType {
case MatcherTypeAllKeys:
logger.Debug(fmt.Sprintf("Building AllKeysMatcher with negate=%t", dto.Negate))
matcher = NewAllKeysMatcher(dto.Negate)
case MatcherTypeEqualTo:
if dto.UnaryNumeric == nil {
return nil, errors.New("UnaryNumeric is required for EQUAL_TO matcher type")
}
logger.Debug(fmt.Sprintf(
"Building EqualToMatcher with negate=%t, value=%d, type=%s, attributeName=%v",
dto.Negate, dto.UnaryNumeric.Value, dto.UnaryNumeric.DataType, attributeName,
))
matcher = NewEqualToMatcher(
dto.Negate,
dto.UnaryNumeric.Value,
dto.UnaryNumeric.DataType,
attributeName,
)
case MatcherTypeInSegment:
if dto.UserDefinedSegment == nil {
return nil, errors.New("UserDefinedSegment is required for IN_SEGMENT matcher type")
}
logger.Debug(fmt.Sprintf(
"Building InSegmentMatcher with negate=%t, segmentName=%s, attributeName=%v",
dto.Negate, dto.UserDefinedSegment.SegmentName, attributeName,
))
matcher = NewInSegmentMatcher(
dto.Negate,
dto.UserDefinedSegment.SegmentName,
attributeName,
)
case MatcherTypeWhitelist:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for WHITELIST matcher type")
}
logger.Debug(fmt.Sprintf(
"Building WhitelistMatcher with negate=%t, whitelist=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewWhitelistMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypeGreaterThanOrEqualTo:
if dto.UnaryNumeric == nil {
return nil, errors.New("UnaryNumeric is required for GREATER_THAN_OR_EQUAL_TO matcher type")
}
logger.Debug(fmt.Sprintf(
"Building GreaterThanOrEqualToMatcher with negate=%t, value=%d, type=%s, attributeName=%v",
dto.Negate, dto.UnaryNumeric.Value, dto.UnaryNumeric.DataType, attributeName,
))
matcher = NewGreaterThanOrEqualToMatcher(
dto.Negate,
dto.UnaryNumeric.Value,
dto.UnaryNumeric.DataType,
attributeName,
)
case MatcherTypeLessThanOrEqualTo:
if dto.UnaryNumeric == nil {
return nil, errors.New("UnaryNumeric is required for LESS_THAN_OR_EQUAL_TO matcher type")
}
logger.Debug(fmt.Sprintf(
"Building LessThanOrEqualToMatcher with negate=%t, value=%d, type=%s, attributeName=%v",
dto.Negate, dto.UnaryNumeric.Value, dto.UnaryNumeric.DataType, attributeName,
))
matcher = NewLessThanOrEqualToMatcher(
dto.Negate,
dto.UnaryNumeric.Value,
dto.UnaryNumeric.DataType,
attributeName,
)
case MatcherTypeBetween:
if dto.Between == nil {
return nil, errors.New("Between is required for BETWEEN matcher type")
}
logger.Debug(fmt.Sprintf(
"Building BetweenMatcher with negate=%t, start=%d, end=%d, type=%s, attributeName=%v",
dto.Negate, dto.Between.Start, dto.Between.End, dto.Between.DataType, attributeName,
))
matcher = NewBetweenMatcher(
dto.Negate,
dto.Between.Start,
dto.Between.End,
dto.Between.DataType,
attributeName,
)
case MatcherTypeEqualToSet:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for EQUAL_TO_SET matcher type")
}
logger.Debug(fmt.Sprintf(
"Building EqualToSetMatcher with negate=%t, set=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewEqualToSetMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypePartOfSet:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for PART_OF_SET matcher type")
}
logger.Debug(fmt.Sprintf(
"Building PartOfSetMatcher with negate=%t, set=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewPartOfSetMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypeContainsAllOfSet:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for CONTAINS_ALL_OF_SET matcher type")
}
logger.Debug(fmt.Sprintf(
"Building AllOfSetMatcher with negate=%t, set=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewContainsAllOfSetMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypeContainsAnyOfSet:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for CONTAINS_ANY_OF_SET matcher type")
}
logger.Debug(fmt.Sprintf(
"Building AnyOfSetMatcher with negate=%t, set=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewContainsAnyOfSetMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypeStartsWith:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for STARTS_WITH matcher type")
}
logger.Debug(fmt.Sprintf(
"Building StartsWithMatcher with negate=%t, set=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewStartsWithMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypeEndsWith:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for ENDS_WITH matcher type")
}
logger.Debug(fmt.Sprintf(
"Building EndsWithMatcher with negate=%t, set=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewEndsWithMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypeContainsString:
if dto.Whitelist == nil {
return nil, errors.New("Whitelist is required for CONTAINS_STRING matcher type")
}
logger.Debug(fmt.Sprintf(
"Building ContainsStringMatcher with negate=%t, set=%v, attributeName=%v",
dto.Negate, dto.Whitelist.Whitelist, attributeName,
))
matcher = NewContainsStringMatcher(
dto.Negate,
dto.Whitelist.Whitelist,
attributeName,
)
case MatcherTypeInSplitTreatment:
if dto.Dependency == nil {
return nil, errors.New("Dependency is required for IN_SPLIT_TREATMENT matcher type")
}
logger.Debug(fmt.Sprintf(
"Building DependencyMatcher with negate=%t, feature=%s, treatments=%v, attributeName=%v",
dto.Negate, dto.Dependency.Split, dto.Dependency.Treatments, attributeName,
))
matcher = NewDependencyMatcher(
dto.Negate,
dto.Dependency.Split,
dto.Dependency.Treatments,
)
case MatcherTypeEqualToBoolean:
if dto.Boolean == nil {
return nil, errors.New("Boolean is required for EQUAL_TO_BOOLEAN matcher type")
}
logger.Debug(fmt.Sprintf(
"Building BooleanMatcher with negate=%t, value=%t, attributeName=%v",
dto.Negate, *dto.Boolean, attributeName,
))
matcher = NewBooleanMatcher(
dto.Negate,
dto.Boolean,
attributeName,
)
case MatcherTypeMatchesString:
if dto.String == nil {
return nil, errors.New("String is required for MATCHES_STRING matcher type")
}
logger.Debug(fmt.Sprintf(
"Building RegexMatcher with negate=%t, regex=%s, attributeName=%v",
dto.Negate, *dto.String, attributeName,
))
matcher = NewRegexMatcher(
dto.Negate,
*dto.String,
attributeName,
)
default:
return nil, errors.New("Matcher not found")
}
if ctx != nil {
ctx.Inject(matcher.base())
}
matcher.base().logger = logger
return matcher, nil
} | splitio/engine/grammar/matchers/matchers.go | 0.599368 | 0.428831 | matchers.go | starcoder |
package ledgerstate
import (
"fmt"
"github.com/iotaledger/hive.go/cerrors"
"github.com/iotaledger/hive.go/marshalutil"
"golang.org/x/xerrors"
)
const (
// Pending represents the state of Transactions and Branches that have not been assigned a final state regarding
// their inclusion in the ledger state.
Pending InclusionState = iota
// Confirmed represents the state of Transactions and Branches that have been accepted to be part of the ledger
// state.
Confirmed
// Rejected represents the state of Transactions and Branches that have been rejected to be part of the ledger
// state.
Rejected
)
// InclusionState represents a type that encodes if a Transaction or Branch has been included in the ledger state.
type InclusionState uint8
// InclusionStateFromBytes unmarshals an InclusionState from a sequence of bytes.
func InclusionStateFromBytes(inclusionStateBytes []byte) (inclusionState InclusionState, consumedBytes int, err error) {
marshalUtil := marshalutil.New(inclusionStateBytes)
if inclusionState, err = InclusionStateFromMarshalUtil(marshalUtil); err != nil {
err = xerrors.Errorf("failed to parse InclusionState from MarshalUtil: %w", err)
}
consumedBytes = marshalUtil.ReadOffset()
return
}
// InclusionStateFromMarshalUtil unmarshals an InclusionState using a MarshalUtil (for easier unmarshaling).
func InclusionStateFromMarshalUtil(marshalUtil *marshalutil.MarshalUtil) (inclusionState InclusionState, err error) {
inclusionStateUint8, err := marshalUtil.ReadUint8()
if err != nil {
err = xerrors.Errorf("failed to parse InclusionState (%v): %w", err, cerrors.ErrParseBytesFailed)
return
}
switch inclusionState = InclusionState(inclusionStateUint8); inclusionState {
case Pending:
case Confirmed:
case Rejected:
default:
err = xerrors.Errorf("unsupported InclusionState (%X): %w", inclusionStateUint8, cerrors.ErrParseBytesFailed)
return
}
return
}
// Bytes returns a marshaled version of the InclusionState.
func (i InclusionState) Bytes() []byte {
return []byte{byte(i)}
}
// String returns a human readable version of the InclusionState.
func (i InclusionState) String() string {
inclusionStateNames := [...]string{
"Pending",
"Confirmed",
"Rejected",
}
if int(i) > len(inclusionStateNames) {
return fmt.Sprintf("InclusionState(%X)", byte(i))
}
return "InclusionState(" + inclusionStateNames[i] + ")"
} | packages/ledgerstate/inclusion_state.go | 0.70477 | 0.414247 | inclusion_state.go | starcoder |
package state
import (
"math/big"
"github.com/hyperledger/burrow/genesis"
"github.com/hyperledger/burrow/acm/validator"
"github.com/hyperledger/burrow/storage"
"github.com/hyperledger/burrow/crypto"
)
// Initialises the validator Ring from the validator storage in forest
func LoadValidatorRing(version int64, ringSize int,
getImmutable func(version int64) (*storage.ImmutableForest, error)) (*validator.Ring, error) {
// In this method we have to page through previous version of the tree in order to reconstruct the in-memory
// ring structure. The corner cases are a little subtle but printing the buckets helps
// The basic idea is to load each version of the tree ringSize back, work out the difference that must have occurred
// between each bucket in the ring, and apply each diff to the ring. Once the ring is full it is symmetrical (up to
// a reindexing). If we are loading a chain whose height is less than the ring size we need to get the initial state
// correct
startVersion := version - int64(ringSize)
if startVersion < 1 {
// The ring will not be fully populated
startVersion = 1
}
var err error
// Read state to pull immutable forests from
rs := &ReadState{}
// Start with an empty ring - we want the initial bucket to have no cumulative power
ring := validator.NewRing(nil, ringSize)
// Load the IAVL state
rs.Forest, err = getImmutable(startVersion)
// Write the validator state at startVersion from IAVL tree into the ring's current bucket delta
err = validator.Write(ring, rs)
if err != nil {
return nil, err
}
// Rotate, now we have [ {bucket 0: cum: {}, delta: {start version changes} }, {bucket 1: cum: {start version changes}, delta {}, ... ]
// which is what we need (in particular we need this initial state if we are loading into a incompletely populated ring
_, _, err = ring.Rotate()
if err != nil {
return nil, err
}
// Rebuild validator Ring
for v := startVersion + 1; v <= version; v++ {
// Update IAVL read state to version of interest
rs.Forest, err = getImmutable(v)
if err != nil {
return nil, err
}
// Calculate the difference between the rings current cum and what is in state at this version
diff, err := validator.Diff(ring.CurrentSet(), rs)
if err != nil {
return nil, err
}
// Write that diff into the ring (just like it was when it was originally written to setPower)
err = validator.Write(ring, diff)
if err != nil {
return nil, err
}
// Rotate just like it was on the original commit
_, _, err = ring.Rotate()
if err != nil {
return nil, err
}
}
// Our ring should be the same up to symmetry in its index so we reindex to regain equality with the version we are loading
// This is the head index we would have had if we had started from version 1 like the chain did
ring.ReIndex(int(version % int64(ringSize)))
return ring, err
}
func (ws *writeState) MakeGenesisValidators(genesisDoc *genesis.GenesisDoc) error {
for _, gv := range genesisDoc.Validators {
err := ws.SetPower(gv.PublicKey, new(big.Int).SetUint64(gv.Amount))
if err != nil {
return err
}
}
return nil
}
func (s *ReadState) Power(id crypto.Address) (*big.Int, error) {
tree, err := s.Forest.Reader(keys.Validator.Prefix())
if err != nil {
return nil, err
}
bs := tree.Get(keys.Validator.KeyNoPrefix(id))
if len(bs) == 0 {
return new(big.Int), nil
}
v, err := validator.Decode(bs)
if err != nil {
return nil, err
}
return v.BigPower(), nil
}
func (s *ReadState) IterateValidators(fn func(id crypto.Addressable, power *big.Int) error) error {
tree, err := s.Forest.Reader(keys.Validator.Prefix())
if err != nil {
return err
}
return tree.Iterate(nil, nil, true, func(_, value []byte) error {
v, err := validator.Decode(value)
if err != nil {
return err
}
return fn(v, v.BigPower())
})
}
func (ws *writeState) AlterPower(id crypto.PublicKey, power *big.Int) (*big.Int, error) {
// AlterPower in ring
flow, err := ws.ring.AlterPower(id, power)
if err != nil {
return nil, err
}
// Set power in versioned state
return flow, ws.setPower(id, power)
}
func (ws *writeState) SetPower(id crypto.PublicKey, power *big.Int) error {
// SetPower in ring
err := ws.ring.SetPower(id, power)
if err != nil {
return err
}
// Set power in versioned state
return ws.setPower(id, power)
}
func (ws *writeState) setPower(id crypto.PublicKey, power *big.Int) error {
tree, err := ws.forest.Writer(keys.Validator.Prefix())
if err != nil {
return err
}
key := keys.Validator.KeyNoPrefix(id.GetAddress())
if power.Sign() == 0 {
tree.Delete(key)
return nil
}
v := validator.New(id, power)
bs, err := v.Encode()
if err != nil {
return err
}
tree.Set(key, bs)
return nil
} | execution/state/validators.go | 0.646237 | 0.426441 | validators.go | starcoder |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.