-
Notifications
You must be signed in to change notification settings - Fork 0
/
files_heap.go
99 lines (86 loc) · 2.68 KB
/
files_heap.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
// Copyright 2018 StreamSets Inc.
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package spooler
import (
"container/heap"
"strings"
"sync"
)
type FilesHeap struct {
fileInfos FileInfos
readOrder string
}
func (h FilesHeap) Len() int {
return len(h.fileInfos)
}
func (h FilesHeap) Less(i, j int) bool {
return (h.readOrder == Timestamp &&
(h.fileInfos[i].getModTime().Before(h.fileInfos[j].getModTime()) ||
(h.fileInfos[i].getModTime().Equal(h.fileInfos[j].getModTime()) &&
strings.Compare(h.fileInfos[i].getFullPath(), h.fileInfos[j].getFullPath()) < 0))) ||
(h.readOrder == Lexicographical &&
(strings.Compare(h.fileInfos[i].getFullPath(), h.fileInfos[j].getFullPath()) < 0 ||
(strings.Compare(h.fileInfos[i].getFullPath(), h.fileInfos[j].getFullPath()) == 0 &&
h.fileInfos[i].getModTime().Before(h.fileInfos[j].getModTime()))))
}
func (h FilesHeap) Swap(i, j int) {
h.fileInfos[i], h.fileInfos[j] = h.fileInfos[j], h.fileInfos[i]
}
func (h *FilesHeap) Contains(path string) bool {
for _, fInfo := range h.fileInfos {
if fInfo.getFullPath() == path {
return true
}
}
return false
}
func (h *FilesHeap) Push(x interface{}) {
h.fileInfos = append(h.fileInfos, x.(*AtomicFileInformation))
}
func (h *FilesHeap) Pop() interface{} {
old := h.fileInfos
n := len(old)
if n > 0 {
x := old[n-1]
h.fileInfos = old[0 : n-1]
return x
}
return nil
}
type SynchronizedFilesHeap struct {
filesHeap *FilesHeap
lock *sync.RWMutex
}
func (sfh *SynchronizedFilesHeap) Push(atf *AtomicFileInformation) {
sfh.lock.Lock()
defer sfh.lock.Unlock()
heap.Push(sfh.filesHeap, atf)
}
func (sfh *SynchronizedFilesHeap) Pop() *AtomicFileInformation {
sfh.lock.Lock()
defer sfh.lock.Unlock()
if sfh.filesHeap.Len() > 0 {
return heap.Pop(sfh.filesHeap).(*AtomicFileInformation)
}
return nil
}
func (sfh *SynchronizedFilesHeap) Contains(path string) bool {
sfh.lock.Lock()
defer sfh.lock.Unlock()
return sfh.filesHeap.Contains(path)
}
func NewSynchronizedFilesHeap(readOrder string) *SynchronizedFilesHeap {
filesQueue := &FilesHeap{fileInfos: FileInfos{}, readOrder: readOrder}
heap.Init(filesQueue)
return &SynchronizedFilesHeap{filesHeap: filesQueue, lock: &sync.RWMutex{}}
}