txiki.js
javascript-algorithms
txiki.js | javascript-algorithms | |
---|---|---|
8 | 118 | |
2,337 | 182,797 | |
- | - | |
9.1 | 5.0 | |
9 days ago | 16 days ago | |
C | JavaScript | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
txiki.js
-
A list of JavaScript engines, runtimes, interpreters
txiki.js
-
JavaScript Standard Input/Output: Unspecified
// https://github.com/denoland/deno/discussions/17236#discussioncomment-4566134 // https://github.com/saghul/txiki.js/blob/master/src/js/core/tjs/eval-stdin.js async function readFullAsync(length, buffer = new Uint8Array(65536)) { const data = []; while (data.length < length) { const input = await open("/dev/stdin"); let { bytesRead } = await input.read({ buffer }); await input.close(); if (bytesRead === 0) { break; } data.push(...buffer.subarray(0, bytesRead)); } return new Uint8Array(data); }
- Node.js fetch() vs. Deno fetch(): Implementation details...
-
How to compile serveTls for import into QuickJS?
I've only dabbled with the shared libraries once, with the help of the owner of the lnked repository. I wound up solving the issue adjusting the code I was working on https://github.com/saghul/txiki.js/issues/294.
-
C++ to C string concatenation
I have written the same code in C++ https://github.com/guest271314/captureSystemAudio/blob/master/native_messaging/capture_system_audio/capture_system_audio.cpp, Python https://github.com/guest271314/captureSystemAudio/blob/master/native_messaging/capture_system_audio/capture_system_audio.py, and QuickJS (C source code) https://github.com/saghul/txiki.js/issues/294. QuickJS is the only implementation that winds up clipping the end of real-time audio capture.
-
QuickJS JavaScript Engine – Fabrice Bellard
QuickJS is awesome, simple to use and very easy to integrate.
Over the past few years I slowly built a small JS runtime using QuickJS as the engine and libuv as the platform layer, amongst other things, in case anyone wants to take a look: https://github.com/saghul/txiki.js
- GitHub - saghul/txiki.js: The tiny JavaScript runtime built with QuickJS, libuv
- GitHub - saghul/txiki.js: The tiny JavaScript runtime built with QuickJS, libuv and ❤️
javascript-algorithms
- 10 GitHub Repos for Mastering JavaScript
-
Minecraft Grub Theme
I'm reminded of the time when some kid wrote a script to crawl GitHub and create issues[1] about using inclusive language... except it was really dumb, for example: https://github.com/trekhleb/javascript-algorithms/pull/875/f...
[1] E.g.: https://github.com/EbookFoundation/free-programming-books/pu...
-
is there any website that you can practise javascript from complete beginning to mastery
Try codewars or leetcode Or you can use this repo for ds practice https://github.com/trekhleb/javascript-algorithms
-
Is anyone interested in contributing to Ultimate Guide to Algorithm opensource together?
This one is pretty popular too.
-
Help! Prep for interview in 2 weeks
for algos - not sure how much you'll need to do for a jr position but familiarity with some of the beginner stuff here couldn't hurt: https://github.com/trekhleb/javascript-algorithms
-
JavaScript-algorithms: Algorithms and data structures implemented in JavaScript
Traditionally, a linked list allows you to insert before/after a node. i.e. addBefore(node,value) (see [2] ) He doesn't implement addBefore & addAfter.
Instead, he provides a whole bunch of non-canonical helpers like reverse(), toArray(), deleteTail() etc - these are typical LC-Easy problems that don't belong inside the data structure.
My own introduction to these things was a C course called "Data Structures in C" in the traditional CS curriculum, and yes, you would have to malloc a new node, get back a pointer with a memory address, & the process of pointing the next pointer of the current node to this new node so that the memory address of the next value was explicitly "linked" to the current value and hence linked list etc...I guess much of that terminology is lost on the new generation in the absence of pointers & memory addresses.
The canonical exercise in those days was - Show that a linked list does not store objects in contiguous memory, unlike an array. So to solve this, you would traverse the list from the head node & print the actual addresses of the memory locations along the way, proving that the vals aren't stored contiguously. I wonder what that exercise would mean in JS land.
That said, yeah its a good starting point & I applaud the effort.
[1]https://github.com/trekhleb/javascript-algorithms/blob/maste...
- 30 March 2023 - Daily Chat Thread
What are some alternatives?
v8go - Execute JavaScript from Go
Dlib - A toolkit for making real world machine learning and data analysis applications in C++
engine262 - An implementation of ECMA-262 in JavaScript
javascript-es2020-sandbox - This is a place for me to screw around some code and will be the home of my future JavaScript ES2020 Cheat Sheet
AudioWorkletStream - fetch() => ReadableStream => AudioWorklet
developer-roadmap - Interactive roadmaps, guides and other educational content to help developers grow in their careers.
proposal-common-minimum-api
clean-code-javascript - :bathtub: Clean Code concepts adapted for JavaScript
rayjs - Javascript bindings for raylib in a single ~3mb executable
free-for-dev - A list of SaaS, PaaS and IaaS offerings that have free tiers of interest to devops and infradev
You-Dont-Know-JS - A book series on JavaScript. @YDKJS on twitter.
node-soap - A SOAP client and server for node.js.