mirror of
https://github.com/neovim/neovim.git
synced 2025-09-07 03:48:18 +00:00
6186df3562
`lib/queue.h` implements a basic queue. `event/queue.c` implements a specialized data structure on top of lib/queue.h; it is not a "normal" queue. Rename the specialized multi-level queue implemented in event/queue.c to "multiqueue", to avoid confusion when reading the code. Before this change one can eventually notice that "macros (uppercase symbols) are for the normal queue, lowercase operations are for the multi-level queue", but that is unnecessary friction for new developers (or existing developers just visiting this part of the codebase).
124 lines
3.2 KiB
Lua
124 lines
3.2 KiB
Lua
local helpers = require("test.unit.helpers")
|
|
|
|
local ffi = helpers.ffi
|
|
local eq = helpers.eq
|
|
|
|
local multiqueue = helpers.cimport("./test/unit/fixtures/multiqueue.h")
|
|
|
|
describe("multiqueue (multi-level event-queue)", function()
|
|
local parent, child1, child2, child3
|
|
|
|
local function put(q, str)
|
|
multiqueue.ut_multiqueue_put(q, str)
|
|
end
|
|
|
|
local function get(q)
|
|
return ffi.string(multiqueue.ut_multiqueue_get(q))
|
|
end
|
|
|
|
local function free(q)
|
|
multiqueue.multiqueue_free(q)
|
|
end
|
|
|
|
before_each(function()
|
|
parent = multiqueue.multiqueue_new_parent(ffi.NULL, ffi.NULL)
|
|
child1 = multiqueue.multiqueue_new_child(parent)
|
|
child2 = multiqueue.multiqueue_new_child(parent)
|
|
child3 = multiqueue.multiqueue_new_child(parent)
|
|
put(child1, 'c1i1')
|
|
put(child1, 'c1i2')
|
|
put(child2, 'c2i1')
|
|
put(child1, 'c1i3')
|
|
put(child2, 'c2i2')
|
|
put(child2, 'c2i3')
|
|
put(child2, 'c2i4')
|
|
put(child3, 'c3i1')
|
|
put(child3, 'c3i2')
|
|
end)
|
|
|
|
it('removing from parent removes from child', function()
|
|
eq('c1i1', get(parent))
|
|
eq('c1i2', get(parent))
|
|
eq('c2i1', get(parent))
|
|
eq('c1i3', get(parent))
|
|
eq('c2i2', get(parent))
|
|
eq('c2i3', get(parent))
|
|
eq('c2i4', get(parent))
|
|
end)
|
|
|
|
it('removing from child removes from parent', function()
|
|
eq('c2i1', get(child2))
|
|
eq('c2i2', get(child2))
|
|
eq('c1i1', get(child1))
|
|
eq('c1i2', get(parent))
|
|
eq('c1i3', get(parent))
|
|
eq('c2i3', get(parent))
|
|
eq('c2i4', get(parent))
|
|
end)
|
|
|
|
it('removing from child at the beginning of parent', function()
|
|
eq('c1i1', get(child1))
|
|
eq('c1i2', get(child1))
|
|
eq('c2i1', get(parent))
|
|
end)
|
|
|
|
it('removing from parent after get from parent and put to child', function()
|
|
eq('c1i1', get(parent))
|
|
eq('c1i2', get(parent))
|
|
eq('c2i1', get(parent))
|
|
eq('c1i3', get(parent))
|
|
eq('c2i2', get(parent))
|
|
eq('c2i3', get(parent))
|
|
eq('c2i4', get(parent))
|
|
eq('c3i1', get(parent))
|
|
put(child1, 'c1i11')
|
|
put(child1, 'c1i22')
|
|
eq('c3i2', get(parent))
|
|
eq('c1i11', get(parent))
|
|
eq('c1i22', get(parent))
|
|
end)
|
|
|
|
it('removing from parent after get and put to child', function()
|
|
eq('c1i1', get(child1))
|
|
eq('c1i2', get(child1))
|
|
eq('c2i1', get(child2))
|
|
eq('c1i3', get(child1))
|
|
eq('c2i2', get(child2))
|
|
eq('c2i3', get(child2))
|
|
eq('c2i4', get(child2))
|
|
eq('c3i1', get(child3))
|
|
eq('c3i2', get(parent))
|
|
put(child1, 'c1i11')
|
|
put(child2, 'c2i11')
|
|
put(child1, 'c1i12')
|
|
eq('c2i11', get(child2))
|
|
eq('c1i11', get(parent))
|
|
eq('c1i12', get(parent))
|
|
end)
|
|
|
|
it('put after removing from child at the end of parent', function()
|
|
eq('c3i1', get(child3))
|
|
eq('c3i2', get(child3))
|
|
put(child1, 'c1i11')
|
|
put(child2, 'c2i11')
|
|
eq('c1i1', get(parent))
|
|
eq('c1i2', get(parent))
|
|
eq('c2i1', get(parent))
|
|
eq('c1i3', get(parent))
|
|
eq('c2i2', get(parent))
|
|
eq('c2i3', get(parent))
|
|
eq('c2i4', get(parent))
|
|
eq('c1i11', get(parent))
|
|
eq('c2i11', get(parent))
|
|
end)
|
|
|
|
it('removes from parent queue when child is freed', function()
|
|
free(child2)
|
|
eq('c1i1', get(parent))
|
|
eq('c1i2', get(parent))
|
|
eq('c1i3', get(parent))
|
|
eq('c3i1', get(child3))
|
|
eq('c3i2', get(child3))
|
|
end)
|
|
end)
|