Update client-go to v10.0.0 (Kubernetes 1.13) (#2382)

* Update client-go to v10.0.0 (Kubernetes 1.13)

This fix updates client-go to v10.0.0 which matches
Kubernetes 1.13 (released several days ago).

Other changes in Gopkg.yaml:
- Updated apimachinary, api, klog, yaml associated with k8s version
  go dep will not automatically match the version.
- Added [prune] field (otherwise go dep will not prune automatically)

Signed-off-by: Yong Tang <yong.tang.github@outlook.com>

* Updated Gopkg.lock

Signed-off-by: Yong Tang <yong.tang.github@outlook.com>

* Updated vendor for client-go v10.0.0

Signed-off-by: Yong Tang <yong.tang.github@outlook.com>

vendor/github.com/petar/GoLLRB/.gitignore

@@ -1,23 +0,0 @@
-syntax:glob
-*.[568ao]
-*.ao
-*.so
-*.pyc
-*.swp
-*.swo
-._*
-.nfs.*
-[568a].out
-*~
-*.orig
-*.pb.go
-core
-_obj
-_test
-src/pkg/Make.deps
-_testmain.go
-
-syntax:regexp
-^pkg/
-^src/cmd/(.*)/6?\1$
-^.*/core.[0-9]*$

vendor/github.com/petar/GoLLRB/README.md

@@ -1,66 +0,0 @@
-# GoLLRB
-
-GoLLRB is a Left-Leaning Red-Black (LLRB) implementation of 2-3 balanced binary
-search trees in Go Language.
-
-## Overview
-
-As of this writing and to the best of the author's knowledge, 
-Go still does not have a balanced binary search tree (BBST) data structure.
-These data structures are quite useful in a variety of cases. A BBST maintains
-elements in sorted order under dynamic updates (inserts and deletes) and can
-support various order-specific queries. Furthermore, in practice one often
-implements other common data structures like Priority Queues, using BBST's.
-
-2-3 trees (a type of BBST's), as well as the runtime-similar 2-3-4 trees, are
-the de facto standard BBST algoritms found in implementations of Python, Java,
-and other libraries. The LLRB method of implementing 2-3 trees is a recent
-improvement over the traditional implementation. The LLRB approach was
-discovered relatively recently (in 2008) by Robert Sedgewick of Princeton
-University.
-
-GoLLRB is a Go implementation of LLRB 2-3 trees.
-
-## Maturity
-
-GoLLRB has been used in some pretty heavy-weight machine learning tasks over many gigabytes of data.
-I consider it to be in stable, perhaps even production, shape. There are no known bugs.
-
-## Installation
-
-With a healthy Go Language installed, simply run `go get github.com/petar/GoLLRB/llrb`
-
-## Example
-    
-	package main
-
-	import (
-		"fmt"
-		"github.com/petar/GoLLRB/llrb"
-	)
-
-	func lessInt(a, b interface{}) bool { return a.(int) < b.(int) }
-
-	func main() {
-		tree := llrb.New(lessInt)
-		tree.ReplaceOrInsert(1)
-		tree.ReplaceOrInsert(2)
-		tree.ReplaceOrInsert(3)
-		tree.ReplaceOrInsert(4)
-		tree.DeleteMin()
-		tree.Delete(4)
-		c := tree.IterAscend()
-		for {
-			u := <-c
-			if u == nil {
-				break
-			}
-			fmt.Printf("%d\n", int(u.(int)))
-		}
-	}
-
-## About
-
-GoLLRB was written by [Petar Maymounkov](http://pdos.csail.mit.edu/~petar/). 
-
-Follow me on [Twitter @maymounkov](http://www.twitter.com/maymounkov)!