(stack Stack[T])
| 39 | } |
| 40 | |
| 41 | func String[T any](stack Stack[T]) string { |
| 42 | var val T |
| 43 | var sb strings.Builder |
| 44 | for stack != nil { |
| 45 | val, stack = Pop(stack) |
| 46 | fmt.Fprintf(&sb, "%v", val) |
| 47 | } |
| 48 | return sb.String() |
| 49 | } |
searching dependent graphs…