https://ankitbahuguna.xyz/tags/programming/ Recent content in programming on ankit bahuguna Hugo -- gohugo.io en Mon, 16 Oct 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/lazy-evaluation/ Mon, 16 Oct 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/lazy-evaluation/ Learning OCaml and Lazy Evaluation Lazy evaluation is a cool concept that delays computations until they’re actually needed, saving resources and time. OCaml is great for this, but TypeScript and Go can do it too in their own ways. OCaml Example OCaml uses lazy streams to generate Fibonacci numbers: type 'a stream = Cons of 'a * 'a stream Lazy.t let rec fibs a b = Cons (a, lazy (fibs b (a + b))) let rec take n (Cons (x, xs)) = if n <= 0 then [] else x :: take (n - 1) (Lazy. https://ankitbahuguna.xyz/posts/trying-out-node-vm-module/ Mon, 02 Oct 2023 17:56:37 +0530 https://ankitbahuguna.xyz/posts/trying-out-node-vm-module/ I recently used Node’s VM module with a CLI tool to allow passing custom JavaScript via command line flags. The tool interacts with a REST API that returns JSON responses. So for instance, we have a users end point that returns users. It accepts some filters but sometimes you may want to filter or transform the output in some way. myclitool get users limit 10 [ { name: 'jon', email: 'jon@doe. https://ankitbahuguna.xyz/posts/benchmarking-recursive-and-tail-recursive-functions-in-ocaml/ Thu, 24 Aug 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/benchmarking-recursive-and-tail-recursive-functions-in-ocaml/ This post is a continuation of the my last post . I did some benchmarking for recursive and non-recursive version of sum function. open Unix (* Tail recursive version *) let min_list_tail lst = let rec min_tail lst acc = match lst with | [] -> acc | h :: t -> min_tail t (if h < acc then h else acc) in match lst with | [] -> failwith "Empty list" | h :: t -> min_tail t h (* Non-tail recursive version *) let rec min_list_non_tail = function | [] -> failwith "Empty list" | [x] -> x | h :: t -> let min_tail = min_list_non_tail t in if h < min_tail then h else min_tail let generate_large_list size = List. https://ankitbahuguna.xyz/posts/undertanding-tail-recursion/ Tue, 15 Aug 2023 01:55:25 +0530 https://ankitbahuguna.xyz/posts/undertanding-tail-recursion/ I’ve been playing around with OCaml lately and wanted to understand how tail recursion works. According to Wikipedia: “In computer science, a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said to be tail recursive, which is a special case of direct recursion.” Non-Tail Recursive Sum Function in OCaml Here’s a non-tail recursive sum function in OCaml: https://ankitbahuguna.xyz/posts/scraping-leetcode/ Fri, 16 Apr 2021 18:48:12 +0530 https://ankitbahuguna.xyz/posts/scraping-leetcode/ Warning: This code no longer works since there has been a change in Leetcode’s website from the time this post was written. I am, by no means, a Fangsexual and I don’t enjoy solving problems on the LeetCode, so I decided to find a way to quickly download the top 15 most voted solutions for any problem. I’ve been playing around with Puppeteer and it seemed like a good idea to use it for something like this.