forked from mirror/afero
44 lines
1.3 KiB
Go
44 lines
1.3 KiB
Go
|
// Copyright © 2015 Steve Francia <spf@spf13.com>.
|
||
|
|
//
|
||
|
|
// 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 mem
|
||
|
|
|
||
|
|
import "sort"
|
||
|
|
|
||
|
|
type DirMap map[string]File
|
||
|
|
|
||
|
|
func (m DirMap) Len() int { return len(m) }
|
||
|
|
func (m DirMap) Add(f File) { m[f.Name()] = f }
|
||
|
|
func (m DirMap) Remove(f File) { delete(m, f.Name()) }
|
||
|
|
func (m DirMap) Files() (files []File) {
|
||
|
|
for _, f := range m {
|
||
|
|
files = append(files, f)
|
||
|
|
}
|
||
|
|
sort.Sort(filesSorter(files))
|
||
|
|
return files
|
||
|
|
}
|
||
|
|
|
||
|
|
type filesSorter []File
|
||
|
|
|
||
|
|
// implement sort.Interface for []File
|
||
|
|
func (s filesSorter) Len() int { return len(s) }
|
||
|
|
func (s filesSorter) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
|
||
|
|
func (s filesSorter) Less(i, j int) bool { return s[i].Name() < s[j].Name() }
|
||
|
|
|
||
|
|
func (m DirMap) Names() (names []string) {
|
||
|
|
for x := range m {
|
||
|
|
names = append(names, x)
|
||
|
|
}
|
||
|
|
return names
|
||
|
|
}
|