time-to-botec

commit 131ea138ae09e609d5bf01daf3c5bceafa0a9981
parent a2e1a48d82dcba2583c0cd6e133d1a399fc2dcb1
Author: NunoSempere <nuno.sempere@protonmail.com>
Date:   Sat,  3 Jun 2023 03:42:30 -0600

simplify xorshift implementation; struct not needed.

Diffstat:
M
C/scratchpad/xorshift
 | 
0

M
C/scratchpad/xorshift.c
 | 
25
++++++++++---------------

2 files changed, 10 insertions(+), 15 deletions(-)
diff --git a/C/scratchpad/xorshift b/C/scratchpad/xorshift
Binary files differ.
diff --git a/C/scratchpad/xorshift.c b/C/scratchpad/xorshift.c
@@ -2,34 +2,29 @@
 #include <stdio.h>
 #include <stdlib.h>
 
-struct xorshift32_state {
-    uint32_t a;
-};
-
-uint32_t xorshift32(struct xorshift32_state *state)
+uint32_t xorshift32(uint32_t* state)
 {
 	/* Algorithm "xor" from p. 4 of Marsaglia, "Xorshift RNGs" */
-	uint32_t x = state->a;
+	uint32_t x = *state;
 	x ^= x << 13;
 	x ^= x >> 17;
 	x ^= x << 5;
-	return state->a = x;
+	return *state = x;
 }
 
 int main(){
-	struct xorshift32_state** state = malloc(sizeof(struct xorshift32_state*) * 4);
+	uint32_t** states = malloc(4 * sizeof(uint32_t*));
 	for(int i=0; i<4;i++){
-		state[i] = malloc(sizeof(struct xorshift32_state));
-		state[i]->a = (uint32_t) i + 1;
+		states[i] = malloc(sizeof(uint32_t));
+		*states[i] = i + 1;
 	}
 
-	printf("%i\n", xorshift32(state[0]));
-	printf("%i\n", xorshift32(state[0]));
+	printf("%i\n", xorshift32(states[0]));
+	printf("%i\n", xorshift32(states[1]));
 	for(int i=0; i<4;i++){
-		free(state[i]);
+		free(states[i]);
 	}
-	free(state);
-
+	free(states);
 
   return 0;
 }