TGT4VSMEWWTFYILTXVZWA5WHB2RCZZYNGZJ3UUKZ5OPD6JQD4G5QC N3PUHKQNA2Q5LRKTXHOZVG4LCDRKY5WAOEDSXS34KL27RZCSVHHAC JAGXXSR7DR5FG77VKBF62BW7Q3JMVHCLHF4VB2PSLIZF4RLE553QC FMYCPGKDAPOUFLQOCXXKZ6TR75HT3TNCG4X3GAJDM4ARWKNWOSWAC Q7TKZCJP2Z75EICZYKCEZDHKGERSOKZGMTSU3UXETBHTF663T66AC RIWSVVASWLJQQTSVRHIIUPENOZWOMHQLZMTQVGJUS2ZUGDPSWWIQC YDQLW2ZOAH7PZ7HHVTSFUO5IWE6O7FDNXVNIN7GG4TJ3P2B2BM4AC XTVLIC243WZF52NVTNRA3SV3WLE2ZZ5GTFQOK45IOLMXYQMTLOSAC break;case FILE_ADD:change_decode_atom(binstat, &bhunk->fileadd.addname);change_decode_atom(binstat, &bhunk->fileadd.addinode);if (bincode_getu8(binstat))change_decode_atom(binstat, &bhunk->fileadd.contents);slen = bincode_getu64(binstat);bhunk->fileadd.path = bincode_getstr(binstat, slen);change_decode_encoding(binstat, &bhunk->edit.encoding);
printf("EdgeMap... \n");
printf("edgemap {\n edges: [\n");for (i = 0; i < m->edges.len; i++) {struct edge *e = &m->edges.entries[i];printf(" edge { previous = %u, flag = ",e->previous);print_edgeflags(e->flag);printf(", from = Position { .. }, to = vertex { .. }, introducedby = ");hashprint(&e->introducedby);printf(" }\n");}printf(" ]\n}\n");