Source file src/github.com/spf13/afero/mem/dirmap.go

Documentation: github.com/spf13/afero/mem

     1  // Copyright © 2015 Steve Francia <spf@spf13.com>.
     2  //
     3  // Licensed under the Apache License, Version 2.0 (the "License");
     4  // you may not use this file except in compliance with the License.
     5  // You may obtain a copy of the License at
     6  // http://www.apache.org/licenses/LICENSE-2.0
     7  //
     8  // Unless required by applicable law or agreed to in writing, software
     9  // distributed under the License is distributed on an "AS IS" BASIS,
    10  // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    11  // See the License for the specific language governing permissions and
    12  // limitations under the License.
    13  
    14  package mem
    15  
    16  import "sort"
    17  
    18  type DirMap map[string]*FileData
    19  
    20  func (m DirMap) Len() int           { return len(m) }
    21  func (m DirMap) Add(f *FileData)    { m[f.name] = f }
    22  func (m DirMap) Remove(f *FileData) { delete(m, f.name) }
    23  func (m DirMap) Files() (files []*FileData) {
    24  	for _, f := range m {
    25  		files = append(files, f)
    26  	}
    27  	sort.Sort(filesSorter(files))
    28  	return files
    29  }
    30  
    31  // implement sort.Interface for []*FileData
    32  type filesSorter []*FileData
    33  
    34  func (s filesSorter) Len() int           { return len(s) }
    35  func (s filesSorter) Swap(i, j int)      { s[i], s[j] = s[j], s[i] }
    36  func (s filesSorter) Less(i, j int) bool { return s[i].name < s[j].name }
    37  
    38  func (m DirMap) Names() (names []string) {
    39  	for x := range m {
    40  		names = append(names, x)
    41  	}
    42  	return names
    43  }
    44  

View as plain text