(t *testing.T)
| 80 | } |
| 81 | |
| 82 | func TestHandler(t *testing.T) { |
| 83 | |
| 84 | handler = FsBrowser{FS: fs} |
| 85 | initTree() |
| 86 | |
| 87 | Convey("Create Node", t, func() { |
| 88 | _, err := handler.CreateNode(ctx, &tree.CreateNodeRequest{Node: &tree.Node{ |
| 89 | Type: tree.NodeType_COLLECTION, |
| 90 | Path: "folder1/subfolder", |
| 91 | Uuid: "hfuuid1", |
| 92 | }}) |
| 93 | So(err, ShouldBeNil) |
| 94 | }) |
| 95 | |
| 96 | Convey("Read Node", t, func() { |
| 97 | resp, err := handler.ReadNode(ctx, &tree.ReadNodeRequest{ |
| 98 | Node: &tree.Node{ |
| 99 | Path: "folder/subfolder/file1", |
| 100 | }, |
| 101 | }) |
| 102 | So(err, ShouldBeNil) |
| 103 | So(resp.Node.Size, ShouldEqual, 1024) |
| 104 | }) |
| 105 | |
| 106 | Convey("Update Node", t, func() { |
| 107 | _, err := handler.UpdateNode(ctx, &tree.UpdateNodeRequest{ |
| 108 | From: &tree.Node{ |
| 109 | Path: "folder/subfolder/file1", |
| 110 | }, |
| 111 | To: &tree.Node{ |
| 112 | Path: "folder/file4", |
| 113 | }, |
| 114 | }) |
| 115 | So(err, ShouldNotBeNil) |
| 116 | }) |
| 117 | |
| 118 | Convey("Delete Node", t, func() { |
| 119 | _, err := handler.DeleteNode(ctx, &tree.DeleteNodeRequest{ |
| 120 | Node: &tree.Node{ |
| 121 | Path: "folder", |
| 122 | }, |
| 123 | }) |
| 124 | So(err, ShouldBeNil) |
| 125 | |
| 126 | _, err = handler.ReadNode(ctx, &tree.ReadNodeRequest{ |
| 127 | Node: &tree.Node{ |
| 128 | Path: "folder", |
| 129 | }, |
| 130 | }) |
| 131 | So(err, ShouldNotBeNil) |
| 132 | }) |
| 133 | |
| 134 | Convey("List Nodes", t, func() {}) |
| 135 | } |
| 136 | |
| 137 | func TestHandlerWithPrefix(t *testing.T) { |
| 138 | initTree() |
nothing calls this directly
no test coverage detected
searching dependent graphs…