🚀 Ah, yes, the riveting world of dynamic programming with Σ-types in Lean—because who wouldn't want to verify their #memoization techniques while sipping on a nice cup of existential dread? 🤓 If you thought solving recursive #algorithms was thrilling, just wait until you read about turning it into a 17-minute snooze-fest! 💤
https://tannerduve.github.io/blog/memoization-sigma/ #dynamicprogramming #Σtypes #Lean #existentialdread #HackerNews #ngated

#commonLisp #programming #amop #mop #metaobjectProtocol #exercise #closette #learnToCode (my own experience) #oop
https://screwlisp.small-web.org/amop/eg1/

Today I simply share and solve (hopefully!) The Art of the Metaobject Protocol exercise 1.1

(the softball generic classes #memoization exercise from chapter 1)

I just added a lexical closure of hash tables.

@simoninireland wrote about the art of the metaobject protocol in his #lisp bibliography a year ago. https://simondobson.org/2024/07/23/the-art-of-the-metaobject-protocol/

Memoizing the Cache in Laravel, by @amitmerchant.bsky.social:

https://www.amitmerchant.com/memoizing-the-cache-in-laravel/

#laravel #caching #memoization

Between immutability and memoization, you might have to choose, by Rémy Hannequin
https://thoughtbot.com/blog/between-immutability-and-memoization-you-might-have-to-choose

Freezing objects, pre-computation, cache, #memoization.. which one you can use, when it's worthy?

#ruby

I started implementing some explorations in #Haskell but I had to ditch `data-memocombinators` because #MicroHs doesn't properly support #RankNTypes yet. Instead I'm doing manual #memoization with #array :

```
import Data.Array

-- memoized function, looks up in array
f :: Int -> Int -> Int -> Int
f = \x y z -> if inRange fBounds (x, y, z) then fArray ! (x, y, z) else 0

-- real algorithm, recursive calls use memoized function
f' :: Int -> Int -> Int -> Int
f' 1 1 1 = 1
f' a b c = sum [ f (a - 1) b c, f a (b - 1), f a b (c - 1) ]

-- array, generated with real algorithm
fArray :: Array (Int, Int, Int) [Bool]
fArray = array fBounds [ (i, f' x y z) | i@(x, y, z)<- range fBounds ]

-- array bounds
fBounds :: ((Int, Int, Int), (Int, Int, Int))
fBounds = ((1, 1, 1), (limit, limit, limit))

-- can be as large as necessary for the real problem,
-- but going too big consumes too much memory
limit :: Int
limit = 45
```

[Перевод] React useCallback() — полное руководство

Всем привет! На связи Разобраться с useCallback() полностью

https://habr.com/ru/companies/spectr/articles/869806/

#ecommerce #ecom #javascript #react #hook #memoization

React. Обновление узлов и мемоизация

В процессе разработки современных веб-приложений производительность часто становится одним из ключевых аспектов, которые волнуют и разработчиков, и пользователей. Пользователи ожидают молниеносного отклика, а разработчики стремятся создать приложения, которые работают быстро и эффективно. Одним из мощных инструментов, позволяющих достигнуть высокой производительности в React-приложениях, является мемоизация. Мемоизация помогает значительно сократить количество вычислений и, соответственно, обновлений интерфейса, что положительно сказывается на общей скорости и отзывчивости приложения. В данной статье мы заглянем "под капот" движка React и увидем, как именно происходит обновление узлов. Параллельно рассмотрим и основные принципы мемоизации и её применение в различных типах компонентов.

https://habr.com/ru/articles/821293/

#react #reactjs #reactjs #мемоизация #memoization

Advent of Code Day 2 — Cube Conundrum

The hands of the Christmas elf are far, far larger than they appear.

https://chasingdings.com/2023/12/02/advent-of-code-day-2-cube-conundrum/

#AdventOfCode #chatgpt #copilot #haskell #memoization

Now (7pm ET Wed) watch https://youtu.be/AVBwSqH01L0 (FEEL FREE TO SUBSCRIBE TO YOUTUBE
@hajiaghayi

FOR FUTURE LESSONS) Lesson 21: Introduction to Algorithms by Mohammad Hajiaghayi: In this session, we talk about #DP, #Memoization,#ApproximationAlgorithm, #GreedyAlgorithm, #Backtracking

Iuri de Silvio is presenting the talk "Caching everywhere" at the DjangoCon Europe 2023 in Edinburgh 🏴󠁧󠁢󠁳󠁣󠁴󠁿🦄🚀

#DjangoConEuroppe #DjangoCon #Django #Caching #Memoization

CC @djangoconeurope

https://pretalx.com/djangocon-europe-2023/talk/8NWSNF/

Advent of Code Day 24 — Blizzard Basin

The Christmas elves don't like the snow for some reason? They have the wrong boss, I think. Well, we better help them get through those couple hundred blizzards.

https://chasingdings.com/2022/12/24/advent-of-code-day-24-blizzard-basin/

#AdventofCode #a* #blizzard #elf #memoization #python

A Guide to Memoization in #Ruby, by @appsignal

https://blog.appsignal.com/2022/12/20/a-guide-to-memoization-in-ruby.html

> Memoization is a caching technique to make your Ruby application run more efficiently and faster.

> In this post, we'll look at the benefits of memoization and when to use it in your Ruby application. We'll also look at some memoization mistakes to avoid.

#performance #memoization #caching #optimization

Advent of Code Day 19 — Not Enough Minerals

Okay, this one took a long time. I knew what to do, but what to do was super slow.

https://chasingdings.com/2022/12/20/advent-of-code-day-19-not-enough-minerals/

#AdventofCode #advent #depthfirstsearch #memoization #python #robots

Nice write up by Prateek Karki on using memoization techniques in React. Great skill to learn about if you haven't looked into it before.

👉https://www.toptal.com/react/react-memoization

#React #Memoization

Referenced link: https://hackernoon.com/how-memoization-can-help-you-boost-your-javascript-code
Discuss on https://discu.eu/q/https://hackernoon.com/how-memoization-can-help-you-boost-your-javascript-code

Originally posted by HackerNoon | Learn Any Technology / @hackernoon@twitter.com: https://twitter.com/hackernoon/status/1549287972041801730#m

"How Memoization Can Help You Boost Your Javascript Code" https://hackernoon.com/how-memoization-can-help-you-boost-your-javascript-code #javascript #memoization

- Eager #memoization of functions from infinite types would require infinite storage. But #Haskell is a lazy language, so the boundary between lazily evaluated (infinite) data structures and functions is fuzzy.

Of course we could choose to avoid #memoization altogether. Avoid #currying. Avoid retaining state. Just pass around argument parameters and recalculate function results every time.

It'll be safer.

And it'll be slower.

So we must come up with something better.

And that can't be achieved with the current version of the #Java #programmingLanguage or the #JVM.

It can't be achieved on current o.s. kernels or any consumer computer chips.

#Immutability is an illusion.

It's just asking for trouble. It's like asking for a #hacker to go in and change a few bits in memory you thought wasn't shared - but you were wrong. Thank you, #Spectre and #Meltdown #vulnerabilities.

And it's worse, because you didn't even know that #memoization was used: it's a black box, a hidden implementation, remember? How do you test what you can't see? How do you trust what you can't know?

Well. Partially through making the code public. Yay, #openSource #software.

And the same occurs with any value remembered beyond a very short lifetime, and sometimes even then. (Looking at you, #multithreading.)
Because a file system is #mutable, our #software #application suffers the effects of the change. And if the #programmingLanguage allows for mutability, like #Java does, then it too suffers the effect of change on remembered values. Especially when we, the programmers, can't see that values were remembered. Which is what #memoization does.

A file on a file system is a prime example of #memoization: it retains data that was the result of some operation. The o.s. provides ways to read and change the contents.

Let's assume the file contains some configuration at the start of a program. The program reads it and alters its processing accordingly.

Then halfway through, a human interferes and changes the file contents.

How does the program react? Does it change? Does it crash? Does it corrupt some data?