Skip to content

MapSetOnlyR

MapSetOnlyR

Description

Replace all values for a key with exactly one key/value pair using r-value semantics.

Parameters

Name Direction Description
m in,out Hash map.
key in Key to insert or replace.
value in Value to insert or replace.

Usage example (Cross-references)

Usage examples (Cross-references)
        IntIntMap map = MapInit(int_hash, int_compare);
    
        MapSetOnlyR(&map, 1, 10);
        MapInsertR(&map, 1, 11);
        MapSetOnlyR(&map, 2, 20);
        MapSetOnlyR(&map, 1, 10);
        MapInsertR(&map, 1, 11);
        MapSetOnlyR(&map, 2, 20);
    
        bool result = MapRemoveFirst(&map, 1);
    
        for (int i = 0; i < 12; i++) {
            MapSetOnlyR(&map, i, i + 100);
        }
    
        MapRemoveFirst(&map, 5);
        MapSetOnlyR(&map, 105, 205);
    
        bool result = !MapContainsKey(&map, 5);
    
        for (int i = 1; i <= 4; i++) {
            MapSetOnlyR(&map, i, i * 10);
        }
        MapInsertR(&map, 2, 25);
        MapInsertR(&map, 1, 11);
        MapInsertR(&map, 2, 20);
        MapSetOnlyR(&map, 2, 200);
        MapSetOnlyR(&map, 3, 30);
        MapInsertR(&map, 2, 20);
        MapSetOnlyR(&map, 2, 200);
        MapSetOnlyR(&map, 3, 30);
    
        bool result = MapPairCount(&map) == 4;
        int red_count = 0;
    
        MapSetOnlyR(&map, "red", "apple");
        MapInsertR(&map, "red", "cherry");
        MapSetOnlyR(&map, "yellow", "banana");
        MapSetOnlyR(&map, "red", "apple");
        MapInsertR(&map, "red", "cherry");
        MapSetOnlyR(&map, "yellow", "banana");
        MapSetOnlyR(&map, "green", "pear");
        MapRehashWithPolicy(&map, MapPairCount(&map), MisraMapPolicyQuadratic);
        MapInsertR(&map, "red", "cherry");
        MapSetOnlyR(&map, "yellow", "banana");
        MapSetOnlyR(&map, "green", "pear");
        MapRehashWithPolicy(&map, MapPairCount(&map), MisraMapPolicyQuadratic);
    
        MapReserve(&map, 32);
        MapSetOnlyR(&map, 1, 10);
        MapSetOnlyR(&map, 2, 20);
        MapClear(&map);
        MapReserve(&map, 32);
        MapSetOnlyR(&map, 1, 10);
        MapSetOnlyR(&map, 2, 20);
        MapClear(&map);
    
        for (int i = 0; i < 24; i++) {
            MapSetOnlyR(&map, i, i * 10);
        }
    
        for (int i = 0; i < 6; i++) {
            MapSetOnlyR(&map, i, i + 100);
        }
        IntIntMap map = MapInitWithValueCompare(int_hash, int_compare, int_compare);
    
        MapSetOnlyR(&map, 7, 70);
        MapInsertR(&map, 7, 71);
        MapSetOnlyR(&map, 9, 90);
        MapSetOnlyR(&map, 7, 70);
        MapInsertR(&map, 7, 71);
        MapSetOnlyR(&map, 9, 90);
    
        bool result = MapContainsKey(&map, 7);
        IntIntMap map = MapInit(int_hash, int_compare);
    
        MapSetOnlyR(&map, 11, 110);
        MapInsertR(&map, 11, 111);
Last updated on