davazp

;;; react.lisp --- React interop for JSCL

;; Copyright (C) 2025 JSCL contributors

;; JSCL is free software: you can redistribute it and/or
;; modify it under the terms of the GNU General Public License as
;; published by the Free Software Foundation, either version 3 of the
;; License, or (at your option) any later version.
;;
;; JSCL is distributed in the hope that it will be useful, but

davazp

/*
  Simplest and least ambitious task-orchestration for Node-based projects

  https://ninja-build.org/manual.html
*/

import { spawn } from "child_process";
import { promises as fs } from "fs";
import glob from "glob";
import path from "path";

davazp

/*

Incremental sieve of Erastotenes
================================

We get the nth prime by an variation of 'sieve of Erastotenes' that is
incremental and does not require a upper bound.

You can visualize the algorithm as it follows. Imagine some boxes
labeled with the integer numbers.

davazp

;; -*- scheme-*-
#lang pie

;;
;; Boolean
;;
(claim Boolean U)
(define Boolean Atom)

;;

davazp

Keybase proof

I hereby claim:

• I am davazp on github.
• I am davazp (https://keybase.io/davazp) on keybase.
• I have a public key ASCxn5ejKuIVLDn2Z5Pj1tuwVJiHFeZF5Y0SY8XgIV5pzQo

To claim this, I am signing this object:

davazp

# Grep across all git history
git rev-list --all | xargs git grep 'pattern'

davazp

SET NOCOUNT ON
GO

PRINT 'Using Master database'
USE master
GO

PRINT 'Checking for the existence of this procedure'
IF (SELECT OBJECT_ID('sp_generate_merge','P')) IS NOT NULL --means, the procedure already exists

davazp

'use strict';

const graphql = require('graphql').graphql;
const makeExecutableSchema = require('graphql-tools').makeExecutableSchema;

let resolvers = {
  Query: {
    person: ()=>{
      return {
        id: 2

davazp

'use strict';

let findup = require('findup');
let path = require('path');

const PACKAGEFILE = 'package.json';

module.exports = function() {
  let mainfile = require.main.filename;
  if (mainfile){

davazp

(defun camelcasefy ()
  "Convert a string in camel-case interactively."
  (interactive)
  (catch 'exit
    (let ((stack nil))
      (while t
        (let ((ch (read-char "Character: ")))
          (cond
           ((char-equal ch ?\n)
            (throw 'exit nil))