-
Notifications
You must be signed in to change notification settings - Fork 19
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Use a stack data structure to push and restore the last request
- Loading branch information
Showing
5 changed files
with
128 additions
and
12 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| package network | ||
|
|
||
| import "sync" | ||
|
|
||
| type Request struct { | ||
| Data []byte | ||
| } | ||
|
|
||
| type Stack struct { | ||
| items []*Request | ||
| mu sync.RWMutex | ||
| } | ||
|
|
||
| func (s *Stack) Push(req *Request) { | ||
| s.mu.Lock() | ||
| defer s.mu.Unlock() | ||
|
|
||
| s.items = append(s.items, req) | ||
| } | ||
|
|
||
| func (s *Stack) GetLastRequest() *Request { | ||
| s.mu.RLock() | ||
| defer s.mu.RUnlock() | ||
|
|
||
| if len(s.items) == 0 { | ||
| return nil | ||
| } | ||
|
|
||
| //nolint:staticcheck | ||
| for i := len(s.items) - 1; i >= 0; i-- { | ||
| return s.items[i] | ||
| } | ||
|
|
||
| return nil | ||
| } | ||
|
|
||
| func (s *Stack) PopLastRequest() *Request { | ||
| s.mu.Lock() | ||
| defer s.mu.Unlock() | ||
|
|
||
| if len(s.items) == 0 { | ||
| return nil | ||
| } | ||
|
|
||
| //nolint:staticcheck | ||
| for i := len(s.items) - 1; i >= 0; i-- { | ||
| req := s.items[i] | ||
| s.items = append(s.items[:i], s.items[i+1:]...) | ||
| return req | ||
| } | ||
|
|
||
| return nil | ||
| } | ||
|
|
||
| func (s *Stack) UpdateLastRequest(req *Request) { | ||
| s.mu.Lock() | ||
| defer s.mu.Unlock() | ||
|
|
||
| if len(s.items) == 0 { | ||
| return | ||
| } | ||
|
|
||
| //nolint:staticcheck | ||
| for i := len(s.items) - 1; i >= 0; i-- { | ||
| s.items[i] = req | ||
| return | ||
| } | ||
| } | ||
|
|
||
| func (s *Stack) Clear() { | ||
| s.mu.Lock() | ||
| defer s.mu.Unlock() | ||
|
|
||
| s.items = make([]*Request, 0) | ||
| } | ||
|
|
||
| func NewStack() *Stack { | ||
| return &Stack{ | ||
| items: make([]*Request, 0), | ||
| mu: sync.RWMutex{}, | ||
| } | ||
| } |