Skip to content

Instantly share code, notes, and snippets.

View menjaraz's full-sized avatar

Menjanahary menjaraz

32 followers · 137 following
View GitHub Profile
@menjaraz
menjaraz / log.txt
Created January 15, 2026 05:41
"tick-sim" log excerpt
2026-01-15T05:25:52.360670Z  INFO tick_sim: simulation_started command="Press Ctrl+C to stop"
2026-01-15T05:25:52.360882Z  INFO market_maker{config=Config { simulation: SimulationConfig { run_duration_ms: None }, agents: AgentsConfig { market_maker: MarketMakerConfig { center_price: 100.0, initial_levels: 5, initial_quantity: 100, spread: 0.1, tick_size: 0.05, standard_quantity: 100, latency_ms: (1, 5) }, noise_trader: NoiseTraderConfig { submit_interval_ms: 500, quantity_range: (10, 50), aggressive_prices: (99.95, 100.05) } }, market: MarketConfig { price_precision: 2 } } agent_id="market_maker"}: tick_sim::agents: market_maker_started
2026-01-15T05:25:52.360877Z  INFO run{event_rx=Receiver { chan: Rx { inner: Chan { tx: Tx { block_tail: 0x1f11d801c40, tail_position: 0 }, semaphore: Semaphore { semaphore: Semaphore {
@menjaraz
menjaraz / AsyncThread.pas
Created March 18, 2025 15:06 — forked from an01f01/AsyncThread.pas
unit AsyncThread;
interface
uses
{Delphi}
System.SysUtils
{Project}
;
@menjaraz
menjaraz / collatz.py
Last active October 7, 2024 08:09
Python Collatz Generator function
def generate_collatz(n):
"""
Generator function to generate the Collatz sequence.
Args:
n (int): The starting number for the sequence.
Yields:
int: The next number in the sequence.
"""
@menjaraz
menjaraz / main.dart
Created September 28, 2024 17:49
OEIS A014445 - Even Fibonacci numbers; or, Fibonacci(3*n).
/// OEIS A014445 - Even Fibonacci numbers; or, Fibonacci(3*n).
/// https://oeis.org/A014445
/// https://oeis.org/A014445/list
void main() => print(evenFibonacci().take(26));
Iterable<int> evenFibonacci() sync* {
int a = 0, b = 2;
while (true) {
@menjaraz
menjaraz / main.dart
Last active September 28, 2024 17:33
Project Euler Problem 10 - Summation of Primes
// Summation of Primes
// https://projecteuler.net/problem=10
void main() {
final timer = Stopwatch()..start();
final answer = summationOfPrimesBelow(2000000);
timer.stop();
@menjaraz
menjaraz / app.d
Created September 28, 2024 17:20
Prime Generator in Dlang
import std.stdio;
import std.range;
import std.algorithm;
auto primeGenerator() {
int num = 2;
return generate(() {
while (true) {
if (isPrime(num)) {
@menjaraz
menjaraz / gf_gen.py
Last active September 22, 2024 06:02
Simple Python script utilizing power series expansion of the ordinary generating function to compute the sequence terms.
import sympy as sp
def generate_sequence(gen_func, num_terms):
"""
Generates a sequence up to num_terms terms using the given generating function.
Args:
gen_func: The generating function as a SymPy expression.
num_terms (int): The number of terms in the sequence.
@menjaraz
menjaraz / Install PostgreSQL on Windows by scoop.md
Created July 19, 2024 07:21 — forked from ergin/Install PostgreSQL on Windows by scoop.md

Install PostgreSQL on Windows by scoop

Follow the below steps to install the latest version of PostgreSQL on Windows by scoop package manager.

Install PostgreSQL

scoop install postgresql -g

Configure PostgreSQL as a Windows Service




  


  




    


          
    

      

        
        

          

              @menjaraz
          

          

            
                menjaraz
                / Install MySQL on Windows by scoop.md
            
            

              Created
              July 18, 2024 18:44
                — forked from ergin/Install MySQL on Windows by scoop.md
            

          

        

      

        

  

      

    
Install MySQL on Windows by scoop


Install latest version of MySQL via scoop package manager on Windows.
If you want to install specific version of MySQL, just replace "mysql" with "mysql@version". For example: "mysql@8.1.0".


Install MySQL


scoop install mysql -g


Configure MySQL as a Windows Service



  


  




    


          
    

      

        
        

          

              @menjaraz
          

          

            
                menjaraz
                / app.d
            
            

              Created
              July 18, 2024 08:26
            

              
                ProjectEuler: Summation of Primes
              
          

        

      

        

  

    
    


        



  


  

        

          
          import std.stdio : writefln;
        

        

          
          

        

        

          
          void main() {
        

        

          
              "%,3?d".writefln('_', 2_000_000.sumOfPrimesBelow);
        

        

          
          }
        

        

          
          

        

        

          
          ulong sumOfPrimesBelow(ulong num) {
        

        

          
              // Create a dynamic array of booleans initialized to true
        

        

          
              bool[] primes = new bool[num];
        

        

          
              primes[] = true;