https://github.com/seifalmotaz/routly

Routly: Elevating skills through dynamic data structures, using binary trees for precise URL path matching.
https://github.com/seifalmotaz/routly

algorithms algorithms-and-data-structures dart dartlang data-structures

Last synced: 4 months ago
JSON representation

Routly: Elevating skills through dynamic data structures, using binary trees for precise URL path matching.

• Host: GitHub
• URL: https://github.com/seifalmotaz/routly
• Owner: seifalmotaz
• License: mit
• Created: 2024-01-13T23:28:57.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2024-01-13T23:45:57.000Z (over 2 years ago)
• Last Synced: 2025-07-21T12:53:09.590Z (11 months ago)
• Topics: algorithms, algorithms-and-data-structures, dart, dartlang, data-structures
• Language: Dart
• Homepage: https://pub.dev/packages/routly
• Size: 8.79 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Routly

Routly is a personal project designed for self-training in data structures and algorithms. The primary focus is on utilizing binary trees or tree algorithms to efficiently identify URL path matches.

## Examples

1. **Dynamic ID Matching:**

   - Path Template: `/users/{id}`

   - Example Path: `/users/thisIsID10`

2. **Strict Integer ID Matching:**

   - Path Template: `/users/{id:int}`

   - Example Path: `/users/1323`