-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
CP-9257 Integrate modifier system with mobile (#1980)
- Loading branch information
Showing
5 changed files
with
155 additions
and
53 deletions.
There are no files selected for viewing
106 changes: 106 additions & 0 deletions
106
packages/core-mobile/app/services/networkFee/NetworkFeeService.test.ts
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,106 @@ | ||
import ModuleManager from 'vmModule/ModuleManager' | ||
import { Network, NetworkVMType } from '@avalabs/core-chains-sdk' | ||
import { NetworkFee } from 'services/networkFee/types' | ||
import { Module } from '@avalabs/vm-module-types' | ||
import NetworkFeeService from './NetworkFeeService' | ||
|
||
const loadModuleSpy = jest.spyOn(ModuleManager, 'loadModuleByNetwork') | ||
|
||
describe('NetworkFeeService', () => { | ||
const mockNetwork = { | ||
vmName: NetworkVMType.AVM | ||
} as Network | ||
|
||
const mockNetworkFees = { | ||
baseFee: 100n, | ||
low: { | ||
maxFeePerGas: 10n, | ||
maxPriorityFeePerGas: 2n | ||
}, | ||
medium: { | ||
maxFeePerGas: 20n, | ||
maxPriorityFeePerGas: 3n | ||
}, | ||
high: { | ||
maxFeePerGas: 30n, | ||
maxPriorityFeePerGas: 4n | ||
}, | ||
isFixedFee: false | ||
} | ||
|
||
beforeEach(() => { | ||
// Reset mocks before each test | ||
jest.clearAllMocks() | ||
}) | ||
|
||
it('should return the correct network fee structure', async () => { | ||
loadModuleSpy.mockResolvedValue({ | ||
getNetworkFee: jest.fn().mockResolvedValue(mockNetworkFees) | ||
} as unknown as Module) | ||
|
||
const result = await NetworkFeeService.getNetworkFee(mockNetwork) | ||
|
||
const expected: NetworkFee = { | ||
baseFee: 100n, | ||
low: { | ||
maxFeePerGas: 10n, | ||
maxPriorityFeePerGas: 2n | ||
}, | ||
medium: { | ||
maxFeePerGas: 20n, | ||
maxPriorityFeePerGas: 3n | ||
}, | ||
high: { | ||
maxFeePerGas: 30n, | ||
maxPriorityFeePerGas: 4n | ||
}, | ||
isFixedFee: false | ||
} | ||
|
||
expect(result).toEqual(expected) | ||
}) | ||
|
||
it('should handle missing maxPriorityFeePerGas for low priority', async () => { | ||
const modifiedNetworkFees = { | ||
...mockNetworkFees, | ||
low: { | ||
maxFeePerGas: 10n, | ||
maxPriorityFeePerGas: undefined | ||
} | ||
} | ||
loadModuleSpy.mockResolvedValue({ | ||
getNetworkFee: jest.fn().mockResolvedValue(modifiedNetworkFees) | ||
} as unknown as Module) | ||
|
||
const result = await NetworkFeeService.getNetworkFee(mockNetwork) | ||
|
||
expect(result).toEqual({ | ||
baseFee: 100n, | ||
low: { | ||
maxFeePerGas: 10n, | ||
maxPriorityFeePerGas: undefined | ||
}, | ||
medium: { | ||
maxFeePerGas: 20n, | ||
maxPriorityFeePerGas: 3n | ||
}, | ||
high: { | ||
maxFeePerGas: 30n, | ||
maxPriorityFeePerGas: 4n | ||
}, | ||
isFixedFee: false | ||
}) | ||
}) | ||
|
||
it('should throw if module cannot load fees', async () => { | ||
loadModuleSpy.mockResolvedValue({ | ||
getNetworkFee: jest | ||
.fn() | ||
.mockRejectedValue(new Error('Failed to load fees')) | ||
} as unknown as Module) | ||
await expect(NetworkFeeService.getNetworkFee(mockNetwork)).rejects.toThrow( | ||
'Failed to load fees' | ||
) | ||
expect(ModuleManager.loadModuleByNetwork).toHaveBeenCalledWith(mockNetwork) | ||
}) | ||
}) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters