From d87dcd4d2d207a6a6b6d4b2c2468d6909c401ef6 Mon Sep 17 00:00:00 2001
From: Per <Per Lindgren>
Date: Sun, 5 Nov 2017 19:26:39 +0100
Subject: [PATCH] fix
---
README.md | 4 ++--
doc/Memory.md | 1 -
2 files changed, 2 insertions(+), 3 deletions(-)
diff --git a/README.md b/README.md
index 303fb6b..b2f07c2 100644
--- a/README.md
+++ b/README.md
@@ -145,11 +145,11 @@ Seminars
You have to be careful about the signed/unsigned operations and use `wrapping` arithmetics to avoid panics due to unsigned *carry* and signed *overflow*.
- Use borrowed array slices as arguments to `decode`.
+ Use borrowed array slices as arguments to `decode`.
The `seed`, `abc`,`coded` and `plain` should be stack allocated. The decoded string should be printed when decryption is finished.
- b. Make the `seed`, `abc`,`coded` and `plain` heap allocated. Accessing those will require some `unsafe` code. (Keep the unsafe blocks as local as possible.)
+ b. Make the `seed`, `abc`,`coded` and `plain` heap allocated. Accessing those will require some `unsafe` code. (Keep the unsafe blocks as local as possible, perhaps you can do all in *safe* Rust.)
c. Safety analysis. Provoke the implementation, by omitting the `'\0'` (null termination). Observe the result and motivate the behavior in terms of your understanding of the Rust memory model. Under which circumstances do you consider 3a and 3b to have same/different memory safety.
diff --git a/doc/Memory.md b/doc/Memory.md
index 4a112d3..6d3c452 100644
--- a/doc/Memory.md
+++ b/doc/Memory.md
@@ -84,7 +84,6 @@ Thus, only for cases when *true* random access is desired/required, raw indexing
In short, the complilation process can be broken down to the following steps:
-
1. Parsing input
* this processes the .rs files and produces the AST ("abstract syntax tree")
--
GitLab