Divyansh Prakash divs1210

## transducerExpansion.js
function mapping(f) {
    return function(rf) {
        return function(acc, x) {
            return rf(acc, f(x))
        }
    }
}

function filtering(f) {
    return function(rf) {

## AVLSort.js
function getHeight(tree) {
    return tree === null? 0: tree.height
}

function newHeight(leftSubtree, rightSubtree) {
    return  Math.max(getHeight(leftSubtree), getHeight(rightSubtree)) + 1
}

function insert(tree, e) {
    if(tree === null)

## sequence.clj
(ns sequence
  (:refer-clojure :exclude [sequence sort])
  (:require [clojure.core :as core]))

;; Helper
;; ======
(defn accumulate
  ([])
  ([acc] acc)
  ([acc x] (conj (vec acc) x)))

## react-starter.html
<!DOCTYPE html>
<html lang="en">
    <title>Test React</title>
    <head>
        <script src="https://unpkg.com/react@16/umd/react.development.js"></script>
        <script src="https://unpkg.com/react-dom@16/umd/react-dom.development.js"></script>
        <script src="https://unpkg.com/babel-standalone@6.15.0/babel.min.js"></script>
    </head>
    <body>
        <div id="app"></div>

## csp.js
const CLOSED = Symbol('chan-closed');
const StackGC = async () => null;

class Chan {
    constructor(size) {
        this.q = [];
        this.size = size || 1;
        this.isClosed = false;
    }

## StackGC.js
// StackGC
// =======
const StackGC = async () => null;


// Tests
// =====
// util
function assert(assertion, msg) {
    console.assert(assertion, `%s`, msg);

## stackless-eval-playground.html
<html>
  <head>
    <script type="text/javascript">
// Trampoline
// ==========
class Thunk {
    constructor(f) {
        this.f = f;
    }
}

## stackless-eval.md

      
              1 file
            
          
              1 fork
            
          
              0 comments
            
          
              9 stars
            
          
                divs1210
                / stackless-eval.md
            
            
              Last active
              April 22, 2024 01:58
            
              
                Writing a Stackless Evaluator
              
          
    Writing a Stackless Evaluator

Divyansh Prakash, September 2023

Preface

NOTE: Please read the previous post to understand the context of this post.

  
## stackless.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              3 stars
            
          
                divs1210
                / stackless.md
            
            
              Last active
              October 6, 2023 13:41
            
              
                Cut me some stack - a deep dive into trampolines
              
          
    Cut me some stack

(a deep dive into trampolines)
Divyansh Prakash, September 2023

Preface


## clj-kondo-conf.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                divs1210
                / clj-kondo-conf.md
            
            
              Last active
              January 26, 2023 13:33
            
              
                clj-kondo-lein
              
          
    # copy libraries' configs
clj-kondo --lint "$(lein classpath)" --dependencies --parallel --copy-configs
;; export current ns types
;; (require '[malli.clj-kondo :as mc])
;; (-> (mc/collect *ns*) (mc/linter-config))
((requiring-resolve 'malli.clj-kondo/emit!))
	function mapping(f) {
	return function(rf) {
	return function(acc, x) {
	return rf(acc, f(x))
	}
	}
	}

	function filtering(f) {
	return function(rf) {
	function getHeight(tree) {
	return tree === null? 0: tree.height
	}

	function newHeight(leftSubtree, rightSubtree) {
	return Math.max(getHeight(leftSubtree), getHeight(rightSubtree)) + 1
	}

	function insert(tree, e) {
	if(tree === null)
	(ns sequence
	(:refer-clojure :exclude [sequence sort])
	(:require [clojure.core :as core]))

	;; Helper
	;; ======
	(defn accumulate
	([])
	([acc] acc)
	([acc x] (conj (vec acc) x)))
	<!DOCTYPE html>
	<html lang="en">
	<title>Test React</title>
	<head>
	<script src="https://unpkg.com/react@16/umd/react.development.js"></script>
	<script src="https://unpkg.com/react-dom@16/umd/react-dom.development.js"></script>
	<script src="https://unpkg.com/babel-standalone@6.15.0/babel.min.js"></script>
	</head>
	<body>
	<div id="app"></div>
	const CLOSED = Symbol('chan-closed');
	const StackGC = async () => null;

	class Chan {
	constructor(size) {
	this.q = [];
	this.size = size \|\| 1;
	this.isClosed = false;
	}
	// StackGC
	// =======
	const StackGC = async () => null;


	// Tests
	// =====
	// util
	function assert(assertion, msg) {
	console.assert(assertion, `%s`, msg);
	<html>
	<head>
	<script type="text/javascript">
	// Trampoline
	// ==========
	class Thunk {
	constructor(f) {
	this.f = f;
	}
	}