This file is indexed.

/usr/share/gocode/src/thrift/tset.go is in golang-thrift-dev 0.0~git20121118-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements. See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership. The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License. You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied. See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */

package thrift

import (
	"bytes"
	"container/list"
)

/**
 * Helper class that encapsulates set metadata.
 *
 * Note that sets of structs requires pointers, not struct values.
 */
type TSet interface {
	TContainer
	ElemType() TType
	Add(data interface{})
	Remove(data interface{})
	Less(other interface{}) bool
	Front() *list.Element
	Back() *list.Element
	Values() []interface{}
}

type tSet struct {
	elemType TType
	size     int
	l        *list.List
}

func NewTSet(t TType, s int) TSet {
	return &tSet{elemType: t, size: s, l: list.New()}
}

func NewTSetDefault() TSet {
	return NewTSet(STOP, 0)
}

func (p *tSet) ElemType() TType {
	return p.elemType
}

func (p *tSet) Front() *list.Element {
	return p.l.Front()
}

func (p *tSet) Back() *list.Element {
	return p.l.Back()
}

func (p *tSet) Len() int {
	if p.l.Len() != 0 {
		return p.l.Len()
	}
	return p.size
}

func (p *tSet) Contains(data interface{}) bool {
	return p.find(data) != nil
}

func (p *tSet) Add(other interface{}) {
	if data, ok := p.elemType.CoerceData(other); ok {
		if p.l.Front() == nil {
			p.l.PushFront(data)
		} else {
			for elem := p.l.Front(); elem != nil; elem = elem.Next() {
				if cmp, ok := p.elemType.Compare(data, elem.Value); ok && cmp >= 0 {
					if cmp > 0 {
						p.l.InsertBefore(data, elem)
					}
					return
				}
			}
		}
	}
}

func (p *tSet) Remove(data interface{}) {
	elem := p.find(data)
	if elem != nil {
		p.l.Remove(elem)
	}
}

func (p *tSet) Less(other interface{}) bool {
	cmp, ok := p.CompareTo(other)
	return ok && cmp > 0
}

func (p *tSet) Equals(other interface{}) bool {
	c, cok := p.CompareTo(other)
	return cok && c == 0
}

func (p *tSet) CompareTo(other interface{}) (int, bool) {
	return TType(SET).Compare(p, other)
}

func (p *tSet) find(data interface{}) *list.Element {
	if data == nil {
		for elem := p.l.Front(); elem != nil; elem = elem.Next() {
			if elem.Value == nil {
				return elem
			}
		}
		return nil
	}
	data, ok := p.elemType.CoerceData(data)
	if data == nil || !ok {
		return nil
	}
	if p.elemType == BINARY {
		for elem := p.l.Front(); elem != nil; elem = elem.Next() {
			if bytes.Compare(data.([]byte), elem.Value.([]byte)) == 0 {
				return elem
			}
		}
		return nil
	}
	if p.elemType.IsBaseType() || p.elemType.IsEnum() {
		for elem := p.l.Front(); elem != nil; elem = elem.Next() {
			if data == elem.Value {
				return elem
			}
		}
		return nil
	}
	if cmp, ok := data.(EqualsOtherInterface); ok {
		for elem := p.l.Front(); elem != nil; elem = elem.Next() {
			if cmp.Equals(elem.Value) {
				return elem
			}
		}
		return nil
	}
	switch p.elemType {
	case MAP:
		if cmp, ok := data.(EqualsMap); ok {
			for elem := p.l.Front(); elem != nil; elem = elem.Next() {
				v := elem.Value
				if v == nil {
					continue
				}
				if cmp.Equals(v.(TMap)) {
					return elem
				}
			}
			return nil
		}
	case SET:
		if cmp, ok := data.(EqualsSet); ok {
			for elem := p.l.Front(); elem != nil; elem = elem.Next() {
				v := elem.Value
				if v == nil {
					continue
				}
				if cmp.Equals(v.(TSet)) {
					return elem
				}
			}
			return nil
		}
	case LIST:
		if cmp, ok := data.(EqualsList); ok {
			for elem := p.l.Front(); elem != nil; elem = elem.Next() {
				v := elem.Value
				if v == nil {
					continue
				}
				if cmp.Equals(v.(TList)) {
					return elem
				}
			}
			return nil
		}
	case STRUCT:
		if cmp, ok := data.(EqualsStruct); ok {
			for elem := p.l.Front(); elem != nil; elem = elem.Next() {
				v := elem.Value
				if v == nil {
					continue
				}
				if cmp.Equals(v.(TStruct)) {
					return elem
				}
			}
			return nil
		}
	}
	return nil
}

func (p *tSet) Values() []interface{} {
	size := p.l.Len()
	values := make([]interface{}, size, size)
	i := 0
	for v := p.l.Front(); v != nil; v = v.Next() {
		values[i] = v.Value
		i++
	}
	return values
}