Add Key.HasAncestor()

service/datastore/key_test.go

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 package datastore
 
 import (
         "encoding/json"
         "fmt"
         "testing"
@@ skipping 137 matching lines @@
                 So(k1.Equal(k2), ShouldBeTrue)
                 k3 := MakeKey("a", "n", "knd", 2)
                 So(k1.Equal(k3), ShouldBeFalse)
         })
 
         Convey("KeyString", t, func() {
                 k1 := MakeKey("a", "n", "knd", 1, "other", "wat")
                 So(k1.String(), ShouldEqual, "a:n:/knd,1/other,\"wat\"")
         })
 
+        Convey("HasAncestor", t, func() {
+                k1 := MakeKey("a", "n", "kind", 1)
+                k2 := MakeKey("a", "n", "kind", 1, "other", "wat")
+                k3 := MakeKey("a", "n", "kind", 1, "other", "wat", "extra", "data")
+                k4 := MakeKey("something", "n", "kind", 1)
+                k5 := MakeKey("a", "n", "kind", 1, "other", "meep")
+
+                So(k1.HasAncestor(k1), ShouldBeTrue)
+                So(k1.HasAncestor(k2), ShouldBeFalse)
+                So(k2.HasAncestor(k5), ShouldBeFalse)
+                So(k5.HasAncestor(k2), ShouldBeFalse)
+                So(k2.HasAncestor(k1), ShouldBeTrue)
+                So(k3.HasAncestor(k2), ShouldBeTrue)
+                So(k3.HasAncestor(k1), ShouldBeTrue)
+                So(k3.HasAncestor(k4), ShouldBeFalse)
+        })
+
         Convey("*GenericKey supports json encoding", t, func() {
                 type TestStruct struct {
                         Key *Key
                 }
                 t := &TestStruct{
                         NewKey("aid", "ns", "kind", "id", 0,
                                 NewKey("aid", "ns", "parent", "", 1, nil),
                         )}
                 d, err := json.Marshal(t)
                 So(err, ShouldBeNil)
@@ skipping 55 matching lines @@
                 }
 
                 for i := 1; i < len(s); i++ {
                         So(s[i-1], shouldBeLess, s[i])
                         So(s[i-1], shouldNotBeEqual, s[i])
                         So(s[i], shouldNotBeEqual, s[i-1])
                         So(s[i], shouldNotBeLess, s[i-1])
                 }
         })
 }