1673594160
A tool for Generating Solana Web3 Clients From anchor IDLs
anchor-client-gen
Generate typescript solana web3 clients from anchor IDLs.
Installation
# npm
$ npm install --global anchor-client-gen
# yarn
$ yarn global add anchor-client-gen
To get the beta build which has unreleased features, install with anchor-client-gen@beta.
Usage
Usage: main [options] <idl> <out>
Generate solana web3 client code from the specified anchor IDL.
Arguments:
idl anchor IDL file path or '-' to read from stdin
out output directory
Options:
--program-id <PROGRAM_ID> optional program ID to be included in the code
-V, --version output the version number
-h, --help display help for command
Example
$ anchor-client-gen path/to/idl.json output/directory
This will generate code to output/directory:
.
├── accounts
│ ├── FooAccount.ts
│ └── index.ts
├── instructions
│ ├── someInstruction.ts
│ ├── otherInstruction.ts
│ └── index.ts
├── types
│ ├── BarStruct.ts
│ ├── BazEnum.ts
│ └── index.ts
├── errors
│ ├── anchor.ts
│ ├── custom.ts
│ └── index.ts
└── programId.ts
For more examples of the generated code, check out the examples directory.
Using the generated client
The following packages are required for the generated client to work:
@solana/web3.jsbn.js@project-serum/borsh
Install them in your project with:
// npm
$ npm install @solana/web3.js bn.js @project-serum/borsh
// yarn
$ yarn add @solana/web3.js bn.js @project-serum/borsh
Instructions
import { someInstruction } from "./output/directory/instructions"
// call an instruction
const tx = new Transaction()
const fooAccount = new Keypar()
const ix = someInstruction({
fooParam: "...",
barParam: "...",
...
}, {
fooAccount: fooAccount.publicKey, // signer
barAccount: new PublicKey("..."),
...
})
tx.add(ix)
sendAndConfirmTransaction(connection, tx, [payer, fooAccount])
Accounts
import { FooAccount } from "./output/directory/accounts"
// fetch an account
const addr = new PublicKey("...")
const acc = FooAccount.fetch(connection, addr)
if (acc === null) {
// the fetch method returns null when the account is uninitialized
console.log("account not found")
return
}
// convert to a JSON object
const obj = acc.toJSON()
console.log(obj)
// load from JSON
const accFromJSON = FooAccount.fromJSON(obj)
Types
// structs
import { BarStruct } from "./output/directory/types"
const barStruct = new BarStruct({
someField: "...",
otherField: "...",
})
console.log(barStruct.toJSON())
// enums
import { BazEnum } from "./output/directory/types"
const tupleEnum = new BazEnum.SomeTupleKind([true, false, "some value"])
const structEnum = new BazEnum.SomeStructKind({
field1: "...",
field2: "...",
})
const discEnum = new BazEnum.SomeDiscriminantKind()
console.log(tupleEnum.toJSON(), structEnum.toJSON(), discEnum.toJSON())
// types are used as arguments in instruction calls (where needed):
const ix = someInstruction({
someStructField: barStruct,
someEnumField: tupleEnum,
...
}, {
// accounts
...
})
// in case of struct fields, it's also possible to pass them as objects:
const ix = someInstrution({
someStructField: {
someField: "...",
otherField: "...",
},
...,
}, {
// accounts
...
})
Errors
import { fromTxError } from "./output/directory/errors"
import { SomeCustomError } from "./output/directory/errors/custom"
try {
await sendAndConfirmTransaction(c, tx, [payer])
} catch (e) {
const parsed = fromTxError(e)
if (parsed !== null && parsed instanceof SomeCustomError) {
console.log(
"SomeCustomError was thrown",
parsed.code,
parsed.name,
parsed.msg
)
}
}
Program ID
The client generator pulls the program ID from:
- the input IDL
- the
--program-idflag
These are then written into the programId.ts file.
The PROGRAM_ID constant inside programId.ts can be (and should be) modified to define the correct program ID as the client relies on it to do checks when fetching accounts etc. The PROGRAM_ID constant is safe to modify as it will be preserved across multiple code generations. The imports in this file are also preserved.
Versioning
The package minor versions match anchor minor versions. So, for example, package version v0.22.x will match anchor v0.22.y. The earliest supported anchor version is v0.22, but the generator probably also works with older versions of anchor since the IDL format is mostly backwards compatible.
Download details:
Author: kklas
Source code: https://github.com/kklas/anchor-client-gen
License: MIT license
What is GEEK
Buddha Community
1673594160
A tool for Generating Solana Web3 Clients From anchor IDLs
anchor-client-gen
Generate typescript solana web3 clients from anchor IDLs.
Installation
# npm
$ npm install --global anchor-client-gen
# yarn
$ yarn global add anchor-client-gen
To get the beta build which has unreleased features, install with anchor-client-gen@beta.
Usage
Usage: main [options] <idl> <out>
Generate solana web3 client code from the specified anchor IDL.
Arguments:
idl anchor IDL file path or '-' to read from stdin
out output directory
Options:
--program-id <PROGRAM_ID> optional program ID to be included in the code
-V, --version output the version number
-h, --help display help for command
Example
$ anchor-client-gen path/to/idl.json output/directory
This will generate code to output/directory:
.
├── accounts
│ ├── FooAccount.ts
│ └── index.ts
├── instructions
│ ├── someInstruction.ts
│ ├── otherInstruction.ts
│ └── index.ts
├── types
│ ├── BarStruct.ts
│ ├── BazEnum.ts
│ └── index.ts
├── errors
│ ├── anchor.ts
│ ├── custom.ts
│ └── index.ts
└── programId.ts
For more examples of the generated code, check out the examples directory.
Using the generated client
The following packages are required for the generated client to work:
@solana/web3.jsbn.js@project-serum/borsh
Install them in your project with:
// npm
$ npm install @solana/web3.js bn.js @project-serum/borsh
// yarn
$ yarn add @solana/web3.js bn.js @project-serum/borsh
Instructions
import { someInstruction } from "./output/directory/instructions"
// call an instruction
const tx = new Transaction()
const fooAccount = new Keypar()
const ix = someInstruction({
fooParam: "...",
barParam: "...",
...
}, {
fooAccount: fooAccount.publicKey, // signer
barAccount: new PublicKey("..."),
...
})
tx.add(ix)
sendAndConfirmTransaction(connection, tx, [payer, fooAccount])
Accounts
import { FooAccount } from "./output/directory/accounts"
// fetch an account
const addr = new PublicKey("...")
const acc = FooAccount.fetch(connection, addr)
if (acc === null) {
// the fetch method returns null when the account is uninitialized
console.log("account not found")
return
}
// convert to a JSON object
const obj = acc.toJSON()
console.log(obj)
// load from JSON
const accFromJSON = FooAccount.fromJSON(obj)
Types
// structs
import { BarStruct } from "./output/directory/types"
const barStruct = new BarStruct({
someField: "...",
otherField: "...",
})
console.log(barStruct.toJSON())
// enums
import { BazEnum } from "./output/directory/types"
const tupleEnum = new BazEnum.SomeTupleKind([true, false, "some value"])
const structEnum = new BazEnum.SomeStructKind({
field1: "...",
field2: "...",
})
const discEnum = new BazEnum.SomeDiscriminantKind()
console.log(tupleEnum.toJSON(), structEnum.toJSON(), discEnum.toJSON())
// types are used as arguments in instruction calls (where needed):
const ix = someInstruction({
someStructField: barStruct,
someEnumField: tupleEnum,
...
}, {
// accounts
...
})
// in case of struct fields, it's also possible to pass them as objects:
const ix = someInstrution({
someStructField: {
someField: "...",
otherField: "...",
},
...,
}, {
// accounts
...
})
Errors
import { fromTxError } from "./output/directory/errors"
import { SomeCustomError } from "./output/directory/errors/custom"
try {
await sendAndConfirmTransaction(c, tx, [payer])
} catch (e) {
const parsed = fromTxError(e)
if (parsed !== null && parsed instanceof SomeCustomError) {
console.log(
"SomeCustomError was thrown",
parsed.code,
parsed.name,
parsed.msg
)
}
}
Program ID
The client generator pulls the program ID from:
- the input IDL
- the
--program-idflag
These are then written into the programId.ts file.
The PROGRAM_ID constant inside programId.ts can be (and should be) modified to define the correct program ID as the client relies on it to do checks when fetching accounts etc. The PROGRAM_ID constant is safe to modify as it will be preserved across multiple code generations. The imports in this file are also preserved.
Versioning
The package minor versions match anchor minor versions. So, for example, package version v0.22.x will match anchor v0.22.y. The earliest supported anchor version is v0.22, but the generator probably also works with older versions of anchor since the IDL format is mostly backwards compatible.
Download details:
Author: kklas
Source code: https://github.com/kklas/anchor-client-gen
License: MIT license
1648532804
Solana price moons past $100 as SOL bulls set their eyes on $150
#Solana price moons past $100 as #SOL bulls set their eyes on $150
#Solana price is looking promising
#Solana price has ascended into the mid $110 zone to start this week's trading session. It was mentioned in last week's neutral thesis that a breach above the triangle's C wave at $106 could be the ultimate catalyst to a 40% rally. This weekend, The bulls pushed Solana price through the trigger level, printing two bullish engulfing candles on the 9-hour chart.
#Solana price will likely continue rising as five wave impulses typically follow triangle breakouts. #Solana price has completed the first impulse into the trigger level at $106 and will need two more impulsive waves to justify the validity of the triangle consolidation.
It's also worth noting that the volume profile is increasing with large buy orders from investors, indicating strength and confidence in the current trend. Traders should consider looking for entries on smaller time frames as the price is likely to chop around the trigger zone.
1617086469
Online secure password generator
Create a secure password using our generator tool. Help prevent a security threat by getting a strong password today on hackthestuff.com.
#password #strong password generator #password generator #password generator tool #random generator tool #google generator tool
1591340335
How To Take Help Of Referencing Generator
APA Referencing Generator
Many students use APA style as the key citation style in their assignment in university or college. Although, many people find it quite difficult to write the reference of the source. You ought to miss the names and dates of authors. Hence, APA referencing generator is important for reducing the burden of students. They can now feel quite easy to do the assignments on time.
The functioning of APA referencing generator
If you are struggling hard to write the APA referencing then you can take the help of APA referencing generator. It will create an excellent list. You are required to enter the information about the source. Just ensure that the text is credible and original. If you will copy references then it is a copyright violation.
You can use a referencing generator in just a click. It will generate the right references for all the sources. You are required to organize in alphabetical order. The generator will make sure that you will get good grades.
How to use APA referencing generator?
Select what is required to be cited such as journal, book, film, and others. You can choose the type of required citations list and enter all the required fields. The fields are dates, author name, title, editor name, and editions, name of publishers, chapter number, page numbers, and title of journals. You can click for reference to be generated and you will get the desired result.
Chicago Referencing Generator
Do you require the citation style? You can rely on Chicago Referencing Generator and will ensure that you will get the right citation in just a click. The generator is created to provide solutions to students to cite their research paper in Chicago style. It has proved to be the quickest and best citation generator on the market. The generator helps to sort the homework issues in few seconds. It also saves a lot of time and energy.
This tool helps researchers, professional writers, and students to manage and generate text citation essays. It will help to write Chicago style in a fast and easy way. It also provides details and directions for formatting and cites resources.
So, you must stop wasting the time and can go for Chicago Referencing Generator or APA referencing generator. These citation generators will help to solve the problem of citation issues. You can easily create citations by using endnotes and footnotes.
So, you can generate bibliographies, references, in-text citations, and title pages. These are fully automatic referencing style. You are just required to enter certain details about the citation and you will get the citation in the proper and required format.
So, if you are feeling any problem in doing assignment then you can take the help of assignment help.
If you require help for Assignment then livewebtutors is the right place for you. If you see our prices, you will observe that they are actually very affordable. Also, you can always expect a discount. Our team is capable and versatile enough to offer you exactly what you need, the best services for the prices you can afford.
read more:- Are you struggling to write a bibliography? Use Harvard referencing generator
#apa referencing generator #harvard referencing generator #chicago referencing generator #mla referencing generator #deakin referencing generator #oxford referencing generator
1658977500
A Ruby Library for Generating Text with Recursive Template Grammars
Calyx
Calyx provides a simple API for generating text with declarative recursive grammars.
Install
Command Line
gem install calyx
Gemfile
gem 'calyx'
Examples
The best way to get started quickly is to install the gem and run the examples locally.
Any Gradient
Requires Roda and Rack to be available.
gem install roda
Demonstrates how to use Calyx to construct SVG graphics. Any Gradient generates a rectangle with a linear gradient of random colours.
Run as a web server and preview the output in a browser (http://localhost:9292):
ruby examples/any_gradient.rb
Or generate SVG files via a command line pipe:
ruby examples/any_gradient > gradient1.xml
Tiny Woodland Bot
Requires the Twitter client gem and API access configured for a specific Twitter handle.
gem install twitter
Demonstrates how to use Calyx to make a minimal Twitter bot that periodically posts unique tweets. See @tiny_woodland on Twitter and the writeup here.
TWITTER_CONSUMER_KEY=XXX-XXX
TWITTER_CONSUMER_SECRET=XXX-XXX
TWITTER_ACCESS_TOKEN=XXX-XXX
TWITTER_CONSUMER_SECRET=XXX-XXX
ruby examples/tiny_woodland_bot.rb
Faker
Faker is a popular library for generating fake names and associated sample data like internet addresses, company names and locations.
This example demonstrates how to use Calyx to reproduce the same functionality using custom lists defined in a YAML configuration file.
ruby examples/faker.rb
Usage
Require the library and inherit from Calyx::Grammar to construct a set of rules to generate a text.
require 'calyx'
class HelloWorld < Calyx::Grammar
start 'Hello world.'
end
To generate the text itself, initialize the object and call the generate method.
hello = HelloWorld.new
hello.generate
# > "Hello world."
Obviously, this hardcoded sentence isn’t very interesting by itself. Possible variations can be added to the text by adding additional rules which provide a named set of text strings. The rule delimiter syntax ({}) can be used to substitute the generated content of other rules.
class HelloWorld < Calyx::Grammar
start '{greeting} world.'
greeting 'Hello', 'Hi', 'Hey', 'Yo'
end
Each time #generate runs, it evaluates the tree and randomly selects variations of rules to construct a resulting string.
hello = HelloWorld.new
hello.generate
# > "Hi world."
hello.generate
# > "Hello world."
hello.generate
# > "Yo world."
By convention, the start rule specifies the default starting point for generating the final text. You can start from any other named rule by passing it explicitly to the generate method.
class HelloWorld < Calyx::Grammar
hello 'Hello world.'
end
hello = HelloWorld.new
hello.generate(:hello)
Block Constructors
As an alternative to subclassing, you can also construct rules unique to an instance by passing a block when initializing the class:
hello = Calyx::Grammar.new do
start '{greeting} world.'
greeting 'Hello', 'Hi', 'Hey', 'Yo'
end
hello.generate
Template Expressions
Basic rule substitution uses single curly brackets as delimiters for template expressions:
fruit = Calyx::Grammar.new do
start '{colour} {fruit}'
colour 'red', 'green', 'yellow'
fruit 'apple', 'pear', 'tomato'
end
6.times { fruit.generate }
# => "yellow pear"
# => "red apple"
# => "green tomato"
# => "red pear"
# => "yellow tomato"
# => "green apple"
Nesting and Substitution
Rules are recursive. They can be arbitrarily nested and connected to generate larger and more complex texts.
class HelloWorld < Calyx::Grammar
start '{greeting} {world_phrase}.'
greeting 'Hello', 'Hi', 'Hey', 'Yo'
world_phrase '{happy_adj} world', '{sad_adj} world', 'world'
happy_adj 'wonderful', 'amazing', 'bright', 'beautiful'
sad_adj 'cruel', 'miserable'
end
Nesting and hierarchy can be manipulated to balance consistency with novelty. The exact same word atoms can be combined in a variety of ways to produce strikingly different resulting texts.
module HelloWorld
class Sentiment < Calyx::Grammar
start '{happy_phrase}', '{sad_phrase}'
happy_phrase '{happy_greeting} {happy_adj} world.'
happy_greeting 'Hello', 'Hi', 'Hey', 'Yo'
happy_adj 'wonderful', 'amazing', 'bright', 'beautiful'
sad_phrase '{sad_greeting} {sad_adj} world.'
sad_greeting 'Goodbye', 'So long', 'Farewell'
sad_adj 'cruel', 'miserable'
end
class Mixed < Calyx::Grammar
start '{greeting} {adj} world.'
greeting 'Hello', 'Hi', 'Hey', 'Yo', 'Goodbye', 'So long', 'Farewell'
adj 'wonderful', 'amazing', 'bright', 'beautiful', 'cruel', 'miserable'
end
end
Random Sampling
By default, the outcomes of generated rules are selected with Ruby’s built-in pseudorandom number generator (as seen in methods like Kernel.rand and Array.sample). To seed the random number generator, pass in an integer seed value as the first argument to the constructor:
grammar = Calyx::Grammar.new(seed: 12345) do
# rules...
end
Alternatively, you can pass a preconfigured instance of Ruby’s stdlib Random class:
random = Random.new(12345)
grammar = Calyx::Grammar.new(rng: random) do
# rules...
end
When a random seed isn’t supplied, Time.new.to_i is used as the default seed, which makes each run of the generator relatively unique.
Weighted Choices
Choices can be weighted so that some rules have a greater probability of expanding than others.
Weights are defined by passing a hash instead of a list of rules where the keys are strings or symbols representing the grammar rules and the values are weights.
Weights can be represented as floats, integers or ranges.
- Floats must be in the interval 0..1 and the given weights for a production must sum to 1.
- Ranges must be contiguous and cover the entire interval from 1 to the maximum value of the largest range.
- Integers (Fixnums) will produce a distribution based on the sum of all given numbers, with each number being a fraction of that sum.
The following definitions produce an equivalent weighting of choices:
Calyx::Grammar.new do
start 'heads' => 1, 'tails' => 1
end
Calyx::Grammar.new do
start 'heads' => 0.5, 'tails' => 0.5
end
Calyx::Grammar.new do
start 'heads' => 1..5, 'tails' => 6..10
end
Calyx::Grammar.new do
start 'heads' => 50, 'tails' => 50
end
There’s a lot of interesting things you can do with this. For example, you can model the triangular distribution produced by rolling 2d6:
Calyx::Grammar.new do
start(
'2' => 1,
'3' => 2,
'4' => 3,
'5' => 4,
'6' => 5,
'7' => 6,
'8' => 5,
'9' => 4,
'10' => 3,
'11' => 2,
'12' => 1
)
end
Or reproduce Gary Gygax’s famous generation table from the original Dungeon Master’s Guide (page 171):
Calyx::Grammar.new do
start(
:empty => 0.6,
:monster => 0.1,
:monster_treasure => 0.15,
:special => 0.05,
:trick_trap => 0.05,
:treasure => 0.05
)
empty 'Empty'
monster 'Monster Only'
monster_treasure 'Monster and Treasure'
special 'Special'
trick_trap 'Trick/Trap.'
treasure 'Treasure'
end
String Modifiers
Dot-notation is supported in template expressions, allowing you to call any available method on the String object returned from a rule. Formatting methods can be chained arbitrarily and will execute in the same way as they would in native Ruby code.
greeting = Calyx::Grammar.new do
start '{hello.capitalize} there.', 'Why, {hello} there.'
hello 'hello', 'hi'
end
4.times { greeting.generate }
# => "Hello there."
# => "Hi there."
# => "Why, hello there."
# => "Why, hi there."
You can also extend the grammar with custom modifiers that provide useful formatting functions.
Filters
Filters accept an input string and return the transformed output:
greeting = Calyx::Grammar.new do
filter :shoutycaps do |input|
input.upcase
end
start '{hello.shoutycaps} there.', 'Why, {hello.shoutycaps} there.'
hello 'hello', 'hi'
end
4.times { greeting.generate }
# => "HELLO there."
# => "HI there."
# => "Why, HELLO there."
# => "Why, HI there."
Mappings
The mapping shortcut allows you to specify a map of regex patterns pointing to their resulting substitution strings:
green_bottle = Calyx::Grammar.new do
mapping :pluralize, /(.+)/ => '\\1s'
start 'One green {bottle}.', 'Two green {bottle.pluralize}.'
bottle 'bottle'
end
2.times { green_bottle.generate }
# => "One green bottle."
# => "Two green bottles."
Modifier Mixins
In order to use more intricate rewriting and formatting methods in a modifier chain, you can add methods to a module and embed it in a grammar using the modifier classmethod.
Modifier methods accept a single argument representing the input string from the previous step in the expression chain and must return a string, representing the modified output.
module FullStop
def full_stop(input)
input << '.'
end
end
hello = Calyx::Grammar.new do
modifier FullStop
start '{hello.capitalize.full_stop}'
hello 'hello'
end
hello.generate
# => "Hello."
To share custom modifiers across multiple grammars, you can include the module in Calyx::Modifiers. This will make the methods available to all subsequent instances:
module FullStop
def full_stop(input)
input << '.'
end
end
class Calyx::Modifiers
include FullStop
end
Monkeypatching String
Alternatively, you can combine methods from existing Gems that monkeypatch String:
require 'indefinite_article'
module FullStop
def full_stop
self << '.'
end
end
class String
include FullStop
end
noun_articles = Calyx::Grammar.new do
start '{fruit.with_indefinite_article.capitalize.full_stop}'
fruit 'apple', 'orange', 'banana', 'pear'
end
4.times { noun_articles.generate }
# => "An apple."
# => "An orange."
# => "A banana."
# => "A pear."
Memoized Rules
Rule expansions can be ‘memoized’ so that multiple references to the same rule return the same value. This is useful for picking a noun from a list and reusing it in multiple places within a text.
The @ sigil is used to mark memoized rules. This evaluates the rule and stores it in memory the first time it’s referenced. All subsequent references to the memoized rule use the same stored value.
# Without memoization
grammar = Calyx::Grammar.new do
start '{name} <{name.downcase}>'
name 'Daenerys', 'Tyrion', 'Jon'
end
3.times { grammar.generate }
# => Daenerys <jon>
# => Tyrion <daenerys>
# => Jon <tyrion>
# With memoization
grammar = Calyx::Grammar.new do
start '{@name} <{@name.downcase}>'
name 'Daenerys', 'Tyrion', 'Jon'
end
3.times { grammar.generate }
# => Tyrion <tyrion>
# => Daenerys <daenerys>
# => Jon <jon>
Note that the memoization symbol can only be used on the right hand side of a production rule.
Unique Rules
Rule expansions can be marked as ‘unique’, meaning that multiple references to the same rule always return a different value. This is useful for situations where the same result appearing twice would appear awkward and messy.
Unique rules are marked by the $ sigil.
grammar = Calyx::Grammar.new do
start "{$medal}, {$medal}, {$medal}"
medal 'Gold', 'Silver', 'Bronze'
end
grammar.generate
# => Silver, Bronze, Gold
Dynamically Constructing Rules
Template expansions can be dynamically constructed at runtime by passing a context map of rules to the #generate method:
class AppGreeting < Calyx::Grammar
start 'Hi {username}!', 'Welcome back {username}...', 'Hola {username}'
end
context = {
username: UserModel.username
}
greeting = AppGreeting.new
greeting.generate(context)
External File Formats
In addition to defining grammars in pure Ruby, you can load them from external JSON and YAML files:
hello = Calyx::Grammar.load('hello.yml')
hello.generate
The format requires a flat map with keys representing the left-hand side named symbols and the values representing the right hand side substitution rules.
In JSON:
{
"start": "{greeting} world.",
"greeting": ["Hello", "Hi", "Hey", "Yo"]
}
In YAML:
---
start: "{greeting} world."
greeting:
- Hello
- Hi
- Hey
- Yo
Accessing the Raw Generated Tree
Calling #evaluate on the grammar instance will give you access to the raw generated tree structure before it gets flattened into a string.
The tree is encoded as an array of nested arrays, with the leading symbols labeling the choices and rules selected, and the trailing terminal leaves encoding string values.
This may not make a lot of sense unless you’re familiar with the concept of s-expressions. It’s a fairly speculative feature at this stage, but it leads to some interesting possibilities.
grammar = Calyx::Grammar.new do
start 'Riddle me ree.'
end
grammar.evaluate
# => [:start, [:choice, [:concat, [[:atom, "Riddle me ree."]]]]]
Roadmap
Rough plan for stabilising the API and features for a 1.0 release.
| Version | Features planned |
|---|---|
0.6 | |
0.7 | |
0.8 | |
0.9 | |
0.10 | |
0.11 | |
0.12 | |
0.13 | |
0.14 | |
0.15 | |
0.16 | |
0.17 | |
Credits
Author & Maintainer
Contributors
Author: Maetl
Source Code: https://github.com/maetl/calyx
License: MIT license