UQCRJLxUs5JJo0TxFnCccqunpa3p4pyVepZheito3jVm96TS

async toBoc(has_idx = true, hash_crc32 = true, has_cache_bits = false, flags = 0) { const root_cell = this; const allcells = await root_cell.treeWalk(); const topologicalOrder = allcells[0]; const cellsIndex = allcells[1]; const cells_num = topologicalOrder.length; const s = cells_num.toString(2).length; // Minimal number of bits to represent reference (unused?) const s_bytes = Math.min(Math.ceil(s / 8), 1); let full_size = 0; let sizeIndex = []; for (let cell_info of topologicalOrder) { //TODO it should be async map or async for sizeIndex.push(full_size); full_size = full_size + await cell_info[1].bocSerializationSize(cellsIndex, s_bytes); } const offset_bits = full_size.toString(2).length; // Minimal number of bits to offset/len (unused?) const offset_bytes = Math.max(Math.ceil(offset_bits / 8), 1); const serialization = new BitString((1023 + 32 * 4 + 32 * 3) * topologicalOrder.length); serialization.writeBytes(reachBocMagicPrefix); serialization.writeBitArray([has_idx, hash_crc32, has_cache_bits]); serialization.writeUint(flags, 2); serialization.writeUint(s_bytes, 3); serialization.writeUint8(offset_bytes); serialization.writeUint(cells_num, s_bytes * 8); serialization.writeUint(1, s_bytes * 8); // One root for now serialization.writeUint(0, s_bytes * 8); // Complete BOCs only serialization.writeUint(full_size, offset_bytes * 8); serialization.writeUint(0, s_bytes * 8); // Root shoulh have index 0 if (has_idx) { topologicalOrder.forEach( (cell_data, index) => serialization.writeUint(sizeIndex[index], offset_bytes * 8)); } for (let cell_info of topologicalOrder) { //TODO it should be async map or async for const refcell_ser = await cell_info[1].serializeForBoc(cellsIndex, s_bytes); serialization.writeBytes(refcell_ser); } let ser_arr = serialization.getTopUppedArray(); if (hash_crc32) { ser_arr = concatBytes(ser_arr, crc32c(ser_arr)); } return ser_arr; }