github.com/aidoskuneen/adk-node@v0.0.0-20220315131952-2e32567cb7f4/core/state/snapshot/sort.go (about)

     1  // Copyright 2021 The adkgo Authors
     2  // This file is part of the adkgo library (adapted for adkgo from go--ethereum v1.10.8).
     3  //
     4  // the adkgo library is free software: you can redistribute it and/or modify
     5  // it under the terms of the GNU Lesser General Public License as published by
     6  // the Free Software Foundation, either version 3 of the License, or
     7  // (at your option) any later version.
     8  //
     9  // the adkgo library is distributed in the hope that it will be useful,
    10  // but WITHOUT ANY WARRANTY; without even the implied warranty of
    11  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    12  // GNU Lesser General Public License for more details.
    13  //
    14  // You should have received a copy of the GNU Lesser General Public License
    15  // along with the adkgo library. If not, see <http://www.gnu.org/licenses/>.
    16  
    17  package snapshot
    18  
    19  import (
    20  	"bytes"
    21  
    22  	"github.com/aidoskuneen/adk-node/common"
    23  )
    24  
    25  // hashes is a helper to implement sort.Interface.
    26  type hashes []common.Hash
    27  
    28  // Len is the number of elements in the collection.
    29  func (hs hashes) Len() int { return len(hs) }
    30  
    31  // Less reports whether the element with index i should sort before the element
    32  // with index j.
    33  func (hs hashes) Less(i, j int) bool { return bytes.Compare(hs[i][:], hs[j][:]) < 0 }
    34  
    35  // Swap swaps the elements with indexes i and j.
    36  func (hs hashes) Swap(i, j int) { hs[i], hs[j] = hs[j], hs[i] }