@@ -54,9 +51,9 @@ Native collections are useful if you are planning to store smalls amounts of dat
:::
-:::warning Keep Native Collections Small
+:::danger Keep Native Collections Small
-As the collection grows, reading and writing it will cost more and more gas. If the collections grows too large, your contract might end up expending all its available gas in reading/writing the state, thus becoming unusable
+As the native collection grows, deserializing it from memory will cost more and more gas. If the collections grows too large, your contract might expend all the gas trying to read its state, making it fail on each function call
:::
@@ -64,9 +61,9 @@ As the collection grows, reading and writing it will cost more and more gas. If
## SDK Collections
-The NEAR SDKs expose collections that are optimized to store large amounts of data in the contract's state. These collections are built to have an interface similar to native collections.
+The NEAR SDKs expose collections that are optimized for random access of large amounts of data. SDK collections are instantiated using a "prefix", which is used as an index to split the data into chunks. This way, SDK collections can defer reading and writing to the store until needed.
-SDK collections are instantiated using a "prefix", which is used as an index to split the data into chunks. This way, SDK collections can defer reading and writing to the store until needed.
+These collections are built to have an interface similar to native collections.
@@ -93,32 +90,44 @@ SDK collections are useful when you are planning to store large amounts of data
| SDK Collection | Native Equivalent | Description |
|----------------|-------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| `Vector` | `Array` | A growable array type. The values are sharded in memory and can be used for iterable and indexable values that are dynamically sized. |
-| `LookupMap` | `Map` | This structure behaves as a thin wrapper around the key-value storage available to contracts. This structure does not contain any metadata about the elements in the map, so it is not iterable. |
-| `UnorderedMap` | `Map` | Similar to `LookupMap`, except that it stores additional data to be able to iterate through elements in the data structure. |
| `LookupSet` | `Set` | A set, which is similar to `LookupMap` but without storing values, can be used for checking the unique existence of values. This structure is not iterable and can only be used for lookups. |
| `UnorderedSet` | `Set` | An iterable equivalent of `LookupSet` which stores additional metadata for the elements contained in the set. |
+| `LookupMap` | `Map` | This structure behaves as a thin wrapper around the key-value storage available to contracts. This structure does not contain any metadata about the elements in the map, so it is not iterable. |
+| `UnorderedMap` | `Map` | Similar to `LookupMap`, except that it stores additional data to be able to iterate through elements in the data structure. |
-:::info Note
+| SDK collection | `std` equivalent | Description |
+|-----------------------------------------------|-----------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| `store::Vector` | `Vec` | A growable array type. The values are sharded in memory and can be used for iterable and indexable values that are dynamically sized. |
+| ` | `HashSet` | A set, which is similar to `LookupMap` but without storing values, can be used for checking the unique existence of values. This structure is not iterable and can only be used for lookups. |
+| `store::IterableSet` | `HashSet` | An iterable equivalent of `LookupSet` which stores additional metadata for the elements contained in the set. |
+| `store::UnorderedSet` | `HashSet` | An iterable equivalent of `LookupSet` which stores additional metadata for the elements contained in the set. |
-The `near_sdk::collections` will be moving to `near_sdk::store` and have updated APIs. If you would like to access these updated structures as they are being implemented, enable the `unstable` feature on `near-sdk`.
+
-:::
+
+
+:::info Note
+The `near_sdk::collections` is now deprecated in favor of `near_sdk::store`. To use `near_sdk::collections` you will have to use the [`legacy` feature](https://github.com/near-examples/storage-examples/blob/2a138a6e8915e08ce76718add3e36c04c2ea2fbb/collections-rs/legacy/Cargo.toml#L11).
-| SDK collection | `std` equivalent | Description |
-|----------------------------------------|------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
-| `LazyOption` | `Option` | Optional value in storage. This value will only be read from storage when interacted with. This value will be `Some` when the value is saved in storage, and `None` if the value at the prefix does not exist. |
-| `Vector` | `Vec` | A growable array type. The values are sharded in memory and can be used for iterable and indexable values that are dynamically sized. |
-| ` | `HashSet` | A set, which is similar to `LookupMap` but without storing values, can be used for checking the unique existence of values. This structure is not iterable and can only be used for lookups. |
-| `UnorderedSet` | `HashSet` | An iterable equivalent of `LookupSet` which stores additional metadata for the elements contained in the set. |
+:::
+| SDK collection | `std` equivalent | Description |
+|----------------------------------------------------|------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| `collections::Vector` | `Vec` | A growable array type. The values are sharded in memory and can be used for iterable and indexable values that are dynamically sized. |
+| ` | `HashSet` | A set, which is similar to `LookupMap` but without storing values, can be used for checking the unique existence of values. This structure is not iterable and can only be used for lookups. |
+| `collections::UnorderedSet` | `HashSet` | An iterable equivalent of `LookupSet` which stores additional metadata for the elements contained in the set. |
+| `collections::LazyOption` | `Option` | Optional value in storage. This value will only be read from storage when interacted with. This value will be `Some` when the value is saved in storage, and `None` if the value at the prefix does not exist. |
@@ -131,8 +140,11 @@ The `near_sdk::collections` will be moving to `near_sdk::store` and have updated
| `Vector` | ✅ | ✅ | ✅ | ✅ |
| `LookupSet` | | | | |
| `UnorderedSet` | ✅ | ✅ | | ✅ |
+| `IterableSet` | ✅ | ✅ | | ✅ |
| `LookupMap` | | | | |
| `UnorderedMap` | ✅ | ✅ | | ✅ |
+| `IterableMap` | ✅ | ✅ | | ✅ |
+| `TreeMap` | ✅ | ✅ | ✅ | ✅ |
@@ -143,8 +155,9 @@ The `near_sdk::collections` will be moving to `near_sdk::store` and have updated | `Vector` | O(1) | O(1)\* | O(1)\*\* | O(n) | O(n) | O(n) | | `LookupSet` | O(1) | O(1) | O(1) | O(1) | N/A | N/A | | `UnorderedSet` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | +| `IterableSet` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | | `LookupMap` | O(1) | O(1) | O(1) | O(1) | N/A | N/A | -| `UnorderedMap` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | +| `IterableMap` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | | `TreeMap` | O(1) | O(log n) | O(log n) | O(log n) | O(n) | O(n) | _\* - to insert at the end of the vector using `push_back` (or `push_front` for deque)_ @@ -152,7 +165,11 @@ _\*\* - to delete from the end of the vector using `pop` (or `pop_front` for deq --- -## Collections Cookbook +## SDK Collections Cookbook + +Let's see how to use the SDK collections in practice + +
### Instantiation @@ -160,32 +177,45 @@ All structures need to be initialized using a **unique `prefix`**, which will be
-
-
+
+
+
:::danger
@@ -199,60 +229,94 @@ Be careful of not using the same prefix in two collections, otherwise, their sto
Implements a [vector/array](https://en.wikipedia.org/wiki/Array_data_structure) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces.
-
-
-
-
-
-
+
+
+
+
+
+
+
+
-### Map +### LookupMap Implements a [map/dictionary](https://en.wikipedia.org/wiki/Associative_array) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. -
-
-
-
-
-
+
+
+
+
+
+
-### Set +### UnorderedMap / IterableMap + +Implements a [map/dictionary](https://en.wikipedia.org/wiki/Associative_array) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. + +
+
+
+
+
+
+
+
+ +### LookupSet Implements a [set](https://en.wikipedia.org/wiki/Set_(abstract_data_type)) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. -
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+ +### UnorderedSet / IterableSet + +Implements a [map/dictionary](https://en.wikipedia.org/wiki/Associative_array) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. + +
+
+
+
+
+
@@ -260,23 +324,18 @@ Implements a [set](https://en.wikipedia.org/wiki/Set_(abstract_data_type)) which An ordered equivalent of Map. The underlying implementation is based on an [AVL](https://en.wikipedia.org/wiki/AVL_tree). You should use this structure when you need to: have a consistent order, or access the min/max keys. -
-
-
-
+
+
+
+
-### `LazyOption` +### LazyOption (Legacy) -It's a type of persistent collection that only stores a single value. -The goal is to prevent a contract from deserializing the given value until it's needed. -An example can be a large blob of metadata that is only needed when it's requested in a view call, -but not needed for the majority of contract operations. +LazyOptions are great to store large values (i.e. a wasm file), since its value will not be read from storage until it is interacted with. It acts like an `Option` that can either hold a value or not and also requires a unique prefix (a key in this case) like other persistent collections. @@ -287,90 +346,26 @@ Compared to other collections, `LazyOption` only allows you to initialize the va ## Nesting Collections -It is possible to nest collections. When nesting SDK collections, remember to **assign different prefixes to all collections** (including the nested ones). +When nesting SDK collections, be careful to **use different prefixes** for all collections, including the nested ones.
- While you can create nested maps, you first need to construct or deconstruct the structure from state. This is a temporary solution that will soon be automatically handled by the SDK.
-
- ```ts
- import { NearBindgen, call, view, near, UnorderedMap } from "near-sdk-js";
-
- @NearBindgen({})
- class StatusMessage {
- records: UnorderedMap;
- constructor() {
- this.records = new UnorderedMap("a");
- }
-
- @call({})
- set_status({ message, prefix }: { message: string; prefix: string }) {
- let account_id = near.signerAccountId();
-
- const inner: any = this.records.get("b" + prefix);
- const inner_map: UnorderedMap = inner
- ? UnorderedMap.deserialize(inner)
- : new UnorderedMap("b" + prefix);
-
- inner_map.set(account_id, message);
-
- this.records.set("b" + prefix, inner_map);
- }
-
- @view({})
- get_status({ account_id, prefix }: { account_id: string; prefix: string }) {
- const inner: any = this.records.get("b" + prefix);
- const inner_map: UnorderedMap = inner
- ? UnorderedMap.deserialize(inner)
- : new UnorderedMap("b" + prefix);
- return inner_map.get(account_id);
- }
- }
- ```
+
- In Rust the simplest way to avoid collisions between nested collections is by using `enums`
+ >,
- }
-
- impl Default for Contract {
- fn default() -> Self {
- Self {
- accounts: UnorderedMap::new(StorageKeys::Accounts),
- }
- }
- }
-
- #[near(serializers = [borsh])]
- pub enum StorageKeys {
- Accounts,
- SubAccount { account_hash: CryptoHash },
- }
-
- #[near]
- impl Contract {
- pub fn get_tokens(&self, account_id: &AccountId) -> Vec {
- let tokens = self.accounts.get(account_id).unwrap_or_else(|| {
- UnorderedSet::new(StorageKeys::SubAccount {
- account_hash: env::sha256_array(account_id.as_bytes()),
- })
- });
- tokens.to_vec()
- }
- }
- ```
+ :::tip
+
+ Notice how we use `enums` that take a `String` argument to ensure all collections have a different prefix
+
+ :::
@@ -384,13 +379,6 @@ Because the values are not kept in memory and are lazily loaded from storage, it
Some error-prone patterns to avoid that cannot be restricted at the type level are:
-
-
-
-
-
-
-
@@ -446,9 +434,9 @@ assert!(
// as reads, and the writes are performed on [`Drop`](https://doc.rust-lang.org/std/ops/trait.Drop.html)
// so if the collection is kept in static memory or something like `std::mem::forget` is used,
// the changes will not be persisted.
-use near_sdk::store::LookupSet;
+use near_sdk::store::IterableSet;
-let mut m: LookupSet = LookupSet::new(b"l");
+let mut m: IterableSet = IterableSet::new(b"l");
m.insert(1);
assert!(m.contains(&1));
@@ -456,7 +444,7 @@ assert!(m.contains(&1));
// m.flush();
std::mem::forget(m);
-m = LookupSet::new(b"l");
+m = IterableSet::new(b"l");
assert!(!m.contains(&1));
```
@@ -470,7 +458,7 @@ Some issues for more context:
- https://github.com/near/near-sdk-rs/issues/560
- https://github.com/near/near-sdk-rs/issues/703
-The following cases are the most commonly encountered bugs that cannot be restricted at the type level:
+The following cases are the most commonly encountered bugs that cannot be restricted at the type level (only relevant for `near_sdk::collections`, not `near_sdk::store`):
```rust
use near_sdk::borsh::{self, BorshSerialize};
@@ -502,8 +490,7 @@ let n = root.get(&1).unwrap();
assert!(n.is_empty());
assert!(n.contains(&"test".to_string()));
-// Bug 2 (only relevant for `near_sdk::collections`, not `near_sdk::store`): Nested
-// collection is modified without updating the collection itself in the outer collection.
+// Bug 2: Nested collection is modified without updating the collection itself in the outer collection.
//
// This is fixed at the type level in `near_sdk::store` because the values are modified
// in-place and guarded by regular Rust borrow-checker rules.
@@ -527,35 +514,53 @@ assert!(n.contains(&"some value".to_string()));
## Pagination
-Persistent collections such as `UnorderedMap`, `UnorderedSet` and `Vector` may
+Persistent collections such as `IterableMap/UnorderedMap`, `IterableSet/UnorderedSet` and `Vector` may
contain more elements than the amount of gas available to read them all.
In order to expose them all through view calls, we can use pagination.
-This can be done using iterators with [`Skip`](https://doc.rust-lang.org/std/iter/struct.Skip.html) and [`Take`](https://doc.rust-lang.org/std/iter/struct.Take.html). This will only load elements from storage within the range.
-Example of pagination for `UnorderedMap`:
-```rust
-#[near(contract_state)]
-#[derive(PanicOnDefault)]
-pub struct Contract {
- pub status_updates: UnorderedMap,
-}
+
+
+ With JavaScript this can be done using iterators with [`toArray`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Iterator/toArray) and [`slice`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice).
-#[near]
-impl Contract {
- /// Retrieves multiple elements from the `UnorderedMap`.
- /// - `from_index` is the index to start from.
- /// - `limit` is the maximum number of elements to return.
- pub fn get_updates(&self, from_index: usize, limit: usize) -> Vec<(AccountId, String)> {
- self.status_updates
- .iter()
- .skip(from_index)
- .take(limit)
- .collect()
- }
-}
-```
+ ```ts
+ /// Returns multiple elements from the `UnorderedMap`.
+ /// - `from_index` is the index to start from.
+ /// - `limit` is the maximum number of elements to return.
+ @view({})
+ get_updates({ from_index, limit }: { from_index: number, limit:number }) {
+ return this.status_updates.toArray().slice(from_index, limit);
+ }
+ ```
+
+
+
+ With Rust this can be done using iterators with [`Skip`](https://doc.rust-lang.org/std/iter/struct.Skip.html) and [`Take`](https://doc.rust-lang.org/std/iter/struct.Take.html). This will only load elements from storage within the range.
+
+ ```rust
+ #[near(contract_state)]
+ #[derive(PanicOnDefault)]
+ pub struct Contract {
+ pub status_updates: IterableMap,
+ }
+
+ #[near]
+ impl Contract {
+ /// Retrieves multiple elements from the `IterableMap`.
+ /// - `from_index` is the index to start from.
+ /// - `limit` is the maximum number of elements to return.
+ pub fn get_updates(&self, from_index: usize, limit: usize) -> Vec<(AccountId, String)> {
+ self.status_updates
+ .iter()
+ .skip(from_index)
+ .take(limit)
+ .collect()
+ }
+ }
+ ```
+
+
---
diff --git a/docs/2.build/2.smart-contracts/testing/kurtosis-localnet.md b/docs/2.build/2.smart-contracts/testing/kurtosis-localnet.md
index 1c5c72d6fc3..a958378a90b 100644
--- a/docs/2.build/2.smart-contracts/testing/kurtosis-localnet.md
+++ b/docs/2.build/2.smart-contracts/testing/kurtosis-localnet.md
@@ -622,9 +622,9 @@ Once you've logged in, you can sign a message with an optional donation.
---
-## Managing NEAR Pacakages
+## Managing NEAR Packages
-The Kurtosis NEAR Pacakages you create will continue to run on your local machine for as long as your Docker engine is running. This package runs inside of a Kurtosis "enclave" which is an environment isolated from both your computer and other enclaves. In practice, this means that you can have multiple independent local NEAR clusters running on your machine simply by rerunning the script we executed from the [setup instructions](#setup).
+The Kurtosis NEAR Packages you create will continue to run on your local machine for as long as your Docker engine is running. This package runs inside of a Kurtosis "enclave" which is an environment isolated from both your computer and other enclaves. In practice, this means that you can have multiple independent local NEAR clusters running on your machine simply by rerunning the script we executed from the [setup instructions](#setup).
### View Package Status
diff --git a/docs/2.build/5.primitives/ft.md b/docs/2.build/5.primitives/ft.md
index 3ce1811eda0..cd9eb8d1a78 100644
--- a/docs/2.build/5.primitives/ft.md
+++ b/docs/2.build/5.primitives/ft.md
@@ -33,7 +33,7 @@ import CLICreateToken from "./ft/near-cli/create.md"
import SmartContractSendToken from "./ft/smart-contract/send.md"
import SmartContractAttachTokenToCall from "./ft/smart-contract/attach-to-call.md"
-Besides the native NEAR token, NEAR accounts have access to a [multitude of tokens](https://guide.ref.finance/developers-1/cli-trading#query-whitelisted-tokens) to use thoughtout the ecosystem. Moreover, it is even possible for users to create their own fungible tokens.
+Besides the native NEAR token, NEAR accounts have access to a [multitude of tokens](https://guide.ref.finance/developers-1/cli-trading#query-whitelisted-tokens) to use throughout the ecosystem. Moreover, it is even possible for users to create their own fungible tokens.
In contrast with the NEAR native token, fungible token (FT) are **not stored** in the user's account. In fact, each FT lives in **their own contract** which is in charge of doing **bookkeeping**. This is, the contract keeps track of how many tokens each user has, and handles transfers internally.
diff --git a/docs/2.build/6.data-infrastructure/lake-data-structures/state_change.mdx b/docs/2.build/6.data-infrastructure/lake-data-structures/state_change.mdx
index 1af0fdcb5d9..4554f436e5c 100644
--- a/docs/2.build/6.data-infrastructure/lake-data-structures/state_change.mdx
+++ b/docs/2.build/6.data-infrastructure/lake-data-structures/state_change.mdx
@@ -11,7 +11,7 @@ import TabItem from '@theme/TabItem';
## Definition
-This entitiy from `nearcore` describes how account's state has changed and the reason
+This entity from `nearcore` describes how account's state has changed and the reason
## `StateChangeWithCauseView`
@@ -101,4 +101,3 @@ export type StateChange = {
-
diff --git a/docs/2.build/6.data-infrastructure/lake-data-structures/transaction.mdx b/docs/2.build/6.data-infrastructure/lake-data-structures/transaction.mdx
index 093fec57137..34f941f9679 100644
--- a/docs/2.build/6.data-infrastructure/lake-data-structures/transaction.mdx
+++ b/docs/2.build/6.data-infrastructure/lake-data-structures/transaction.mdx
@@ -10,7 +10,7 @@ import TabItem from '@theme/TabItem';
## Definition
-Transaction is the main way of interraction between a user and a blockchain. Transaction contains:
+Transaction is the main way of interaction between a user and a blockchain. Transaction contains:
- Signer account ID
- Receiver account ID
- Actions
diff --git a/docs/2.build/6.data-infrastructure/lake-framework/migrating-to-near-lake-framework.md b/docs/2.build/6.data-infrastructure/lake-framework/migrating-to-near-lake-framework.md
index 44e00dda479..a954186dd4d 100644
--- a/docs/2.build/6.data-infrastructure/lake-framework/migrating-to-near-lake-framework.md
+++ b/docs/2.build/6.data-infrastructure/lake-framework/migrating-to-near-lake-framework.md
@@ -499,7 +499,7 @@ We are posting the complete diffs for the reference
- /// Specify a custom download URL for the genesis file.
- #[clap(long)]
- pub download_genesis_url: Option,
-- /// Download the verified NEAR config file automtically.
+- /// Download the verified NEAR config file automatically.
- #[clap(long)]
- pub download_config: bool,
- /// Specify a custom download URL for the config file.
diff --git a/docs/2.build/6.data-infrastructure/lake-framework/running-near-lake/credentials.md b/docs/2.build/6.data-infrastructure/lake-framework/running-near-lake/credentials.md
index 9c9e6ce033e..666bcca61d8 100644
--- a/docs/2.build/6.data-infrastructure/lake-framework/running-near-lake/credentials.md
+++ b/docs/2.build/6.data-infrastructure/lake-framework/running-near-lake/credentials.md
@@ -30,7 +30,7 @@ aws_secret_access_key=
[AWS docs: Configuration and credential file settings](https://docs.aws.amazon.com/cli/latest/userguide/cli-configure-files.html)
-#### Environment varibales
+#### Environment variables
Alternatively, you can provide your AWS credentials via environment variables with constant names:
diff --git a/docs/4.tools/cli-rs.md b/docs/4.tools/cli-rs.md
index baa8f452d33..4b5cfd7c842 100644
--- a/docs/4.tools/cli-rs.md
+++ b/docs/4.tools/cli-rs.md
@@ -66,7 +66,7 @@ You'll get redirected to `wallet.testnet.near.org`. Once there, grant authorizat
If you're on Mac you'll have the option to use the [Mac Keychain](https://support.apple.com/guide/keychain-access/what-is-keychain-access-kyca1083/mac) option.
-Either storage option is fine. Using the legacy storage option will save a file in your root directory in a hidden folder called `./near-credentials`. This storage option is compatable with the `near-cli` tool (a cli tool without the guided prompts but similar functionality).
+Either storage option is fine. Using the legacy storage option will save a file in your root directory in a hidden folder called `./near-credentials`. This storage option is compatible with the `near-cli` tool (a cli tool without the guided prompts but similar functionality).
**Good Job!**
Now you can use `near-cli-rs` to it's full capacity.
@@ -129,7 +129,7 @@ Operate Transactions
| Option | Description |
| ---------------------- | --------------------------- |
| `view-status` | View a transaction status |
-| `construct-tansaction` | Construct a new transaction |
+| `construct-transaction` | Construct a new transaction |
### Config
diff --git a/docs/4.tools/near-api-js/quick-reference.md b/docs/4.tools/near-api-js/quick-reference.md
index 333df1e91f8..d8de49d4789 100644
--- a/docs/4.tools/near-api-js/quick-reference.md
+++ b/docs/4.tools/near-api-js/quick-reference.md
@@ -245,7 +245,7 @@ const provider = new FailoverRpcProvider(jsonProviders);
await connect({
networkId: 'mainnet',
provider: provider,
- // this isn't used if `provider` is specified, but is still required for backward compativility
+ // this isn't used if `provider` is specified, but is still required for backward compatibility
nodeUrl: 'https://rpc.mainnet.near.org',
});
```
diff --git a/docs/5.api/rpc/access-keys.md b/docs/5.api/rpc/access-keys.md
index e7c5cc3a4bd..652f421a8fa 100644
--- a/docs/5.api/rpc/access-keys.md
+++ b/docs/5.api/rpc/access-keys.md
@@ -132,6 +132,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
ERROR_CAUSE
+ Status Code
Reason
Solution
@@ -140,6 +141,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
HANDLER_ERROR
UNKNOWN_BLOCK
+ 200
The requested block has not been produced yet or it has been garbage-collected (cleaned up to save space on the RPC node)
INVALID_ACCOUNT
+ 200
The requested
UNKNOWN_ACCOUNT
+ 200
The requested
UNKNOWN_ACCESS_KEY
+ 200
The requested
UNAVAILABLE_SHARD
+ 200
The node was unable to found the requested data because it does not track the shard where data is present
NO_SYNCED_BLOCKS
+ 200
The node is still syncing and the requested block is not in the database yet
store::LookupMap`` | HashMap`` | This structure behaves as a thin wrapper around the key-value storage available to contracts. This structure does not contairn any metadata about the elements in the map, so it is not iterable. |
+| store::IterableMap`` | HashMap`` | Similar to `LookupMap`, except that it stores additional data to be able to iterate through elements in the data structure. |
+| store::UnorderedMap`` | HashMap`` | Similar to `LookupMap`, except that it stores additional data to be able to iterate through elements in the data structure. |
+| `store::LookupSetLookupMap`` | HashMap`` | This structure behaves as a thin wrapper around the key-value storage available to contracts. This structure does not contain any metadata about the elements in the map, so it is not iterable. |
-| UnorderedMap`` | HashMap`` | Similar to `LookupMap`, except that it stores additional data to be able to iterate through elements in the data structure. |
-| TreeMap`` | BTreeMap`` | An ordered equivalent of `UnorderedMap`. The underlying implementation is based on an [AVL tree](https://en.wikipedia.org/wiki/AVL_tree). This structure should be used when a consistent order is needed or accessing the min/max keys is needed. |
-| `LookupSetcollections::LookupMap`` | HashMap`` | This structure behaves as a thin wrapper around the key-value storage available to contracts. This structure does not contairn any metadata about the elements in the map, so it is not iterable. |
+| collections::UnorderedMap`` | HashMap`` | Similar to `LookupMap`, except that it stores additional data to be able to iterate through elements in the data structure. |
+| collections::TreeMap`` | BTreeMap`` | An ordered equivalent of `UnorderedMap`. The underlying implementation is based on an [AVL tree](https://en.wikipedia.org/wiki/AVL_tree). This structure should be used when a consistent order is needed or accessing the min/max keys is needed. |
+| `collections::LookupSet@@ -143,8 +155,9 @@ The `near_sdk::collections` will be moving to `near_sdk::store` and have updated | `Vector` | O(1) | O(1)\* | O(1)\*\* | O(n) | O(n) | O(n) | | `LookupSet` | O(1) | O(1) | O(1) | O(1) | N/A | N/A | | `UnorderedSet` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | +| `IterableSet` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | | `LookupMap` | O(1) | O(1) | O(1) | O(1) | N/A | N/A | -| `UnorderedMap` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | +| `IterableMap` | O(1) | O(1) | O(1) | O(1) | O(n) | O(n) | | `TreeMap` | O(1) | O(log n) | O(log n) | O(log n) | O(n) | O(n) | _\* - to insert at the end of the vector using `push_back` (or `push_front` for deque)_ @@ -152,7 +165,11 @@ _\*\* - to delete from the end of the vector using `pop` (or `pop_front` for deq --- -## Collections Cookbook +## SDK Collections Cookbook + +Let's see how to use the SDK collections in practice + +
### Instantiation @@ -160,32 +177,45 @@ All structures need to be initialized using a **unique `prefix`**, which will be
-### Map +### LookupMap Implements a [map/dictionary](https://en.wikipedia.org/wiki/Associative_array) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. -
-### Set +### UnorderedMap / IterableMap + +Implements a [map/dictionary](https://en.wikipedia.org/wiki/Associative_array) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. + +
+ +### LookupSet Implements a [set](https://en.wikipedia.org/wiki/Set_(abstract_data_type)) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. -
+ +### UnorderedSet / IterableSet + +Implements a [map/dictionary](https://en.wikipedia.org/wiki/Associative_array) which persists in the contract's storage. Please refer to the Rust and JS SDK's for a full reference on their interfaces. + +
@@ -260,23 +324,18 @@ Implements a [set](https://en.wikipedia.org/wiki/Set_(abstract_data_type)) which An ordered equivalent of Map. The underlying implementation is based on an [AVL](https://en.wikipedia.org/wiki/AVL_tree). You should use this structure when you need to: have a consistent order, or access the min/max keys. -
-### `LazyOption` +### LazyOption (Legacy) -It's a type of persistent collection that only stores a single value. -The goal is to prevent a contract from deserializing the given value until it's needed. -An example can be a large blob of metadata that is only needed when it's requested in a view call, -but not needed for the majority of contract operations. +LazyOptions are great to store large values (i.e. a wasm file), since its value will not be read from storage until it is interacted with. It acts like an `Option` that can either hold a value or not and also requires a unique prefix (a key in this case) like other persistent collections. @@ -287,90 +346,26 @@ Compared to other collections, `LazyOption` only allows you to initialize the va ## Nesting Collections -It is possible to nest collections. When nesting SDK collections, remember to **assign different prefixes to all collections** (including the nested ones). +When nesting SDK collections, be careful to **use different prefixes** for all collections, including the nested ones.
error.name
error.cause.name-
@@ -150,6 +152,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id is invalid-
@@ -159,6 +162,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id has not been found while viewing since the account has not been created or has been already deleted-
@@ -169,6 +173,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
public_key has not been found while viewing since the public key has not been created or has been already deleted-
@@ -179,6 +184,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -188,6 +194,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -199,6 +206,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -210,6 +218,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -448,6 +457,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
error.name
error.cause.name-
@@ -466,6 +477,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id is invalid-
@@ -475,6 +487,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id has not been found while viewing since the account has not been created or has been already deleted-
@@ -485,6 +498,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -494,6 +508,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -505,6 +520,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -516,6 +532,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -669,6 +686,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -687,6 +706,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -698,6 +718,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -709,6 +730,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -862,6 +884,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -880,6 +904,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -891,6 +916,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -902,6 +928,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
diff --git a/docs/5.api/rpc/block-chunk.md b/docs/5.api/rpc/block-chunk.md
index 77abf5e5ad2..217b6d03cd0 100644
--- a/docs/5.api/rpc/block-chunk.md
+++ b/docs/5.api/rpc/block-chunk.md
@@ -283,6 +283,7 @@ Here is the exhaustive list of the error variants that can be returned by `block
error.name
error.cause.name-
@@ -301,6 +303,7 @@ Here is the exhaustive list of the error variants that can be returned by `block
-
@@ -312,6 +315,7 @@ Here is the exhaustive list of the error variants that can be returned by `block
-
@@ -323,6 +327,7 @@ Here is the exhaustive list of the error variants that can be returned by `block
-
@@ -532,6 +537,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -550,6 +557,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -561,6 +569,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -572,6 +581,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -737,6 +747,7 @@ Here is the exhaustive list of the error variants that can be returned by `chunk
error.name
error.cause.name-
@@ -755,6 +767,7 @@ Here is the exhaustive list of the error variants that can be returned by `chunk
-
@@ -765,6 +778,7 @@ Here is the exhaustive list of the error variants that can be returned by `chunk
shard_id does not exist-
@@ -774,6 +788,7 @@ Here is the exhaustive list of the error variants that can be returned by `chunk
-
@@ -785,6 +800,7 @@ Here is the exhaustive list of the error variants that can be returned by `chunk
-
@@ -796,6 +812,7 @@ Here is the exhaustive list of the error variants that can be returned by `chunk
-
diff --git a/docs/5.api/rpc/contracts.md b/docs/5.api/rpc/contracts.md
index a240ffb0dd9..689f2c4a30e 100644
--- a/docs/5.api/rpc/contracts.md
+++ b/docs/5.api/rpc/contracts.md
@@ -123,6 +123,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
error.name
error.cause.name-
@@ -141,6 +143,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id is invalid-
@@ -150,6 +153,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id has not been found while viewing since the account has not been created or has been already deleted-
@@ -160,6 +164,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -169,6 +174,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -180,6 +186,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -191,6 +198,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -344,6 +352,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -362,6 +372,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -373,6 +384,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -384,6 +396,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -508,6 +521,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
error.name
error.cause.name-
@@ -526,6 +541,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id is invalid-
@@ -535,6 +551,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id has not been found while viewing since the account has not been created or has been already deleted-
@@ -545,6 +562,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
contract deployed on it-
@@ -555,6 +573,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -564,6 +583,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -575,6 +595,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -586,6 +607,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -900,6 +922,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
error.name
error.cause.name-
@@ -918,6 +942,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id is invalid-
@@ -927,6 +952,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
account_id has not been found while viewing since the account has not been created or has been already deleted-
@@ -937,6 +963,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
contract deployed on it-
@@ -947,6 +974,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -957,6 +985,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -966,6 +995,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -977,6 +1007,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -988,6 +1019,7 @@ Here is the exhaustive list of the error variants that can be returned by `view_
-
@@ -1139,6 +1171,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -1157,6 +1191,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -1168,6 +1203,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -1179,6 +1215,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -1313,6 +1350,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -1331,6 +1370,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -1342,6 +1382,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -1353,6 +1394,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -1538,6 +1580,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
error.name
error.cause.name-
@@ -1556,6 +1600,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
account_id is invalid-
@@ -1565,6 +1610,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
account_id has not been found while viewing since the account has not been created or has been already deleted-
@@ -1575,6 +1621,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
contract_code has not been found while viewing-
@@ -1585,6 +1632,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
-
@@ -1594,6 +1642,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
-
@@ -1603,6 +1652,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
-
@@ -1614,6 +1664,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
-
@@ -1625,6 +1676,7 @@ Here is the exhaustive list of the error variants that can be returned by `call_
-
diff --git a/docs/5.api/rpc/gas.md b/docs/5.api/rpc/gas.md
index 604e8a2f282..7a887152386 100644
--- a/docs/5.api/rpc/gas.md
+++ b/docs/5.api/rpc/gas.md
@@ -167,6 +167,7 @@ Here is the exhaustive list of the error variants that can be returned by `gas_p
error.name
error.cause.name-
@@ -186,6 +188,7 @@ Here is the exhaustive list of the error variants that can be returned by `gas_p
-
@@ -197,6 +200,7 @@ Here is the exhaustive list of the error variants that can be returned by `gas_p
-
diff --git a/docs/5.api/rpc/maintenance-windows.md b/docs/5.api/rpc/maintenance-windows.md
index ba1af597404..1664151f7a7 100644
--- a/docs/5.api/rpc/maintenance-windows.md
+++ b/docs/5.api/rpc/maintenance-windows.md
@@ -109,6 +109,7 @@ Here is the exhaustive list of the error variants that can be returned by `maint
error.name
error.cause.name-
diff --git a/docs/5.api/rpc/network.md b/docs/5.api/rpc/network.md
index c3f4060afb0..48ea415472f 100644
--- a/docs/5.api/rpc/network.md
+++ b/docs/5.api/rpc/network.md
@@ -282,6 +282,7 @@ Here is the exhaustive list of the error variants that can be returned by `statu
error.name
error.cause.name-
@@ -405,6 +407,7 @@ Here is the exhaustive list of the error variants that can be returned by `netwo
error.name
error.cause.name-
@@ -1356,6 +1360,7 @@ Here is the exhaustive list of the error variants that can be returned by `valid
error.name
error.cause.name-
@@ -1376,6 +1382,7 @@ Here is the exhaustive list of the error variants that can be returned by `valid
-
@@ -1387,6 +1394,7 @@ Here is the exhaustive list of the error variants that can be returned by `valid
-
diff --git a/docs/5.api/rpc/protocol.md b/docs/5.api/rpc/protocol.md
index e12188276a0..24d883d9377 100644
--- a/docs/5.api/rpc/protocol.md
+++ b/docs/5.api/rpc/protocol.md
@@ -323,6 +323,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -633,6 +635,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -652,6 +656,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
diff --git a/docs/5.api/rpc/providers.md b/docs/5.api/rpc/providers.md
index da371d7af3e..adebcf997fb 100644
--- a/docs/5.api/rpc/providers.md
+++ b/docs/5.api/rpc/providers.md
@@ -25,7 +25,7 @@ If you want to use a custom RPC provider with NEAR Wallet Selector, [check this
| [BlockPi](https://chains.blockpi.io/#/near) | `https://public-rpc.blockpi.io/http/near` |
| [dRPC](https://drpc.org/) | `https://near.drpc.org` |
| [fast-near web4](https://github.com/vgrichina/fast-near) | `https://rpc.web4.near.page` |
-| [FASTNEAR Free](https://twitter.com/fast_near/status/1779578631318368269) | `https://free.rpc.fastnear.com` |
+| [FASTNEAR](https://fastnear.com) | `https://free.rpc.fastnear.com` |
| [Gateway.fm](https://gateway.fm/) | `https://rpc.near.gateway.fm/` |
| [GetBlock](https://getblock.io/nodes/near/) | `https://getblock.io/nodes/near/` |
| [Lava Network](https://www.lavanet.xyz/get-started/near) | `https://near.lava.build` |
@@ -43,6 +43,7 @@ If you want to use a custom RPC provider with NEAR Wallet Selector, [check this
| -------------------------------------------------------------------------- | ------------------------------------------------------------ |
| [NEAR](setup.md) | `https://rpc.testnet.near.org` |
| [Pagoda](https://www.pagoda.co/console) | `https://rpc.testnet.pagoda.co` |
+| [FASTNEAR](https://fastnear.com) | `https://test.rpc.fastnear.com` |
## RPC Failover
diff --git a/docs/5.api/rpc/transactions.md b/docs/5.api/rpc/transactions.md
index 65fe3f16e9b..8bd08b2e0ef 100644
--- a/docs/5.api/rpc/transactions.md
+++ b/docs/5.api/rpc/transactions.md
@@ -180,6 +180,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
error.name
error.cause.name-
@@ -199,6 +201,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
-
@@ -211,6 +214,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
-
@@ -222,6 +226,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
-
@@ -416,6 +421,7 @@ Here is the exhaustive list of the error variants that can be returned by `tx` m
error.name
error.cause.name-
@@ -433,6 +440,7 @@ Here is the exhaustive list of the error variants that can be returned by `tx` m
-
@@ -444,6 +452,7 @@ Here is the exhaustive list of the error variants that can be returned by `tx` m
-
@@ -455,6 +464,7 @@ Here is the exhaustive list of the error variants that can be returned by `tx` m
-
@@ -466,6 +476,7 @@ Here is the exhaustive list of the error variants that can be returned by `tx` m
-
@@ -794,6 +805,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.name-
@@ -811,6 +824,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -822,6 +836,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -833,6 +848,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -844,6 +860,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -961,6 +978,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
error.name
error.cause.namereceipt_id was never observed on the node-
@@ -980,6 +999,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -991,6 +1011,7 @@ Here is the exhaustive list of the error variants that can be returned by `EXPER
-
@@ -1126,6 +1147,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
error.name
error.cause.name-
@@ -1303,6 +1326,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
error.name
error.cause.name-
@@ -1322,6 +1347,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
-
@@ -1334,6 +1360,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
-
@@ -1345,6 +1372,7 @@ Here is the exhaustive list of the error variants that can be returned by `broad
-
diff --git a/docs/6.integrations/errors/error-implementation.md b/docs/6.integrations/errors/error-implementation.md
index 7e511c6abe4..803bd37c68f 100644
--- a/docs/6.integrations/errors/error-implementation.md
+++ b/docs/6.integrations/errors/error-implementation.md
@@ -441,6 +441,13 @@ pub enum ReceiptValidationError {
NumberInputDataDependenciesExceeded { number_of_input_data_dependencies: u64, limit: u64 },
/// An error occurred while validating actions of an ActionReceipt.
ActionsValidation(ActionsValidationError),
+ /// Receipt is bigger than the limit.
+ /// ReceiptSizeExceeded means that there was a receipt above the size limit (currently 4MiB).
+ /// NEAR will refuse to execute receipts that are above the size limit.
+ /// The most likely source of such receipts would be cross-contract calls with a lot of large actions
+ /// (contract deployment, function call with large args, etc).
+ /// This error means that the user has to adjust their contract to generate smaller receipts.
+ ReceiptSizeExceeded { size: u64, limit: u64 },
}
```
@@ -466,6 +473,9 @@ ReceiptValidationError::NumberInputDataDependenciesExceeded { number_of_input_da
"The number of input data dependencies {} exceeded the limit {} in an ActionReceipt"
ReceiptValidationError::ActionsValidation(e)
+
+ReceiptValidationError::ReceiptSizeExceeded { size, limit }
+"The size of the receipt exceeded the limit: {} > {}",
```
diff --git a/docs/pagoda/alerts/setup.md b/docs/pagoda/alerts/setup.md
index 4219694557c..83ed926be7d 100644
--- a/docs/pagoda/alerts/setup.md
+++ b/docs/pagoda/alerts/setup.md
@@ -42,7 +42,7 @@ Follow the steps above to begin setting-up telegram alerts. When selecting the d
### Private Message Alerts
-1. On the device that is logged into the telegram aclick "Open Telegram" or scan the QR code.
+1. On the device that is logged into the telegram click "Open Telegram" or scan the QR code.
diff --git a/docs/pagoda/alerts/webhooks.md b/docs/pagoda/alerts/webhooks.md
index 7a7d9f47425..61c82ebc2dc 100644
--- a/docs/pagoda/alerts/webhooks.md
+++ b/docs/pagoda/alerts/webhooks.md
@@ -140,7 +140,7 @@ copy that entire line and head on over to console.pagoda.co
## Step 5: Integrating Webhook into Pagoda Console
-Once at console.pagoda.co, you should be greeted by the log-in page. Select the Non-funcable Token (NFT) project to start exploring the NFT contract
+Once at console.pagoda.co, you should be greeted by the log-in page. Select the Non-fungible Token (NFT) project to start exploring the NFT contract
@@ -181,12 +181,12 @@ But for now, we'll keep it easy and select any Successful Action.
We're almost done! Under destination select webhooks. Now that webhook we created earlier go ahead and copy and paste it into here. Then hit "Create"
:::tip
-Don't forget to remove the `{}` around the name of your event! `ifttt.com/trigger/...`, not `ifftt.com/{trigger}/...`
+Don't forget to remove the `{}` around the name of your event! `ifttt.com/trigger/...`, not `ifttt.com/{trigger}/...`
:::
-Remember to hit the "+ Create Alert" button on this page...
+Remember to hit the "+ Create Alert" button on this page...
@@ -210,6 +210,6 @@ Select the `new_default_metadata` function (we are choosing this one because we
And that's it! You've just triggered something in the real world with an event that happened on the NEAR Blockchain. Hopefully this inspires you to create your own webhook using IFTTT and the Pagoda Console.
-We'd love to see what you create! Tag [@PagodaPlatform](https://twitter.com/PagodaPlatform) on Twitter with a novel implementation of a webhhook and trigger and we might retweet it.
+We'd love to see what you create! Tag [@PagodaPlatform](https://twitter.com/PagodaPlatform) on Twitter with a novel implementation of a webhook and trigger and we might retweet it.
Happy hacking!
diff --git a/docs/pagoda/rpc/intro.md b/docs/pagoda/rpc/intro.md
index 1e252efddab..6fc91453125 100644
--- a/docs/pagoda/rpc/intro.md
+++ b/docs/pagoda/rpc/intro.md
@@ -19,7 +19,7 @@ The Pagoda RPC provides you with instant access to maintenance free, scalable NE
Developers can interact with on-chain data and send different types of transactions to the network by utilizing the RPC endpoints.
-In addition to the powerful node infrastructure, we also created the Pagoda RPC Stats page so that you can have visibility into your RPC usage and performances and take control of your project from the infrastructure level. What’s more? You can subscribe to the alerts from our Status page so that you can follow the health of Pagoda RPC real time. All accesible via [Pagoda Console](https://console.pagoda.co/).
+In addition to the powerful node infrastructure, we also created the Pagoda RPC Stats page so that you can have visibility into your RPC usage and performances and take control of your project from the infrastructure level. What’s more? You can subscribe to the alerts from our Status page so that you can follow the health of Pagoda RPC real time. All accessible via [Pagoda Console](https://console.pagoda.co/).
## Setup
diff --git a/docs/pagoda/rpc/setup.md b/docs/pagoda/rpc/setup.md
index 493500a7b61..486a5577247 100644
--- a/docs/pagoda/rpc/setup.md
+++ b/docs/pagoda/rpc/setup.md
@@ -37,7 +37,7 @@ With a dedicated API key, developers are able to:
- Access higher request throughput and increased concurrent requests
- Query data from [Enhanced APIs](api.md), gaining access to free processed data for NFT, FT and NEAR balances, ownership, and metadata
-- Utlize dedicated, individualized usage metrics
+- Utilize dedicated, individualized usage metrics
### Test your API keys
diff --git a/docs/pagoda/rpc/stats.md b/docs/pagoda/rpc/stats.md
index 1f80b174c3a..e780bd9693a 100644
--- a/docs/pagoda/rpc/stats.md
+++ b/docs/pagoda/rpc/stats.md
@@ -28,7 +28,7 @@ Aggregated key metrics available at the top of the dashboard are
## Set a Time Period
-Data is sent with UTC time to the browser and the browser adjusts to the user’s timezon.
+Data is sent with UTC time to the browser and the browser adjusts to the user’s timezone.
- Last 15 Minutes is the last complete 15 minutes. This updates every few seconds.
- Last 1 Hour is the last fully completed hour; from 00 to 59 minutes and 59 seconds.
diff --git a/website/sidebars.js b/website/sidebars.js
index aa8534fe7d8..d5a1764267d 100644
--- a/website/sidebars.js
+++ b/website/sidebars.js
@@ -88,15 +88,27 @@ const sidebar = {
]
},
{
- "Chain Signatures": [
+ "type": "category",
+ "label": "Chain Signatures",
+ "link": {
+ "type": "doc",
+ "id": "build/chain-abstraction/chain-signatures/getting-started"
+ },
+ "items": [
"concepts/abstraction/chain-signatures",
- 'build/chain-abstraction/chain-signatures',
- 'build/chain-abstraction/nft-chain-keys',
+ 'build/chain-abstraction/chain-signatures/chain-signatures',
+ // 'build/chain-abstraction/nft-chain-keys',
]
},
// 'build/chain-abstraction/wallet',
{
- "Multichain Gas Relayer": [
+ "type": "category",
+ "label": "Multichain Gas Relayer",
+ "link": {
+ "type": "doc",
+ "id": "build/chain-abstraction/multichain-gas-relayer/getting-started"
+ },
+ "items": [
"build/chain-abstraction/multichain-gas-relayer/overview",
"build/chain-abstraction/multichain-gas-relayer/gas-station",
"build/chain-abstraction/multichain-gas-relayer/multichain-server",
diff --git a/website/src/theme/Navbar/Logo/index.js b/website/src/theme/Navbar/Logo/index.js
index 0ab73ab1715..d85776fb19c 100644
--- a/website/src/theme/Navbar/Logo/index.js
+++ b/website/src/theme/Navbar/Logo/index.js
@@ -1,13 +1,11 @@
import React from 'react';
import Logo from '@theme/Logo';
-import BrowserOnly from '@docusaurus/BrowserOnly';
+import useIsBrowser from '@docusaurus/useIsBrowser';
export default function NavbarLogo() {
-
+ const isBrowser = useIsBrowser();
// if embedded in an iframe, do not show the logo
-