Skip to content

Commit 2c4f42d

Browse files
bishaboshabishabosha
committed
remove more app wrappers
1 parent 2740775 commit 2c4f42d

File tree

8 files changed

+68
-56
lines changed

8 files changed

+68
-56
lines changed

‎_es/tour/inner-classes.md

Lines changed: 20 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -31,25 +31,29 @@ En Scala es posible que las clases tengan como miembro otras clases. A diferenci
3131

3232
En nuestro programa, los grafos son representados mediante una lista de nodos. Estos nodos son objetos de la clase interna `Node`. Cada nodo tiene una lista de vecinos que se almacena en la lista `connectedNodes`. Ahora podemos crear un grafo con algunos nodos y conectarlos incrementalmente:
3333

34-
object GraphTest extends App {
35-
val g = new Graph
36-
val n1 = g.newNode
37-
val n2 = g.newNode
38-
val n3 = g.newNode
39-
n1.connectTo(n2)
40-
n3.connectTo(n1)
41-
}
34+
```scala mdoc
35+
def graphTest: Unit = {
36+
val g = new Graph
37+
val n1 = g.newNode
38+
val n2 = g.newNode
39+
val n3 = g.newNode
40+
n1.connectTo(n2)
41+
n3.connectTo(n1)
42+
}
43+
```
4244

4345
Ahora vamos a completar el ejemplo con información relacionada al tipado para definir explicitamente de qué tipo son las entidades anteriormente definidas:
4446

45-
object GraphTest extends App {
46-
val g: Graph = new Graph
47-
val n1: g.Node = g.newNode
48-
val n2: g.Node = g.newNode
49-
val n3: g.Node = g.newNode
50-
n1.connectTo(n2)
51-
n3.connectTo(n1)
52-
}
47+
```scala mdoc:nest
48+
def graphTest: Unit = {
49+
val g: Graph = new Graph
50+
val n1: g.Node = g.newNode
51+
val n2: g.Node = g.newNode
52+
val n3: g.Node = g.newNode
53+
n1.connectTo(n2)
54+
n3.connectTo(n1)
55+
}
56+
```
5357

5458
El código anterior muestra que al tipo del nodo le es prefijado con la instancia superior (que en nuestro ejemplo es `g`). Si ahora tenemos dos grafos, el sistema de tipado de Scala no nos permite mezclar nodos definidos en un grafo con nodos definidos en otro, ya que los nodos del otro grafo tienen un tipo diferente.
5559

‎_es/tour/self-types.md

Lines changed: 11 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -91,12 +91,14 @@ Por favor nótese que en esta clase nos es posible instanciar `NodoImpl` porque
9191

9292
Aquí hay un ejemplo de uso de la clase `GrafoDirigidoConcreto`:
9393

94-
object GraphTest extends App {
95-
val g: Grafo = new GrafoDirigidoConcreto
96-
val n1 = g.agregarNodo
97-
val n2 = g.agregarNodo
98-
val n3 = g.agregarNodo
99-
n1.conectarCon(n2)
100-
n2.conectarCon(n3)
101-
n1.conectarCon(n3)
102-
}
94+
```scala mdoc
95+
def graphTest: Unit = {
96+
val g: Grafo = new GrafoDirigidoConcreto
97+
val n1 = g.agregarNodo
98+
val n2 = g.agregarNodo
99+
val n3 = g.agregarNodo
100+
n1.conectarCon(n2)
101+
n2.conectarCon(n3)
102+
n1.conectarCon(n3)
103+
}
104+
```

‎_ko/tour/inner-classes.md

Lines changed: 20 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -31,25 +31,29 @@ previous-page: lower-type-bounds
3131

3232
이 프로그램에선 노드의 리스트로 그래프를 나타냈다. 노드는 내부 클래스 `Node`의 객체다. 각 노드는 리스트 `connectedNodes`에 저장되는 이웃의 목록을 갖고 있다. 이제 몇몇 노드를 선택하고 이에 연결된 노드를 추가하면서 점진적으로 그래프를 구축할 수 있다.
3333

34-
object GraphTest extends App {
35-
val g = new Graph
36-
val n1 = g.newNode
37-
val n2 = g.newNode
38-
val n3 = g.newNode
39-
n1.connectTo(n2)
40-
n3.connectTo(n1)
41-
}
34+
```scala mdoc
35+
def graphTest: Unit = {
36+
val g = new Graph
37+
val n1 = g.newNode
38+
val n2 = g.newNode
39+
val n3 = g.newNode
40+
n1.connectTo(n2)
41+
n3.connectTo(n1)
42+
}
43+
```
4244

4345
정의된 여러 엔티티의 타입이 무엇인지 명시적으로 알려주는 타입 정보를 사용해 위의 예제를 확장해보자.
4446

45-
object GraphTest extends App {
46-
val g: Graph = new Graph
47-
val n1: g.Node = g.newNode
48-
val n2: g.Node = g.newNode
49-
val n3: g.Node = g.newNode
50-
n1.connectTo(n2)
51-
n3.connectTo(n1)
52-
}
47+
```scala mdoc:nest
48+
def graphTest: Unit = {
49+
val g: Graph = new Graph
50+
val n1: g.Node = g.newNode
51+
val n2: g.Node = g.newNode
52+
val n3: g.Node = g.newNode
53+
n1.connectTo(n2)
54+
n3.connectTo(n1)
55+
}
56+
```
5357

5458
이 코드는 외부 인스턴스(이 예제의 객체 `g`)를 접두어로 지정해 노드 타입을 분명히 나타내고 있다. 두 그래프가 있는 상황에서, 스칼라의 타입 시스템은 한 그래프에 정의된 노드를 다른 그래프에서도 정의해 공유하는 상황을 허용하지 않는다. 이는 다른 그래프의 노드는 다른 타입을 갖기 때문이다.
5559
다음은 잘못된 프로그램이다.

‎_ko/tour/self-types.md

Lines changed: 11 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -88,14 +88,16 @@ previous-page: compound-types
8888

8989
다음은 클래스 `ConcreteDirectedGraph`를 사용하는 예다.
9090

91-
object GraphTest extends App {
92-
val g: Graph = new ConcreteDirectedGraph
93-
val n1 = g.addNode
94-
val n2 = g.addNode
95-
val n3 = g.addNode
96-
n1.connectWith(n2)
97-
n2.connectWith(n3)
98-
n1.connectWith(n3)
99-
}
91+
```scala mdoc
92+
def graphTest: Unit = {
93+
val g: Graph = new ConcreteDirectedGraph
94+
val n1 = g.addNode
95+
val n2 = g.addNode
96+
val n3 = g.addNode
97+
n1.connectWith(n2)
98+
n2.connectWith(n3)
99+
n1.connectWith(n3)
100+
}
101+
```
100102

101103
윤창석, 이한욱 옮김

‎_pl/tour/inner-classes.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,7 @@ class Graph {
3333
W naszym programie grafy są reprezentowane przez listę wierzchołków. Wierzchołki są obiektami klasy wewnętrznej `Node`. Każdy wierzchołek zawiera listę sąsiadów, które są przechowywane w liście `connectedNodes`. Możemy teraz skonfigurować graf z kilkoma wierzchołkami i połączyć je ze sobą:
3434

3535
```scala mdoc
36-
object GraphTest extends App {
36+
def graphTest: Unit = {
3737
val g = new Graph
3838
val n1 = g.newNode
3939
val n2 = g.newNode
@@ -46,7 +46,7 @@ object GraphTest extends App {
4646
Teraz wzbogacimy nasz przykład o jawne typowanie, aby można było zobaczyć powiązanie typów wierzchołków z grafem:
4747

4848
```scala mdoc:nest
49-
object GraphTest extends App {
49+
def graphTest: Unit = {
5050
val g: Graph = new Graph
5151
val n1: g.Node = g.newNode
5252
val n2: g.Node = g.newNode

‎_pl/tour/self-types.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -110,7 +110,7 @@ Należy dodać, że w tej klasie możemy utworzyć `NodeImpl`, ponieważ wiemy j
110110
Poniżej przykład zastosowania klasy `ConcreteDirectedGraph`:
111111

112112
```scala mdoc
113-
object GraphTest extends App {
113+
def graphTest: Unit = {
114114
val g: Graph = new ConcreteDirectedGraph
115115
val n1 = g.addNode
116116
val n2 = g.addNode

‎_pt-br/tour/inner-classes.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,7 @@ class Graph {
3333
Em nosso programa, os grafos são representados por uma lista de nós. Os nós são objetos da classe interna `Node`. Cada nó tem uma lista de vizinhos, que são armazenados na lista `connectedNodes`. Agora podemos configurar um grafo com alguns nós e conectar os nós de forma incremental:
3434

3535
```scala mdoc
36-
object GraphTest extends App {
36+
def graphTest: Unit = {
3737
val g = new Graph
3838
val n1 = g.newNode
3939
val n2 = g.newNode
@@ -46,7 +46,7 @@ object GraphTest extends App {
4646
Agora melhoramos o exemplo acima com tipos, para assim declarar explicitamente qual o tipo das várias entidades definidas:
4747

4848
```scala mdoc:nest
49-
object GraphTest extends App {
49+
def graphTest: Unit = {
5050
val g: Graph = new Graph
5151
val n1: g.Node = g.newNode
5252
val n2: g.Node = g.newNode

‎_pt-br/tour/self-types.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -108,7 +108,7 @@ Observe que nesta classe, podemos instanciar `NodeImpl` porque agora sabemos que
108108
Aqui está um exemplo de uso da classe `ConcreteDirectedGraph`:
109109

110110
```scala mdoc
111-
object GraphTest extends App {
111+
def graphTest: Unit = {
112112
val g: Graph = new ConcreteDirectedGraph
113113
val n1 = g.addNode
114114
val n2 = g.addNode

0 commit comments

Comments
 (0)