ldsch_satisfaction.go 92.5 KB
Newer Older
1 2
package dagpb

3
// Code generated by go-ld-prime gengo.  DO NOT EDIT.
4 5

import (
6 7 8
	ld "gitlab.dms3.io/ld/go-ld-prime"
	"gitlab.dms3.io/ld/go-ld-prime/node/mixins"
	"gitlab.dms3.io/ld/go-ld-prime/schema"
9 10 11 12 13 14 15 16 17
)

func (n Bytes) Bytes() []byte {
	return n.x
}
func (_Bytes__Prototype) FromBytes(v []byte) (Bytes, error) {
	n := _Bytes{v}
	return &n, nil
}
18

19 20
type _Bytes__Maybe struct {
	m schema.Maybe
21
	v _Bytes
22 23 24 25 26 27 28 29 30 31 32 33
}
type MaybeBytes = *_Bytes__Maybe

func (m MaybeBytes) IsNull() bool {
	return m.m == schema.Maybe_Null
}
func (m MaybeBytes) IsAbsent() bool {
	return m.m == schema.Maybe_Absent
}
func (m MaybeBytes) Exists() bool {
	return m.m == schema.Maybe_Value
}
34
func (m MaybeBytes) AsNode() ld.Node {
35
	switch m.m {
36
	case schema.Maybe_Absent:
37
		return ld.Absent
38
	case schema.Maybe_Null:
39
		return ld.Null
40 41 42 43
	case schema.Maybe_Value:
		return &m.v
	default:
		panic("unreachable")
44 45 46 47 48 49
	}
}
func (m MaybeBytes) Must() Bytes {
	if !m.Exists() {
		panic("unbox of a maybe rejected")
	}
50
	return &m.v
51
}
52

53
var _ ld.Node = (Bytes)(&_Bytes{})
54
var _ schema.TypedNode = (Bytes)(&_Bytes{})
55

56 57
func (Bytes) Kind() ld.Kind {
	return ld.Kind_Bytes
58
}
59
func (Bytes) LookupByString(string) (ld.Node, error) {
60
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.LookupByString("")
61
}
62
func (Bytes) LookupByNode(ld.Node) (ld.Node, error) {
63
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.LookupByNode(nil)
64
}
65
func (Bytes) LookupByIndex(idx int64) (ld.Node, error) {
66
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.LookupByIndex(0)
67
}
68
func (Bytes) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
69
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.LookupBySegment(seg)
70
}
71
func (Bytes) MapIterator() ld.MapIterator {
72 73
	return nil
}
74
func (Bytes) ListIterator() ld.ListIterator {
75 76
	return nil
}
77
func (Bytes) Length() int64 {
78 79 80 81 82 83 84 85 86
	return -1
}
func (Bytes) IsAbsent() bool {
	return false
}
func (Bytes) IsNull() bool {
	return false
}
func (Bytes) AsBool() (bool, error) {
87
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.AsBool()
88
}
89
func (Bytes) AsInt() (int64, error) {
90
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.AsInt()
91 92
}
func (Bytes) AsFloat() (float64, error) {
93
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.AsFloat()
94 95
}
func (Bytes) AsString() (string, error) {
96
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.AsString()
97 98 99 100
}
func (n Bytes) AsBytes() ([]byte, error) {
	return n.x, nil
}
101
func (Bytes) AsLink() (ld.Link, error) {
102
	return mixins.Bytes{TypeName: "dagpb.Bytes"}.AsLink()
103
}
104
func (Bytes) Prototype() ld.NodePrototype {
105 106
	return _Bytes__Prototype{}
}
107

108 109
type _Bytes__Prototype struct{}

110
func (_Bytes__Prototype) NewBuilder() ld.NodeBuilder {
111 112 113 114
	var nb _Bytes__Builder
	nb.Reset()
	return &nb
}
115

116 117 118
type _Bytes__Builder struct {
	_Bytes__Assembler
}
119

120
func (nb *_Bytes__Builder) Build() ld.Node {
121 122 123 124 125 126 127 128 129 130
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_Bytes__Builder) Reset() {
	var w _Bytes
	var m schema.Maybe
	*nb = _Bytes__Builder{_Bytes__Assembler{w: &w, m: &m}}
}
131

132 133 134 135 136 137
type _Bytes__Assembler struct {
	w *_Bytes
	m *schema.Maybe
}

func (na *_Bytes__Assembler) reset() {}
138
func (_Bytes__Assembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
139
	return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.BeginMap(0)
140
}
141
func (_Bytes__Assembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
142
	return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.BeginList(0)
143 144 145 146 147 148 149
}
func (na *_Bytes__Assembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
150
		return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.AssignNull()
151 152 153 154 155 156
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	panic("unreachable")
}
func (_Bytes__Assembler) AssignBool(bool) error {
157
	return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.AssignBool(false)
158
}
159
func (_Bytes__Assembler) AssignInt(int64) error {
160
	return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.AssignInt(0)
161 162
}
func (_Bytes__Assembler) AssignFloat(float64) error {
163
	return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.AssignFloat(0)
164 165
}
func (_Bytes__Assembler) AssignString(string) error {
166
	return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.AssignString("")
167 168 169 170 171 172 173 174 175 176
}
func (na *_Bytes__Assembler) AssignBytes(v []byte) error {
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	na.w.x = v
	*na.m = schema.Maybe_Value
	return nil
}
177
func (_Bytes__Assembler) AssignLink(ld.Link) error {
178
	return mixins.BytesAssembler{TypeName: "dagpb.Bytes"}.AssignLink(nil)
179
}
180
func (na *_Bytes__Assembler) AssignNode(v ld.Node) error {
181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_Bytes); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
	if v2, err := v.AsBytes(); err != nil {
		return err
	} else {
		return na.AssignBytes(v2)
	}
}
199
func (_Bytes__Assembler) Prototype() ld.NodePrototype {
200 201 202 203 204
	return _Bytes__Prototype{}
}
func (Bytes) Type() schema.Type {
	return nil /*TODO:typelit*/
}
205
func (n Bytes) Representation() ld.Node {
206 207
	return (*_Bytes__Repr)(n)
}
208

209
type _Bytes__Repr = _Bytes
210

211
var _ ld.Node = &_Bytes__Repr{}
212

213 214 215
type _Bytes__ReprPrototype = _Bytes__Prototype
type _Bytes__ReprAssembler = _Bytes__Assembler

216
func (n Int) Int() int64 {
217 218
	return n.x
}
219
func (_Int__Prototype) FromInt(v int64) (Int, error) {
220 221 222
	n := _Int{v}
	return &n, nil
}
223

224 225
type _Int__Maybe struct {
	m schema.Maybe
226
	v _Int
227 228 229 230 231 232 233 234 235 236 237 238
}
type MaybeInt = *_Int__Maybe

func (m MaybeInt) IsNull() bool {
	return m.m == schema.Maybe_Null
}
func (m MaybeInt) IsAbsent() bool {
	return m.m == schema.Maybe_Absent
}
func (m MaybeInt) Exists() bool {
	return m.m == schema.Maybe_Value
}
239
func (m MaybeInt) AsNode() ld.Node {
240
	switch m.m {
241
	case schema.Maybe_Absent:
242
		return ld.Absent
243
	case schema.Maybe_Null:
244
		return ld.Null
245 246 247 248
	case schema.Maybe_Value:
		return &m.v
	default:
		panic("unreachable")
249 250 251 252 253 254
	}
}
func (m MaybeInt) Must() Int {
	if !m.Exists() {
		panic("unbox of a maybe rejected")
	}
255
	return &m.v
256
}
257

258
var _ ld.Node = (Int)(&_Int{})
259
var _ schema.TypedNode = (Int)(&_Int{})
260

261 262
func (Int) Kind() ld.Kind {
	return ld.Kind_Int
263
}
264
func (Int) LookupByString(string) (ld.Node, error) {
265
	return mixins.Int{TypeName: "dagpb.Int"}.LookupByString("")
266
}
267
func (Int) LookupByNode(ld.Node) (ld.Node, error) {
268
	return mixins.Int{TypeName: "dagpb.Int"}.LookupByNode(nil)
269
}
270
func (Int) LookupByIndex(idx int64) (ld.Node, error) {
271
	return mixins.Int{TypeName: "dagpb.Int"}.LookupByIndex(0)
272
}
273
func (Int) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
274
	return mixins.Int{TypeName: "dagpb.Int"}.LookupBySegment(seg)
275
}
276
func (Int) MapIterator() ld.MapIterator {
277 278
	return nil
}
279
func (Int) ListIterator() ld.ListIterator {
280 281
	return nil
}
282
func (Int) Length() int64 {
283 284 285 286 287 288 289 290 291
	return -1
}
func (Int) IsAbsent() bool {
	return false
}
func (Int) IsNull() bool {
	return false
}
func (Int) AsBool() (bool, error) {
292
	return mixins.Int{TypeName: "dagpb.Int"}.AsBool()
293
}
294
func (n Int) AsInt() (int64, error) {
295 296 297
	return n.x, nil
}
func (Int) AsFloat() (float64, error) {
298
	return mixins.Int{TypeName: "dagpb.Int"}.AsFloat()
299 300
}
func (Int) AsString() (string, error) {
301
	return mixins.Int{TypeName: "dagpb.Int"}.AsString()
302 303
}
func (Int) AsBytes() ([]byte, error) {
304
	return mixins.Int{TypeName: "dagpb.Int"}.AsBytes()
305
}
306
func (Int) AsLink() (ld.Link, error) {
307
	return mixins.Int{TypeName: "dagpb.Int"}.AsLink()
308
}
309
func (Int) Prototype() ld.NodePrototype {
310 311
	return _Int__Prototype{}
}
312

313 314
type _Int__Prototype struct{}

315
func (_Int__Prototype) NewBuilder() ld.NodeBuilder {
316 317 318 319
	var nb _Int__Builder
	nb.Reset()
	return &nb
}
320

321 322 323
type _Int__Builder struct {
	_Int__Assembler
}
324

325
func (nb *_Int__Builder) Build() ld.Node {
326 327 328 329 330 331 332 333 334 335
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_Int__Builder) Reset() {
	var w _Int
	var m schema.Maybe
	*nb = _Int__Builder{_Int__Assembler{w: &w, m: &m}}
}
336

337 338 339 340 341 342
type _Int__Assembler struct {
	w *_Int
	m *schema.Maybe
}

func (na *_Int__Assembler) reset() {}
343
func (_Int__Assembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
344
	return mixins.IntAssembler{TypeName: "dagpb.Int"}.BeginMap(0)
345
}
346
func (_Int__Assembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
347
	return mixins.IntAssembler{TypeName: "dagpb.Int"}.BeginList(0)
348 349 350 351 352 353 354
}
func (na *_Int__Assembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
355
		return mixins.IntAssembler{TypeName: "dagpb.Int"}.AssignNull()
356 357 358 359 360 361
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	panic("unreachable")
}
func (_Int__Assembler) AssignBool(bool) error {
362
	return mixins.IntAssembler{TypeName: "dagpb.Int"}.AssignBool(false)
363
}
364
func (na *_Int__Assembler) AssignInt(v int64) error {
365 366 367 368 369 370 371 372 373
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	na.w.x = v
	*na.m = schema.Maybe_Value
	return nil
}
func (_Int__Assembler) AssignFloat(float64) error {
374
	return mixins.IntAssembler{TypeName: "dagpb.Int"}.AssignFloat(0)
375 376
}
func (_Int__Assembler) AssignString(string) error {
377
	return mixins.IntAssembler{TypeName: "dagpb.Int"}.AssignString("")
378 379
}
func (_Int__Assembler) AssignBytes([]byte) error {
380
	return mixins.IntAssembler{TypeName: "dagpb.Int"}.AssignBytes(nil)
381
}
382
func (_Int__Assembler) AssignLink(ld.Link) error {
383
	return mixins.IntAssembler{TypeName: "dagpb.Int"}.AssignLink(nil)
384
}
385
func (na *_Int__Assembler) AssignNode(v ld.Node) error {
386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_Int); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
	if v2, err := v.AsInt(); err != nil {
		return err
	} else {
		return na.AssignInt(v2)
	}
}
404
func (_Int__Assembler) Prototype() ld.NodePrototype {
405 406 407 408 409
	return _Int__Prototype{}
}
func (Int) Type() schema.Type {
	return nil /*TODO:typelit*/
}
410
func (n Int) Representation() ld.Node {
411 412
	return (*_Int__Repr)(n)
}
413

414
type _Int__Repr = _Int
415

416
var _ ld.Node = &_Int__Repr{}
417

418 419 420
type _Int__ReprPrototype = _Int__Prototype
type _Int__ReprAssembler = _Int__Assembler

421
func (n Link) Link() ld.Link {
422 423
	return n.x
}
424
func (_Link__Prototype) FromLink(v ld.Link) (Link, error) {
425 426 427
	n := _Link{v}
	return &n, nil
}
428

429 430
type _Link__Maybe struct {
	m schema.Maybe
431
	v _Link
432 433 434 435 436 437 438 439 440 441 442 443
}
type MaybeLink = *_Link__Maybe

func (m MaybeLink) IsNull() bool {
	return m.m == schema.Maybe_Null
}
func (m MaybeLink) IsAbsent() bool {
	return m.m == schema.Maybe_Absent
}
func (m MaybeLink) Exists() bool {
	return m.m == schema.Maybe_Value
}
444
func (m MaybeLink) AsNode() ld.Node {
445
	switch m.m {
446
	case schema.Maybe_Absent:
447
		return ld.Absent
448
	case schema.Maybe_Null:
449
		return ld.Null
450 451 452 453
	case schema.Maybe_Value:
		return &m.v
	default:
		panic("unreachable")
454 455 456 457 458 459
	}
}
func (m MaybeLink) Must() Link {
	if !m.Exists() {
		panic("unbox of a maybe rejected")
	}
460
	return &m.v
461
}
462

463
var _ ld.Node = (Link)(&_Link{})
464
var _ schema.TypedNode = (Link)(&_Link{})
465

466 467
func (Link) Kind() ld.Kind {
	return ld.Kind_Link
468
}
469
func (Link) LookupByString(string) (ld.Node, error) {
470
	return mixins.Link{TypeName: "dagpb.Link"}.LookupByString("")
471
}
472
func (Link) LookupByNode(ld.Node) (ld.Node, error) {
473
	return mixins.Link{TypeName: "dagpb.Link"}.LookupByNode(nil)
474
}
475
func (Link) LookupByIndex(idx int64) (ld.Node, error) {
476
	return mixins.Link{TypeName: "dagpb.Link"}.LookupByIndex(0)
477
}
478
func (Link) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
479
	return mixins.Link{TypeName: "dagpb.Link"}.LookupBySegment(seg)
480
}
481
func (Link) MapIterator() ld.MapIterator {
482 483
	return nil
}
484
func (Link) ListIterator() ld.ListIterator {
485 486
	return nil
}
487
func (Link) Length() int64 {
488 489 490 491 492 493 494 495 496
	return -1
}
func (Link) IsAbsent() bool {
	return false
}
func (Link) IsNull() bool {
	return false
}
func (Link) AsBool() (bool, error) {
497
	return mixins.Link{TypeName: "dagpb.Link"}.AsBool()
498
}
499
func (Link) AsInt() (int64, error) {
500
	return mixins.Link{TypeName: "dagpb.Link"}.AsInt()
501 502
}
func (Link) AsFloat() (float64, error) {
503
	return mixins.Link{TypeName: "dagpb.Link"}.AsFloat()
504 505
}
func (Link) AsString() (string, error) {
506
	return mixins.Link{TypeName: "dagpb.Link"}.AsString()
507 508
}
func (Link) AsBytes() ([]byte, error) {
509
	return mixins.Link{TypeName: "dagpb.Link"}.AsBytes()
510
}
511
func (n Link) AsLink() (ld.Link, error) {
512 513
	return n.x, nil
}
514
func (Link) Prototype() ld.NodePrototype {
515 516
	return _Link__Prototype{}
}
517

518 519
type _Link__Prototype struct{}

520
func (_Link__Prototype) NewBuilder() ld.NodeBuilder {
521 522 523 524
	var nb _Link__Builder
	nb.Reset()
	return &nb
}
525

526 527 528
type _Link__Builder struct {
	_Link__Assembler
}
529

530
func (nb *_Link__Builder) Build() ld.Node {
531 532 533 534 535 536 537 538 539 540
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_Link__Builder) Reset() {
	var w _Link
	var m schema.Maybe
	*nb = _Link__Builder{_Link__Assembler{w: &w, m: &m}}
}
541

542 543 544 545 546 547
type _Link__Assembler struct {
	w *_Link
	m *schema.Maybe
}

func (na *_Link__Assembler) reset() {}
548
func (_Link__Assembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
549
	return mixins.LinkAssembler{TypeName: "dagpb.Link"}.BeginMap(0)
550
}
551
func (_Link__Assembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
552
	return mixins.LinkAssembler{TypeName: "dagpb.Link"}.BeginList(0)
553 554 555 556 557 558 559
}
func (na *_Link__Assembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
560
		return mixins.LinkAssembler{TypeName: "dagpb.Link"}.AssignNull()
561 562 563 564 565 566
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	panic("unreachable")
}
func (_Link__Assembler) AssignBool(bool) error {
567
	return mixins.LinkAssembler{TypeName: "dagpb.Link"}.AssignBool(false)
568
}
569
func (_Link__Assembler) AssignInt(int64) error {
570
	return mixins.LinkAssembler{TypeName: "dagpb.Link"}.AssignInt(0)
571 572
}
func (_Link__Assembler) AssignFloat(float64) error {
573
	return mixins.LinkAssembler{TypeName: "dagpb.Link"}.AssignFloat(0)
574 575
}
func (_Link__Assembler) AssignString(string) error {
576
	return mixins.LinkAssembler{TypeName: "dagpb.Link"}.AssignString("")
577 578
}
func (_Link__Assembler) AssignBytes([]byte) error {
579
	return mixins.LinkAssembler{TypeName: "dagpb.Link"}.AssignBytes(nil)
580
}
581
func (na *_Link__Assembler) AssignLink(v ld.Link) error {
582 583 584 585 586 587 588 589
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	na.w.x = v
	*na.m = schema.Maybe_Value
	return nil
}
590
func (na *_Link__Assembler) AssignNode(v ld.Node) error {
591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_Link); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
	if v2, err := v.AsLink(); err != nil {
		return err
	} else {
		return na.AssignLink(v2)
	}
}
609
func (_Link__Assembler) Prototype() ld.NodePrototype {
610 611 612 613 614
	return _Link__Prototype{}
}
func (Link) Type() schema.Type {
	return nil /*TODO:typelit*/
}
615
func (n Link) Representation() ld.Node {
616 617
	return (*_Link__Repr)(n)
}
618

619
type _Link__Repr = _Link
620

621
var _ ld.Node = &_Link__Repr{}
622

623 624 625 626 627 628 629 630 631 632 633 634
type _Link__ReprPrototype = _Link__Prototype
type _Link__ReprAssembler = _Link__Assembler

func (n _PBLink) FieldHash() Link {
	return &n.Hash
}
func (n _PBLink) FieldName() MaybeString {
	return &n.Name
}
func (n _PBLink) FieldTsize() MaybeInt {
	return &n.Tsize
}
635

636 637 638 639 640 641 642 643 644 645 646 647 648 649 650
type _PBLink__Maybe struct {
	m schema.Maybe
	v PBLink
}
type MaybePBLink = *_PBLink__Maybe

func (m MaybePBLink) IsNull() bool {
	return m.m == schema.Maybe_Null
}
func (m MaybePBLink) IsAbsent() bool {
	return m.m == schema.Maybe_Absent
}
func (m MaybePBLink) Exists() bool {
	return m.m == schema.Maybe_Value
}
651
func (m MaybePBLink) AsNode() ld.Node {
652
	switch m.m {
653
	case schema.Maybe_Absent:
654
		return ld.Absent
655
	case schema.Maybe_Null:
656
		return ld.Null
657 658 659 660
	case schema.Maybe_Value:
		return m.v
	default:
		panic("unreachable")
661 662 663 664 665 666 667 668
	}
}
func (m MaybePBLink) Must() PBLink {
	if !m.Exists() {
		panic("unbox of a maybe rejected")
	}
	return m.v
}
669

670
var (
671 672
	fieldName__PBLink_Hash  = _String{"Hash"}
	fieldName__PBLink_Name  = _String{"Name"}
673 674
	fieldName__PBLink_Tsize = _String{"Tsize"}
)
675
var _ ld.Node = (PBLink)(&_PBLink{})
676
var _ schema.TypedNode = (PBLink)(&_PBLink{})
677

678 679
func (PBLink) Kind() ld.Kind {
	return ld.Kind_Map
680
}
681
func (n PBLink) LookupByString(key string) (ld.Node, error) {
682 683 684 685 686
	switch key {
	case "Hash":
		return &n.Hash, nil
	case "Name":
		if n.Name.m == schema.Maybe_Absent {
687
			return ld.Absent, nil
688
		}
689
		return &n.Name.v, nil
690 691
	case "Tsize":
		if n.Tsize.m == schema.Maybe_Absent {
692
			return ld.Absent, nil
693
		}
694
		return &n.Tsize.v, nil
695
	default:
696
		return nil, schema.ErrNoSuchField{Type: nil /*TODO*/, Field: ld.PathSegmentOfString(key)}
697 698
	}
}
699
func (n PBLink) LookupByNode(key ld.Node) (ld.Node, error) {
700 701 702 703 704 705
	ks, err := key.AsString()
	if err != nil {
		return nil, err
	}
	return n.LookupByString(ks)
}
706
func (PBLink) LookupByIndex(idx int64) (ld.Node, error) {
707
	return mixins.Map{TypeName: "dagpb.PBLink"}.LookupByIndex(0)
708
}
709
func (n PBLink) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
710 711
	return n.LookupByString(seg.String())
}
712
func (n PBLink) MapIterator() ld.MapIterator {
713 714 715 716
	return &_PBLink__MapItr{n, 0}
}

type _PBLink__MapItr struct {
717 718
	n   PBLink
	idx int
719 720
}

721
func (itr *_PBLink__MapItr) Next() (k ld.Node, v ld.Node, _ error) {
722
	if itr.idx >= 3 {
723
		return nil, nil, ld.ErrIteratorOverread{}
724 725 726 727 728 729 730 731
	}
	switch itr.idx {
	case 0:
		k = &fieldName__PBLink_Hash
		v = &itr.n.Hash
	case 1:
		k = &fieldName__PBLink_Name
		if itr.n.Name.m == schema.Maybe_Absent {
732
			v = ld.Absent
733 734
			break
		}
735
		v = &itr.n.Name.v
736 737 738
	case 2:
		k = &fieldName__PBLink_Tsize
		if itr.n.Tsize.m == schema.Maybe_Absent {
739
			v = ld.Absent
740 741
			break
		}
742
		v = &itr.n.Tsize.v
743 744 745 746 747 748 749 750 751 752
	default:
		panic("unreachable")
	}
	itr.idx++
	return
}
func (itr *_PBLink__MapItr) Done() bool {
	return itr.idx >= 3
}

753
func (PBLink) ListIterator() ld.ListIterator {
754 755
	return nil
}
756
func (PBLink) Length() int64 {
757 758 759 760 761 762 763 764 765
	return 3
}
func (PBLink) IsAbsent() bool {
	return false
}
func (PBLink) IsNull() bool {
	return false
}
func (PBLink) AsBool() (bool, error) {
766
	return mixins.Map{TypeName: "dagpb.PBLink"}.AsBool()
767
}
768
func (PBLink) AsInt() (int64, error) {
769
	return mixins.Map{TypeName: "dagpb.PBLink"}.AsInt()
770 771
}
func (PBLink) AsFloat() (float64, error) {
772
	return mixins.Map{TypeName: "dagpb.PBLink"}.AsFloat()
773 774
}
func (PBLink) AsString() (string, error) {
775
	return mixins.Map{TypeName: "dagpb.PBLink"}.AsString()
776 777
}
func (PBLink) AsBytes() ([]byte, error) {
778
	return mixins.Map{TypeName: "dagpb.PBLink"}.AsBytes()
779
}
780
func (PBLink) AsLink() (ld.Link, error) {
781
	return mixins.Map{TypeName: "dagpb.PBLink"}.AsLink()
782
}
783
func (PBLink) Prototype() ld.NodePrototype {
784 785
	return _PBLink__Prototype{}
}
786

787 788
type _PBLink__Prototype struct{}

789
func (_PBLink__Prototype) NewBuilder() ld.NodeBuilder {
790 791 792 793
	var nb _PBLink__Builder
	nb.Reset()
	return &nb
}
794

795 796 797
type _PBLink__Builder struct {
	_PBLink__Assembler
}
798

799
func (nb *_PBLink__Builder) Build() ld.Node {
800 801 802 803 804 805 806 807 808 809
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_PBLink__Builder) Reset() {
	var w _PBLink
	var m schema.Maybe
	*nb = _PBLink__Builder{_PBLink__Assembler{w: &w, m: &m}}
}
810

811
type _PBLink__Assembler struct {
812 813
	w     *_PBLink
	m     *schema.Maybe
814
	state maState
815 816
	s     int
	f     int
817

818 819 820
	cm       schema.Maybe
	ca_Hash  _Link__Assembler
	ca_Name  _String__Assembler
821
	ca_Tsize _Int__Assembler
822
}
823 824 825 826 827 828 829 830 831 832

func (na *_PBLink__Assembler) reset() {
	na.state = maState_initial
	na.s = 0
	na.ca_Hash.reset()
	na.ca_Name.reset()
	na.ca_Tsize.reset()
}

var (
833 834 835 836
	fieldBit__PBLink_Hash        = 1 << 0
	fieldBit__PBLink_Name        = 1 << 1
	fieldBit__PBLink_Tsize       = 1 << 2
	fieldBits__PBLink_sufficient = 0 + 1<<0
837
)
838

839
func (na *_PBLink__Assembler) BeginMap(int64) (ld.MapAssembler, error) {
840 841 842 843 844 845 846 847 848 849 850 851
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: it makes no sense to 'begin' twice on the same assembler!")
	}
	*na.m = midvalue
	if na.w == nil {
		na.w = &_PBLink{}
	}
	return na, nil
}
852
func (_PBLink__Assembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
853
	return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.BeginList(0)
854 855 856 857 858 859 860
}
func (na *_PBLink__Assembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
861
		return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.AssignNull()
862 863 864 865 866 867 868 869
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
	}
	panic("unreachable")
}
func (_PBLink__Assembler) AssignBool(bool) error {
870
	return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.AssignBool(false)
871
}
872
func (_PBLink__Assembler) AssignInt(int64) error {
873
	return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.AssignInt(0)
874 875
}
func (_PBLink__Assembler) AssignFloat(float64) error {
876
	return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.AssignFloat(0)
877 878
}
func (_PBLink__Assembler) AssignString(string) error {
879
	return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.AssignString("")
880 881
}
func (_PBLink__Assembler) AssignBytes([]byte) error {
882
	return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.AssignBytes(nil)
883
}
884
func (_PBLink__Assembler) AssignLink(ld.Link) error {
885
	return mixins.MapAssembler{TypeName: "dagpb.PBLink"}.AssignLink(nil)
886
}
887
func (na *_PBLink__Assembler) AssignNode(v ld.Node) error {
888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_PBLink); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		case midvalue:
			panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
		}
		if na.w == nil {
			na.w = v2
			*na.m = schema.Maybe_Value
			return nil
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
907 908
	if v.Kind() != ld.Kind_Map {
		return ld.ErrWrongKind{TypeName: "dagpb.PBLink", MethodName: "AssignNode", AppropriateKind: ld.KindSet_JustMap, ActualKind: v.Kind()}
909 910 911 912 913 914 915
	}
	itr := v.MapIterator()
	for !itr.Done() {
		k, v, err := itr.Next()
		if err != nil {
			return err
		}
916
		if err := na.AssembleKey().AssignNode(k); err != nil {
917 918
			return err
		}
919
		if err := na.AssembleValue().AssignNode(v); err != nil {
920 921 922 923 924
			return err
		}
	}
	return na.Finish()
}
925
func (_PBLink__Assembler) Prototype() ld.NodePrototype {
926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959
	return _PBLink__Prototype{}
}
func (ma *_PBLink__Assembler) valueFinishTidy() bool {
	switch ma.f {
	case 0:
		switch ma.cm {
		case schema.Maybe_Value:
			ma.ca_Hash.w = nil
			ma.cm = schema.Maybe_Absent
			ma.state = maState_initial
			return true
		default:
			return false
		}
	case 1:
		switch ma.w.Name.m {
		case schema.Maybe_Value:
			ma.state = maState_initial
			return true
		default:
			return false
		}
	case 2:
		switch ma.w.Tsize.m {
		case schema.Maybe_Value:
			ma.state = maState_initial
			return true
		default:
			return false
		}
	default:
		panic("unreachable")
	}
}
960
func (ma *_PBLink__Assembler) AssembleEntry(k string) (ld.NodeAssembler, error) {
961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleEntry cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleEntry cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleEntry cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleEntry cannot be called on an assembler that's already finished")
	}
	switch k {
	case "Hash":
977
		if ma.s&fieldBit__PBLink_Hash != 0 {
978
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Hash}
979 980 981 982 983 984 985 986
		}
		ma.s += fieldBit__PBLink_Hash
		ma.state = maState_midValue
		ma.f = 0
		ma.ca_Hash.w = &ma.w.Hash
		ma.ca_Hash.m = &ma.cm
		return &ma.ca_Hash, nil
	case "Name":
987
		if ma.s&fieldBit__PBLink_Name != 0 {
988
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Name}
989 990 991 992
		}
		ma.s += fieldBit__PBLink_Name
		ma.state = maState_midValue
		ma.f = 1
993
		ma.ca_Name.w = &ma.w.Name.v
994 995 996
		ma.ca_Name.m = &ma.w.Name.m
		return &ma.ca_Name, nil
	case "Tsize":
997
		if ma.s&fieldBit__PBLink_Tsize != 0 {
998
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Tsize}
999 1000 1001 1002
		}
		ma.s += fieldBit__PBLink_Tsize
		ma.state = maState_midValue
		ma.f = 2
1003
		ma.ca_Tsize.w = &ma.w.Tsize.v
1004 1005 1006
		ma.ca_Tsize.m = &ma.w.Tsize.m
		return &ma.ca_Tsize, nil
	}
1007
	return nil, ld.ErrInvalidKey{TypeName: "dagpb.PBLink", Key: &_String{k}}
1008
}
1009
func (ma *_PBLink__Assembler) AssembleKey() ld.NodeAssembler {
1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleKey cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleKey cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleKey cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleKey cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midKey
	return (*_PBLink__KeyAssembler)(ma)
}
1027
func (ma *_PBLink__Assembler) AssembleValue() ld.NodeAssembler {
1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046
	switch ma.state {
	case maState_initial:
		panic("invalid state: AssembleValue cannot be called when no key is primed")
	case maState_midKey:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		// carry on
	case maState_midValue:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling another value")
	case maState_finished:
		panic("invalid state: AssembleValue cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midValue
	switch ma.f {
	case 0:
		ma.ca_Hash.w = &ma.w.Hash
		ma.ca_Hash.m = &ma.cm
		return &ma.ca_Hash
	case 1:
1047
		ma.ca_Name.w = &ma.w.Name.v
1048 1049 1050
		ma.ca_Name.m = &ma.w.Name.m
		return &ma.ca_Name
	case 2:
1051
		ma.ca_Tsize.w = &ma.w.Tsize.v
1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072
		ma.ca_Tsize.m = &ma.w.Tsize.m
		return &ma.ca_Tsize
	default:
		panic("unreachable")
	}
}
func (ma *_PBLink__Assembler) Finish() error {
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: Finish cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		panic("invalid state: Finish cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: Finish cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: Finish cannot be called on an assembler that's already finished")
	}
1073
	if ma.s&fieldBits__PBLink_sufficient != fieldBits__PBLink_sufficient {
1074
		err := ld.ErrMissingRequiredField{Missing: make([]string, 0)}
1075
		if ma.s&fieldBit__PBLink_Hash == 0 {
1076 1077 1078 1079 1080 1081 1082 1083
			err.Missing = append(err.Missing, "Hash")
		}
		return err
	}
	ma.state = maState_finished
	*ma.m = schema.Maybe_Value
	return nil
}
1084
func (ma *_PBLink__Assembler) KeyPrototype() ld.NodePrototype {
1085 1086
	return _String__Prototype{}
}
1087
func (ma *_PBLink__Assembler) ValuePrototype(k string) ld.NodePrototype {
1088 1089
	panic("todo structbuilder mapassembler valueprototype")
}
1090

1091
type _PBLink__KeyAssembler _PBLink__Assembler
1092

1093
func (_PBLink__KeyAssembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
1094
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.BeginMap(0)
1095
}
1096
func (_PBLink__KeyAssembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
1097
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.BeginList(0)
1098 1099
}
func (na *_PBLink__KeyAssembler) AssignNull() error {
1100
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.AssignNull()
1101 1102
}
func (_PBLink__KeyAssembler) AssignBool(bool) error {
1103
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.AssignBool(false)
1104
}
1105
func (_PBLink__KeyAssembler) AssignInt(int64) error {
1106
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.AssignInt(0)
1107 1108
}
func (_PBLink__KeyAssembler) AssignFloat(float64) error {
1109
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.AssignFloat(0)
1110 1111 1112 1113 1114 1115 1116
}
func (ka *_PBLink__KeyAssembler) AssignString(k string) error {
	if ka.state != maState_midKey {
		panic("misuse: KeyAssembler held beyond its valid lifetime")
	}
	switch k {
	case "Hash":
1117
		if ka.s&fieldBit__PBLink_Hash != 0 {
1118
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Hash}
1119 1120 1121 1122
		}
		ka.s += fieldBit__PBLink_Hash
		ka.state = maState_expectValue
		ka.f = 0
1123
		return nil
1124
	case "Name":
1125
		if ka.s&fieldBit__PBLink_Name != 0 {
1126
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Name}
1127 1128 1129 1130
		}
		ka.s += fieldBit__PBLink_Name
		ka.state = maState_expectValue
		ka.f = 1
1131
		return nil
1132
	case "Tsize":
1133
		if ka.s&fieldBit__PBLink_Tsize != 0 {
1134
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Tsize}
1135 1136 1137 1138
		}
		ka.s += fieldBit__PBLink_Tsize
		ka.state = maState_expectValue
		ka.f = 2
1139
		return nil
1140
	default:
1141
		return ld.ErrInvalidKey{TypeName: "dagpb.PBLink", Key: &_String{k}}
1142 1143 1144
	}
}
func (_PBLink__KeyAssembler) AssignBytes([]byte) error {
1145
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.AssignBytes(nil)
1146
}
1147
func (_PBLink__KeyAssembler) AssignLink(ld.Link) error {
1148
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.KeyAssembler"}.AssignLink(nil)
1149
}
1150
func (ka *_PBLink__KeyAssembler) AssignNode(v ld.Node) error {
1151 1152 1153 1154 1155 1156
	if v2, err := v.AsString(); err != nil {
		return err
	} else {
		return ka.AssignString(v2)
	}
}
1157
func (_PBLink__KeyAssembler) Prototype() ld.NodePrototype {
1158 1159 1160 1161 1162
	return _String__Prototype{}
}
func (PBLink) Type() schema.Type {
	return nil /*TODO:typelit*/
}
1163
func (n PBLink) Representation() ld.Node {
1164 1165
	return (*_PBLink__Repr)(n)
}
1166

1167
type _PBLink__Repr _PBLink
1168

1169
var (
1170 1171
	fieldName__PBLink_Hash_serial  = _String{"Hash"}
	fieldName__PBLink_Name_serial  = _String{"Name"}
1172 1173
	fieldName__PBLink_Tsize_serial = _String{"Tsize"}
)
1174
var _ ld.Node = &_PBLink__Repr{}
1175

1176 1177
func (_PBLink__Repr) Kind() ld.Kind {
	return ld.Kind_Map
1178
}
1179
func (n *_PBLink__Repr) LookupByString(key string) (ld.Node, error) {
1180 1181 1182 1183 1184
	switch key {
	case "Hash":
		return n.Hash.Representation(), nil
	case "Name":
		if n.Name.m == schema.Maybe_Absent {
1185
			return ld.Absent, ld.ErrNotExists{Segment: ld.PathSegmentOfString(key)}
1186 1187 1188 1189
		}
		return n.Name.v.Representation(), nil
	case "Tsize":
		if n.Tsize.m == schema.Maybe_Absent {
1190
			return ld.Absent, ld.ErrNotExists{Segment: ld.PathSegmentOfString(key)}
1191 1192 1193
		}
		return n.Tsize.v.Representation(), nil
	default:
1194
		return nil, schema.ErrNoSuchField{Type: nil /*TODO*/, Field: ld.PathSegmentOfString(key)}
1195 1196
	}
}
1197
func (n *_PBLink__Repr) LookupByNode(key ld.Node) (ld.Node, error) {
1198 1199 1200 1201 1202 1203
	ks, err := key.AsString()
	if err != nil {
		return nil, err
	}
	return n.LookupByString(ks)
}
1204
func (_PBLink__Repr) LookupByIndex(idx int64) (ld.Node, error) {
1205
	return mixins.Map{TypeName: "dagpb.PBLink.Repr"}.LookupByIndex(0)
1206
}
1207
func (n _PBLink__Repr) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
1208 1209
	return n.LookupByString(seg.String())
}
1210
func (n *_PBLink__Repr) MapIterator() ld.MapIterator {
1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231
	end := 3
	if n.Tsize.m == schema.Maybe_Absent {
		end = 2
	} else {
		goto done
	}
	if n.Name.m == schema.Maybe_Absent {
		end = 1
	} else {
		goto done
	}
done:
	return &_PBLink__ReprMapItr{n, 0, end}
}

type _PBLink__ReprMapItr struct {
	n   *_PBLink__Repr
	idx int
	end int
}

1232
func (itr *_PBLink__ReprMapItr) Next() (k ld.Node, v ld.Node, _ error) {
1233 1234
advance:
	if itr.idx >= 3 {
1235
		return nil, nil, ld.ErrIteratorOverread{}
1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263
	}
	switch itr.idx {
	case 0:
		k = &fieldName__PBLink_Hash_serial
		v = itr.n.Hash.Representation()
	case 1:
		k = &fieldName__PBLink_Name_serial
		if itr.n.Name.m == schema.Maybe_Absent {
			itr.idx++
			goto advance
		}
		v = itr.n.Name.v.Representation()
	case 2:
		k = &fieldName__PBLink_Tsize_serial
		if itr.n.Tsize.m == schema.Maybe_Absent {
			itr.idx++
			goto advance
		}
		v = itr.n.Tsize.v.Representation()
	default:
		panic("unreachable")
	}
	itr.idx++
	return
}
func (itr *_PBLink__ReprMapItr) Done() bool {
	return itr.idx >= itr.end
}
1264
func (_PBLink__Repr) ListIterator() ld.ListIterator {
1265 1266
	return nil
}
1267
func (rn *_PBLink__Repr) Length() int64 {
1268 1269 1270 1271 1272 1273 1274
	l := 3
	if rn.Name.m == schema.Maybe_Absent {
		l--
	}
	if rn.Tsize.m == schema.Maybe_Absent {
		l--
	}
1275
	return int64(l)
1276 1277 1278 1279 1280 1281 1282 1283
}
func (_PBLink__Repr) IsAbsent() bool {
	return false
}
func (_PBLink__Repr) IsNull() bool {
	return false
}
func (_PBLink__Repr) AsBool() (bool, error) {
1284
	return mixins.Map{TypeName: "dagpb.PBLink.Repr"}.AsBool()
1285
}
1286
func (_PBLink__Repr) AsInt() (int64, error) {
1287
	return mixins.Map{TypeName: "dagpb.PBLink.Repr"}.AsInt()
1288 1289
}
func (_PBLink__Repr) AsFloat() (float64, error) {
1290
	return mixins.Map{TypeName: "dagpb.PBLink.Repr"}.AsFloat()
1291 1292
}
func (_PBLink__Repr) AsString() (string, error) {
1293
	return mixins.Map{TypeName: "dagpb.PBLink.Repr"}.AsString()
1294 1295
}
func (_PBLink__Repr) AsBytes() ([]byte, error) {
1296
	return mixins.Map{TypeName: "dagpb.PBLink.Repr"}.AsBytes()
1297
}
1298
func (_PBLink__Repr) AsLink() (ld.Link, error) {
1299
	return mixins.Map{TypeName: "dagpb.PBLink.Repr"}.AsLink()
1300
}
1301
func (_PBLink__Repr) Prototype() ld.NodePrototype {
1302 1303
	return _PBLink__ReprPrototype{}
}
1304

1305 1306
type _PBLink__ReprPrototype struct{}

1307
func (_PBLink__ReprPrototype) NewBuilder() ld.NodeBuilder {
1308 1309 1310 1311
	var nb _PBLink__ReprBuilder
	nb.Reset()
	return &nb
}
1312

1313 1314 1315
type _PBLink__ReprBuilder struct {
	_PBLink__ReprAssembler
}
1316

1317
func (nb *_PBLink__ReprBuilder) Build() ld.Node {
1318 1319 1320 1321 1322 1323 1324 1325 1326 1327
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_PBLink__ReprBuilder) Reset() {
	var w _PBLink
	var m schema.Maybe
	*nb = _PBLink__ReprBuilder{_PBLink__ReprAssembler{w: &w, m: &m}}
}
1328

1329
type _PBLink__ReprAssembler struct {
1330 1331
	w     *_PBLink
	m     *schema.Maybe
1332
	state maState
1333 1334
	s     int
	f     int
1335

1336 1337 1338
	cm       schema.Maybe
	ca_Hash  _Link__ReprAssembler
	ca_Name  _String__ReprAssembler
1339
	ca_Tsize _Int__ReprAssembler
1340
}
1341 1342 1343 1344 1345 1346 1347 1348

func (na *_PBLink__ReprAssembler) reset() {
	na.state = maState_initial
	na.s = 0
	na.ca_Hash.reset()
	na.ca_Name.reset()
	na.ca_Tsize.reset()
}
1349
func (na *_PBLink__ReprAssembler) BeginMap(int64) (ld.MapAssembler, error) {
1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: it makes no sense to 'begin' twice on the same assembler!")
	}
	*na.m = midvalue
	if na.w == nil {
		na.w = &_PBLink{}
	}
	return na, nil
}
1362
func (_PBLink__ReprAssembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
1363
	return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr"}.BeginList(0)
1364 1365 1366 1367 1368 1369 1370
}
func (na *_PBLink__ReprAssembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
1371
		return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr.Repr"}.AssignNull()
1372 1373 1374 1375 1376 1377 1378 1379
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
	}
	panic("unreachable")
}
func (_PBLink__ReprAssembler) AssignBool(bool) error {
1380
	return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr"}.AssignBool(false)
1381
}
1382
func (_PBLink__ReprAssembler) AssignInt(int64) error {
1383
	return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr"}.AssignInt(0)
1384 1385
}
func (_PBLink__ReprAssembler) AssignFloat(float64) error {
1386
	return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr"}.AssignFloat(0)
1387 1388
}
func (_PBLink__ReprAssembler) AssignString(string) error {
1389
	return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr"}.AssignString("")
1390 1391
}
func (_PBLink__ReprAssembler) AssignBytes([]byte) error {
1392
	return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr"}.AssignBytes(nil)
1393
}
1394
func (_PBLink__ReprAssembler) AssignLink(ld.Link) error {
1395
	return mixins.MapAssembler{TypeName: "dagpb.PBLink.Repr"}.AssignLink(nil)
1396
}
1397
func (na *_PBLink__ReprAssembler) AssignNode(v ld.Node) error {
1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_PBLink); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		case midvalue:
			panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
		}
		if na.w == nil {
			na.w = v2
			*na.m = schema.Maybe_Value
			return nil
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
1417 1418
	if v.Kind() != ld.Kind_Map {
		return ld.ErrWrongKind{TypeName: "dagpb.PBLink.Repr", MethodName: "AssignNode", AppropriateKind: ld.KindSet_JustMap, ActualKind: v.Kind()}
1419 1420 1421 1422 1423 1424 1425
	}
	itr := v.MapIterator()
	for !itr.Done() {
		k, v, err := itr.Next()
		if err != nil {
			return err
		}
1426
		if err := na.AssembleKey().AssignNode(k); err != nil {
1427 1428
			return err
		}
1429
		if err := na.AssembleValue().AssignNode(v); err != nil {
1430 1431 1432 1433 1434
			return err
		}
	}
	return na.Finish()
}
1435
func (_PBLink__ReprAssembler) Prototype() ld.NodePrototype {
1436 1437 1438 1439 1440 1441
	return _PBLink__ReprPrototype{}
}
func (ma *_PBLink__ReprAssembler) valueFinishTidy() bool {
	switch ma.f {
	case 0:
		switch ma.cm {
1442 1443
		case schema.Maybe_Value:
			ma.cm = schema.Maybe_Absent
1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468
			ma.state = maState_initial
			return true
		default:
			return false
		}
	case 1:
		switch ma.w.Name.m {
		case schema.Maybe_Value:
			ma.state = maState_initial
			return true
		default:
			return false
		}
	case 2:
		switch ma.w.Tsize.m {
		case schema.Maybe_Value:
			ma.state = maState_initial
			return true
		default:
			return false
		}
	default:
		panic("unreachable")
	}
}
1469
func (ma *_PBLink__ReprAssembler) AssembleEntry(k string) (ld.NodeAssembler, error) {
1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleEntry cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleEntry cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleEntry cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleEntry cannot be called on an assembler that's already finished")
	}
	switch k {
	case "Hash":
1486
		if ma.s&fieldBit__PBLink_Hash != 0 {
1487
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Hash_serial}
1488 1489 1490 1491 1492 1493 1494 1495
		}
		ma.s += fieldBit__PBLink_Hash
		ma.state = maState_midValue
		ma.f = 0
		ma.ca_Hash.w = &ma.w.Hash
		ma.ca_Hash.m = &ma.cm
		return &ma.ca_Hash, nil
	case "Name":
1496
		if ma.s&fieldBit__PBLink_Name != 0 {
1497
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Name_serial}
1498 1499 1500 1501
		}
		ma.s += fieldBit__PBLink_Name
		ma.state = maState_midValue
		ma.f = 1
1502
		ma.ca_Name.w = &ma.w.Name.v
1503
		ma.ca_Name.m = &ma.w.Name.m
1504

1505 1506
		return &ma.ca_Name, nil
	case "Tsize":
1507
		if ma.s&fieldBit__PBLink_Tsize != 0 {
1508
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Tsize_serial}
1509 1510 1511 1512
		}
		ma.s += fieldBit__PBLink_Tsize
		ma.state = maState_midValue
		ma.f = 2
1513
		ma.ca_Tsize.w = &ma.w.Tsize.v
1514
		ma.ca_Tsize.m = &ma.w.Tsize.m
1515

1516 1517 1518
		return &ma.ca_Tsize, nil
	default:
	}
1519
	return nil, ld.ErrInvalidKey{TypeName: "dagpb.PBLink.Repr", Key: &_String{k}}
1520
}
1521
func (ma *_PBLink__ReprAssembler) AssembleKey() ld.NodeAssembler {
1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleKey cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleKey cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleKey cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleKey cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midKey
	return (*_PBLink__ReprKeyAssembler)(ma)
}
1539
func (ma *_PBLink__ReprAssembler) AssembleValue() ld.NodeAssembler {
1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558
	switch ma.state {
	case maState_initial:
		panic("invalid state: AssembleValue cannot be called when no key is primed")
	case maState_midKey:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		// carry on
	case maState_midValue:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling another value")
	case maState_finished:
		panic("invalid state: AssembleValue cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midValue
	switch ma.f {
	case 0:
		ma.ca_Hash.w = &ma.w.Hash
		ma.ca_Hash.m = &ma.cm
		return &ma.ca_Hash
	case 1:
1559
		ma.ca_Name.w = &ma.w.Name.v
1560
		ma.ca_Name.m = &ma.w.Name.m
1561

1562 1563
		return &ma.ca_Name
	case 2:
1564
		ma.ca_Tsize.w = &ma.w.Tsize.v
1565
		ma.ca_Tsize.m = &ma.w.Tsize.m
1566

1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586
		return &ma.ca_Tsize
	default:
		panic("unreachable")
	}
}
func (ma *_PBLink__ReprAssembler) Finish() error {
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: Finish cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		panic("invalid state: Finish cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: Finish cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: Finish cannot be called on an assembler that's already finished")
	}
1587
	if ma.s&fieldBits__PBLink_sufficient != fieldBits__PBLink_sufficient {
1588
		err := ld.ErrMissingRequiredField{Missing: make([]string, 0)}
1589
		if ma.s&fieldBit__PBLink_Hash == 0 {
1590 1591 1592 1593 1594 1595 1596 1597
			err.Missing = append(err.Missing, "Hash")
		}
		return err
	}
	ma.state = maState_finished
	*ma.m = schema.Maybe_Value
	return nil
}
1598
func (ma *_PBLink__ReprAssembler) KeyPrototype() ld.NodePrototype {
1599 1600
	return _String__Prototype{}
}
1601
func (ma *_PBLink__ReprAssembler) ValuePrototype(k string) ld.NodePrototype {
1602 1603
	panic("todo structbuilder mapassembler repr valueprototype")
}
1604

1605
type _PBLink__ReprKeyAssembler _PBLink__ReprAssembler
1606

1607
func (_PBLink__ReprKeyAssembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
1608
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.BeginMap(0)
1609
}
1610
func (_PBLink__ReprKeyAssembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
1611
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.BeginList(0)
1612 1613
}
func (na *_PBLink__ReprKeyAssembler) AssignNull() error {
1614
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.AssignNull()
1615 1616
}
func (_PBLink__ReprKeyAssembler) AssignBool(bool) error {
1617
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.AssignBool(false)
1618
}
1619
func (_PBLink__ReprKeyAssembler) AssignInt(int64) error {
1620
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.AssignInt(0)
1621 1622
}
func (_PBLink__ReprKeyAssembler) AssignFloat(float64) error {
1623
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.AssignFloat(0)
1624 1625 1626 1627 1628 1629 1630
}
func (ka *_PBLink__ReprKeyAssembler) AssignString(k string) error {
	if ka.state != maState_midKey {
		panic("misuse: KeyAssembler held beyond its valid lifetime")
	}
	switch k {
	case "Hash":
1631
		if ka.s&fieldBit__PBLink_Hash != 0 {
1632
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Hash_serial}
1633 1634 1635 1636
		}
		ka.s += fieldBit__PBLink_Hash
		ka.state = maState_expectValue
		ka.f = 0
1637
		return nil
1638
	case "Name":
1639
		if ka.s&fieldBit__PBLink_Name != 0 {
1640
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Name_serial}
1641 1642 1643 1644
		}
		ka.s += fieldBit__PBLink_Name
		ka.state = maState_expectValue
		ka.f = 1
1645
		return nil
1646
	case "Tsize":
1647
		if ka.s&fieldBit__PBLink_Tsize != 0 {
1648
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBLink_Tsize_serial}
1649 1650 1651 1652
		}
		ka.s += fieldBit__PBLink_Tsize
		ka.state = maState_expectValue
		ka.f = 2
1653
		return nil
1654
	}
1655
	return ld.ErrInvalidKey{TypeName: "dagpb.PBLink.Repr", Key: &_String{k}}
1656 1657
}
func (_PBLink__ReprKeyAssembler) AssignBytes([]byte) error {
1658
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.AssignBytes(nil)
1659
}
1660
func (_PBLink__ReprKeyAssembler) AssignLink(ld.Link) error {
1661
	return mixins.StringAssembler{TypeName: "dagpb.PBLink.Repr.KeyAssembler"}.AssignLink(nil)
1662
}
1663
func (ka *_PBLink__ReprKeyAssembler) AssignNode(v ld.Node) error {
1664 1665 1666 1667 1668 1669
	if v2, err := v.AsString(); err != nil {
		return err
	} else {
		return ka.AssignString(v2)
	}
}
1670
func (_PBLink__ReprKeyAssembler) Prototype() ld.NodePrototype {
1671 1672 1673
	return _String__Prototype{}
}

1674
func (n *_PBLinks) Lookup(idx int64) PBLink {
1675 1676 1677 1678 1679 1680
	if n.Length() <= idx {
		return nil
	}
	v := &n.x[idx]
	return v
}
1681
func (n *_PBLinks) LookupMaybe(idx int64) MaybePBLink {
1682 1683 1684 1685 1686 1687 1688 1689 1690 1691
	if n.Length() <= idx {
		return nil
	}
	v := &n.x[idx]
	return &_PBLink__Maybe{
		m: schema.Maybe_Value,
		v: v,
	}
}

1692 1693
var _PBLinks__valueAbsent = _PBLink__Maybe{m: schema.Maybe_Absent}

1694 1695 1696 1697 1698
func (n PBLinks) Iterator() *PBLinks__Itr {
	return &PBLinks__Itr{n, 0}
}

type PBLinks__Itr struct {
1699 1700
	n   PBLinks
	idx int
1701 1702
}

1703
func (itr *PBLinks__Itr) Next() (idx int64, v PBLink) {
1704 1705 1706
	if itr.idx >= len(itr.n.x) {
		return -1, nil
	}
1707
	idx = int64(itr.idx)
1708 1709 1710 1711 1712 1713 1714 1715 1716 1717
	v = &itr.n.x[itr.idx]
	itr.idx++
	return
}
func (itr *PBLinks__Itr) Done() bool {
	return itr.idx >= len(itr.n.x)
}

type _PBLinks__Maybe struct {
	m schema.Maybe
1718
	v _PBLinks
1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730
}
type MaybePBLinks = *_PBLinks__Maybe

func (m MaybePBLinks) IsNull() bool {
	return m.m == schema.Maybe_Null
}
func (m MaybePBLinks) IsAbsent() bool {
	return m.m == schema.Maybe_Absent
}
func (m MaybePBLinks) Exists() bool {
	return m.m == schema.Maybe_Value
}
1731
func (m MaybePBLinks) AsNode() ld.Node {
1732
	switch m.m {
1733
	case schema.Maybe_Absent:
1734
		return ld.Absent
1735
	case schema.Maybe_Null:
1736
		return ld.Null
1737 1738 1739 1740
	case schema.Maybe_Value:
		return &m.v
	default:
		panic("unreachable")
1741 1742 1743 1744 1745 1746
	}
}
func (m MaybePBLinks) Must() PBLinks {
	if !m.Exists() {
		panic("unbox of a maybe rejected")
	}
1747
	return &m.v
1748
}
1749

1750
var _ ld.Node = (PBLinks)(&_PBLinks{})
1751
var _ schema.TypedNode = (PBLinks)(&_PBLinks{})
1752

1753 1754
func (PBLinks) Kind() ld.Kind {
	return ld.Kind_List
1755
}
1756
func (PBLinks) LookupByString(string) (ld.Node, error) {
1757
	return mixins.List{TypeName: "dagpb.PBLinks"}.LookupByString("")
1758
}
1759
func (n PBLinks) LookupByNode(k ld.Node) (ld.Node, error) {
1760 1761 1762 1763 1764 1765
	idx, err := k.AsInt()
	if err != nil {
		return nil, err
	}
	return n.LookupByIndex(idx)
}
1766
func (n PBLinks) LookupByIndex(idx int64) (ld.Node, error) {
1767
	if n.Length() <= idx {
1768
		return nil, ld.ErrNotExists{Segment: ld.PathSegmentOfInt(idx)}
1769 1770 1771 1772
	}
	v := &n.x[idx]
	return v, nil
}
1773
func (n PBLinks) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
1774 1775
	i, err := seg.Index()
	if err != nil {
1776
		return nil, ld.ErrInvalidSegmentForList{TypeName: "dagpb.PBLinks", TroubleSegment: seg, Reason: err}
1777 1778 1779
	}
	return n.LookupByIndex(i)
}
1780
func (PBLinks) MapIterator() ld.MapIterator {
1781 1782
	return nil
}
1783
func (n PBLinks) ListIterator() ld.ListIterator {
1784 1785 1786 1787
	return &_PBLinks__ListItr{n, 0}
}

type _PBLinks__ListItr struct {
1788 1789
	n   PBLinks
	idx int
1790 1791
}

1792
func (itr *_PBLinks__ListItr) Next() (idx int64, v ld.Node, _ error) {
1793
	if itr.idx >= len(itr.n.x) {
1794
		return -1, nil, ld.ErrIteratorOverread{}
1795
	}
1796
	idx = int64(itr.idx)
1797 1798 1799 1800 1801 1802 1803 1804 1805
	x := &itr.n.x[itr.idx]
	v = x
	itr.idx++
	return
}
func (itr *_PBLinks__ListItr) Done() bool {
	return itr.idx >= len(itr.n.x)
}

1806 1807
func (n PBLinks) Length() int64 {
	return int64(len(n.x))
1808 1809 1810 1811 1812 1813 1814 1815
}
func (PBLinks) IsAbsent() bool {
	return false
}
func (PBLinks) IsNull() bool {
	return false
}
func (PBLinks) AsBool() (bool, error) {
1816
	return mixins.List{TypeName: "dagpb.PBLinks"}.AsBool()
1817
}
1818
func (PBLinks) AsInt() (int64, error) {
1819
	return mixins.List{TypeName: "dagpb.PBLinks"}.AsInt()
1820 1821
}
func (PBLinks) AsFloat() (float64, error) {
1822
	return mixins.List{TypeName: "dagpb.PBLinks"}.AsFloat()
1823 1824
}
func (PBLinks) AsString() (string, error) {
1825
	return mixins.List{TypeName: "dagpb.PBLinks"}.AsString()
1826 1827
}
func (PBLinks) AsBytes() ([]byte, error) {
1828
	return mixins.List{TypeName: "dagpb.PBLinks"}.AsBytes()
1829
}
1830
func (PBLinks) AsLink() (ld.Link, error) {
1831
	return mixins.List{TypeName: "dagpb.PBLinks"}.AsLink()
1832
}
1833
func (PBLinks) Prototype() ld.NodePrototype {
1834 1835
	return _PBLinks__Prototype{}
}
1836

1837 1838
type _PBLinks__Prototype struct{}

1839
func (_PBLinks__Prototype) NewBuilder() ld.NodeBuilder {
1840 1841 1842 1843
	var nb _PBLinks__Builder
	nb.Reset()
	return &nb
}
1844

1845 1846 1847
type _PBLinks__Builder struct {
	_PBLinks__Assembler
}
1848

1849
func (nb *_PBLinks__Builder) Build() ld.Node {
1850 1851 1852 1853 1854 1855 1856 1857 1858 1859
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_PBLinks__Builder) Reset() {
	var w _PBLinks
	var m schema.Maybe
	*nb = _PBLinks__Builder{_PBLinks__Assembler{w: &w, m: &m}}
}
1860

1861
type _PBLinks__Assembler struct {
1862 1863
	w     *_PBLinks
	m     *schema.Maybe
1864 1865 1866 1867 1868 1869 1870 1871 1872 1873
	state laState

	cm schema.Maybe
	va _PBLink__Assembler
}

func (na *_PBLinks__Assembler) reset() {
	na.state = laState_initial
	na.va.reset()
}
1874
func (_PBLinks__Assembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
1875
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.BeginMap(0)
1876
}
1877
func (na *_PBLinks__Assembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: it makes no sense to 'begin' twice on the same assembler!")
	}
	*na.m = midvalue
	if sizeHint < 0 {
		sizeHint = 0
	}
	if sizeHint > 0 {
		na.w.x = make([]_PBLink, 0, sizeHint)
	}
	return na, nil
}
func (na *_PBLinks__Assembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
1899
		return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.AssignNull()
1900 1901 1902 1903 1904 1905 1906 1907
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
	}
	panic("unreachable")
}
func (_PBLinks__Assembler) AssignBool(bool) error {
1908
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.AssignBool(false)
1909
}
1910
func (_PBLinks__Assembler) AssignInt(int64) error {
1911
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.AssignInt(0)
1912 1913
}
func (_PBLinks__Assembler) AssignFloat(float64) error {
1914
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.AssignFloat(0)
1915 1916
}
func (_PBLinks__Assembler) AssignString(string) error {
1917
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.AssignString("")
1918 1919
}
func (_PBLinks__Assembler) AssignBytes([]byte) error {
1920
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.AssignBytes(nil)
1921
}
1922
func (_PBLinks__Assembler) AssignLink(ld.Link) error {
1923
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks"}.AssignLink(nil)
1924
}
1925
func (na *_PBLinks__Assembler) AssignNode(v ld.Node) error {
1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_PBLinks); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		case midvalue:
			panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
1940 1941
	if v.Kind() != ld.Kind_List {
		return ld.ErrWrongKind{TypeName: "dagpb.PBLinks", MethodName: "AssignNode", AppropriateKind: ld.KindSet_JustList, ActualKind: v.Kind()}
1942 1943 1944 1945 1946 1947 1948
	}
	itr := v.ListIterator()
	for !itr.Done() {
		_, v, err := itr.Next()
		if err != nil {
			return err
		}
1949
		if err := na.AssembleValue().AssignNode(v); err != nil {
1950 1951 1952 1953 1954
			return err
		}
	}
	return na.Finish()
}
1955
func (_PBLinks__Assembler) Prototype() ld.NodePrototype {
1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969
	return _PBLinks__Prototype{}
}
func (la *_PBLinks__Assembler) valueFinishTidy() bool {
	switch la.cm {
	case schema.Maybe_Value:
		la.va.w = nil
		la.cm = schema.Maybe_Absent
		la.state = laState_initial
		la.va.reset()
		return true
	default:
		return false
	}
}
1970
func (la *_PBLinks__Assembler) AssembleValue() ld.NodeAssembler {
1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002
	switch la.state {
	case laState_initial:
		// carry on
	case laState_midValue:
		if !la.valueFinishTidy() {
			panic("invalid state: AssembleValue cannot be called when still in the middle of assembling the previous value")
		} // if tidy success: carry on
	case laState_finished:
		panic("invalid state: AssembleValue cannot be called on an assembler that's already finished")
	}
	la.w.x = append(la.w.x, _PBLink{})
	la.state = laState_midValue
	row := &la.w.x[len(la.w.x)-1]
	la.va.w = row
	la.va.m = &la.cm
	return &la.va
}
func (la *_PBLinks__Assembler) Finish() error {
	switch la.state {
	case laState_initial:
		// carry on
	case laState_midValue:
		if !la.valueFinishTidy() {
			panic("invalid state: Finish cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case laState_finished:
		panic("invalid state: Finish cannot be called on an assembler that's already finished")
	}
	la.state = laState_finished
	*la.m = schema.Maybe_Value
	return nil
}
2003
func (la *_PBLinks__Assembler) ValuePrototype(_ int64) ld.NodePrototype {
2004 2005 2006 2007 2008
	return _PBLink__Prototype{}
}
func (PBLinks) Type() schema.Type {
	return nil /*TODO:typelit*/
}
2009
func (n PBLinks) Representation() ld.Node {
2010 2011
	return (*_PBLinks__Repr)(n)
}
2012

2013
type _PBLinks__Repr _PBLinks
2014

2015
var _ ld.Node = &_PBLinks__Repr{}
2016

2017 2018
func (_PBLinks__Repr) Kind() ld.Kind {
	return ld.Kind_List
2019
}
2020
func (_PBLinks__Repr) LookupByString(string) (ld.Node, error) {
2021
	return mixins.List{TypeName: "dagpb.PBLinks.Repr"}.LookupByString("")
2022
}
2023
func (nr *_PBLinks__Repr) LookupByNode(k ld.Node) (ld.Node, error) {
2024
	v, err := (PBLinks)(nr).LookupByNode(k)
2025
	if err != nil || v == ld.Null {
2026 2027 2028 2029
		return v, err
	}
	return v.(PBLink).Representation(), nil
}
2030
func (nr *_PBLinks__Repr) LookupByIndex(idx int64) (ld.Node, error) {
2031
	v, err := (PBLinks)(nr).LookupByIndex(idx)
2032
	if err != nil || v == ld.Null {
2033 2034 2035 2036
		return v, err
	}
	return v.(PBLink).Representation(), nil
}
2037
func (n _PBLinks__Repr) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
2038 2039
	i, err := seg.Index()
	if err != nil {
2040
		return nil, ld.ErrInvalidSegmentForList{TypeName: "dagpb.PBLinks.Repr", TroubleSegment: seg, Reason: err}
2041 2042 2043
	}
	return n.LookupByIndex(i)
}
2044
func (_PBLinks__Repr) MapIterator() ld.MapIterator {
2045 2046
	return nil
}
2047
func (nr *_PBLinks__Repr) ListIterator() ld.ListIterator {
2048 2049 2050 2051 2052
	return &_PBLinks__ReprListItr{(PBLinks)(nr), 0}
}

type _PBLinks__ReprListItr _PBLinks__ListItr

2053
func (itr *_PBLinks__ReprListItr) Next() (idx int64, v ld.Node, err error) {
2054
	idx, v, err = (*_PBLinks__ListItr)(itr).Next()
2055
	if err != nil || v == ld.Null {
2056 2057 2058 2059 2060 2061 2062 2063
		return
	}
	return idx, v.(PBLink).Representation(), nil
}
func (itr *_PBLinks__ReprListItr) Done() bool {
	return (*_PBLinks__ListItr)(itr).Done()
}

2064 2065
func (rn *_PBLinks__Repr) Length() int64 {
	return int64(len(rn.x))
2066 2067 2068 2069 2070 2071 2072 2073
}
func (_PBLinks__Repr) IsAbsent() bool {
	return false
}
func (_PBLinks__Repr) IsNull() bool {
	return false
}
func (_PBLinks__Repr) AsBool() (bool, error) {
2074
	return mixins.List{TypeName: "dagpb.PBLinks.Repr"}.AsBool()
2075
}
2076
func (_PBLinks__Repr) AsInt() (int64, error) {
2077
	return mixins.List{TypeName: "dagpb.PBLinks.Repr"}.AsInt()
2078 2079
}
func (_PBLinks__Repr) AsFloat() (float64, error) {
2080
	return mixins.List{TypeName: "dagpb.PBLinks.Repr"}.AsFloat()
2081 2082
}
func (_PBLinks__Repr) AsString() (string, error) {
2083
	return mixins.List{TypeName: "dagpb.PBLinks.Repr"}.AsString()
2084 2085
}
func (_PBLinks__Repr) AsBytes() ([]byte, error) {
2086
	return mixins.List{TypeName: "dagpb.PBLinks.Repr"}.AsBytes()
2087
}
2088
func (_PBLinks__Repr) AsLink() (ld.Link, error) {
2089
	return mixins.List{TypeName: "dagpb.PBLinks.Repr"}.AsLink()
2090
}
2091
func (_PBLinks__Repr) Prototype() ld.NodePrototype {
2092 2093
	return _PBLinks__ReprPrototype{}
}
2094

2095 2096
type _PBLinks__ReprPrototype struct{}

2097
func (_PBLinks__ReprPrototype) NewBuilder() ld.NodeBuilder {
2098 2099 2100 2101
	var nb _PBLinks__ReprBuilder
	nb.Reset()
	return &nb
}
2102

2103 2104 2105
type _PBLinks__ReprBuilder struct {
	_PBLinks__ReprAssembler
}
2106

2107
func (nb *_PBLinks__ReprBuilder) Build() ld.Node {
2108 2109 2110 2111 2112 2113 2114 2115 2116 2117
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_PBLinks__ReprBuilder) Reset() {
	var w _PBLinks
	var m schema.Maybe
	*nb = _PBLinks__ReprBuilder{_PBLinks__ReprAssembler{w: &w, m: &m}}
}
2118

2119
type _PBLinks__ReprAssembler struct {
2120 2121
	w     *_PBLinks
	m     *schema.Maybe
2122 2123 2124 2125 2126 2127 2128 2129 2130 2131
	state laState

	cm schema.Maybe
	va _PBLink__ReprAssembler
}

func (na *_PBLinks__ReprAssembler) reset() {
	na.state = laState_initial
	na.va.reset()
}
2132
func (_PBLinks__ReprAssembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
2133
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr"}.BeginMap(0)
2134
}
2135
func (na *_PBLinks__ReprAssembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: it makes no sense to 'begin' twice on the same assembler!")
	}
	*na.m = midvalue
	if sizeHint < 0 {
		sizeHint = 0
	}
	if sizeHint > 0 {
		na.w.x = make([]_PBLink, 0, sizeHint)
	}
	return na, nil
}
func (na *_PBLinks__ReprAssembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
2157
		return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr.Repr"}.AssignNull()
2158 2159 2160 2161 2162 2163 2164 2165
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
	}
	panic("unreachable")
}
func (_PBLinks__ReprAssembler) AssignBool(bool) error {
2166
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr"}.AssignBool(false)
2167
}
2168
func (_PBLinks__ReprAssembler) AssignInt(int64) error {
2169
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr"}.AssignInt(0)
2170 2171
}
func (_PBLinks__ReprAssembler) AssignFloat(float64) error {
2172
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr"}.AssignFloat(0)
2173 2174
}
func (_PBLinks__ReprAssembler) AssignString(string) error {
2175
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr"}.AssignString("")
2176 2177
}
func (_PBLinks__ReprAssembler) AssignBytes([]byte) error {
2178
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr"}.AssignBytes(nil)
2179
}
2180
func (_PBLinks__ReprAssembler) AssignLink(ld.Link) error {
2181
	return mixins.ListAssembler{TypeName: "dagpb.PBLinks.Repr"}.AssignLink(nil)
2182
}
2183
func (na *_PBLinks__ReprAssembler) AssignNode(v ld.Node) error {
2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_PBLinks); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		case midvalue:
			panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
2198 2199
	if v.Kind() != ld.Kind_List {
		return ld.ErrWrongKind{TypeName: "dagpb.PBLinks.Repr", MethodName: "AssignNode", AppropriateKind: ld.KindSet_JustList, ActualKind: v.Kind()}
2200 2201 2202 2203 2204 2205 2206
	}
	itr := v.ListIterator()
	for !itr.Done() {
		_, v, err := itr.Next()
		if err != nil {
			return err
		}
2207
		if err := na.AssembleValue().AssignNode(v); err != nil {
2208 2209 2210 2211 2212
			return err
		}
	}
	return na.Finish()
}
2213
func (_PBLinks__ReprAssembler) Prototype() ld.NodePrototype {
2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227
	return _PBLinks__ReprPrototype{}
}
func (la *_PBLinks__ReprAssembler) valueFinishTidy() bool {
	switch la.cm {
	case schema.Maybe_Value:
		la.va.w = nil
		la.cm = schema.Maybe_Absent
		la.state = laState_initial
		la.va.reset()
		return true
	default:
		return false
	}
}
2228
func (la *_PBLinks__ReprAssembler) AssembleValue() ld.NodeAssembler {
2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260
	switch la.state {
	case laState_initial:
		// carry on
	case laState_midValue:
		if !la.valueFinishTidy() {
			panic("invalid state: AssembleValue cannot be called when still in the middle of assembling the previous value")
		} // if tidy success: carry on
	case laState_finished:
		panic("invalid state: AssembleValue cannot be called on an assembler that's already finished")
	}
	la.w.x = append(la.w.x, _PBLink{})
	la.state = laState_midValue
	row := &la.w.x[len(la.w.x)-1]
	la.va.w = row
	la.va.m = &la.cm
	return &la.va
}
func (la *_PBLinks__ReprAssembler) Finish() error {
	switch la.state {
	case laState_initial:
		// carry on
	case laState_midValue:
		if !la.valueFinishTidy() {
			panic("invalid state: Finish cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case laState_finished:
		panic("invalid state: Finish cannot be called on an assembler that's already finished")
	}
	la.state = laState_finished
	*la.m = schema.Maybe_Value
	return nil
}
2261
func (la *_PBLinks__ReprAssembler) ValuePrototype(_ int64) ld.NodePrototype {
2262 2263 2264 2265 2266 2267 2268 2269 2270
	return _PBLink__ReprPrototype{}
}

func (n _PBNode) FieldLinks() PBLinks {
	return &n.Links
}
func (n _PBNode) FieldData() MaybeBytes {
	return &n.Data
}
2271

2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286
type _PBNode__Maybe struct {
	m schema.Maybe
	v PBNode
}
type MaybePBNode = *_PBNode__Maybe

func (m MaybePBNode) IsNull() bool {
	return m.m == schema.Maybe_Null
}
func (m MaybePBNode) IsAbsent() bool {
	return m.m == schema.Maybe_Absent
}
func (m MaybePBNode) Exists() bool {
	return m.m == schema.Maybe_Value
}
2287
func (m MaybePBNode) AsNode() ld.Node {
2288
	switch m.m {
2289
	case schema.Maybe_Absent:
2290
		return ld.Absent
2291
	case schema.Maybe_Null:
2292
		return ld.Null
2293 2294 2295 2296
	case schema.Maybe_Value:
		return m.v
	default:
		panic("unreachable")
2297 2298 2299 2300 2301 2302 2303 2304
	}
}
func (m MaybePBNode) Must() PBNode {
	if !m.Exists() {
		panic("unbox of a maybe rejected")
	}
	return m.v
}
2305

2306 2307
var (
	fieldName__PBNode_Links = _String{"Links"}
2308
	fieldName__PBNode_Data  = _String{"Data"}
2309
)
2310
var _ ld.Node = (PBNode)(&_PBNode{})
2311
var _ schema.TypedNode = (PBNode)(&_PBNode{})
2312

2313 2314
func (PBNode) Kind() ld.Kind {
	return ld.Kind_Map
2315
}
2316
func (n PBNode) LookupByString(key string) (ld.Node, error) {
2317 2318 2319 2320 2321
	switch key {
	case "Links":
		return &n.Links, nil
	case "Data":
		if n.Data.m == schema.Maybe_Absent {
2322
			return ld.Absent, nil
2323
		}
2324
		return &n.Data.v, nil
2325
	default:
2326
		return nil, schema.ErrNoSuchField{Type: nil /*TODO*/, Field: ld.PathSegmentOfString(key)}
2327 2328
	}
}
2329
func (n PBNode) LookupByNode(key ld.Node) (ld.Node, error) {
2330 2331 2332 2333 2334 2335
	ks, err := key.AsString()
	if err != nil {
		return nil, err
	}
	return n.LookupByString(ks)
}
2336
func (PBNode) LookupByIndex(idx int64) (ld.Node, error) {
2337
	return mixins.Map{TypeName: "dagpb.PBNode"}.LookupByIndex(0)
2338
}
2339
func (n PBNode) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
2340 2341
	return n.LookupByString(seg.String())
}
2342
func (n PBNode) MapIterator() ld.MapIterator {
2343 2344 2345 2346
	return &_PBNode__MapItr{n, 0}
}

type _PBNode__MapItr struct {
2347 2348
	n   PBNode
	idx int
2349 2350
}

2351
func (itr *_PBNode__MapItr) Next() (k ld.Node, v ld.Node, _ error) {
2352
	if itr.idx >= 2 {
2353
		return nil, nil, ld.ErrIteratorOverread{}
2354 2355 2356 2357 2358 2359 2360 2361
	}
	switch itr.idx {
	case 0:
		k = &fieldName__PBNode_Links
		v = &itr.n.Links
	case 1:
		k = &fieldName__PBNode_Data
		if itr.n.Data.m == schema.Maybe_Absent {
2362
			v = ld.Absent
2363 2364
			break
		}
2365
		v = &itr.n.Data.v
2366 2367 2368 2369 2370 2371 2372 2373 2374 2375
	default:
		panic("unreachable")
	}
	itr.idx++
	return
}
func (itr *_PBNode__MapItr) Done() bool {
	return itr.idx >= 2
}

2376
func (PBNode) ListIterator() ld.ListIterator {
2377 2378
	return nil
}
2379
func (PBNode) Length() int64 {
2380 2381 2382 2383 2384 2385 2386 2387 2388
	return 2
}
func (PBNode) IsAbsent() bool {
	return false
}
func (PBNode) IsNull() bool {
	return false
}
func (PBNode) AsBool() (bool, error) {
2389
	return mixins.Map{TypeName: "dagpb.PBNode"}.AsBool()
2390
}
2391
func (PBNode) AsInt() (int64, error) {
2392
	return mixins.Map{TypeName: "dagpb.PBNode"}.AsInt()
2393 2394
}
func (PBNode) AsFloat() (float64, error) {
2395
	return mixins.Map{TypeName: "dagpb.PBNode"}.AsFloat()
2396 2397
}
func (PBNode) AsString() (string, error) {
2398
	return mixins.Map{TypeName: "dagpb.PBNode"}.AsString()
2399 2400
}
func (PBNode) AsBytes() ([]byte, error) {
2401
	return mixins.Map{TypeName: "dagpb.PBNode"}.AsBytes()
2402
}
2403
func (PBNode) AsLink() (ld.Link, error) {
2404
	return mixins.Map{TypeName: "dagpb.PBNode"}.AsLink()
2405
}
2406
func (PBNode) Prototype() ld.NodePrototype {
2407 2408
	return _PBNode__Prototype{}
}
2409

2410 2411
type _PBNode__Prototype struct{}

2412
func (_PBNode__Prototype) NewBuilder() ld.NodeBuilder {
2413 2414 2415 2416
	var nb _PBNode__Builder
	nb.Reset()
	return &nb
}
2417

2418 2419 2420
type _PBNode__Builder struct {
	_PBNode__Assembler
}
2421

2422
func (nb *_PBNode__Builder) Build() ld.Node {
2423 2424 2425 2426 2427 2428 2429 2430 2431 2432
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_PBNode__Builder) Reset() {
	var w _PBNode
	var m schema.Maybe
	*nb = _PBNode__Builder{_PBNode__Assembler{w: &w, m: &m}}
}
2433

2434
type _PBNode__Assembler struct {
2435 2436
	w     *_PBNode
	m     *schema.Maybe
2437
	state maState
2438 2439
	s     int
	f     int
2440

2441
	cm       schema.Maybe
2442
	ca_Links _PBLinks__Assembler
2443 2444
	ca_Data  _Bytes__Assembler
}
2445 2446 2447 2448 2449 2450 2451 2452 2453

func (na *_PBNode__Assembler) reset() {
	na.state = maState_initial
	na.s = 0
	na.ca_Links.reset()
	na.ca_Data.reset()
}

var (
2454 2455 2456
	fieldBit__PBNode_Links       = 1 << 0
	fieldBit__PBNode_Data        = 1 << 1
	fieldBits__PBNode_sufficient = 0 + 1<<0
2457
)
2458

2459
func (na *_PBNode__Assembler) BeginMap(int64) (ld.MapAssembler, error) {
2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: it makes no sense to 'begin' twice on the same assembler!")
	}
	*na.m = midvalue
	if na.w == nil {
		na.w = &_PBNode{}
	}
	return na, nil
}
2472
func (_PBNode__Assembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
2473
	return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.BeginList(0)
2474 2475 2476 2477 2478 2479 2480
}
func (na *_PBNode__Assembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
2481
		return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.AssignNull()
2482 2483 2484 2485 2486 2487 2488 2489
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
	}
	panic("unreachable")
}
func (_PBNode__Assembler) AssignBool(bool) error {
2490
	return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.AssignBool(false)
2491
}
2492
func (_PBNode__Assembler) AssignInt(int64) error {
2493
	return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.AssignInt(0)
2494 2495
}
func (_PBNode__Assembler) AssignFloat(float64) error {
2496
	return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.AssignFloat(0)
2497 2498
}
func (_PBNode__Assembler) AssignString(string) error {
2499
	return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.AssignString("")
2500 2501
}
func (_PBNode__Assembler) AssignBytes([]byte) error {
2502
	return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.AssignBytes(nil)
2503
}
2504
func (_PBNode__Assembler) AssignLink(ld.Link) error {
2505
	return mixins.MapAssembler{TypeName: "dagpb.PBNode"}.AssignLink(nil)
2506
}
2507
func (na *_PBNode__Assembler) AssignNode(v ld.Node) error {
2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_PBNode); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		case midvalue:
			panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
		}
		if na.w == nil {
			na.w = v2
			*na.m = schema.Maybe_Value
			return nil
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
2527 2528
	if v.Kind() != ld.Kind_Map {
		return ld.ErrWrongKind{TypeName: "dagpb.PBNode", MethodName: "AssignNode", AppropriateKind: ld.KindSet_JustMap, ActualKind: v.Kind()}
2529 2530 2531 2532 2533 2534 2535
	}
	itr := v.MapIterator()
	for !itr.Done() {
		k, v, err := itr.Next()
		if err != nil {
			return err
		}
2536
		if err := na.AssembleKey().AssignNode(k); err != nil {
2537 2538
			return err
		}
2539
		if err := na.AssembleValue().AssignNode(v); err != nil {
2540 2541 2542 2543 2544
			return err
		}
	}
	return na.Finish()
}
2545
func (_PBNode__Assembler) Prototype() ld.NodePrototype {
2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571
	return _PBNode__Prototype{}
}
func (ma *_PBNode__Assembler) valueFinishTidy() bool {
	switch ma.f {
	case 0:
		switch ma.cm {
		case schema.Maybe_Value:
			ma.ca_Links.w = nil
			ma.cm = schema.Maybe_Absent
			ma.state = maState_initial
			return true
		default:
			return false
		}
	case 1:
		switch ma.w.Data.m {
		case schema.Maybe_Value:
			ma.state = maState_initial
			return true
		default:
			return false
		}
	default:
		panic("unreachable")
	}
}
2572
func (ma *_PBNode__Assembler) AssembleEntry(k string) (ld.NodeAssembler, error) {
2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleEntry cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleEntry cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleEntry cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleEntry cannot be called on an assembler that's already finished")
	}
	switch k {
	case "Links":
2589
		if ma.s&fieldBit__PBNode_Links != 0 {
2590
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Links}
2591 2592 2593 2594 2595 2596 2597 2598
		}
		ma.s += fieldBit__PBNode_Links
		ma.state = maState_midValue
		ma.f = 0
		ma.ca_Links.w = &ma.w.Links
		ma.ca_Links.m = &ma.cm
		return &ma.ca_Links, nil
	case "Data":
2599
		if ma.s&fieldBit__PBNode_Data != 0 {
2600
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Data}
2601 2602 2603 2604
		}
		ma.s += fieldBit__PBNode_Data
		ma.state = maState_midValue
		ma.f = 1
2605
		ma.ca_Data.w = &ma.w.Data.v
2606 2607 2608
		ma.ca_Data.m = &ma.w.Data.m
		return &ma.ca_Data, nil
	}
2609
	return nil, ld.ErrInvalidKey{TypeName: "dagpb.PBNode", Key: &_String{k}}
2610
}
2611
func (ma *_PBNode__Assembler) AssembleKey() ld.NodeAssembler {
2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleKey cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleKey cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleKey cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleKey cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midKey
	return (*_PBNode__KeyAssembler)(ma)
}
2629
func (ma *_PBNode__Assembler) AssembleValue() ld.NodeAssembler {
2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648
	switch ma.state {
	case maState_initial:
		panic("invalid state: AssembleValue cannot be called when no key is primed")
	case maState_midKey:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		// carry on
	case maState_midValue:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling another value")
	case maState_finished:
		panic("invalid state: AssembleValue cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midValue
	switch ma.f {
	case 0:
		ma.ca_Links.w = &ma.w.Links
		ma.ca_Links.m = &ma.cm
		return &ma.ca_Links
	case 1:
2649
		ma.ca_Data.w = &ma.w.Data.v
2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670
		ma.ca_Data.m = &ma.w.Data.m
		return &ma.ca_Data
	default:
		panic("unreachable")
	}
}
func (ma *_PBNode__Assembler) Finish() error {
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: Finish cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		panic("invalid state: Finish cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: Finish cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: Finish cannot be called on an assembler that's already finished")
	}
2671
	if ma.s&fieldBits__PBNode_sufficient != fieldBits__PBNode_sufficient {
2672
		err := ld.ErrMissingRequiredField{Missing: make([]string, 0)}
2673
		if ma.s&fieldBit__PBNode_Links == 0 {
2674 2675 2676 2677 2678 2679 2680 2681
			err.Missing = append(err.Missing, "Links")
		}
		return err
	}
	ma.state = maState_finished
	*ma.m = schema.Maybe_Value
	return nil
}
2682
func (ma *_PBNode__Assembler) KeyPrototype() ld.NodePrototype {
2683 2684
	return _String__Prototype{}
}
2685
func (ma *_PBNode__Assembler) ValuePrototype(k string) ld.NodePrototype {
2686 2687
	panic("todo structbuilder mapassembler valueprototype")
}
2688

2689
type _PBNode__KeyAssembler _PBNode__Assembler
2690

2691
func (_PBNode__KeyAssembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
2692
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.BeginMap(0)
2693
}
2694
func (_PBNode__KeyAssembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
2695
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.BeginList(0)
2696 2697
}
func (na *_PBNode__KeyAssembler) AssignNull() error {
2698
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.AssignNull()
2699 2700
}
func (_PBNode__KeyAssembler) AssignBool(bool) error {
2701
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.AssignBool(false)
2702
}
2703
func (_PBNode__KeyAssembler) AssignInt(int64) error {
2704
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.AssignInt(0)
2705 2706
}
func (_PBNode__KeyAssembler) AssignFloat(float64) error {
2707
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.AssignFloat(0)
2708 2709 2710 2711 2712 2713 2714
}
func (ka *_PBNode__KeyAssembler) AssignString(k string) error {
	if ka.state != maState_midKey {
		panic("misuse: KeyAssembler held beyond its valid lifetime")
	}
	switch k {
	case "Links":
2715
		if ka.s&fieldBit__PBNode_Links != 0 {
2716
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Links}
2717 2718 2719 2720
		}
		ka.s += fieldBit__PBNode_Links
		ka.state = maState_expectValue
		ka.f = 0
2721
		return nil
2722
	case "Data":
2723
		if ka.s&fieldBit__PBNode_Data != 0 {
2724
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Data}
2725 2726 2727 2728
		}
		ka.s += fieldBit__PBNode_Data
		ka.state = maState_expectValue
		ka.f = 1
2729
		return nil
2730
	default:
2731
		return ld.ErrInvalidKey{TypeName: "dagpb.PBNode", Key: &_String{k}}
2732 2733 2734
	}
}
func (_PBNode__KeyAssembler) AssignBytes([]byte) error {
2735
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.AssignBytes(nil)
2736
}
2737
func (_PBNode__KeyAssembler) AssignLink(ld.Link) error {
2738
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.KeyAssembler"}.AssignLink(nil)
2739
}
2740
func (ka *_PBNode__KeyAssembler) AssignNode(v ld.Node) error {
2741 2742 2743 2744 2745 2746
	if v2, err := v.AsString(); err != nil {
		return err
	} else {
		return ka.AssignString(v2)
	}
}
2747
func (_PBNode__KeyAssembler) Prototype() ld.NodePrototype {
2748 2749 2750 2751 2752
	return _String__Prototype{}
}
func (PBNode) Type() schema.Type {
	return nil /*TODO:typelit*/
}
2753
func (n PBNode) Representation() ld.Node {
2754 2755
	return (*_PBNode__Repr)(n)
}
2756

2757
type _PBNode__Repr _PBNode
2758

2759 2760
var (
	fieldName__PBNode_Links_serial = _String{"Links"}
2761
	fieldName__PBNode_Data_serial  = _String{"Data"}
2762
)
2763
var _ ld.Node = &_PBNode__Repr{}
2764

2765 2766
func (_PBNode__Repr) Kind() ld.Kind {
	return ld.Kind_Map
2767
}
2768
func (n *_PBNode__Repr) LookupByString(key string) (ld.Node, error) {
2769 2770 2771 2772 2773
	switch key {
	case "Links":
		return n.Links.Representation(), nil
	case "Data":
		if n.Data.m == schema.Maybe_Absent {
2774
			return ld.Absent, ld.ErrNotExists{Segment: ld.PathSegmentOfString(key)}
2775 2776 2777
		}
		return n.Data.v.Representation(), nil
	default:
2778
		return nil, schema.ErrNoSuchField{Type: nil /*TODO*/, Field: ld.PathSegmentOfString(key)}
2779 2780
	}
}
2781
func (n *_PBNode__Repr) LookupByNode(key ld.Node) (ld.Node, error) {
2782 2783 2784 2785 2786 2787
	ks, err := key.AsString()
	if err != nil {
		return nil, err
	}
	return n.LookupByString(ks)
}
2788
func (_PBNode__Repr) LookupByIndex(idx int64) (ld.Node, error) {
2789
	return mixins.Map{TypeName: "dagpb.PBNode.Repr"}.LookupByIndex(0)
2790
}
2791
func (n _PBNode__Repr) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
2792 2793
	return n.LookupByString(seg.String())
}
2794
func (n *_PBNode__Repr) MapIterator() ld.MapIterator {
2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810
	end := 2
	if n.Data.m == schema.Maybe_Absent {
		end = 1
	} else {
		goto done
	}
done:
	return &_PBNode__ReprMapItr{n, 0, end}
}

type _PBNode__ReprMapItr struct {
	n   *_PBNode__Repr
	idx int
	end int
}

2811
func (itr *_PBNode__ReprMapItr) Next() (k ld.Node, v ld.Node, _ error) {
2812 2813
advance:
	if itr.idx >= 2 {
2814
		return nil, nil, ld.ErrIteratorOverread{}
2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835
	}
	switch itr.idx {
	case 0:
		k = &fieldName__PBNode_Links_serial
		v = itr.n.Links.Representation()
	case 1:
		k = &fieldName__PBNode_Data_serial
		if itr.n.Data.m == schema.Maybe_Absent {
			itr.idx++
			goto advance
		}
		v = itr.n.Data.v.Representation()
	default:
		panic("unreachable")
	}
	itr.idx++
	return
}
func (itr *_PBNode__ReprMapItr) Done() bool {
	return itr.idx >= itr.end
}
2836
func (_PBNode__Repr) ListIterator() ld.ListIterator {
2837 2838
	return nil
}
2839
func (rn *_PBNode__Repr) Length() int64 {
2840 2841 2842 2843
	l := 2
	if rn.Data.m == schema.Maybe_Absent {
		l--
	}
2844
	return int64(l)
2845 2846 2847 2848 2849 2850 2851 2852
}
func (_PBNode__Repr) IsAbsent() bool {
	return false
}
func (_PBNode__Repr) IsNull() bool {
	return false
}
func (_PBNode__Repr) AsBool() (bool, error) {
2853
	return mixins.Map{TypeName: "dagpb.PBNode.Repr"}.AsBool()
2854
}
2855
func (_PBNode__Repr) AsInt() (int64, error) {
2856
	return mixins.Map{TypeName: "dagpb.PBNode.Repr"}.AsInt()
2857 2858
}
func (_PBNode__Repr) AsFloat() (float64, error) {
2859
	return mixins.Map{TypeName: "dagpb.PBNode.Repr"}.AsFloat()
2860 2861
}
func (_PBNode__Repr) AsString() (string, error) {
2862
	return mixins.Map{TypeName: "dagpb.PBNode.Repr"}.AsString()
2863 2864
}
func (_PBNode__Repr) AsBytes() ([]byte, error) {
2865
	return mixins.Map{TypeName: "dagpb.PBNode.Repr"}.AsBytes()
2866
}
2867
func (_PBNode__Repr) AsLink() (ld.Link, error) {
2868
	return mixins.Map{TypeName: "dagpb.PBNode.Repr"}.AsLink()
2869
}
2870
func (_PBNode__Repr) Prototype() ld.NodePrototype {
2871 2872
	return _PBNode__ReprPrototype{}
}
2873

2874 2875
type _PBNode__ReprPrototype struct{}

2876
func (_PBNode__ReprPrototype) NewBuilder() ld.NodeBuilder {
2877 2878 2879 2880
	var nb _PBNode__ReprBuilder
	nb.Reset()
	return &nb
}
2881

2882 2883 2884
type _PBNode__ReprBuilder struct {
	_PBNode__ReprAssembler
}
2885

2886
func (nb *_PBNode__ReprBuilder) Build() ld.Node {
2887 2888 2889 2890 2891 2892 2893 2894 2895 2896
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_PBNode__ReprBuilder) Reset() {
	var w _PBNode
	var m schema.Maybe
	*nb = _PBNode__ReprBuilder{_PBNode__ReprAssembler{w: &w, m: &m}}
}
2897

2898
type _PBNode__ReprAssembler struct {
2899 2900
	w     *_PBNode
	m     *schema.Maybe
2901
	state maState
2902 2903
	s     int
	f     int
2904

2905
	cm       schema.Maybe
2906
	ca_Links _PBLinks__ReprAssembler
2907 2908
	ca_Data  _Bytes__ReprAssembler
}
2909 2910 2911 2912 2913 2914 2915

func (na *_PBNode__ReprAssembler) reset() {
	na.state = maState_initial
	na.s = 0
	na.ca_Links.reset()
	na.ca_Data.reset()
}
2916
func (na *_PBNode__ReprAssembler) BeginMap(int64) (ld.MapAssembler, error) {
2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: it makes no sense to 'begin' twice on the same assembler!")
	}
	*na.m = midvalue
	if na.w == nil {
		na.w = &_PBNode{}
	}
	return na, nil
}
2929
func (_PBNode__ReprAssembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
2930
	return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr"}.BeginList(0)
2931 2932 2933 2934 2935 2936 2937
}
func (na *_PBNode__ReprAssembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
2938
		return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr.Repr"}.AssignNull()
2939 2940 2941 2942 2943 2944 2945 2946
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	case midvalue:
		panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
	}
	panic("unreachable")
}
func (_PBNode__ReprAssembler) AssignBool(bool) error {
2947
	return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr"}.AssignBool(false)
2948
}
2949
func (_PBNode__ReprAssembler) AssignInt(int64) error {
2950
	return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr"}.AssignInt(0)
2951 2952
}
func (_PBNode__ReprAssembler) AssignFloat(float64) error {
2953
	return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr"}.AssignFloat(0)
2954 2955
}
func (_PBNode__ReprAssembler) AssignString(string) error {
2956
	return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr"}.AssignString("")
2957 2958
}
func (_PBNode__ReprAssembler) AssignBytes([]byte) error {
2959
	return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr"}.AssignBytes(nil)
2960
}
2961
func (_PBNode__ReprAssembler) AssignLink(ld.Link) error {
2962
	return mixins.MapAssembler{TypeName: "dagpb.PBNode.Repr"}.AssignLink(nil)
2963
}
2964
func (na *_PBNode__ReprAssembler) AssignNode(v ld.Node) error {
2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_PBNode); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		case midvalue:
			panic("invalid state: cannot assign null into an assembler that's already begun working on recursive structures!")
		}
		if na.w == nil {
			na.w = v2
			*na.m = schema.Maybe_Value
			return nil
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
2984 2985
	if v.Kind() != ld.Kind_Map {
		return ld.ErrWrongKind{TypeName: "dagpb.PBNode.Repr", MethodName: "AssignNode", AppropriateKind: ld.KindSet_JustMap, ActualKind: v.Kind()}
2986 2987 2988 2989 2990 2991 2992
	}
	itr := v.MapIterator()
	for !itr.Done() {
		k, v, err := itr.Next()
		if err != nil {
			return err
		}
2993
		if err := na.AssembleKey().AssignNode(k); err != nil {
2994 2995
			return err
		}
2996
		if err := na.AssembleValue().AssignNode(v); err != nil {
2997 2998 2999 3000 3001
			return err
		}
	}
	return na.Finish()
}
3002
func (_PBNode__ReprAssembler) Prototype() ld.NodePrototype {
3003 3004 3005 3006 3007 3008
	return _PBNode__ReprPrototype{}
}
func (ma *_PBNode__ReprAssembler) valueFinishTidy() bool {
	switch ma.f {
	case 0:
		switch ma.cm {
3009 3010
		case schema.Maybe_Value:
			ma.cm = schema.Maybe_Absent
3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027
			ma.state = maState_initial
			return true
		default:
			return false
		}
	case 1:
		switch ma.w.Data.m {
		case schema.Maybe_Value:
			ma.state = maState_initial
			return true
		default:
			return false
		}
	default:
		panic("unreachable")
	}
}
3028
func (ma *_PBNode__ReprAssembler) AssembleEntry(k string) (ld.NodeAssembler, error) {
3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleEntry cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleEntry cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleEntry cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleEntry cannot be called on an assembler that's already finished")
	}
	switch k {
	case "Links":
3045
		if ma.s&fieldBit__PBNode_Links != 0 {
3046
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Links_serial}
3047 3048 3049 3050 3051 3052 3053 3054
		}
		ma.s += fieldBit__PBNode_Links
		ma.state = maState_midValue
		ma.f = 0
		ma.ca_Links.w = &ma.w.Links
		ma.ca_Links.m = &ma.cm
		return &ma.ca_Links, nil
	case "Data":
3055
		if ma.s&fieldBit__PBNode_Data != 0 {
3056
			return nil, ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Data_serial}
3057 3058 3059 3060
		}
		ma.s += fieldBit__PBNode_Data
		ma.state = maState_midValue
		ma.f = 1
3061
		ma.ca_Data.w = &ma.w.Data.v
3062
		ma.ca_Data.m = &ma.w.Data.m
3063

3064 3065 3066
		return &ma.ca_Data, nil
	default:
	}
3067
	return nil, ld.ErrInvalidKey{TypeName: "dagpb.PBNode.Repr", Key: &_String{k}}
3068
}
3069
func (ma *_PBNode__ReprAssembler) AssembleKey() ld.NodeAssembler {
3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: AssembleKey cannot be called when in the middle of assembling another key")
	case maState_expectValue:
		panic("invalid state: AssembleKey cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: AssembleKey cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: AssembleKey cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midKey
	return (*_PBNode__ReprKeyAssembler)(ma)
}
3087
func (ma *_PBNode__ReprAssembler) AssembleValue() ld.NodeAssembler {
3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106
	switch ma.state {
	case maState_initial:
		panic("invalid state: AssembleValue cannot be called when no key is primed")
	case maState_midKey:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		// carry on
	case maState_midValue:
		panic("invalid state: AssembleValue cannot be called when in the middle of assembling another value")
	case maState_finished:
		panic("invalid state: AssembleValue cannot be called on an assembler that's already finished")
	}
	ma.state = maState_midValue
	switch ma.f {
	case 0:
		ma.ca_Links.w = &ma.w.Links
		ma.ca_Links.m = &ma.cm
		return &ma.ca_Links
	case 1:
3107
		ma.ca_Data.w = &ma.w.Data.v
3108
		ma.ca_Data.m = &ma.w.Data.m
3109

3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129
		return &ma.ca_Data
	default:
		panic("unreachable")
	}
}
func (ma *_PBNode__ReprAssembler) Finish() error {
	switch ma.state {
	case maState_initial:
		// carry on
	case maState_midKey:
		panic("invalid state: Finish cannot be called when in the middle of assembling a key")
	case maState_expectValue:
		panic("invalid state: Finish cannot be called when expecting start of value assembly")
	case maState_midValue:
		if !ma.valueFinishTidy() {
			panic("invalid state: Finish cannot be called when in the middle of assembling a value")
		} // if tidy success: carry on
	case maState_finished:
		panic("invalid state: Finish cannot be called on an assembler that's already finished")
	}
3130
	if ma.s&fieldBits__PBNode_sufficient != fieldBits__PBNode_sufficient {
3131
		err := ld.ErrMissingRequiredField{Missing: make([]string, 0)}
3132
		if ma.s&fieldBit__PBNode_Links == 0 {
3133 3134 3135 3136 3137 3138 3139 3140
			err.Missing = append(err.Missing, "Links")
		}
		return err
	}
	ma.state = maState_finished
	*ma.m = schema.Maybe_Value
	return nil
}
3141
func (ma *_PBNode__ReprAssembler) KeyPrototype() ld.NodePrototype {
3142 3143
	return _String__Prototype{}
}
3144
func (ma *_PBNode__ReprAssembler) ValuePrototype(k string) ld.NodePrototype {
3145 3146
	panic("todo structbuilder mapassembler repr valueprototype")
}
3147

3148
type _PBNode__ReprKeyAssembler _PBNode__ReprAssembler
3149

3150
func (_PBNode__ReprKeyAssembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
3151
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.BeginMap(0)
3152
}
3153
func (_PBNode__ReprKeyAssembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
3154
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.BeginList(0)
3155 3156
}
func (na *_PBNode__ReprKeyAssembler) AssignNull() error {
3157
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.AssignNull()
3158 3159
}
func (_PBNode__ReprKeyAssembler) AssignBool(bool) error {
3160
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.AssignBool(false)
3161
}
3162
func (_PBNode__ReprKeyAssembler) AssignInt(int64) error {
3163
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.AssignInt(0)
3164 3165
}
func (_PBNode__ReprKeyAssembler) AssignFloat(float64) error {
3166
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.AssignFloat(0)
3167 3168 3169 3170 3171 3172 3173
}
func (ka *_PBNode__ReprKeyAssembler) AssignString(k string) error {
	if ka.state != maState_midKey {
		panic("misuse: KeyAssembler held beyond its valid lifetime")
	}
	switch k {
	case "Links":
3174
		if ka.s&fieldBit__PBNode_Links != 0 {
3175
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Links_serial}
3176 3177 3178 3179
		}
		ka.s += fieldBit__PBNode_Links
		ka.state = maState_expectValue
		ka.f = 0
3180
		return nil
3181
	case "Data":
3182
		if ka.s&fieldBit__PBNode_Data != 0 {
3183
			return ld.ErrRepeatedMapKey{Key: &fieldName__PBNode_Data_serial}
3184 3185 3186 3187
		}
		ka.s += fieldBit__PBNode_Data
		ka.state = maState_expectValue
		ka.f = 1
3188
		return nil
3189
	}
3190
	return ld.ErrInvalidKey{TypeName: "dagpb.PBNode.Repr", Key: &_String{k}}
3191 3192
}
func (_PBNode__ReprKeyAssembler) AssignBytes([]byte) error {
3193
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.AssignBytes(nil)
3194
}
3195
func (_PBNode__ReprKeyAssembler) AssignLink(ld.Link) error {
3196
	return mixins.StringAssembler{TypeName: "dagpb.PBNode.Repr.KeyAssembler"}.AssignLink(nil)
3197
}
3198
func (ka *_PBNode__ReprKeyAssembler) AssignNode(v ld.Node) error {
3199 3200 3201 3202 3203 3204
	if v2, err := v.AsString(); err != nil {
		return err
	} else {
		return ka.AssignString(v2)
	}
}
3205
func (_PBNode__ReprKeyAssembler) Prototype() ld.NodePrototype {
3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219
	return _String__Prototype{}
}

func (n String) String() string {
	return n.x
}
func (_String__Prototype) fromString(w *_String, v string) error {
	*w = _String{v}
	return nil
}
func (_String__Prototype) FromString(v string) (String, error) {
	n := _String{v}
	return &n, nil
}
3220

3221 3222
type _String__Maybe struct {
	m schema.Maybe
3223
	v _String
3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235
}
type MaybeString = *_String__Maybe

func (m MaybeString) IsNull() bool {
	return m.m == schema.Maybe_Null
}
func (m MaybeString) IsAbsent() bool {
	return m.m == schema.Maybe_Absent
}
func (m MaybeString) Exists() bool {
	return m.m == schema.Maybe_Value
}
3236
func (m MaybeString) AsNode() ld.Node {
3237
	switch m.m {
3238
	case schema.Maybe_Absent:
3239
		return ld.Absent
3240
	case schema.Maybe_Null:
3241
		return ld.Null
3242 3243 3244 3245
	case schema.Maybe_Value:
		return &m.v
	default:
		panic("unreachable")
3246 3247 3248 3249 3250 3251
	}
}
func (m MaybeString) Must() String {
	if !m.Exists() {
		panic("unbox of a maybe rejected")
	}
3252
	return &m.v
3253
}
3254

3255
var _ ld.Node = (String)(&_String{})
3256
var _ schema.TypedNode = (String)(&_String{})
3257

3258 3259
func (String) Kind() ld.Kind {
	return ld.Kind_String
3260
}
3261
func (String) LookupByString(string) (ld.Node, error) {
3262
	return mixins.String{TypeName: "dagpb.String"}.LookupByString("")
3263
}
3264
func (String) LookupByNode(ld.Node) (ld.Node, error) {
3265
	return mixins.String{TypeName: "dagpb.String"}.LookupByNode(nil)
3266
}
3267
func (String) LookupByIndex(idx int64) (ld.Node, error) {
3268
	return mixins.String{TypeName: "dagpb.String"}.LookupByIndex(0)
3269
}
3270
func (String) LookupBySegment(seg ld.PathSegment) (ld.Node, error) {
3271
	return mixins.String{TypeName: "dagpb.String"}.LookupBySegment(seg)
3272
}
3273
func (String) MapIterator() ld.MapIterator {
3274 3275
	return nil
}
3276
func (String) ListIterator() ld.ListIterator {
3277 3278
	return nil
}
3279
func (String) Length() int64 {
3280 3281 3282 3283 3284 3285 3286 3287 3288
	return -1
}
func (String) IsAbsent() bool {
	return false
}
func (String) IsNull() bool {
	return false
}
func (String) AsBool() (bool, error) {
3289
	return mixins.String{TypeName: "dagpb.String"}.AsBool()
3290
}
3291
func (String) AsInt() (int64, error) {
3292
	return mixins.String{TypeName: "dagpb.String"}.AsInt()
3293 3294
}
func (String) AsFloat() (float64, error) {
3295
	return mixins.String{TypeName: "dagpb.String"}.AsFloat()
3296 3297 3298 3299 3300
}
func (n String) AsString() (string, error) {
	return n.x, nil
}
func (String) AsBytes() ([]byte, error) {
3301
	return mixins.String{TypeName: "dagpb.String"}.AsBytes()
3302
}
3303
func (String) AsLink() (ld.Link, error) {
3304
	return mixins.String{TypeName: "dagpb.String"}.AsLink()
3305
}
3306
func (String) Prototype() ld.NodePrototype {
3307 3308
	return _String__Prototype{}
}
3309

3310 3311
type _String__Prototype struct{}

3312
func (_String__Prototype) NewBuilder() ld.NodeBuilder {
3313 3314 3315 3316
	var nb _String__Builder
	nb.Reset()
	return &nb
}
3317

3318 3319 3320
type _String__Builder struct {
	_String__Assembler
}
3321

3322
func (nb *_String__Builder) Build() ld.Node {
3323 3324 3325 3326 3327 3328 3329 3330 3331 3332
	if *nb.m != schema.Maybe_Value {
		panic("invalid state: cannot call Build on an assembler that's not finished")
	}
	return nb.w
}
func (nb *_String__Builder) Reset() {
	var w _String
	var m schema.Maybe
	*nb = _String__Builder{_String__Assembler{w: &w, m: &m}}
}
3333

3334 3335 3336 3337 3338 3339
type _String__Assembler struct {
	w *_String
	m *schema.Maybe
}

func (na *_String__Assembler) reset() {}
3340
func (_String__Assembler) BeginMap(sizeHint int64) (ld.MapAssembler, error) {
3341
	return mixins.StringAssembler{TypeName: "dagpb.String"}.BeginMap(0)
3342
}
3343
func (_String__Assembler) BeginList(sizeHint int64) (ld.ListAssembler, error) {
3344
	return mixins.StringAssembler{TypeName: "dagpb.String"}.BeginList(0)
3345 3346 3347 3348 3349 3350 3351
}
func (na *_String__Assembler) AssignNull() error {
	switch *na.m {
	case allowNull:
		*na.m = schema.Maybe_Null
		return nil
	case schema.Maybe_Absent:
3352
		return mixins.StringAssembler{TypeName: "dagpb.String"}.AssignNull()
3353 3354 3355 3356 3357 3358
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	panic("unreachable")
}
func (_String__Assembler) AssignBool(bool) error {
3359
	return mixins.StringAssembler{TypeName: "dagpb.String"}.AssignBool(false)
3360
}
3361
func (_String__Assembler) AssignInt(int64) error {
3362
	return mixins.StringAssembler{TypeName: "dagpb.String"}.AssignInt(0)
3363 3364
}
func (_String__Assembler) AssignFloat(float64) error {
3365
	return mixins.StringAssembler{TypeName: "dagpb.String"}.AssignFloat(0)
3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376
}
func (na *_String__Assembler) AssignString(v string) error {
	switch *na.m {
	case schema.Maybe_Value, schema.Maybe_Null:
		panic("invalid state: cannot assign into assembler that's already finished")
	}
	na.w.x = v
	*na.m = schema.Maybe_Value
	return nil
}
func (_String__Assembler) AssignBytes([]byte) error {
3377
	return mixins.StringAssembler{TypeName: "dagpb.String"}.AssignBytes(nil)
3378
}
3379
func (_String__Assembler) AssignLink(ld.Link) error {
3380
	return mixins.StringAssembler{TypeName: "dagpb.String"}.AssignLink(nil)
3381
}
3382
func (na *_String__Assembler) AssignNode(v ld.Node) error {
3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400
	if v.IsNull() {
		return na.AssignNull()
	}
	if v2, ok := v.(*_String); ok {
		switch *na.m {
		case schema.Maybe_Value, schema.Maybe_Null:
			panic("invalid state: cannot assign into assembler that's already finished")
		}
		*na.w = *v2
		*na.m = schema.Maybe_Value
		return nil
	}
	if v2, err := v.AsString(); err != nil {
		return err
	} else {
		return na.AssignString(v2)
	}
}
3401
func (_String__Assembler) Prototype() ld.NodePrototype {
3402 3403 3404 3405 3406
	return _String__Prototype{}
}
func (String) Type() schema.Type {
	return nil /*TODO:typelit*/
}
3407
func (n String) Representation() ld.Node {
3408 3409
	return (*_String__Repr)(n)
}
3410

3411
type _String__Repr = _String
3412

3413
var _ ld.Node = &_String__Repr{}
3414

3415 3416
type _String__ReprPrototype = _String__Prototype
type _String__ReprAssembler = _String__Assembler