I'm wondering if there is a way to implement a generic "memoize" functional (as in a function with a function as input and a function as output, as python's decorators) capable of handling also cps-style functions.  for a normal funct...

I have something like this:    function main() {   function create_node() {     console.log("create_node")       (function() {         var memo;         console.log(memo);          function f() {           var value;           console.log(val...

Summary: Is there a faster way to hash objects than JSON.stringify?  Details: I have a Ruby and JavaScript library (NeatJSON) that provides pretty-printing of JavaScript values. I recently fixed a problem where deeply-nested objects caused O(n!) perf...

Beginner in JS :) needs an explanation of code piece from Crockford's book, section 4.15:    var memoizer = function (memo, fundamental) {     var shell = function (n) {         var result = memo[n];         if (typeof result !== 'number'...

Promises are my preferred way of managing my asynchronous code in Javascript. Memoize (memoizee on npm) is a Javascript library for easily caching & pre-fetching results of functions.  Ideally I want to combine the best of both, and have the abil...

I'm working with some government data published via Socrata's SODA api.  This API provides a way to retrieve rows via a REST call. The API allows limited parameterization of the query - basically you can do a full text search, and nothing els...

I am stumped with this memoize problem. I need to create a function that will check to see if a value has already been calculated for a given argument, return the previous result, or run the calculation and return that value.   I have spent hours on...

I'm seeking an elegant way to memoize a class function using Memoizee package.  Outside a class, you can go about this trivially:  const memoize = require('memoizee')  const myFunc = memoize(function myfunc(){ ... })   but inside a class...

I'm trying to solve LeetCode's longest palindromic subsequence problem using Javascript by applying memoization to a recursive solution. Here is the recursive solution, longestPalindromicSubsequence.js:  function longestPalindromicSubsequence...

...or are there better ways to implement a Memoization?  Function.memoize = function(callableAsString)     {     var r = false, callable, code;     try         {         callable = eval(callableAsString);         if (typeof callable == "function&...