|
| 1 | +defmodule CircularBufferTest do |
| 2 | + use ExUnit.Case, async: false |
| 3 | + use PropCheck |
| 4 | + |
| 5 | + alias CircularBuffer, as: CB |
| 6 | + |
| 7 | + property "new/1 accepts a max size" do |
| 8 | + forall i <- integer() do |
| 9 | + try do |
| 10 | + buffer = CB.new(i) |
| 11 | + buffer.max_size == i |
| 12 | + rescue |
| 13 | + FunctionClauseError -> |
| 14 | + i <= 0 |
| 15 | + |
| 16 | + _ -> |
| 17 | + false |
| 18 | + end |
| 19 | + end |
| 20 | + end |
| 21 | + |
| 22 | + property "the count matches the number of elements in the buffer" do |
| 23 | + forall {size, is} <- {pos_integer(), list(integer())} do |
| 24 | + buffer = Enum.reduce(is, CB.new(size), fn i, cb -> CB.insert(cb, i) end) |
| 25 | + :queue.len(buffer.q) == buffer.count |
| 26 | + end |
| 27 | + end |
| 28 | + |
| 29 | + property "the number of elements never exceeds the size of the buffer" do |
| 30 | + forall {size, is} <- size_and_list() do |
| 31 | + buffer = Enum.reduce(is, CB.new(size), fn i, cb -> CB.insert(cb, i) end) |
| 32 | + :queue.len(buffer.q) <= size |
| 33 | + end |
| 34 | + end |
| 35 | + |
| 36 | + property "the 'oldest' elements are dropped from the buffer" do |
| 37 | + forall {size, is} <- size_and_list() do |
| 38 | + iis = Enum.with_index(is) |
| 39 | + |
| 40 | + buffer = |
| 41 | + iis |
| 42 | + |> Enum.reduce(CB.new(size), fn i, cb -> CB.insert(cb, i) end) |
| 43 | + |
| 44 | + slice = |
| 45 | + iis |
| 46 | + |> Enum.reverse |
| 47 | + |> Enum.take(size) |
| 48 | + |
| 49 | + :queue.to_list(buffer.q) == slice |
| 50 | + end |
| 51 | + end |
| 52 | + |
| 53 | + property "newest/1 returns the newest element in the buffer" do |
| 54 | + forall {size, is} <- size_and_list() do |
| 55 | + iis = Enum.with_index(is) |
| 56 | + |
| 57 | + buffer = Enum.reduce(iis, CB.new(size), fn i, cb -> CB.insert(cb, i) end) |
| 58 | + |
| 59 | + CB.newest(buffer) == Enum.at(Enum.reverse(iis), 0) |
| 60 | + end |
| 61 | + end |
| 62 | + |
| 63 | + property "oldest/1 returns the oldest element in the buffer" do |
| 64 | + forall {size, is} <- size_and_list() do |
| 65 | + iis = Enum.with_index(is) |
| 66 | + |
| 67 | + buffer = Enum.reduce(iis, CB.new(size), fn i, cb -> CB.insert(cb, i) end) |
| 68 | + |
| 69 | + oldest = |
| 70 | + iis |
| 71 | + |> Enum.reverse() |
| 72 | + |> Enum.drop(size-1) |
| 73 | + |> Enum.at(0) |
| 74 | + |
| 75 | + CB.oldest(buffer) == oldest |
| 76 | + end |
| 77 | + end |
| 78 | + |
| 79 | + def size_and_list do |
| 80 | + let size <- pos_integer() do |
| 81 | + let is <- ints(size*2, []) do |
| 82 | + {size, is} |
| 83 | + end |
| 84 | + end |
| 85 | + end |
| 86 | + |
| 87 | + defp ints(0, acc), do: acc |
| 88 | + defp ints(size, acc) do |
| 89 | + let i <- integer() do |
| 90 | + ints(size-1, [i | acc]) |
| 91 | + end |
| 92 | + end |
| 93 | +end |
0 commit comments