I hereby claim:
- I am krebernisak on github.
- I am krebernisak (https://keybase.io/krebernisak) on keybase.
- I have a public key ASDRGM-oIfTk6c3fZu7r8r3yiQjEcnItSd4ebc5M1_43Ego
To claim this, I am signing this object:
package com.firebase.client; | |
import com.firebase.client.AuthData; | |
import com.firebase.client.ChildEventListener; | |
import com.firebase.client.DataSnapshot; | |
import com.firebase.client.Firebase; | |
import com.firebase.client.FirebaseError; | |
import com.firebase.client.Query; | |
import com.firebase.client.ValueEventListener; | |
import com.firebase.client.core.view.Event; |
// es connection | |
class Client { | |
Call create(Query q); | |
} | |
// immutable call object created for specific client an query | |
class Call { | |
Result execute(); | |
ScrollableCall toScrollable(long ttl); // this call makes a network request to get the first scrollable token |
I hereby claim:
To claim this, I am signing this object:
It can be used for interviews or assessments.
Make sure you understand the basic requirements and ask clarification questions. Start with the most basic assumptions:
// Write a function that accepts as an argument a string of addition/subtraction operations. | |
// The function should return the result of the operations as an integer | |
// ex: calculate("1 - 2 + 3") => 2 | |
// will not see: "1 - -2" | |
/** | |
* Solution: | |
* 1. Build a stack using Reverse Polish (Post-fix) notation | |
* 2. Build a stack machine that reads and executes Reverse Polish (Post-fix) notation | |
* |
{"jsonrpc":"2.0","result":"0x6d6574610a2c1853797374656d011853797374656d34304163636f756e744e6f6e636501010130543a3a4163636f756e74496420543a3a496e646578001000000000047c2045787472696e73696373206e6f6e636520666f72206163636f756e74732e3845787472696e736963436f756e7400000c753332040004b820546f74616c2065787472696e7369637320636f756e7420666f72207468652063757272656e7420626c6f636b2e4c416c6c45787472696e73696373576569676874000018576569676874040004150120546f74616c2077656967687420666f7220616c6c2065787472696e736963732070757420746f6765746865722c20666f72207468652063757272656e7420626c6f636b2e40416c6c45787472696e736963734c656e00000c753332040004410120546f74616c206c656e6774682028696e2062797465732920666f7220616c6c2065787472696e736963732070757420746f6765746865722c20666f72207468652063757272656e7420626c6f636b2e24426c6f636b4861736801010138543a3a426c6f636b4e756d6265721c543a3a48617368008000000000000000000000000000000000000000000000000000000000000000000498204d6170206f6620626c6f636b206e756d6265727320746f20626c6f636b206861736865732e3445787472696 |
pragma solidity ^0.6.0; | |
import "https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/token/ERC20/IERC20.sol"; | |
contract LinkTokenOnMatic { | |
IERC20 public token; | |
The docs page, while a good resource, is currently out of date.
Solidity source code needs to be compiled using OVM modified solc compiler. Because of the way OVM is architectured, the Optimism team needs to work to support specific Solidity compiler versions. Currently supported are v0.5 & v0.6, while work is started on v0.7 & v0.8.
The JS compiler can be found in ethereum-optimism/solc-js repo. Branches of interest are master-0.5
& master-0.6
.
{ | |
"schemaVersion": "2.0.0", | |
"contractName": "AccessControlledAggregator", | |
"compilerOutput": { | |
"abi": [ | |
{ | |
"inputs": [ | |
{ | |
"internalType": "address", | |
"name": "implementation", |