feat(minor-interchain-token-service): all chains with optional filter query message

[maancham]

Description

AXE-7369

Todos

• Unit tests
• Manual tests
• Documentation
• Connect epics/issues

Convention Checklist

• Each contract should have a client mod for others to interact with it.
• Derive macros
  • EnsurePermissions: Contract permission control
  • IntoContractError: Conversion from custom contract errors to axelar_wasm_std::error::ContractError
  • IntoEvent: Event serialization
  • migrate_from_version: Contract version management in the migrate function
• The state mod and msg mod should use separate data structures so that internal state changes do not break the contract interface. Check out the interchain-token-service for reference.
  • msg.rs should never use any type from the state.rs
  • Shared types must be defined in a separate exported mod. If those types have already been defined somewhere else, then they should get re-exported in the exported mod

Steps to Test

Expected Behaviour

Notes

[codecov]

Codecov Report

Attention: Patch coverage is 98.41270% with 1 line in your changes missing coverage. Please review.

Project coverage is 93.37%. Comparing base (1a8a4cc) to head (252d036).

Files with missing lines	Patch %	Lines
...cts/interchain-token-service/src/contract/query.rs	97.67%	1 Missing ⚠️

Additional details and impacted files

@@           Coverage Diff           @@
##             main     #754   +/-   ##
=======================================
  Coverage   93.36%   93.37%           
=======================================
  Files         225      225           
  Lines       36359    36422   +63     
=======================================
+ Hits        33947    34009   +62     
- Misses       2412     2413    +1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

[cgorenflo]

Suggested change

	limit: Option<u32>,
	#[serde(default = "default_pagination_limit"]
	limit: u32,

with

const fn default_pagination_limit() -> u32{
    DEFAULT_LIMIT
}

this makes it clearer that we never do an unbounded search