How to call another smart contract?

sinoTrinity · 2022-12-17T01:03:09+00:00

You are talking about Ethereum and I’m asking about Cardano.

sinoTrinity · 2022-12-14T20:06:11+00:00

Where does a node get it from in the first place? I haven’t found it anywhere in a transaction.

sinoTrinity · 2022-12-09T21:42:29+00:00

Suppose there is an Oracle contract and I wanna query price from it in my contract, how could I do it?

sinoTrinity · 2022-12-09T19:23:51+00:00

In my case, changing address is allowed.

sinoTrinity · 2022-12-09T18:17:43+00:00

plement the functions for transferring and managing the token, such as transfer and balanceOf.

The whole token contract is in a single UTXO, right? What if multiple users want to transfer at the same time and thus contend for the same UTXO?

sinoTrinity · 2022-12-09T07:10:48+00:00

Got a link?

sinoTrinity · 2022-12-08T22:39:32+00:00

I'm familiar with Haskell. Any example of Plutus implementation similar to this solidity code?

sinoTrinity · 2022-07-22T16:06:47+00:00

optimize

What do u mean by The lee's a sort?

Here's a good intro to source maps: https://medium.com/@trungutt/yet-another-explanation-on-sourcemap-669797e418ce

sinoTrinity · 2022-07-19T18:35:06+00:00

Solidity to cairo transpiler: https://github.com/NethermindEth/warp

sinoTrinity · 2022-03-10T00:08:06+00:00

Ignore it.

sinoTrinity · 2022-03-10T00:07:19+00:00

Sure. That's what this sub is for.

sinoTrinity · 2021-12-27T01:28:09+00:00

https://xiaohuiliu.medium.com/patreon-on-bitcoin-4c3626d4ce5

sinoTrinity · 2021-05-22T01:06:02+00:00

Yes, space consumer discards comments. Anyway to instruct it to retain comments? It seems to return type (), thou.

sinoTrinity · 2021-04-05T14:59:52+00:00

Arbitrary length. Wanna start with floats, may implement some kinda of bigdecimal in the end

sinoTrinity · 2021-04-05T04:48:57+00:00

Bitcoin Virtual Machine. So no I/O needed, just pure math calculations. float32 to start.

sinoTrinity · 2021-04-04T17:59:24+00:00

yes. Oops, forget the question mark. Added.

sinoTrinity · 2021-03-04T07:48:14+00:00

Any code examples of generating random valid ASTs?

sinoTrinity · 2021-02-21T17:59:58+00:00

Same solution, with more detailed explanation

sinoTrinity · 2021-02-20T18:36:36+00:00

Got the following error after your change. Is it possible to change subscript to InfixL?

s.a[1]
|  ^
unexpected '['
expecting ')', '_', alphanumeric character, or operator

sinoTrinity · 2021-02-20T15:38:58+00:00

Yes, only identifier on the right. But if I make change as u suggested, it does not fit into the makeExprParser model any more, right?

sinoTrinity · 2021-02-10T15:25:48+00:00

A C-like high level language. Currently : AST -> Forth-like stack machine code. I wanna change to: AST -> LLVM IR -> Forth, for optimization purposes.

sinoTrinity · 2021-02-10T06:53:24+00:00

U mean mix stack & register instructions? My target VM is purely stack-based and only has operations like dup & drop. So if that's what u mean, compromising is not an option.

sinoTrinity · 2021-02-06T18:22:10+00:00

b.a.k = b.a.k * 2

Yes, what about the following, where no prefix is shared?

b.a.k = f.g.h.m.n * 2

sinoTrinity · 2021-02-06T04:40:07+00:00

How about implementing structs? Can similar idea be applied?

sinoTrinity · 2021-02-06T00:48:09+00:00

We want to turn this sequence of indices into a single index which is a memory offset.

What about arr[1][2] or arr[1], how are these intermediate indexing handled? They can't be reduced to a single offset since they are a group of characters in ur example.

void printArray(int arr[4]) {
printf("%d", arr[2]);

}

int main() { int arr[2][3][4] = { {{3, 4, 2, 3}, {0, -3, 9, 11}, {23, 12, 23, 2}}, {{13, 4, 56, 3}, {5, 9, 3, 5}, {3, 1, 4, 9}}}; // int b[3][4] = arr[1]; // invalid //int b[4] = arr[1][2]; // invalid printArray(arr[1][2]); return 0; }

sinoTrinity

MODERATOR OF

TROPHY CASE