From 9d0e6b40bd247229b2ae906997bf45264e83ba85 Mon Sep 17 00:00:00 2001
From: Armon Dadgar <armon.dadgar@gmail.com>
Date: Tue, 11 Aug 2015 18:30:45 -0700
Subject: [PATCH] scheduler: adding static rank iterator

---
 scheduler/rank.go | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)

diff --git a/scheduler/rank.go b/scheduler/rank.go
index 20b712ea3..54a82142b 100644
--- a/scheduler/rank.go
+++ b/scheduler/rank.go
@@ -20,6 +20,7 @@ type RankIterator interface {
 // FeasibleRankIterator is used to consume from a FeasibleIterator
 // and return an unranked node with base ranking.
 type FeasibleRankIterator struct {
+	ctx    Context
 	source FeasibleIterator
 }
 
@@ -27,6 +28,7 @@ type FeasibleRankIterator struct {
 // from a FeasibleIterator source.
 func NewFeasibleRankIterator(ctx Context, source FeasibleIterator) *FeasibleRankIterator {
 	iter := &FeasibleRankIterator{
+		ctx:    ctx,
 		source: source,
 	}
 	return iter
@@ -40,6 +42,26 @@ func (iter *FeasibleRankIterator) Next() *RankedNode {
 	return ranked
 }
 
+// StaticRankIterator is a RankIterator that returns a static set of results.
+// This is largely only useful for testing.
+type StaticRankIterator struct {
+	ctx    Context
+	nodes  []*RankedNode
+	offset int
+}
+
+func (iter *StaticRankIterator) Next() *RankedNode {
+	// Check if exhausted
+	if iter.offset == len(iter.nodes) {
+		return nil
+	}
+
+	// Return the next offset
+	offset := iter.offset
+	iter.offset += 1
+	return iter.nodes[offset]
+}
+
 // BinPackIterator is a RankIterator that scores potential options
 // based on a bin-packing algorithm.
 type BinPackIterator struct {