mirror of
https://github.com/Azure/DotNetty.git
synced 2026-10-19 06:31:20 +08:00
mgortman
d5a4c30778
Motivation: Allow for less GC when scheduling if Task-based API is not required. Allow for proper cleanup when canceling scheduled task so that associated resources can be cleaned up early. Modifications: - Moved out scheduled task implementations from AbstractScheduledEventExecutor - Introduced IScheduledTask and aligned IScheduledRunnable - Implemented removal of scheduled task upon its cancellation - Extra minor fixes - IByteBuffer.ToString(Encoding) honoring ArrayOffset - InternalLoggerFactory creating default logging factory lazily Result: Scheduled tasks that normally never fire (e.g. timeout handling) do not cause resources to be held up unnecessarily in memory for longer period of time if not necessary.
65 lines
2.0 KiB
C#
65 lines
2.0 KiB
C#
// Copyright (c) Microsoft. All rights reserved.
|
|
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
|
|
|
|
namespace DotNetty.Common.Tests.Utilities
|
|
{
|
|
using System;
|
|
using DotNetty.Common.Utilities;
|
|
using Xunit;
|
|
|
|
public class PriorityQueueTest
|
|
{
|
|
[Theory]
|
|
[InlineData(0, -1)]
|
|
[InlineData(1, 0)]
|
|
[InlineData(1, -1)]
|
|
[InlineData(2, 0)]
|
|
[InlineData(2, 1)]
|
|
[InlineData(3, 0)]
|
|
[InlineData(3, 1)]
|
|
[InlineData(3, 2)]
|
|
[InlineData(7, 5)]
|
|
public void PriorityQueueRemoveTest(int length, int removeIndex)
|
|
{
|
|
var queue = new PriorityQueue<Tuple<int>>();
|
|
for (int i = length - 1; i >= 0; i--)
|
|
{
|
|
queue.Enqueue(Tuple.Create(i));
|
|
}
|
|
|
|
if (removeIndex == -1)
|
|
{
|
|
queue.Remove(Tuple.Create(length));
|
|
Assert.Equal(length, queue.Count);
|
|
}
|
|
else
|
|
{
|
|
queue.Remove(Tuple.Create(removeIndex));
|
|
Assert.Equal(length - 1, queue.Count);
|
|
}
|
|
}
|
|
|
|
[Theory]
|
|
[InlineData(new[] { 1, 2, 3, 4 }, new[] { 1, 2, 3, 4 })]
|
|
[InlineData(new[] { 4, 3, 2, 1 }, new[] { 1, 2, 3, 4 })]
|
|
[InlineData(new[] { 3, 2, 1 }, new[] { 1, 2, 3 })]
|
|
[InlineData(new[] { 1, 3, 2 }, new[] { 1, 2, 3 })]
|
|
[InlineData(new[] { 1, 2 }, new[] { 1, 2 })]
|
|
[InlineData(new[] { 2, 1 }, new[] { 1, 2 })]
|
|
public void PriorityQueueOrderTest(int[] input, int[] expectedOutput)
|
|
{
|
|
var queue = new PriorityQueue<Tuple<int>>();
|
|
foreach (int value in input)
|
|
{
|
|
queue.Enqueue(Tuple.Create(value));
|
|
}
|
|
|
|
for (int index = 0; index < expectedOutput.Length; index++)
|
|
{
|
|
Tuple<int> item = queue.Dequeue();
|
|
Assert.Equal(expectedOutput[index], item.Item1);
|
|
}
|
|
Assert.Equal(0, queue.Count);
|
|
}
|
|
}
|
|
} |