generated from BlossomLabs/web3-turbo-template
-
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.
- Loading branch information
Showing
12 changed files
with
10,680 additions
and
8,526 deletions.
There are no files selected for viewing
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 |
|---|---|---|
| @@ -1,66 +1,66 @@ | ||
| import { ProposalMetadata } from "#/subgraph/.graphclient"; | ||
| import { LightCVStrategy } from "@/types"; | ||
| import { fetchIpfs } from "@/utils/ipfsUtils"; | ||
| // import { ProposalMetadata } from "#/subgraph/.graphclient"; | ||
| // import { LightCVStrategy } from "@/types"; | ||
| // import { fetchIpfs } from "@/utils/ipfsUtils"; | ||
|
|
||
| export async function getProposals(strategy: LightCVStrategy) { | ||
| try { | ||
| const fetchIPFSDataBatch = async function ( | ||
| proposals: (typeof strategy)["proposals"], | ||
| batchSize = 5, | ||
| delay = 300, | ||
| ) { | ||
| // Introduce a delay | ||
| const sleep = (ms: number) => | ||
| new Promise((resolve) => setTimeout(resolve, ms)); | ||
| // export async function getProposals(strategy: LightCVStrategy) { | ||
| // try { | ||
| // const fetchIPFSDataBatch = async function ( | ||
| // proposals: (typeof strategy)["proposals"], | ||
| // batchSize = 5, | ||
| // delay = 300, | ||
| // ) { | ||
| // // Introduce a delay | ||
| // const sleep = (ms: number) => | ||
| // new Promise((resolve) => setTimeout(resolve, ms)); | ||
|
|
||
| // Create proposal chunks | ||
| const chunks = Array.from( | ||
| { length: Math.ceil(proposals.length / batchSize) }, | ||
| (_, i) => proposals.slice(i * batchSize, i * batchSize + batchSize), | ||
| ); | ||
| // // Create proposal chunks | ||
| // const chunks = Array.from( | ||
| // { length: Math.ceil(proposals.length / batchSize) }, | ||
| // (_, i) => proposals.slice(i * batchSize, i * batchSize + batchSize), | ||
| // ); | ||
|
|
||
| // Process each chunk | ||
| let results: Array<Pick<ProposalMetadata, "title" | "description">> = []; | ||
| for (const chunk of chunks) { | ||
| chunk.forEach(async (p) => { | ||
| if (p.metadata) { | ||
| results.push(p.metadata); | ||
| } else { | ||
| const ipfsRes = await fetchIpfs<(typeof results)[number] | null>( | ||
| p.metadataHash, | ||
| ); | ||
| if (ipfsRes) { | ||
| results.push(ipfsRes); | ||
| } | ||
| } | ||
| }); | ||
| await sleep(delay); | ||
| } | ||
| // // Process each chunk | ||
| // let results: Array<Pick<ProposalMetadata, "title" | "description">> = []; | ||
| // for (const chunk of chunks) { | ||
| // chunk.forEach(async (p) => { | ||
| // if (p.metadata) { | ||
| // results.push(p.metadata); | ||
| // } else { | ||
| // const ipfsRes = await fetchIpfs<(typeof results)[number] | null>( | ||
| // p.metadataHash, | ||
| // ); | ||
| // if (ipfsRes) { | ||
| // results.push(ipfsRes); | ||
| // } | ||
| // } | ||
| // }); | ||
| // await sleep(delay); | ||
| // } | ||
|
|
||
| return results; | ||
| }; | ||
| // return results; | ||
| // }; | ||
|
|
||
| const proposalsData = await fetchIPFSDataBatch(strategy.proposals); | ||
| const transformedProposals = proposalsData | ||
| .map((data, index) => { | ||
| const p = strategy.proposals[index]; | ||
| return { | ||
| ...p, | ||
| voterStakedPointsPct: 0, | ||
| metadata: { | ||
| title: data.title, | ||
| description: data.description, | ||
| }, | ||
| stakedAmount: strategy.proposals[index].stakedAmount, | ||
| type: strategy.config?.proposalType as number, | ||
| status: strategy.proposals[index].proposalStatus, | ||
| createdAt: strategy.proposals[index].createdAt, | ||
| }; | ||
| }) | ||
| .sort((a, b) => +a.proposalNumber - +b.proposalNumber); // Sort by proposal number ascending | ||
| // const proposalsData = await fetchIPFSDataBatch(strategy.proposals); | ||
| // const transformedProposals = proposalsData | ||
| // .map((data, index) => { | ||
| // const p = strategy.proposals[index]; | ||
| // return { | ||
| // ...p, | ||
| // voterStakedPointsPct: 0, | ||
| // metadata: { | ||
| // title: data.title, | ||
| // description: data.description, | ||
| // }, | ||
| // stakedAmount: strategy.proposals[index].stakedAmount, | ||
| // type: strategy.config?.proposalType as number, | ||
| // status: strategy.proposals[index].proposalStatus, | ||
| // createdAt: strategy.proposals[index].createdAt, | ||
| // }; | ||
| // }) | ||
| // .sort((a, b) => +a.proposalNumber - +b.proposalNumber); // Sort by proposal number ascending | ||
|
|
||
| return transformedProposals; | ||
| } catch (error) { | ||
| console.error("Error while getting proposal ipfs metadata", error); | ||
| } | ||
| } | ||
| // return transformedProposals; | ||
| // } catch (error) { | ||
| // console.error("Error while getting proposal ipfs metadata", error); | ||
| // } | ||
| // } |
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
Oops, something went wrong.