regenerated sdk

Author: StanChe

account-compression/sdk/idl/spl_account_compression.json

@@ -54,19 +54,22 @@
     {
       "name": "prepareTree",
       "docs": [
-        "In order to initialize a tree with a root, we need to create the tree on-chain first with the proper authority.",
-        "The tree might contain a canopy, which is a cache of the uppermost nodes.",
-        "The canopy is used to decrease the size of the proof required to update the tree.",
+        "In order to initialize a tree with a root, we need to create the tree on-chain first with",
+        "the proper authority. The tree might contain a canopy, which is a cache of the uppermost",
+        "nodes. The canopy is used to decrease the size of the proof required to update the tree.",
         "If the tree is expected to have a canopy, it needs to be prefilled with the necessary nodes.",
         "There are 2 ways to initialize a merkle tree:",
         "1. Initialize an empty tree",
         "2. Initialize a tree with a root and leaf",
-        "For the former case, the canopy will be empty which is expected for an empty tree. The expected flow is `init_empty_merkle_tree`.",
-        "For the latter case, the canopy should be filled with the necessary nodes to render the tree usable.",
-        "Thus we need to prefill the canopy with the necessary nodes.",
-        "The expected flow for a tree without canopy is `prepare_tree` -> `init_merkle_tree_with_root`.",
-        "The expected flow for a tree with canopy is `prepare_tree` -> `append_canopy_nodes` (multiple times until all of the canopy is filled) -> `init_merkle_tree_with_root`.",
-        "This instruction initializes the tree header while leaving the tree itself uninitialized. This allows distinguishing between an empty tree and a tree prepare to be initialized with a root."
+        "For the former case, the canopy will be empty which is expected for an empty tree. The",
+        "expected flow is `init_empty_merkle_tree`. For the latter case, the canopy should be",
+        "filled with the necessary nodes to render the tree usable. Thus we need to prefill the",
+        "canopy with the necessary nodes. The expected flow for a tree without canopy is",
+        "`prepare_tree` -> `init_merkle_tree_with_root`. The expected flow for a tree with canopy",
+        "is `prepare_tree` -> `append_canopy_nodes` (multiple times until all of the canopy is",
+        "filled) -> `init_merkle_tree_with_root`. This instruction initializes the tree header",
+        "while leaving the tree itself uninitialized. This allows distinguishing between an empty",
+        "tree and a tree prepare to be initialized with a root."
       ],
       "accounts": [
         {
@@ -105,7 +108,8 @@
       "name": "appendCanopyNodes",
       "docs": [
         "This instruction pre-initializes the canopy with the specified leaf nodes of the canopy.",
-        "This is intended to be used after `prepare_tree` and in conjunction with the `init_merkle_tree_with_root` instruction that'll finalize the tree initialization."
+        "This is intended to be used after `prepare_tree` and in conjunction with the",
+        "`init_merkle_tree_with_root` instruction that'll finalize the tree initialization."
       ],
       "accounts": [
         {

account-compression/sdk/tests/accountCompression.test.ts

@@ -250,7 +250,7 @@ describe('Account Compression', () => {
             const root = merkleTreeRaw.root;
             const leaf = leaves[leaves.length - 1];
 
-            const appendIx = createAppendCanopyNodesIx(cmt, payer, [merkleTreeRaw.leaves[0].parent?.node!], 0);
+            const appendIx = createAppendCanopyNodesIx(cmt, payer, [merkleTreeRaw.leaves[0].parent!.node!], 0);
             await execute(provider, [appendIx], [payerKeypair]);
             const finalize = createFinalizeMerkleTreeWithRootIx(cmt, payer, root, leaf, leaves.length - 1, merkleTreeRaw.getProof(leaves.length - 1).proof);
 
@@ -265,7 +265,7 @@ describe('Account Compression', () => {
             const leaf = leaves[leaves.length - 1];
 
             // take every second leaf and append it's parent node to the canopy
-            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 0);
+            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 0);
             await execute(provider, [appendIx], [payerKeypair]);
             const finalize = createFinalizeMerkleTreeWithRootIx(cmt, payer, root, leaf, leaves.length - 1, merkleTreeRaw.getProof(leaves.length - 1).proof);
             await execute(provider, [finalize], [payerKeypair]);
@@ -275,10 +275,10 @@ describe('Account Compression', () => {
             const root = merkleTreeRaw.root;
             const leaf = leaves[leaves.length - 1];
             // take every second leaf of the first half of a tree and append it's parent node to the canopy
-            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(0, leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 0);
+            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(0, leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 0);
             await execute(provider, [appendIx], [payerKeypair]);
             // take every second leaf of the second half of a tree and append it's parent node to the canopy
-            const appendIx2 = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 2);
+            const appendIx2 = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 2);
             await execute(provider, [appendIx2], [payerKeypair]);
             const finalize = createFinalizeMerkleTreeWithRootIx(cmt, payer, root, leaf, leaves.length - 1, merkleTreeRaw.getProof(leaves.length - 1).proof);
             await execute(provider, [finalize], [payerKeypair]);
@@ -288,9 +288,9 @@ describe('Account Compression', () => {
             const root = merkleTreeRaw.root;
             const leaf = leaves[leaves.length - 1];
 
-            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 2);
+            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 2);
             await execute(provider, [appendIx], [payerKeypair]);
-            const appendIx2 = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(0, leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 0);
+            const appendIx2 = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(0, leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 0);
             await execute(provider, [appendIx2], [payerKeypair]);
             const finalize = createFinalizeMerkleTreeWithRootIx(cmt, payer, root, leaf, leaves.length - 1, merkleTreeRaw.getProof(leaves.length - 1).proof);
             await execute(provider, [finalize], [payerKeypair]);
@@ -300,11 +300,11 @@ describe('Account Compression', () => {
             const root = merkleTreeRaw.root;
             const leaf = leaves[leaves.length - 1];
 
-            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(0, leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 0);
+            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(0, leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 0);
             await execute(provider, [appendIx], [payerKeypair]);
             const appendIx2 = createAppendCanopyNodesIx(cmt, payer, [crypto.randomBytes(32)], 2);
             await execute(provider, [appendIx2], [payerKeypair]);
-            const replaceIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 2);
+            const replaceIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.slice(leaves.length / 2).filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 2);
             await execute(provider, [replaceIx], [payerKeypair]);
             const finalize = createFinalizeMerkleTreeWithRootIx(cmt, payer, root, leaf, leaves.length - 1, merkleTreeRaw.getProof(leaves.length - 1).proof);
             await execute(provider, [finalize], [payerKeypair]);
@@ -314,7 +314,7 @@ describe('Account Compression', () => {
             const root = merkleTreeRaw.root;
             const leaf = leaves[leaves.length - 1];
 
-            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.filter((_, i) => i % 2 === 0).map(leaf => leaf.parent?.node!), 0);
+            const appendIx = createAppendCanopyNodesIx(cmt, payer, merkleTreeRaw.leaves.filter((_, i) => i % 2 === 0).map(leaf => leaf.parent!.node!), 0);
             await execute(provider, [appendIx], [payerKeypair]);
             const finalize = createFinalizeMerkleTreeWithRootIx(cmt, payer, root, leaf, leaves.length - 1, merkleTreeRaw.getProof(leaves.length - 1).proof);
             await execute(provider, [finalize], [payerKeypair]);