kjr247/dangerzone
Full stack mean app for tracking the dangerzone level for geo-locations. Get warnings when you are entering "THE DANGERZONE" with alerts for the level of "THE DANGERZONE"
Public GitHub Catalog
Discovered Sep 30, 2026
kjr247 / Compilers
concurrent Pascal Parser/Compiler without semaphore in C++
About this discovery
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
#18657207GitHub System ID
kjr247Organization / User
PublicVisibility
ActiveCatalog Status
More from kjr247
kjr247/Project-Euler
I will be storing and optimizing my personal solutions for Project Euler. Please be aware that if you are looking for solutions before you attempt the problem you are cheating yourself of experience. Once you have tried your own version feel free to look through others for tricks and optimizations that will improve your own habits.
kjr247/Ajaximagegallery
restful image gallery in Ajax with json
kjr247/fibopthread.reposit
program in Linux which uses Pthreads to spawn a child process and print the Fibonacci sequence (http://en.wikipedia.org/wiki/Fibonacci_number) up to a user specified number of places. You do actually have to COMPUTE the sequence, not just print it out from a hardcoded value. You should divide the sequence roughly in half (if the user inputs an even number, one half - doesn't matter which - will have one more than the other). The first half should be computed in the child process. The second half should be computed in the parent process. Finally, the parent process should output the entire sequence (which should have already been computed), followed by "Sequence complete." Note: To compile a program using pthreads, you will need to link the pthreads library. For example: g++ main.cpp -lpthread -o main ./main (to run) Example Output: ... How many places would you like to see in the Fibonacci Sequence? 10 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 Sequence Complete