Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP

Comparing changes

Choose two branches to see what’s changed or to start a new pull request. If you need to, you can also compare across forks.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also compare across forks.
base fork: catrope/netcomp
base: 36fad92845
...
head fork: catrope/netcomp
compare: 9d6148f49b
  • 2 commits
  • 1 file changed
  • 0 commit comments
  • 1 contributor
Showing with 4 additions and 2 deletions.
  1. +4 −2 verslag/verslag.tex
View
6 verslag/verslag.tex
@@ -108,8 +108,10 @@ \subsection*{POST request format}
empty body and a content length of zero.
\subsection*{Local cache}
-All caches --- local and remote --- implement the interface \texttt{ICache}.
+All caches --- local and remote --- implement the interface \texttt{ICache}, which requires classes to implement the functions \texttt{get}, \texttt{set}, and \texttt{clear}. All classes and methods using caches accept an \texttt{ICache} as parameter, not specifying what kind of cache is used.
-The implementation of a basic functional local cache (\texttt{BasicCache}) is quite simple. We use a \texttt{HashMap} to store key-value pairs of strings. To decide which values to throw away when the cache is full, we use a \texttt{LinkedList}. The last value of this list is removed when the list is full, and new items are placed in front. This gives almost a FIFO behavior, the only difference being that when an already existing value is set again, it is not moved to the front of the list.
+A trivial but correct implementation of a cache is the \texttt{StubCache}, which does absolutely nothing. A cache is not required to indicate how long it stores data, if at all.
+
+The implementation of a basic functional local cache (\texttt{BasicCache}) is also quite simple. We use a \texttt{HashMap} to store key-value pairs of strings. To decide which values to throw away when the cache is full, we use a \texttt{LinkedList}. The last value of this list is removed when the list is full, and new items are placed in front. This gives almost a FIFO behavior, the only difference being that when an already existing value is set again, it is not moved to the front of the list.
\end{document}

No commit comments for this range

Something went wrong with that request. Please try again.