|
| 1 | +import { |
| 2 | + accountNode, |
| 3 | + assertIsNode, |
| 4 | + definedTypeLinkNode, |
| 5 | + definedTypeNode, |
| 6 | + numberTypeNode, |
| 7 | + programLinkNode, |
| 8 | + programNode, |
| 9 | + rootNode, |
| 10 | + structFieldTypeNode, |
| 11 | + structTypeNode, |
| 12 | +} from '@codama/nodes'; |
| 13 | +import { visit } from '@codama/visitors-core'; |
| 14 | +import { expect, test } from 'vitest'; |
| 15 | + |
| 16 | +import { unwrapDefinedTypesVisitor } from '../src'; |
| 17 | + |
| 18 | +test('it unwraps defined types by following links', () => { |
| 19 | + // Given a program node with an account that uses a defined type link. |
| 20 | + const node = programNode({ |
| 21 | + accounts: [ |
| 22 | + accountNode({ |
| 23 | + data: structTypeNode([structFieldTypeNode({ name: 'value', type: definedTypeLinkNode('myType') })]), |
| 24 | + name: 'myAccount', |
| 25 | + }), |
| 26 | + ], |
| 27 | + definedTypes: [definedTypeNode({ name: 'myType', type: numberTypeNode('u64') })], |
| 28 | + name: 'myProgram', |
| 29 | + publicKey: '1111', |
| 30 | + }); |
| 31 | + |
| 32 | + // When we unwrap the defined types. |
| 33 | + const result = visit(node, unwrapDefinedTypesVisitor(['myType'])); |
| 34 | + |
| 35 | + // Then we expect the following tree. |
| 36 | + assertIsNode(result, 'programNode'); |
| 37 | + expect(result.accounts[0].data).toStrictEqual( |
| 38 | + structTypeNode([structFieldTypeNode({ name: 'value', type: numberTypeNode('u64') })]), |
| 39 | + ); |
| 40 | +}); |
| 41 | + |
| 42 | +test('it follows linked nodes using the correct paths', () => { |
| 43 | + // Given two link nodes designed so that the path would |
| 44 | + // fail if we did not save and restored linked paths. |
| 45 | + const programA = programNode({ |
| 46 | + definedTypes: [ |
| 47 | + definedTypeNode({ |
| 48 | + name: 'typeA', |
| 49 | + type: definedTypeLinkNode('typeB1', programLinkNode('programB')), |
| 50 | + }), |
| 51 | + ], |
| 52 | + name: 'programA', |
| 53 | + publicKey: '1111', |
| 54 | + }); |
| 55 | + const programB = programNode({ |
| 56 | + definedTypes: [ |
| 57 | + definedTypeNode({ name: 'typeB1', type: definedTypeLinkNode('typeB2') }), |
| 58 | + definedTypeNode({ name: 'typeB2', type: numberTypeNode('u64') }), |
| 59 | + ], |
| 60 | + name: 'programB', |
| 61 | + publicKey: '2222', |
| 62 | + }); |
| 63 | + const root = rootNode(programA, [programB]); |
| 64 | + |
| 65 | + // When we unwrap the defined types in programB. |
| 66 | + const visitor = unwrapDefinedTypesVisitor(['typeB1', 'typeB2']); |
| 67 | + const result = visit(root, visitor); |
| 68 | + |
| 69 | + // Then we expect the final linkable to be resolved in programA. |
| 70 | + assertIsNode(result, 'rootNode'); |
| 71 | + expect(result.program.definedTypes[0]).toStrictEqual( |
| 72 | + definedTypeNode({ name: 'typeA', type: numberTypeNode('u64') }), |
| 73 | + ); |
| 74 | +}); |
0 commit comments