wader/fq
1
1
Fork 0
mirror of https://github.com/wader/fq.git synced 2024-11-29 23:27:12 +03:00
Code Issues Projects Releases Wiki Activity

decode: unexport methods

Browse Source
This commit is contained in:
David McDonald 2022-12-13 00:47:58 -06:00
parent f747873dbc
commit 7fb674b532
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
format/bplist/bplist.go
View File

@ -187,11 +187,11 @@ func decodeItem(d *decode.D, p *plist) bool {
type indexStack []uint64
func (i *indexStack) Pop() {
func (i *indexStack) pop() {
*i = (*i)[:len(*i)-1]
}
func (i *indexStack) Push(idx uint64, handler func()) {
func (i *indexStack) push(idx uint64, handler func()) {
for _, v := range *i {
if v == idx {
handler()
@ -200,9 +200,9 @@ func (i *indexStack) Push(idx uint64, handler func()) {
*i = append(*i, idx)
}
func (i *indexStack) PushAndPop(idx uint64, handler func()) func() {
i.Push(idx, handler)
return i.Pop
func (i *indexStack) pushAndPop(idx uint64, handler func()) func() {
i.push(idx, handler)
return i.pop
}
// decodeReference looks up and decodes an object based on its index in the
@ -216,7 +216,7 @@ func (pl *plist) decodeReference(d *decode.D, idx uint64) bool {
}
pl.consumed[idx] = true
defer pl.idxStack.PushAndPop(idx, func() { d.Fatalf("infinite recursion detected") })()
defer pl.idxStack.pushAndPop(idx, func() { d.Fatalf("infinite recursion detected") })()
itemOffset := pl.o[idx]
if itemOffset >= pl.t.offsetTableStart {
@ -298,8 +298,8 @@ func bplistDecode(d *decode.D, _ any) any {
i := 0
d.FieldStructArrayLoop("lost_and_found", "entry",
func() bool { return i < len(lost) },
d.FieldStructNArray("lost_and_found", "entry",
int64(len(lost)),
func(d *decode.D) {
p.decodeReference(d, lost[i])
i++