aboutsummaryrefslogtreecommitdiff
path: root/thesis/parts/background.tex
diff options
context:
space:
mode:
Diffstat (limited to 'thesis/parts/background.tex')
-rw-r--r--thesis/parts/background.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/thesis/parts/background.tex b/thesis/parts/background.tex
index ea30f36..65372ef 100644
--- a/thesis/parts/background.tex
+++ b/thesis/parts/background.tex
@@ -79,7 +79,7 @@ Interfaces, or their closest equivalent, are often used to abstract over similar
In Java, ordered collections implement the interface \code{List<E>}, with similar interfaces for \code{Set<E>}, \code{Queue<E>}, etc.
This allows most code to be implementation-agnostic, with functional requirements specified by the interface used.
-Whilst this provides some flexibility, it still requires the developer to choose a concrete implementation at some point.
+While this provides some flexibility, it still requires the developer to choose a concrete implementation at some point.
In most cases, developers will simply choose the most common implementation and assume it will be fast enough.
Otherwise, developers are forced to guess based on their knowledge of specific implementations and their program's behaviour.