Cleanup of old code, moved Node class, many improvements on file handling

node.go

@@ -57,67 +57,6 @@ type Node struct {
 	Special          bool
 }
 
-func NodeTree(userID, offset int, synced uint64) (nodes []TreeNode, maxSeq uint64, moreRowsExist bool, err error) { // {{{
-	const LIMIT = 100
-	var rows *sqlx.Rows
-	rows, err = db.Queryx(`
-		SELECT
-			uuid,
-			COALESCE(parent_uuid, '') AS parent_uuid,
-			name,
-			created,
-			updated,
-			deleted IS NOT NULL AS deleted,
-			created_seq,
-			updated_seq,
-			deleted_seq
-		FROM
-			public.node
-		WHERE
-			user_id = $1 AND 
-			(
-				created_seq > $4 OR
-				updated_seq > $4 OR
-				deleted_seq > $4
-			)
-		ORDER BY
-			created ASC
-		LIMIT $2 OFFSET $3
-		`,
-		userID,
-		LIMIT+1,
-		offset,
-		synced,
-	)
-	if err != nil {
-		return
-	}
-	defer rows.Close()
-
-	nodes = []TreeNode{}
-	numNodes := 0
-	for rows.Next() {
-		// Query selects up to one more row than the decided limit.
-		// Saves one SQL query for row counting.
-		// Thus if numNodes is larger than the limit, more rows exist for the next call.
-		numNodes++
-		if numNodes > LIMIT {
-			moreRowsExist = true
-			return
-		}
-
-		node := TreeNode{}
-		if err = rows.StructScan(&node); err != nil {
-			return
-		}
-		nodes = append(nodes, node)
-
-		// DeletedSeq will be 0 if invalid, and thus not be a problem for the max function.
-		maxSeq = max(maxSeq, node.CreatedSeq, node.UpdatedSeq, uint64(node.DeletedSeq.Int64))
-	}
-
-	return
-} // }}}
 func Nodes(userID, offset int, synced uint64, clientUUID string) (nodes []Node, maxSeq uint64, moreRowsExist bool, err error) { // {{{
 	var rows *sqlx.Rows
 	rows, err = db.Queryx(`