АЕ
Why not? It's a fundamental work.
Size: a a a
2020 March 31
BD
Он прислал в личку что мы за него должны экзамег сдать. Я пас.
АЕ
нехороший человек, редиска
KR
Он прислал в личку что мы за него должны экзамег сдать. Я пас.
Вы цинично притворялись хорошими, а на самом деле вы вот какие!!!! ;-)
C
https://github.com/kgabis/ape#basic-types
Ape is a dynamically typed language with mark and sweep garbage collection. It's compiled to bytecode and executed on internal VM. It's fairly fast for simple numeric operations and not very heavy on allocations (custom allocators can be configured).
Ape is a dynamically typed language with mark and sweep garbage collection. It's compiled to bytecode and executed on internal VM. It's fairly fast for simple numeric operations and not very heavy on allocations (custom allocators can be configured).
BD
BD
NimbleParsec is a simple and fast library for text-based parser #elixir combinators.
Combinators are built during runtime and compiled into multiple clauses with binary matching. This provides the following benefits:
- Performance: since it compiles to binary matching, it leverages many Erlang VM optimizations to generate extremely fast parser code with low memory usage
- Composable: this library does not rely on macros for building and composing parsers, therefore they are fully composable. The only macros are defparsec/3 and defparsecp/3 which emit the compiled clauses with binary matching
- No runtime dependency: after compilation, the generated parser clauses have no runtime dependency on NimbleParsec. This opens up the possibility to compile parsers and do not impose a dependency on users of your library
- No footprints: NimbleParsec only needs to be imported in your modules. There is no need for use NimbleParsec, leaving no footprints on your modules
The goal of this library is to focus on a set of primitives for writing efficient parser combinators. The composition aspect means you should be able to use those primitives to implement higher level combinators.
https://github.com/dashbitco/nimble_parsec
Combinators are built during runtime and compiled into multiple clauses with binary matching. This provides the following benefits:
- Performance: since it compiles to binary matching, it leverages many Erlang VM optimizations to generate extremely fast parser code with low memory usage
- Composable: this library does not rely on macros for building and composing parsers, therefore they are fully composable. The only macros are defparsec/3 and defparsecp/3 which emit the compiled clauses with binary matching
- No runtime dependency: after compilation, the generated parser clauses have no runtime dependency on NimbleParsec. This opens up the possibility to compile parsers and do not impose a dependency on users of your library
- No footprints: NimbleParsec only needs to be imported in your modules. There is no need for use NimbleParsec, leaving no footprints on your modules
The goal of this library is to focus on a set of primitives for writing efficient parser combinators. The composition aspect means you should be able to use those primitives to implement higher level combinators.
https://github.com/dashbitco/nimble_parsec
а
https://github.com/kgabis/ape#basic-types
Ape is a dynamically typed language with mark and sweep garbage collection. It's compiled to bytecode and executed on internal VM. It's fairly fast for simple numeric operations and not very heavy on allocations (custom allocators can be configured).
Ape is a dynamically typed language with mark and sweep garbage collection. It's compiled to bytecode and executed on internal VM. It's fairly fast for simple numeric operations and not very heavy on allocations (custom allocators can be configured).
раст какой-то
BD
раст какой-то
как будто это что-то плохое
А
раст какой-то
где?
M
раст какой-то
Rust? Как по мне 1:1 JavaScript с той лишь разницей, что вместо function пишеться fn
А
MaxGraey
Rust? Как по мне 1:1 JavaScript с той лишь разницей, что вместо function пишеться fn
ааа, вот где раст, в fn засел
А
а так прям клон js
M
а так прям клон js
ага
IJ
Мне кажется нужно запретить просить решить домашние задания
AZ
Мне кажется, что стоит просто удалять и банить
IJ
Чатик не для этого
M
Похоже нас просто используют
АУ
Я забанила