Skip to content

Commit d8754ff

Browse files
dev-jkodev-jko
committed
stack / fix typo
1 parent 644f579 commit d8754ff

File tree

8 files changed

+43
-43
lines changed

8 files changed

+43
-43
lines changed

‎stack/stack_array/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -35,10 +35,10 @@
3535
int stack_size(t_stack *stack);
3636
```
3737

38-
### stack_peak
38+
### stack_peek
3939
- stack에서 가장 위에 있는 data를 반환하는 함수를 작성하세요.
4040
```
41-
void *stack_peak(t_stack *stack);
41+
void *stack_peek(t_stack *stack);
4242
```
4343

4444
### stack_pop

‎stack/stack_array/implementation_example/stack.h

+4-4
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
/* By: jko <[email protected]> +#+ +:+ +#+ */
77
/* +#+#+#+#+#+ +#+ */
88
/* Created: 2020/03/12 00:48:13 by jko #+# #+# */
9-
/* Updated: 2020/04/09 17:33:12 by jko ### ########.fr */
9+
/* Updated: 2020/04/10 23:44:11 by jko ### ########.fr */
1010
/* */
1111
/* ************************************************************************** */
1212

@@ -23,10 +23,10 @@ typedef struct s_stack
2323
} t_stack;
2424

2525
t_stack *stack_init(unsigned int max_size);
26-
int stack_push(t_stack *stack, void *data);
26+
int stack_push(t_stack *stack, void *data);
2727
void *stack_pop(t_stack *stack);
28-
int stack_size(t_stack *stack);
29-
void *stack_peak(t_stack *stack);
28+
int stack_size(t_stack *stack);
29+
void *stack_peek(t_stack *stack);
3030
void stack_clear(t_stack *stack, void (*free_data)(void *));
3131
void free_stack(t_stack *stack, void (*free_data)(void *));
3232

‎stack/stack_array/implementation_example/stack_array_implementation.c

+2-2
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
/* By: jko <[email protected]> +#+ +:+ +#+ */
77
/* +#+#+#+#+#+ +#+ */
88
/* Created: 2020/03/12 00:50:01 by jko #+# #+# */
9-
/* Updated: 2020/04/09 17:33:32 by jko ### ########.fr */
9+
/* Updated: 2020/04/10 23:45:33 by jko ### ########.fr */
1010
/* */
1111
/* ************************************************************************** */
1212

@@ -47,7 +47,7 @@ int stack_size(t_stack *stack)
4747
return (stack->top_index + 1);
4848
}
4949

50-
void *stack_peak(t_stack *stack)
50+
void *stack_peek(t_stack *stack)
5151
{
5252
if (stack == 0 || stack->top_index < 0)
5353
return (0);

‎stack/stack_array/implementation_example/test_main.c

+11-11
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
/* By: jko <[email protected]> +#+ +:+ +#+ */
77
/* +#+#+#+#+#+ +#+ */
88
/* Created: 2020/03/12 00:50:22 by jko #+# #+# */
9-
/* Updated: 2020/04/09 17:34:18 by jko ### ########.fr */
9+
/* Updated: 2020/04/10 23:45:57 by jko ### ########.fr */
1010
/* */
1111
/* ************************************************************************** */
1212

@@ -20,32 +20,32 @@ int main(void)
2020
char *temp;
2121
t_stack *stack = stack_init(5);
2222
printf("size = %d\n", stack_size(stack));
23-
printf("peak->data = %s\n", stack_peak(stack));
23+
printf("peek->data = %s\n", stack_peek(stack));
2424

2525
stack_push(stack, strdup("aa"));
2626
printf("size = %d\n", stack_size(stack));
27-
printf("peak->data = %s\n", stack_peak(stack));
27+
printf("peek->data = %s\n", stack_peek(stack));
2828

2929
stack_push(stack, strdup("b"));
3030
printf("size = %d\n", stack_size(stack));
31-
printf("peak->data = %s\n", stack_peak(stack));
31+
printf("peek->data = %s\n", stack_peek(stack));
3232

3333
stack_push(stack, strdup("ccc"));
3434
printf("size = %d\n", stack_size(stack));
35-
printf("peak->data = %s\n", stack_peak(stack));
35+
printf("peek->data = %s\n", stack_peek(stack));
3636

3737
stack_push(stack, strdup("ddddd"));
3838
printf("size = %d\n", stack_size(stack));
39-
printf("peak->data = %s\n", stack_peak(stack));
39+
printf("peek->data = %s\n", stack_peek(stack));
4040

4141
stack_push(stack, strdup("ee"));
4242
printf("size = %d\n", stack_size(stack));
43-
printf("peak->data = %s\n", stack_peak(stack));
43+
printf("peek->data = %s\n", stack_peek(stack));
4444

4545
temp = strdup("f");
4646
stack_push(stack, temp);
4747
printf("size = %d\n", stack_size(stack));
48-
printf("peak->data = %s\n", stack_peak(stack));
48+
printf("peek->data = %s\n", stack_peek(stack));
4949
free(temp);
5050

5151
printf("=============== pop ===============\n");
@@ -55,18 +55,18 @@ int main(void)
5555
printf("pop = %s\n", temp);
5656
free(temp);
5757
printf("size = %d\n", stack_size(stack));
58-
printf("peak->data = %s\n", stack_peak(stack));
58+
printf("peek->data = %s\n", stack_peek(stack));
5959
}
6060

6161
stack_clear(stack, free);
6262

6363
stack_push(stack, strdup("e22"));
6464
printf("size = %d\n", stack_size(stack));
65-
printf("peak->data = %s\n", stack_peak(stack));
65+
printf("peek->data = %s\n", stack_peek(stack));
6666

6767
stack_push(stack, strdup("f22"));
6868
printf("size = %d\n", stack_size(stack));
69-
printf("peak->data = %s\n", stack_peak(stack));
69+
printf("peek->data = %s\n", stack_peek(stack));
7070

7171
free_stack(stack, free);
7272

‎stack/stack_linked_list/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -46,10 +46,10 @@
4646
int stack_size(t_stack *stack);
4747
```
4848

49-
### stack_peak
49+
### stack_peek
5050
- stack에서 가장 위에 있는 요소를 반환하는 함수를 작성하세요.
5151
```
52-
t_node *stack_peak(t_stack *stack);
52+
t_node *stack_peek(t_stack *stack);
5353
```
5454

5555
### stack_pop

‎stack/stack_linked_list/implementation_example/stack.h

+9-9
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
/* By: jko <[email protected]> +#+ +:+ +#+ */
77
/* +#+#+#+#+#+ +#+ */
88
/* Created: 2020/03/12 01:05:16 by jko #+# #+# */
9-
/* Updated: 2020/04/09 17:35:00 by jko ### ########.fr */
9+
/* Updated: 2020/04/10 23:46:58 by jko ### ########.fr */
1010
/* */
1111
/* ************************************************************************** */
1212

@@ -17,21 +17,21 @@
1717

1818
typedef struct s_node
1919
{
20-
void *data;
20+
void *data;
2121
struct s_node *next;
22-
} t_node;
22+
} t_node;
2323

24-
typedef struct s_stack
24+
typedef struct s_stack
2525
{
2626
unsigned int size;
27-
t_node *top;
28-
} t_stack;
27+
t_node *top;
28+
} t_stack;
2929

3030
t_stack *stack_init(void);
3131
t_node *create_elem(void *data);
32-
int stack_push(t_stack *stack, void *data);
33-
int stack_size(t_stack *stack);
34-
t_node *stack_peak(t_stack *stack);
32+
int stack_push(t_stack *stack, void *data);
33+
int stack_size(t_stack *stack);
34+
t_node *stack_peek(t_stack *stack);
3535
t_node *stack_pop(t_stack *stack);
3636
void stack_clear(t_stack *stack, void (*free_data)(void *));
3737
void free_stack(t_stack *stack, void (*free_data)(void *));

‎stack/stack_linked_list/implementation_example/stack_linked_list_implementation.c

+2-2
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
/* By: jko <[email protected]> +#+ +:+ +#+ */
77
/* +#+#+#+#+#+ +#+ */
88
/* Created: 2020/03/12 01:05:04 by jko #+# #+# */
9-
/* Updated: 2020/04/09 17:35:13 by jko ### ########.fr */
9+
/* Updated: 2020/04/10 23:47:18 by jko ### ########.fr */
1010
/* */
1111
/* ************************************************************************** */
1212

@@ -55,7 +55,7 @@ int stack_size(t_stack *stack)
5555
return (stack->size);
5656
}
5757

58-
t_node *stack_peak(t_stack *stack)
58+
t_node *stack_peek(t_stack *stack)
5959
{
6060
if (stack == 0)
6161
return (0);

‎stack/stack_linked_list/implementation_example/test_main.c

+11-11
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
/* By: jko <[email protected]> +#+ +:+ +#+ */
77
/* +#+#+#+#+#+ +#+ */
88
/* Created: 2020/03/12 00:50:22 by jko #+# #+# */
9-
/* Updated: 2020/04/09 17:35:32 by jko ### ########.fr */
9+
/* Updated: 2020/04/10 23:47:40 by jko ### ########.fr */
1010
/* */
1111
/* ************************************************************************** */
1212

@@ -20,31 +20,31 @@ int main(void)
2020
t_node *temp;
2121
t_stack *stack = stack_init();
2222
printf("size = %d\n", stack_size(stack));
23-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
23+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
2424

2525
stack_push(stack, strdup("aa"));
2626
printf("size = %d\n", stack_size(stack));
27-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
27+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
2828

2929
stack_push(stack, strdup("b"));
3030
printf("size = %d\n", stack_size(stack));
31-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
31+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
3232

3333
stack_push(stack, strdup("ccc"));
3434
printf("size = %d\n", stack_size(stack));
35-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
35+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
3636

3737
stack_push(stack, strdup("ddddd"));
3838
printf("size = %d\n", stack_size(stack));
39-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
39+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
4040

4141
stack_push(stack, strdup("ee"));
4242
printf("size = %d\n", stack_size(stack));
43-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
43+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
4444

4545
stack_push(stack, strdup("f"));
4646
printf("size = %d\n", stack_size(stack));
47-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
47+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
4848

4949
printf("=============== pop ===============\n");
5050
for (int i = 0; i < 9; i++)
@@ -54,18 +54,18 @@ int main(void)
5454
free(temp ? temp->data : 0);
5555
free(temp);
5656
printf("size = %d\n", stack_size(stack));
57-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
57+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
5858
}
5959

6060
stack_clear(stack, free);
6161

6262
stack_push(stack, strdup("e22"));
6363
printf("size = %d\n", stack_size(stack));
64-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
64+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
6565

6666
stack_push(stack, strdup("f22"));
6767
printf("size = %d\n", stack_size(stack));
68-
printf("peak->data = %s\n", stack_peak(stack) ? stack_peak(stack)->data : 0);
68+
printf("peek->data = %s\n", stack_peek(stack) ? stack_peek(stack)->data : 0);
6969

7070
free_stack(stack, free);
7171

0 commit comments

Comments
 (0)