radiofreejohn

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
/*
  I wrote this as a sort of challenge, I wanted to pass random words into the K&R exercise
  that generates a hash table of key value pairs to see how quickly the hashes stack up on
  one another. I could have easily piped random words to the input, but that's not painful
  at all...
*/

radiofreejohn

#include <stdio.h>
#include <stdlib.h>
#include "numbers.h" // https://gist.github.com/911872

struct node {
    int key;
    struct node *l;
    struct node *r;
};

radiofreejohn

#include <stdio.h>

void *strcatsnot(char *s, const char *t);

void *strcatsnot(char *s, const char *t)
{
    while (*++s)
        ;
    while (*s++ = *t++)
        ;

radiofreejohn

package main

import (
  "fmt"
  "io/ioutil"
  "log"
  "os"
  "sync"
)

radiofreejohn

#include <stdio.h>
#include "numbers.h" // https://gist.github.com/911872

int main()
{
    struct numbers a;
    struct numbers b;
    /*
      I feel like a tool, sort of. I spent more time than I should admit using
      generateRandoms here, forgetting that mergesort can only merge two arrays

radiofreejohn

Keybase proof

I hereby claim:

• I am radiofreejohn on github.
• I am radiofreejohn (https://keybase.io/radiofreejohn) on keybase.
• I have a public key whose fingerprint is 1C44 2943 B328 703E FBF2 F180 A91A DB31 84F2 2D74

To claim this, I am signing this object:

radiofreejohn

/*
  input is 1 line with 10 cards, black first, white second

  cards are sorted by value (suit is disregarded when sorting)
  when tested for hand type -- they are sorted again based on the
  order of evaluation of the hand when comparing the two, so 
  full house will put the 3 of a kind highest, then the 2 of a kind.
  A pair will have the pair as the last two cards, and the rest
  sorted by from lowest to highest. This makes it easy to determine
  the winner by comparing down from the top.

radiofreejohn

/*
    check-frag filename [blocksize guess]
    
    blocksize default is 4096 -- smaller and seeks take too long
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <sys/fcntl.h>
#include <unistd.h>

radiofreejohn

#!/bin/bash
#+
# Usage
#       newc filename [include[.h] ...]
#
# Output
#       Creates a file (filename) with a skeleton main function, with
#       optional include files in the header. If the file exists in
#       /usr/include then #include <include.h> is added, if it is not
#       found in /usr/include, but is found in the current directory

radiofreejohn

/*
 * gcc nv3h_read_gz.c -shared -Bsymbolic -I/zshare/rsi/idl_6.3/external/include -L/zshare/rsi/idl_6.3/bin/bin.linux.x86_64 -lidl -o nv3h_read_gz.so -fPIC -lz -ldl
 *
 * requires zlib 1.2.5 for gzbuffer -- will check for right version
 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
#include <zlib.h>