Souvik Sen invokesus

## check-status.hs
#!/usr/bin/env stack
-- stack --resolver lts-15.10 script
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE NoImplicitPrelude #-}
import RIO
import Network.HTTP.Simple
import qualified RIO.Text as T

main :: IO ()
main = runSimpleApp $ do

## what each nix Dev should know.md

      
              1 file
            
          
              1 fork
            
          
              0 comments
            
          
              10 stars
            
          
                srghma
                / what each nix Dev should know.md
            
            
              Last active
              January 1, 2024 17:59
            
          
    fix function - https://github.com/NixOS/nixpkgs/blob/9f087964709174424bca681b600af8ee8e763df5/lib/fixed-points.nix#L19 , https://en.m.wikipedia.org/wiki/Fixed_point_(mathematics) , point where x = f(x) = f(f(f(f....f(x)....)))
rec { a = 1; b = a + 1; } is the same as fix (self: { a = 1; b = self.a + 1; })
builtins.trace - https://github.com/NixOS/nixpkgs/blob/9f087964709174424bca681b600af8ee8e763df5/lib/debug.nix#L4 trace has different flavors, http://hackage.haskell.org/package/base-4.12.0.0/docs/Debug-Trace.html#v:trace all lazy languages have trace
builtins.seq - in lazy languages data is represented as thunks (IF data has not been yet evaluated THEN it's pointer on function that should produce this data ELSE it's pointer on data), builtins.seq forces first layer of data to evaluate (evaluates it to WHNF?), builtins.deepSeq is recursive variant of seq, it forces whole data to evaluate (evaluates it to NF?), (more https://wiki.haskell.org/Seq, https://www.google.com/amp/s/amp.reddit.

  
## nix-flakes.md

      
              1 file
            
          
              3 forks
            
          
              7 comments
            
          
              102 stars
            
          
                edolstra
                / nix-flakes.md
            
            
              Last active
              November 11, 2023 01:06
            
          
    Nix Flake MVP

Goals


To provide Nix repositories with an easy and standard way to
reference other Nix repositories.


To allow such references to be queried and updated automatically.


To provide a replacement for nix-channel, NIX_PATH and Hydra


## MST.py
# coding: utf-8
import re


# Class WeightedGraph
class WeightedGraph:
    def __init__(self, path):
        # open file to initialize the graph
        file = open(path, "r")
        p = re.compile("\d+")

## pre-push.sh
#!/bin/bash

# @link https://gist.github.com/mattscilipoti/8424018
#
# Called by "git push" after it has checked the remote status,
# but before anything has been pushed.
#
# If this script exits with a non-zero status nothing will be pushed.
#
# Steps to install, from the root directory of your repo...

## example.md

      
              2 files
            
          
              72 forks
            
          
              33 comments
            
          
              139 stars
            
          
                dideler
                / example.md
            
            
              Last active
              February 17, 2024 20:24
            
              
                A python script for extracting email addresses from text files.You can pass it multiple files. It prints the email addresses to stdout, one address per line.For ease of use, remove the .py extension and place it in your $PATH (e.g. /usr/local/bin/) to run it like a built-in command.
              
          
    The program below can take one or more plain text files as input. It works with python2 and python3.
Let's say we have two files that may contain email addresses:

file_a.txt

foo bar
ok ideler.dennis@gmail.com sup
 hey...user+123@example.com,wyd
hello world!


## latency.txt
Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD
	#!/usr/bin/env stack
	-- stack --resolver lts-15.10 script
	{-# LANGUAGE OverloadedStrings #-}
	{-# LANGUAGE NoImplicitPrelude #-}
	import RIO
	import Network.HTTP.Simple
	import qualified RIO.Text as T

	main :: IO ()
	main = runSimpleApp $ do
	# coding: utf-8
	import re


	# Class WeightedGraph
	class WeightedGraph:
	def __init__(self, path):
	# open file to initialize the graph
	file = open(path, "r")
	p = re.compile("\d+")
	#!/bin/bash

	# @link https://gist.github.com/mattscilipoti/8424018
	#
	# Called by "git push" after it has checked the remote status,
	# but before anything has been pushed.
	#
	# If this script exits with a non-zero status nothing will be pushed.
	#
	# Steps to install, from the root directory of your repo...
	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD