Skip to content

Commit

Permalink
Typo fixes and misc
Browse files Browse the repository at this point in the history
  • Loading branch information
S4ndyk committed Jun 26, 2020
1 parent dc37de9 commit b832bac
Show file tree
Hide file tree
Showing 3 changed files with 8 additions and 7 deletions.
2 changes: 1 addition & 1 deletion data/part-12/1-type-parameters.md
Original file line number Diff line number Diff line change
Expand Up @@ -66,7 +66,7 @@ public class Locker<T> {

<!-- Määrittely `public class Lokero<T>` kertoo että luokalle `Lokero` tulee antaa konstruktorissa tyyppiparametri. Konstruktorikutsun jälkeen kaikki olion sisäiset muuttujat tulevat olemaan kutsun yhteydessä annettua tyyppiä. Luodaan merkkijonon tallentava lokero. -->

The definition `public class Locker<T>` indicates that the `Locker` class msut be given a type parameter in its constructor. After the constructor call is executed, all the variables stored in that object are going to be of the type that was given with the constructor. Let's create a locker for storing strings.
The definition `public class Locker<T>` indicates that the `Locker` class must be given a type parameter in its constructor. After the constructor call is executed, all the variables stored in that object are going to be of the type that was given with the constructor. Let's create a locker for storing strings.


<!-- ```java
Expand Down
11 changes: 6 additions & 5 deletions data/part-12/2-arraylist-and-hashtable.md
Original file line number Diff line number Diff line change
Expand Up @@ -28,7 +28,7 @@ hidden: true

<!-- ArrayList ja Hajautustaulu ovat ohjemoinnissa hyvin yleisesti käytettyjä tietorakenteita. Tarkastellaan tässä niiden todelmyList toteutusta. Kerrataan ensin lyhyesti taulukon käyttöä, jonka jälkeen rakennetaan esimerkinomaisesti ensin ArrayListiä imitoiva tietorakenne `List`, jota hyödynnetään sitten tietorakenteen `Hajautustaulu` tekemisessä. -->

ArrayList and HashMap are some of commonly used data structures in programming. We are now going to take a look at their actual implementation. First we'll remind ourselves of how to use an array, after which we're going to build a data structure called `List`, imitating ArrayList. Then we'll make use of the List to implement the data structure `HashTable`.
ArrayList and HashMap are commonly used data structures in programming. We are now going to take a look at their actual implementation. First we'll remind ourselves of how to use an array, after which we're going to build a data structure called `List`, imitating ArrayList. Then we'll make use of the List to implement the data structure `HashTable`.

<!-- ## Lyhyt kertaus taulukoista -->

Expand Down Expand Up @@ -104,7 +104,7 @@ for (int i = 0; i < numbers.length; i++) {
}
```


<!---
<sample-output>
Taulukossa on 4 alkiota.
Expand All @@ -114,6 +114,7 @@ Taulukossa on 4 alkiota.
7
</sample-output>
--->

<sample-output>

Expand Down Expand Up @@ -252,7 +253,7 @@ myList.add("world");
### Adding values to a list part 2

<!-- Edellä kuvatussa `add`-metodissa on pieni ongelma. Ongelma ilmenee kun seuraava ohjelmakoodi suoritetaan. -->
There is a small problem with the `add` method. The problem comes when the following code is run:
There is a small problem with the `add` method. The problem occurs when the following code is run:


```java
Expand Down Expand Up @@ -318,7 +319,7 @@ Now we can add almost unlimited amount of elements to the List.
The method described above copies every element from the old array to the new array. If we would have for example two million elements in an array, we must go through two million elements while copying them.

<!-- Menetelmän tehokkuuteen -- ja parannusehdotuksiin -- paneudutaan muunmuassa kursseilla Tietorakenteet ja algoritmit sekä Algoritmien suunnittelu ja analyysi. -->
We will discuss the effectiveness of this method -- and ways to make it more effective -- in the course Tietorakenteet ja algoritmit and Algoritmien suunnittelu ja analyysi.
We will discuss the effectiveness of this method -- and ways to make it more effective -- in the courses Datastructures and Algorithms and Design and analysis of algorithms.

</text-box>

Expand Down Expand Up @@ -454,7 +455,7 @@ public void remove(Type value) {
The method describes above copies each element after the removed element one place to the left. Think about the effectiveness of this method when the List is used as a queue.

<!-- Tämänkin menetelmän tehokkuuteen -- ja parannusehdotuksiin -- paneudutaan muunmuassa kursseilla Tietorakenteet ja algoritmit sekä Algoritmien suunnittelu ja analyysi. -->
We will discuss the effectiveness of this method -- and ways to make it more effective -- in the course Tietorakenteet ja algoritmit and Algoritmien suunnittelu ja analyysi.
We will discuss the effectiveness of this method -- and ways to make it more effective -- in the courses Datastructures and algorithms and Design and analysis of algorithms.

</text-box>

Expand Down
2 changes: 1 addition & 1 deletion data/part-12/4-multidimensional-data.md
Original file line number Diff line number Diff line change
Expand Up @@ -111,7 +111,7 @@ Create in the exercise base a method called `public static String arrayAsString(

<!-- Kertaa yhdeksännestä osasta StringBuilderin käyttö ennen tehtävän tekoa. Alla muutamia esimerkkejä metodin odotetusta toiminnasta. -->

Brush up on using StrinBuilder in part nine before taking on this exercise. Below there are a few examples of how the method is expected to work.
Brush up on using StringBuilder in part nine before taking on this exercise. Below there are a few examples of how the method is expected to work.

<!-- ```java
int rows = 2;
Expand Down

0 comments on commit b832bac

Please sign in to comment.