Managed Projects

OpenRabbit

  Analyzed 2 months ago

Loader and Debugger for Rabbit Semiconductor µC, such as the Rabbit 2000, 3000, 3000A, 4000.

4.84K lines of code

0 current contributors

5 months since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This

zshg

  No analysis available

zshg is an implementation of a constant-time connectivity algorithms for graphs.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: GPL2

f-eval-boards

  Analyzed 2 months ago

Evaluation boards for online-programmable (MTP) Padauk µC

0 lines of code

0 current contributors

about 1 year since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: GPL2

sdcc-pdk-code-examples

  Analyzed 2 months ago

Examples code for Padauk µCs to be compiled with the Small Device C Compiler (SDCC)

397 lines of code

0 current contributors

about 1 year since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Licenses: No declared licenses
Tags c padauk sdcc

cockshock

  Analyzed 2 months ago

Reverse-engineering, documenting and hopefully ultimately improving the Master Series Cock Shock sex toy

269 lines of code

0 current contributors

over 5 years since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Licenses: No declared licenses
Tags bdsm cbt

cockshock2

  Analyzed 2 months ago

Reverse-engineering, documenting and hacking a dog shock collar for use as a sex toy

53 lines of code

0 current contributors

almost 4 years since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Licenses: No declared licenses
Tags bdsm cbt

stdcbench

  No analysis available

stdcbench is a benchmark for C implementations. It was created due to some problems in existing benchmarks. For more information and background see: Philipp K. Krause, "stdcbench - A Benchmark for Small Systems", SCOPES '18: 20th International Workshop on Software and Compilers for Embedded Systems.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: No declared licenses

rankwidth

  No analysis available

rw calculates rank-width and rank-decompositions. It is based on ideas from "Computing rank-width exactly" by Sang-il Oum, "Sopra una formula numerica" by Ernesto Pascal, "Generation of a Vector from the Lexicographical Index" by B.P. Buckles and M. Lybanon and "Fast additions on masked integers" by ... [More] Michael D. Adams and David S. Wise. On 2009's computers it works quite well up to graph sizes of about 28 nodes. Runtime and memory usage are exponential in the graph size. [Less]

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: No declared licenses