TODO: consider a more generally-known optimization for reflect.Value ==> Interface Currently, we use this fragile method that taps into implememtatio

decInferLen will infer a sensible length, given the following: - clen: length wanted. - maxlen: max length to be returned. if <= 0, it is unset, and w

this will check if the next token is a break.

Note: TryDecodeAsNil should be careful not to share any temporary []byte with the rest of the decDriver. This is because sometimes, we optimize by hol

decodeExt(verifyTag bool, tag byte) (xtag byte, xbs []byte)

Size returns the number of Key Value pairs in the map. This takes O(1) time.

Set returns a new map in which Key and Value are associated. If the Key didn't exist before, it's created; otherwise, the associated Value is changed.

Equal returns true if a and b have the same contents

readx will use the implementation scratch buffer if possible i.e. n < len(scratchbuf), OR just return a view of the []byte being decoded from. Ensure

IsNil returns true if the Map is empty

Add the given value to the Sets.

DecodeString can also decode symbols. It looks redundant as DecodeBytes is available. However, some codecs (e.g. binc) support symbols and can return

Add the given value to the Sets.