Base

ファイルやテストが指定されていないため、まず Issue にリンクされている availability-ranges の例と、Repository に既に存在するエントリーポイントを確認してください。現在の範囲ベースのアプローチと、提案されているスロットベースのブールビットマップを比較してください。ブロックされたスペースと複数の可用性マップを表現してクエリでき、想定されるエッジケースがカバーされれば、作業は完了です。

Here's the basic algorithm .

Problem

1. Availability ranges are based off of a simple single element array which is then modified to handle the areas that have been booked or blocked.
2. These areas are not accessible anymore and thus cannot be locked again.

A simple implementation of the above can be found here
https://snips.reaper.im/snippets/availability-ranges.html

Obviously the above has quite a few cases which aren't handled and the space and time complexity of the above is off the charts for something so simple.

Possible Solution

1. Construct the range based on a given number of slots, example a 24 hour availability would add up to be a 1440 slots each pointing to 1 minute
2. each slot acts as a boolean point of whether blocked or not.
3. you can then create multiple such bitmaps to handle blocking of multiple spaces and this could be a much faster way to find based on the keying logic, so then you can use the key to find the last booked point in the bitmap and also more flexible since the slots actually have no other meaning, thus being a little more generic