optimized LimitedQueue implementation
This commit is contained in:
@@ -65,7 +65,7 @@ impl Beatmap {
|
||||
|
||||
map.cs = target_columns;
|
||||
|
||||
let mut prev_note_times = LimitedQueue::new(MAX_NOTES_FOR_DENSITY);
|
||||
let mut prev_note_times: LimitedQueue<f64, MAX_NOTES_FOR_DENSITY> = LimitedQueue::new();
|
||||
let mut density = i32::MAX as f64;
|
||||
|
||||
let mut compute_density = |new_note_time: f64, d: &mut f64| {
|
||||
|
||||
@@ -113,7 +113,7 @@ impl<'h> DistanceObjectPatternGenerator<'h> {
|
||||
let conversion_diff = self.conversion_difficulty();
|
||||
|
||||
if self.total_columns == 1 {
|
||||
return Pattern::new_slider_note(self, 0, self.start_time, self.end_time);
|
||||
Pattern::new_slider_note(self, 0, self.start_time, self.end_time)
|
||||
} else if self.span_count > 1 {
|
||||
if self.segment_duration <= 90 {
|
||||
self.generate_random_hold_notes(self.start_time, 1)
|
||||
|
||||
Reference in New Issue
Block a user