segment-tree-array-based.js

methods: {
    getSmallestBidFromRange() {
      const start = parseInt(this.start);
      const end = parseInt(this.end);
      this.smallestValue = this.items
        .filter(bidsInRange(start, end))
        .reduce((cur, prev) => {
          if (prev) {
            return cur;
          } else {
            return cur.bid < prev.bid ? cur : prev;
          }
        }).bid;
    },
    getSumFromRange() {
      const start = parseInt(this.start);
      const end = parseInt(this.end);
      this.sum = this.items
        .filter(bidsInRange(start, end))
        .reduce(
          (prev, cur) => {
            prev.bid += cur.bid;
            return prev;
          },
          { bid: 0 }
        )
        .bid.toFixed(2);
    }
    
// ... Rest of object code
    
// Filter function for finding bids in a range
function bidsInRange(start, end) {
  return bid => bid.index >= start && bid.index <= end;
}