Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
stack
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
algorithmique
lib_2021_malaspinas
stack
Commits
5a8d23e3
Commit
5a8d23e3
authored
3 years ago
by
boris.stefanov
Committed by
orestis.malaspin
3 years ago
Browse files
Options
Downloads
Patches
Plain Diff
* Add stack_print(stack) function (when is_empty is available change implementation slightly)
parent
c5ad82a3
Branches
Branches containing commit
Tags
Tags containing commit
1 merge request
!12
Add stack_print(stack) function
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
stack.c
+16
-1
16 additions, 1 deletion
stack.c
stack.h
+2
-0
2 additions, 0 deletions
stack.h
with
18 additions
and
1 deletion
stack.c
+
16
−
1
View file @
5a8d23e3
...
...
@@ -17,6 +17,20 @@ void stack_peek(stack s, int *value){
}
}
void
stack_print
(
const
stack
s
)
{
//TODO: replace if statement with following as soon as relevant function is implemented
//if (!stack_is_empty()) {
if
(
s
.
top
>=
0
)
{
printf
(
" TOP
\n
--------------------
\n
"
);
for
(
int
*
spot
=
s
.
data
+
s
.
top
;
spot
>=
s
.
data
;
--
spot
)
{
printf
(
"%8d | %12d
\n
"
,
spot
-
s
.
data
,
*
spot
);
}
printf
(
"--------------------
\n
BOTTOM
\n
"
);
}
else
{
printf
(
"STACK EMPTY
\n
"
);
}
}
void
stack_clone
(
stack
s
,
stack
*
clone
)
{
clone
->
top
=
s
.
top
;
clone
->
capacity
=
s
.
capacity
;
...
...
@@ -24,4 +38,5 @@ void stack_clone(stack s, stack *clone) {
for
(
int
i
=
0
;
i
<=
s
.
top
&&
i
<
s
.
capacity
;
i
++
)
{
clone
->
data
[
i
]
=
s
.
data
[
i
];
}
}
\ No newline at end of file
}
This diff is collapsed.
Click to expand it.
stack.h
+
2
−
0
View file @
5a8d23e3
...
...
@@ -12,4 +12,6 @@ void stack_init(stack *stack);
void
stack_peek
(
stack
s
,
int
*
value
);
void
stack_clone
(
stack
s
,
stack
*
clone
);
void
stack_print
(
const
stack
s
);
#endif
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment