Readme update

Author: phenax

README.md

@@ -5,13 +5,24 @@ Note: Uses react canary (19)
 Our [App.tsx](./src/App.tsx) here calculates factorial of a number, fibonacci sequence and does a bit of arithmetics but it does all that using react (not JS). What I mean by that is:
 - No function recursion
 - No loops
-- No if-else/ternaries/`&& ||` ternaries
+- No if-else/`?:` ternaries/`&& ||` ternaries
 - No switch-case
 - No arithmetic operators (Currently I'm still minus for convinience but that'll change)
 
+![Screenshot](./screenshot.jpg)
+
+
 ## How it works
+It's all a blur now. I was in a state of trance when I wrote this. But basically, it uses Suspense and react's ability to get stuck in infinite render/state-update loop to compute things.
+
+Don't want to spend more time on this so if you need more details, feel free to ask in an issue. I'll be happy to explain.
+
 
-It's all a blur now. I was in a state of trance when I wrote this. But basically, it uses Suspense and react's ability to get stuck in infinite render/state-update loop to calculate things.
+## How to run it?
+Why would you want to do something like that? But if you're sure you want to...
 
-Don't want to spend more time on this so if you need more details, go through the code or ask me. I'll be happy to explain.
+- Clone this thing
+- Install dependencies `bun i` (Uses bun because I'm cool like that)
+- `bun run dev`
+- Open `localhost:5173` in your browser
 

screenshot.jpg

@@ -28,7 +28,7 @@ export const CallElement: FC<{
   fn: ReactNode,
   children: (result: any) => ReactNode,
 }> = ({ fn, children }) => {
-  const [_, forceUpdate] = useReducer((n) => n + 1, 0)
+  const [_, forceUpdate] = useReducer((n) => !n, false)
   const resolve = useRef((_: any) => {});
   const promise = useMemo(() => new Promise((res) => {
     resolve.current = res
@@ -53,7 +53,7 @@ export const EvaluateAll: FC<{ fns: ReactNode[] }> = ({ fns }) => {
 
   const resolve = useCallback((result: any, i: number) => {
     resultList.current[i] = result;
-    resultCount.current += 1;
+    resultCount.current++;
     if (resultCount.current === fns.length) {
       onReturn(resultList.current);
     }