/**
 * A list of key-value collections (BTreeMap)
 */
struct authors {
	size_t len;
	struct author *map;
};
/** An "author" is (strangely) a list of key-value pairs */
struct author {
	size_t len;
	struct author_entry *entries;
};
struct author_entry {
	char *key;
	char *value;
};

	void *authors;		/* a "key"="value" collection */

	struct authors authors;	/* a list of "key"="value" collections */

	len = bincode_getu64(&binstat); /* arrays of authors */
	hashed.header.authors.len = len;
	hashed.header.authors.map = xmalloc(sizeof(struct author) * len);
	printf("[[authors]]\n");
	for (i = 0; i < hashed.header.authors.len; i++) {
		int j;
		len = bincode_getu64(&binstat);
		hashed.header.authors.map[i].entries = xmalloc(sizeof(struct author) * len);
		hashed.header.authors.map[i].len = len;
		for (j = 0; j < hashed.header.authors.map[i].len; j++) {
			len = bincode_getu64(&binstat);
			hashed.header.authors.map[i].entries[j].key = bincode_getstr(&binstat, len);
			len = bincode_getu64(&binstat);
			hashed.header.authors.map[i].entries[j].value = bincode_getstr(&binstat, len);
			printf("%s = '%s'\n",
				hashed.header.authors.map[i].entries[j].key,
				hashed.header.authors.map[i].entries[j].value);
		}
	}
	dump_buf("buf2", binstat.buf, binstat.avail);