From dcfc21ea1fe787d27bb71ebada5df855476d29a8 Mon Sep 17 00:00:00 2001
From: Christopher Rosset <chris@rosset.org.uk>
Date: Fri, 18 Sep 2015 20:54:29 +0100
Subject: [PATCH] Fix typo in ES.1

---
 CppCoreGuidelines.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/CppCoreGuidelines.md b/CppCoreGuidelines.md
index 0b2cd1d..f3e0a5d 100644
--- a/CppCoreGuidelines.md
+++ b/CppCoreGuidelines.md
@@ -6361,7 +6361,7 @@ but don't hand-code a well-known algorithm
 	for (int i = 0; i<max; ++i)
 		sum = sum+v[i];
 
-**Exception**: Large parts of the standard library rely on dynamic allocation (free store). These parts, notably the containers but not the algorithms, are unsuitable for some hard-real time and embedded applications. In such cases, consider providing/using similar facilities, e.g.,  a standard-libray-style container implemented using a pool allocator.
+**Exception**: Large parts of the standard library rely on dynamic allocation (free store). These parts, notably the containers but not the algorithms, are unsuitable for some hard-real time and embedded applications. In such cases, consider providing/using similar facilities, e.g.,  a standard-library-style container implemented using a pool allocator.
 
 **Enforcement**: Not easy. ??? Look for messy loops, nested loops, long functions, absence of function calls, lack of use of non-built-in types. Cyclomatic complexity?