File: test_utils.rb

package info (click to toggle)
qpid-proton 0.37.0-7
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 18,384 kB
  • sloc: ansic: 37,828; cpp: 37,140; python: 15,302; ruby: 6,018; xml: 477; sh: 320; pascal: 52; makefile: 18
file content (63 lines) | stat: -rw-r--r-- 2,072 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements.  See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership.  The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not use this file except in compliance
# with the License.  You may obtain a copy of the License at
#
#   http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing,
# software distributed under the License is distributed on an
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# KIND, either express or implied.  See the License for the
# specific language governing permissions and limitations
# under the License.

require 'test_tools'
require 'minitest/unit'

class UtilsTest < MiniTest::Test
  include Qpid::Proton

  # Make sure Schedule puts tasks in proper order.
  def test_schedule_empty
    s = Schedule.new
    assert_empty s
    assert_nil s.next_tick
    assert_nil s.pop(nil)
  end

  def test_schedule_insert_pop
    s = Schedule.new
    [3,5,4].each { |i| s.insert(Time.at(i), i) }
    assert_equal Time.at(3), s.next_tick
    assert_nil s.pop(Time.at(2))
    assert_equal [3,4], [s.pop(Time.at(4)), s.pop(Time.at(4))]
    refute_empty s
    assert_nil s.pop(Time.at(4.9))
    assert_equal Time.at(5), s.next_tick
    assert_equal 5, s.pop(Time.at(5))
    assert_empty s
  end

  # Make sure we sort by time and don't change order if same time
  def test_schedule_sort
    s = Schedule.new
    [4.0, 3, 5, 1, 4.1, 4.2 ].each { |n| s.insert(Time.at(n.to_i), n) }
    [1, 3, 4.0, 4.1, 4.2].each { |n| assert_equal n, s.pop(Time.at(4)) }
    refute_empty s              # Not empty but nothing due until time 5
    assert_equal Time.at(5), s.next_tick
    assert_nil s.pop(Time.at(4))
    assert_equal 5, s.pop(Time.at(5))
  end

  def test_schedule_clear
    s = Schedule.new
    [3, 5].each { |n| s.insert(Time.at(n.to_i), n) }
    refute_empty s
    s.clear
    assert_empty s
  end
end