summaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authorTyge Løvset <[email protected]>2020-03-13 23:51:55 +0100
committerGitHub <[email protected]>2020-03-13 23:51:55 +0100
commit4f751d6fa763f9caaf0a64df336f91629c1114f8 (patch)
tree2f0bb64d56135a10cabbffa8a67b882d42a101f1
parent98bc73eef50f051cbe67f3ce44a849d228b1f1ae (diff)
downloadSTC-modified-4f751d6fa763f9caaf0a64df336f91629c1114f8.tar.gz
STC-modified-4f751d6fa763f9caaf0a64df336f91629c1114f8.zip
Update EXAMPLE.md
-rw-r--r--EXAMPLE.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/EXAMPLE.md b/EXAMPLE.md
index 4998e402..528bdef1 100644
--- a/EXAMPLE.md
+++ b/EXAMPLE.md
@@ -8,7 +8,7 @@ To be able to use CMap (or one of the other unordered associative containers) wi
The difficulty with the hash function is that if your key type consists of several members, you will usually have the hash function calculate hash values for the individual members, and then somehow combine them into one hash value for the entire object. For good performance (i.e., few collisions) you should think carefully about how to combine the individual hash values to ensure you avoid getting the same output for different objects too often.
-A starting point for a hash function is one that combines the individual hash values in a good manner. For example, assuming a key-type like this:
+Assuming a key-type like this:
```
#include <clib/cstring.h>