MapInsertR
MapInsertR
Description
Insert a new key/value pair using r-value semantics. Duplicate keys are allowed and append another value for the same key.
Parameters
| Name | Direction | Description |
|---|---|---|
m |
in,out | Hash map. |
key |
in | Key to insert. |
value |
in | Value to insert. |
Usage example (Cross-references)
Usage examples (Cross-references)
- In
Map.Remove.c:25:
MapSetOnlyR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapSetOnlyR(&map, 2, 20);- In
Map.Remove.c:42:
IntIntMap map = MapInitWithValueCompare(int_hash, int_compare, int_compare);
MapInsertR(&map, 5, 50);
MapInsertR(&map, 5, 51);
MapInsertR(&map, 5, 52);- In
Map.Remove.c:43:
MapInsertR(&map, 5, 50);
MapInsertR(&map, 5, 51);
MapInsertR(&map, 5, 52);- In
Map.Remove.c:44:
MapInsertR(&map, 5, 50);
MapInsertR(&map, 5, 51);
MapInsertR(&map, 5, 52);
bool result = MapRemovePair(&map, 5, 51);- In
Map.Remove.c:66:
IntIntMap map = MapInit(int_hash, int_compare);
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);- In
Map.Remove.c:67:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 3, 31);- In
Map.Remove.c:68:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 3, 31);- In
Map.Remove.c:69:
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 3, 31);
bool result = (MapRemoveIf(&map, remove_even_values, NULL) == 2);- In
Map.Remove.c:86:
IntIntMap map = MapInit(int_hash, int_compare);
MapInsertR(&map, 5, 50);
MapInsertR(&map, 5, 51);
MapInsertR(&map, 5, 52);- In
Map.Remove.c:87:
MapInsertR(&map, 5, 50);
MapInsertR(&map, 5, 51);
MapInsertR(&map, 5, 52);
MapInsertR(&map, 9, 90);- In
Map.Remove.c:88:
MapInsertR(&map, 5, 50);
MapInsertR(&map, 5, 51);
MapInsertR(&map, 5, 52);
MapInsertR(&map, 9, 90);- In
Map.Remove.c:89:
MapInsertR(&map, 5, 51);
MapInsertR(&map, 5, 52);
MapInsertR(&map, 9, 90);
bool result = (MapRemoveAll(&map, 5) == 3);- In
Map.Foreach.c:29:
MapSetOnlyR(&map, i, i * 10);
}
MapInsertR(&map, 2, 25);
MapForeachPairPtr(&map, key_ptr, value_ptr) {- In
Map.Foreach.c:49:
int key_two_sum = 0;
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);- In
Map.Foreach.c:50:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 2, 21);- In
Map.Foreach.c:51:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 2, 21);
MapInsertR(&map, 3, 30);- In
Map.Foreach.c:52:
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 2, 21);
MapInsertR(&map, 3, 30);- In
Map.Foreach.c:53:
MapInsertR(&map, 2, 20);
MapInsertR(&map, 2, 21);
MapInsertR(&map, 3, 30);
MapForeachKey(&map, key) {- In
Map.Insert.c:24:
IntIntMap map = MapInit(int_hash, int_compare);
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);- In
Map.Insert.c:25:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapSetOnlyR(&map, 2, 200);- In
Map.Insert.c:26:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 2, 20);
MapSetOnlyR(&map, 2, 200);
MapSetOnlyR(&map, 3, 30);- In
Map.Insert.c:46:
IntIntMap map = MapInitWithValueCompare(int_hash, int_compare, int_compare);
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 1, 12);- In
Map.Insert.c:47:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 1, 12);
MapSetFirstR(&map, 1, 100);- In
Map.Insert.c:48:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 1, 11);
MapInsertR(&map, 1, 12);
MapSetFirstR(&map, 1, 100);- In
Map.Ops.c:87:
MapSetOnlyR(&map, "red", "apple");
MapInsertR(&map, "red", "cherry");
MapSetOnlyR(&map, "yellow", "banana");
MapSetOnlyR(&map, "green", "pear");- In
Map.Ops.c:116:
IntIntMap second = MapInitWithValueCompare(int_hash, int_compare, int_compare);
MapInsertR(&first, 1, 10);
MapInsertR(&first, 1, 11);
MapInsertR(&first, 2, 20);- In
Map.Ops.c:117:
MapInsertR(&first, 1, 10);
MapInsertR(&first, 1, 11);
MapInsertR(&first, 2, 20);
MapRemoveFirst(&first, 1);- In
Map.Ops.c:118:
MapInsertR(&first, 1, 10);
MapInsertR(&first, 1, 11);
MapInsertR(&first, 2, 20);
MapRemoveFirst(&first, 1);- In
Map.Ops.c:121:
MapRemoveFirst(&first, 1);
MapInsertR(&second, 9, 90);
MapInsertR(&second, 10, 100);- In
Map.Ops.c:122:
MapInsertR(&second, 9, 90);
MapInsertR(&second, 10, 100);
bool result = (first.tombstones == 1);- In
Map.Ops.c:159:
int threshold = 30;
MapInsertR(&map, 1, 10);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 3, 30);- In
Map.Ops.c:160:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 3, 30);
MapInsertR(&map, 4, 40);- In
Map.Ops.c:161:
MapInsertR(&map, 1, 10);
MapInsertR(&map, 2, 20);
MapInsertR(&map, 3, 30);
MapInsertR(&map, 4, 40);- In
Map.Ops.c:162:
MapInsertR(&map, 2, 20);
MapInsertR(&map, 3, 30);
MapInsertR(&map, 4, 40);
bool result = (MapRetainIf(&map, retain_values_above_threshold, &threshold) == 2);- In
Map.Access.c:25:
MapSetOnlyR(&map, 7, 70);
MapInsertR(&map, 7, 71);
MapSetOnlyR(&map, 9, 90);- In
Map.Access.c:48:
MapSetOnlyR(&map, 11, 110);
MapInsertR(&map, 11, 111);
int *value = MapGetFirstPtr(&map, 11);- In
Map.Access.c:65:
int seen = 0;
MapInsertR(&map, 4, 40);
MapInsertR(&map, 4, 41);
MapInsertR(&map, 4, 42);- In
Map.Access.c:66:
MapInsertR(&map, 4, 40);
MapInsertR(&map, 4, 41);
MapInsertR(&map, 4, 42);
MapInsertR(&map, 9, 90);- In
Map.Access.c:67:
MapInsertR(&map, 4, 40);
MapInsertR(&map, 4, 41);
MapInsertR(&map, 4, 42);
MapInsertR(&map, 9, 90);- In
Map.Access.c:68:
MapInsertR(&map, 4, 41);
MapInsertR(&map, 4, 42);
MapInsertR(&map, 9, 90);
cursor = MapFindFirstForKey(&map, 4);
Last updated on