view MapTest.m @ 1037:2d7ba44340d0 feature/burgers1d

Pass scheme specific parameters as cell array. This will enabale constructDiffOps to be more general. In addition, allow for schemes returning function handles as diffOps, which is currently how non-linear schemes such as Burgers1d are implemented.
author Vidar Stiernström <vidar.stiernstrom@it.uu.se>
date Fri, 18 Jan 2019 09:02:02 +0100
parents a6c5e73ff44e
children
line wrap: on
line source

function tests = MatTest()
    tests = functiontests(localfunctions);
end

function kvp = getKeyValuePairs()
    kvp = {
        {1,3},1;
        struct(), [1; 3; 4];
        [1,2; 4 3], struct();
        'Hej', struct('lol', 6);
        0, 'Nej';
    };
end

function testMultiKey(testCase)
    map = Map

    function setMultiKey()
        map(1,2) = 1;
    end

    function getMultiKey()
        v = map(1,2);
    end

    testCase.verifyError(@setMultiKey,'sbplib:Map:multipleKeys')
    testCase.verifyError(@getMultiKey,'sbplib:Map:multipleKeys')
end

function testSetAndGet(testCase)
    keyValuePairs = getKeyValuePairs();

    map = Map();

    % Insert
    for i = 1:length(keyValuePairs)
        map(keyValuePairs{i,1}) = keyValuePairs{i,2};
    end

    % Validate output
    for i = 1:length(keyValuePairs)
        v = map(keyValuePairs{i,1});
        testCase.verifyEqual(v, keyValuePairs{i,2});
    end
end

function map = exampleMap()
    keyValuePairs = getKeyValuePairs();

    map = Map();

    % Insert
    for i = 1:length(keyValuePairs)
        map(keyValuePairs{i,1}) = keyValuePairs{i,2};
    end
end

function testLength(testCase)
    map = Map();
    testCase.verifyEqual(map.length, 0);

    map = exampleMap();
    testCase.verifyEqual(map.length, 5)
end


function testIsKey(testCase)
    map = exampleMap();

    keyValuePairs = getKeyValuePairs();
    keys = keyValuePairs(:,1);

    for i = 1:length(keys)
        testCase.verifyTrue(map.isKey(keys{i}));
    end

    notKeys = {
        'hej',
        [],
        1,
        {2,5},
    };

    for i = 1:length(notKeys)
        testCase.verifyFalse(map.isKey(notKeys{i}));
    end
end


function testRemove(testCase)
    map = exampleMap();

    remove(map, struct());

    testCase.verifyFalse(map.isKey(struct()));
end

% function testValues(testCase)
%     keyValuePairs = getKeyValuePairs();

%     map = exampleMap();

%     testCase.verifyEqual(values(map), keyValuePairs(:,2)');
% end

% function testKeys(testCase)
%     keyValuePairs = getKeyValuePairs();

%     map = exampleMap();

%     testCase.verifyEqual(keys(map), keyValuePairs(:,1)');
% end