egaebel/haskell-playground
A bunch of random programs I wrote when playing around with Haskell.
Developer Profile
egaebel
Discovered public repositories for egaebel in the GitHub catalog.
egaebel/Qualcomm-Hackathon--2014
The 5 Ds.
egaebel/grocery-list--Android-Pebble
A grocery list companion app and Pebble watch app that communicate with each other.
egaebel/tip-calculator--pebble
A simple tip calculator app for the Pebble smartwatch
egaebel/VT-New-Building-Checker
Java program that reads over every course in the VT timetable and checks if there are any buildings that are not a part of the BuildingGPSMap. This is useful for determining building codes that are new at Virginia Tech for applications that require this information.
egaebel/linked-list--C
A generic linked list implemented in C
egaebel/Heap--Go
An implementation of a binary, node based heap in Go. The heap is generic in that it requires types fit an interface with two simple methods (String, and CompareTo)
egaebel/VT-Finder
An Android application that interfaces with Virginia Tech's hokiespa service to pull down information about a VT student's final exam schedule and semester schedule. Allows for sharing of this data from app-to-app.
egaebel/jackal
Poset data structure along with several poset algorithms. Created as part of my undergraduate research with Dr. Heath.
egaebel/Random-Scripts-and-Configs
A collection of random configuration files and scripts that are useful for a variety of reasons
egaebel/AVL-Tree--Cplusplus
A generic AVLTree implemented in C++. Along with a simple test script for verification.
egaebel/debug-server-client--C
A server client pair to enable debug messages to be sent over the network. The server maintains a queue of messages, and when a client requests, all of the messages are sent.
egaebel/VTAccessDemo
A small swing application which demonstrates some of the features of the VT Access API. NOTE: Requires Jsoup 1.6 or higher and VT Access on the build path.
egaebel/VTAccess
A java API with methods to allow users to pull data such as: semester course schedules, final exam schedules, and general course information from the Virginia Tech website. Uses JSoup to accomplish this. Also contains many data structures for storing schedule data, as well as classes to read/write these data structures to XML. NOTE: JSOUP MUST BE ON THE BUILDPATH WHEN BUILDING THIS!
egaebel/AdjacencyMatrix-and-Graph-Algorithms--Java
A generic Java implementation of an AdjacencyMatrix which fits a defined Graph interface as well as several Algorithms (dfs, bfs, topological sort and MORE TO COME!) which operate on the generic Graph interface.
egaebel/LinkedQueue--C
A generic C implementation of a Queue. Uses a pre-processor macro to enable the generic-ness. To use this Queue you must embed a QNode struct into your data objects, and then use the macro QUEUE_ENTRY(DATA_OBJECT, STRUCT_TYPE (of your DATA_OBJECT), MEMBER (the variable name in DATA_OBJECT of the QNode stored in it))
egaebel/AdjacencyList--C
A generic C implementation of an AdjacencyList. Uses a pre-processor macro to enable the generic-ness. To use this AdjacencyList you must embed an AdjNode struct into your data objects, and then use the macro ADJ_LIST_ENTRY(DATA_OBJECT, STRUCT_TYPE (of your DATA_OBJECT), MEMBER (the variable name in DATA_OBJECT of the AdjNode stored in it))
egaebel/Array-List--Cplusplus
A generic C++ implementation of an ArrayList, along with implementations of insertion sort, merge sort, quick sort, and binary search.
egaebel/LinkedList--Cplusplus
a generic C++ implementation of a LinkedList, with standard functions, as well as an Iterator abstract class, and a LinkedListIterator concrete class used to iterate over the LinkedList, and to add and remove elements from the middle of the LinkedList. Also includes time complexity in comments of all functions whose time complexity isn't O(1).
egaebel/Heap--Java
A generic Java implementation of a Heap, using an array. Includes standard functions for a heap, along with a Priority Queue implemented using the heap, and an interface for a heuristic to be used with the heap, such as the provided MinHeap and MaxHeap heuristics.
egaebel/BinarySearchTree--Java
A generic Java implementation of a BinarySearchTree, includes standard functions as well as a function to access elements by index.
egaebel/IEEE-Robotics
Public repository.