Fernando Zamora fernandozamoraj

## 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

## PriorityQueue.cpp
#include<iostream>
#include<string>

using namespace std;

template <class T>
class PriorityQueue{

private:
    T *_array;

## valgrind-example-commands.txt
g++ -g -std=c++11 mymain.cpp ./subfolder/myutil.cpp ./subfolder/myutil2.cpp -o myprogram.exe
./myprogram.exe
valgrind ./myprogram.exe

## Simplest Java Drawing Skeleton
import java.awt.*;
class Window extends Frame{

	Window(){

		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

## findfz.py
#usage
#  ./findfz directory filefilter searchWord [searchWord2] [searchWord3] [searchWord4]

import glob
import sys

directory = "."
fileFilter = "*.*"

if len(sys.argv) > 3:

## BinaryTree.js
/**
 * Binary Tree
 * (c) 2014 Ben Lesh <ben@benlesh.com>
 * MIT license
 */

/*
 * A simple Binary Tree implementation in JavaScript
 */

## 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();

## bpdemo-index.php
<!DOCTYPE html>
<html>
<head>
    <title>Books</title>
</head>
<body>
    <?php
        $servername = "localhost";
        $username = "bpdemo";
        $password = "bpdemo";

## gist:b191005eae5cb1ac9d554385d88f17b0
#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();

## gist:05c6ad533ded5fd6b803df82b8247e61
#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();
	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
	#include<iostream>
	#include<string>

	using namespace std;

	template <class T>
	class PriorityQueue{

	private:
	T *_array;
	g++ -g -std=c++11 mymain.cpp ./subfolder/myutil.cpp ./subfolder/myutil2.cpp -o myprogram.exe
	./myprogram.exe
	valgrind ./myprogram.exe
	import java.awt.*;
	class Window extends Frame{

	Window(){

	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
	#usage
	# ./findfz directory filefilter searchWord [searchWord2] [searchWord3] [searchWord4]

	import glob
	import sys

	directory = "."
	fileFilter = "."

	if len(sys.argv) > 3:
	/**
	* Binary Tree
	* (c) 2014 Ben Lesh <ben@benlesh.com>
	* MIT license
	*/

	/*
	* A simple Binary Tree implementation in JavaScript
	*/
	#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();
	<!DOCTYPE html>
	<html>
	<head>
	<title>Books</title>
	</head>
	<body>
	<?php
	$servername = "localhost";
	$username = "bpdemo";
	$password = "bpdemo";