Skip to content

Instantly share code, notes, and snippets.


Fernando Zamora fernandozamoraj

View GitHub Profile
View HowToForkInC
#include <stdio.h>
#include <sys/types.h>
#include <unistd.h>
//this code must be run in an unix env
int main(int argc, char *argv[]){
pid_t pid;
View FZs Ruby Cheat Sheet
#this is a comment
#this is an array assignment
numbers = [0,1,2,3,4,3,5,6,7,8]
#this is an array assignment from a range
puts "*****Numbers******"
numbers.each{|number| puts number}
import urllib.request
import ctypes
import time
from datetime import datetime
page_name = "my page" #change to what you want your message to display
page_url = "" #change to your website...
start_time =;
failure_count = 0
View RabbitMQ Example in Javascript
var _q = 'fz.default.q';
let _conn = false
let _sendChannel = false
let _server = "amqp://localhost"
let _userName = ""
let _password = ""
let _onConsume = setMessage
let _connectionIsEstablished = false
fernandozamoraj / PriorityQueue.cpp
Created Mar 31, 2019
Priority queue using heao
View PriorityQueue.cpp
using namespace std;
template <class T>
class PriorityQueue{
T *_array;
View valgrind-example-commands.txt
g++ -g -std=c++11 mymain.cpp ./subfolder/myutil.cpp ./subfolder/myutil2.cpp -o myprogram.exe
valgrind ./myprogram.exe
View Simplest Java Drawing Skeleton
import java.awt.*;
class Window extends Frame{
setSize(800,900);//frame size 300 width and 300 height
setLayout(null);//no layout manager
setVisible(true);//now frame will be visible, by default not visible
fernandozamoraj /
Created Dec 10, 2018
This gist is a python script to find text in files in a given directory... useful for searching log files. Grep works better but sometimes not a windows as well
# ./findfz directory filefilter searchWord [searchWord2] [searchWord3] [searchWord4]
import glob
import sys
directory = "."
fileFilter = "*.*"
if len(sys.argv) > 3:
fernandozamoraj / BinaryTree.js
Created Nov 22, 2018 — forked from benlesh/BinaryTree.js
A simple Binary Tree implementation in JavaScript
View BinaryTree.js
* Binary Tree
* (c) 2014 Ben Lesh <>
* MIT license
* A simple Binary Tree implementation in JavaScript
View ninja.c
#include <stdio.h>
#include <stdlib.h>
#include <windows.h>
#include <conio.h>
#include <string.h>
void print_at_xy(int x, int y, char *val);
void display_score();
void init();
int zero_lives();
You can’t perform that action at this time.