-
Notifications
You must be signed in to change notification settings - Fork 13
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
02a351b
commit 9de80c4
Showing
4 changed files
with
508 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,220 @@ | ||
| // | ||
| // CMNode+ASTManipulation.swift | ||
| // Maaku | ||
| // | ||
| // Created by Tim Learmont on 5/29/19. | ||
| // Copyright © 2019 Kristopher Baker. All rights reserved. | ||
| // | ||
|
|
||
| import Foundation | ||
| import libcmark_gfm | ||
|
|
||
| /// Extension for manipulating ndoe values and the Abstract Syntax Tree | ||
| public extension CMNode { | ||
| enum ASTError: Error { | ||
| case canNotSetValue | ||
| case canNotInsert | ||
| case documentMismatch | ||
| } | ||
|
|
||
| func setStringValue(_ newValue: String) throws { | ||
| // cmark_node_set_literal copies the string | ||
| if cmark_node_set_literal(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setHeadingLevel(_ newValue: Int32) throws { | ||
| if cmark_node_set_heading_level(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setFencedCodeInfo(_ newValue: String) throws { | ||
| // cmark_node_set_fence_info copies the string | ||
| if cmark_node_set_fence_info(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setCustomOnEnter(_ newValue: String) throws { | ||
| // cmark_node_set_on_enter copies the string | ||
| if cmark_node_set_on_enter(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setCustomOnExit(_ newValue: String) throws { | ||
| // cmark_node_set_on_exit copies the string | ||
| if cmark_node_set_on_exit(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setListType(_ newValue: CMListType) throws { | ||
| if cmark_node_set_list_type(cmarkNode, cmark_list_type(newValue.rawValue)) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setListDelimiterType(_ newValue: CMDelimiterType) throws { | ||
| if cmark_node_set_list_delim(cmarkNode, cmark_delim_type(newValue.rawValue)) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setListStartingNumber(_ newValue: Int32) throws { | ||
| if cmark_node_set_list_start(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setListTight(_ newValue: Bool) throws { | ||
| if cmark_node_set_list_tight(cmarkNode, newValue ? 1 : 0) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setDestination(_ newValue: String) throws { | ||
| // cmark_node_set_url copies the string | ||
| if cmark_node_set_url(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setURL(_ newValue: URL) throws { | ||
| try setDestination(newValue.absoluteString) | ||
| } | ||
|
|
||
| func setTitle(_ newValue: String) throws { | ||
| // cmark_node_set_title copies the string | ||
| if cmark_node_set_title(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| func setLiteral(_ newValue: String) throws { | ||
| // cmark_node_set_literal copies the string | ||
| if cmark_node_set_literal(cmarkNode, newValue) != 1 { | ||
| throw ASTError.canNotSetValue | ||
| } | ||
| } | ||
|
|
||
| /// Inserts this node into the AST before the given node | ||
| /// | ||
| /// - Parameters: | ||
| /// - beforeNode: the node that this node will be inserted before. | ||
| /// | ||
| func insertIntoTree(beforeNode: CMNode) throws { | ||
| // There should only be one node at the top level (the Document node), | ||
| // so if node we're trying to add before is the document node, don't allow. | ||
| // We also don't allow mutliple document nodes, so that's an error, too | ||
| guard (beforeNode.type != .document) && (self.type != .document) else { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| // For now, we only allow nodes in the same memory management set to play together. | ||
| guard (beforeNode.internalMemoryOwner != nil) | ||
| && (self.internalMemoryOwner != nil) | ||
| && (beforeNode.internalMemoryOwner!.cmarkNode == self.internalMemoryOwner!.cmarkNode) else { | ||
| throw ASTError.documentMismatch | ||
| } | ||
| if cmark_node_insert_before(beforeNode.cmarkNode, self.cmarkNode) != 1 { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| } | ||
|
|
||
| /// Inserts this node into the AST after the given node | ||
| /// | ||
| /// - Paremeters: | ||
| /// - afterNode: the node that this node will be inserted after. | ||
| func insertIntoTree(afterNode: CMNode) throws { | ||
| // There should only be one node at the top level (the Document node), | ||
| // so if node we're trying to add before is the document node, don't allow. | ||
| // We also don't allow mutliple document nodes, so that's an error, too | ||
| guard (afterNode.type != .document) && (self.type != .document) else { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| // For now, we only allow nodes in the same memory management set to play together. | ||
| guard (afterNode.internalMemoryOwner != nil) | ||
| && (self.internalMemoryOwner != nil) | ||
| && (afterNode.internalMemoryOwner!.cmarkNode == self.internalMemoryOwner!.cmarkNode) else { | ||
| throw ASTError.documentMismatch | ||
| } | ||
| if cmark_node_insert_after(afterNode.cmarkNode, self.cmarkNode) != 1 { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| } | ||
|
|
||
| /// Inserts this node into the AST as the first child of the given node. | ||
| /// | ||
| /// All previous children of the given node will come after this node. | ||
| /// | ||
| /// - Paremeters: | ||
| /// - asFirstChildOf: the node that this node will be inserted after. | ||
| func insertIntoTree(asFirstChildOf parent: CMNode) throws { | ||
| // We don't allow mutliple document nodes, so if the node we're trying to insert is a doc node, | ||
| // that's an error. | ||
| guard self.type != .document else { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| // For now, we only allow nodes in the same memory management set to play together. | ||
| // The test is a bit complicated, because parent might be the referencedMemoryOwner. | ||
| guard (self.internalMemoryOwner === parent) | ||
| || ((parent.internalMemoryOwner != nil) | ||
| && (self.internalMemoryOwner === parent.internalMemoryOwner)) else { | ||
| throw ASTError.documentMismatch | ||
| } | ||
| if cmark_node_prepend_child(parent.cmarkNode, self.cmarkNode) != 1 { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| } | ||
|
|
||
| /// Inserts this node into the AST as the last child of the given node. | ||
| /// | ||
| /// All previous children of the given node will come before this node | ||
| /// | ||
| /// - Paremeters: | ||
| /// - afterNode: the node that this node will be inserted after. | ||
| func insertIntoTree(asLastChildOf parent: CMNode) throws { | ||
| // We don't allow mutliple document nodes, so if the node we're trying to insert is a doc node, | ||
| // that's an error. | ||
| guard self.type != .document else { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| // For now, we only allow nodes in the same memory management set to play together. | ||
| // The test is a bit complicated, because parent might be the referencedMemoryOwner. | ||
| guard (self.internalMemoryOwner === parent) | ||
| || ((parent.internalMemoryOwner != nil) | ||
| && (self.internalMemoryOwner === parent.internalMemoryOwner)) else { | ||
| throw ASTError.documentMismatch | ||
| } | ||
| if cmark_node_append_child(parent.cmarkNode, self.cmarkNode) != 1 { | ||
| throw ASTError.canNotInsert | ||
| } | ||
| } | ||
|
|
||
| /// Create a new node and add as the last child of the given parent | ||
| /// | ||
| /// - Parameters: | ||
| /// - type: the type of the node to be created | ||
| /// - extension: the extension for this node (or nil if this type is a base type). | ||
| /// - parent: the node that will be the parent of the newly created node. | ||
| /// This is only needed because our current memory management scheme requires | ||
| /// all nodes to be owned by a parent node. Any nodes without parents might | ||
| /// end up having their data freed incorrectly. | ||
| convenience init?(type: CMNodeType, `extension`: CMExtensionOption? = nil, parent: CMNode) { | ||
| let node: UnsafeMutablePointer<cmark_node> | ||
| if `extension` != nil { | ||
| node = cmark_node_new_with_ext(cmark_node_type(type.rawValue), `extension`!.syntaxExtension) | ||
| } else { | ||
| node = cmark_node_new(cmark_node_type(type.rawValue)) | ||
| } | ||
| self.init(cmarkNode: node, memoryOwner: parent) | ||
|
|
||
| do { | ||
| try insertIntoTree(asLastChildOf: parent) | ||
| } catch { | ||
| return nil | ||
| } | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.