|
1 |
| -# javaf.github.io |
2 | 1 | A summary of programs written in Java.
|
| 2 | + |
| 3 | +<br> |
| 4 | + |
| 5 | +| 📦 Packages | 💁 Helpers | 💽 External | |
| 6 | +| ------------------ | ----------------- | ------------- | |
| 7 | +| 📦 [hello-world] | 📦 [extra-boolean] | 📦 [extra-bit] | |
| 8 | +| 💁 [extra-xml] | 💁 [extra-event] | 💁 [ant-learn] | |
| 9 | +| 💽 [xml-apk-parser] | ❌ | ❌ | |
| 10 | + |
| 11 | +[hello-world]: https://search.maven.org/artifact/io.github.javaf/hello-world |
| 12 | +[extra-boolean]: https://search.maven.org/artifact/io.github.javaf/extra-boolean |
| 13 | +[extra-bit]: https://search.maven.org/artifact/io.github.javaf/extra-bit |
| 14 | +[extra-xml]: https://github.com/javaf/extra-xml |
| 15 | +[extra-event]: https://github.com/javaf/extra-event |
| 16 | +[ant-learn]: https://github.com/javaf/ant-learn |
| 17 | +[xml-apk-parser]: https://github.com/javaf/xml-apk-parser |
| 18 | + |
| 19 | +<br> |
| 20 | +<br> |
| 21 | + |
| 22 | + |
| 23 | +### Concurrent Data Strcutures |
| 24 | + |
| 25 | +| 📋 Algorithms | 🔒 Locks | 🔏 Special | |
| 26 | +| ------------------------------- | --------------------------- | ------------------------ | |
| 27 | +| 📋 [dining-philosophers-problem] | 📋 [sleeping-barber-problem] | 📋 [bakery-algorithm] | |
| 28 | +| 📋 [dekker-algorithm] | 📋 [peterson-algorithm] | ❌ | |
| 29 | +| 🔒 [tas-lock] | 🔒 [ttas-lock] | 🔒 [backoff-lock] | |
| 30 | +| 🔒 [array-lock] | 🔒 [clh-lock] | 🔒 [mcs-lock] | |
| 31 | +| 🔏 [simple-reentrant-lock] | 🔏 [simple-read-write-lock] | 🔏 [fifo-read-write-lock] | |
| 32 | +| 🔏 [bathroom-lock] | 🔏 [simple-semaphore] | 🔏 [monitor-example] | |
| 33 | + |
| 34 | +[dining-philosophers-problem]: https://replit.com/@wolfram77/dining-philosophers-problem#README.md |
| 35 | +[sleeping-barber-problem]: https://replit.com/@wolfram77/sleeping-barber-problem#README.md |
| 36 | +[bakery-algorithm]: https://replit.com/@wolfram77/bakery-algorithm#README.md |
| 37 | +[dekker-algorithm]: https://replit.com/@wolfram77/dekker-algorithm#README.md |
| 38 | +[peterson-algorithm]: https://replit.com/@wolfram77/peterson-algorithm#README.md |
| 39 | +[tas-lock]: https://replit.com/@wolfram77/tas-lock#README.md |
| 40 | +[ttas-lock]: https://replit.com/@wolfram77/ttas-lock#README.md |
| 41 | +[backoff-lock]: https://replit.com/@wolfram77/backoff-lock#README.md |
| 42 | +[array-lock]: https://replit.com/@wolfram77/array-lock#README.md |
| 43 | +[clh-lock]: https://replit.com/@wolfram77/clh-lock#README.md |
| 44 | +[mcs-lock]: https://replit.com/@wolfram77/mcs-lock#README.md |
| 45 | +[bathroom-lock]: https://replit.com/@wolfram77/bathroom-lock#README.md |
| 46 | +[simple-reentrant-lock]: https://replit.com/@wolfram77/simple-reentrant-lock#README.md |
| 47 | +[simple-read-write-lock]: https://replit.com/@wolfram77/simple-read-write-lock#README.md |
| 48 | +[fifo-read-write-lock]: https://replit.com/@wolfram77/fifo-read-write-lock#README.md |
| 49 | +[simple-semaphore]: https://replit.com/@wolfram77/simple-semaphore#README.md |
| 50 | +[monitor-example]: https://replit.com/@wolfram77/monitor-example#README.md |
| 51 | + |
| 52 | +<br> |
| 53 | +<br> |
| 54 | + |
| 55 | +| 🚂 Queues | 📚 Stacks | 🚦 Sets | |
| 56 | +| ----------------- | ----------------------------- | ------------------ | |
| 57 | +| 🚂 [locked-queue] | 🚂 [array-queue] | ❌ | |
| 58 | +| 📚 [backoff-stack] | 📚 [elimination-backoff-stack] | 📚 [array-stack] | |
| 59 | +| 🚦 [coarse-set] | 🚦 [fine-set] | 🚦 [optimistic-set] | |
| 60 | + |
| 61 | +[locked-queue]: https://replit.com/@wolfram77/locked-queue#README.md |
| 62 | +[array-queue]: https://replit.com/@wolfram77/array-queue#README.md |
| 63 | +[array-stack]: https://replit.com/@wolfram77/array-stack#README.md |
| 64 | +[backoff-stack]: https://replit.com/@wolfram77/backoff-stack#README.md |
| 65 | +[elimination-backoff-stack]: https://replit.com/@wolfram77/elimination-backoff-stack#README.md |
| 66 | +[coarse-set]: https://replit.com/@wolfram77/coarse-set#README.md |
| 67 | +[fine-set]: https://replit.com/@wolfram77/fine-set#README.md |
| 68 | +[optimistic-set]: https://replit.com/@wolfram77/optimistic-set#README.md |
| 69 | + |
| 70 | +<br> |
| 71 | +<br> |
| 72 | + |
| 73 | + |
| 74 | +| 🧮 Counting networks | ❤️ Combining | 🏦 Misc | |
| 75 | +| -------------------- | ------------------- | ------ | |
| 76 | +| 🧮 [periodic-network] | 🧮 [bitonic-network] | ❌ | |
| 77 | +| ❤️ [combining-tree] | ❌ | ❌ | |
| 78 | +| 🏦 [savings-account] | ❌ | ❌ | |
| 79 | + |
| 80 | +[periodic-network]: https://replit.com/@wolfram77periodic-network#README.md |
| 81 | +[bitonic-network]: https://replit.com/@wolfram77/bitonic-network#README.md |
| 82 | +[combining-tree]: https://replit.com/@wolfram77/combining-tree#README.md |
| 83 | +[savings-account]: https://replit.com/@wolfram77/savings-account#README.md |
| 84 | + |
| 85 | +<br> |
| 86 | +<br> |
| 87 | + |
| 88 | + |
| 89 | +### Projects |
| 90 | + |
| 91 | +- 📻 [k-compare-single-swap]﹕ k-compare single-swap (KCSS) is an extension of CAS that enables atomically checking multiple addresses before making an update. |
| 92 | +- 📻 [bowling-alley]: Bowling Alley Management System assignment in Software Engineering Course ([original][bowling-alley-original]). |
| 93 | + |
| 94 | +[k-compare-single-swap]: https://replit.com/@wolfram77/k-compare-single-swap#README.md |
| 95 | +[bowling-alley]: https://github.com/javaf/bowling-alley |
| 96 | +[bowling-alley-original]: https://github.com/javaf/bowling-alley-original |
0 commit comments