markly 0.12.0 → 0.13.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3cd94abddc41f15067801a6e539bc8f9e9243625ad4896c75a226b8d9001fbd8
-  data.tar.gz: 24eef0d17ac2f066e68689fa6a1dfcae0ac106d5219d5a0df7d41502333a39d2
+  metadata.gz: 16f7d1b58c0978a73757f549d15ab5930fce2c7893345b45bc80fd5d7cd29a8f
+  data.tar.gz: 2232e3fd1897f656f47720fa6220896d65c6ddeafca87ab25f158d3a7939ddad
 SHA512:
-  metadata.gz: c74742176f3f3514e96af7f78d0128ae14ac1b116e3aaccfee37eea6441de208347d2a370509c71782d15147d0414e7940d7e839aa5967561e7df53225eeada0
-  data.tar.gz: 05ee9e27830fc92fa13c7cc909e0a1fba8221c3b563bcb0c31ec0ece271673cdc402293e382464af529b4e110e46e0a440888d19d9d907f13b299ad88c23ea73
+  metadata.gz: 4e8c4a0b0a458edca3865244a1933191f7a01749bef0cc1d9f7137a43d79c65f8de67138a89f8687018954d576a26a46ee85f18621f489d826ef6b262e0f17e2
+  data.tar.gz: 58221e79a6a07c53949cb5a8751df4d1d32db5fa3c976ae7ca003909e5e2ed20da4041794a57bb10db51be7baa5e06a28e022fb5d93045b5391f84d82c9d314b

checksums.yaml.gz.sig

@@ -1,3 +1,3 @@
-IS&f`����cM��S��=-X{!Q��D�6��F3���ٝnO2j��!x�_|���hËL��퐫�Wz�	۰��i
-_�R��s� ��:!���
-82��3R8��X
+ '%�Sm�k~�PZ�,��d�˝��Lz��]��ώ"T��}�J�ћ�S�.&pɦ���Ѐ��Ue��O�^D�Q����݋A���N�n�4	S��V�tU|�(3���s��F��O���z�H�_��51��r
+�s���Tl~��1�<��¿��Q���f9]B�>�|s�\d^�`e:���aR!B?r��R�����]��~��������ƻ�P��v�������T}���~�]b�ĺ6��~��ʠ��/�@2�a���3������c{
+���������]b��]]�՝tK=ё��+\��ėί}ò3r<�ی����^�k�{9kJ�ܥ;)�Zf̲�E�� w�pW��- �>�

data/lib/markly/node.rb

@@ -17,7 +17,14 @@ module Markly
 		# Duplicate the current node and all children.
 		def dup
 			# This is a bit crazy, but it's the best I can come up with right now:
-			Markly.parse(self.to_markdown)
+			node = Markly.parse(self.to_markdown)
+			
+			# If we aren't duplicating a document, we return `first_child` as the root will be a document node:
+			if self.type == :document
+				return node
+			else
+				return node.first_child
+			end
 		end
 		
 		# Public: An iterator that "walks the tree," descending into children recursively.
@@ -142,6 +149,24 @@ module Markly
 			end
 		end
 		
+		# Append the given node before the current node.
+		#
+		# It's okay to provide a document node, it's children will be appended.
+		#
+		# @parameter node [Markly::Node] the node to append.
+		def append_before(node)
+			if node.type == :document
+				node = node.first_child
+			end
+			
+			current = self
+			while node
+				next_node = node.next
+				current.insert_before(node)
+				node = next_node
+			end
+		end
+		
 		# Extract the children as a fragment.
 		#
 		# @returns [Markly::Node] the fragment.

data/lib/markly/version.rb

@@ -7,5 +7,5 @@
 # Copyright, 2020-2023, by Samuel Williams.
 
 module Markly
-	VERSION = '0.12.0'
+	VERSION = '0.13.0'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: markly
 version: !ruby/object:Gem::Version
-  version: 0.12.0
+  version: 0.13.0
 platform: ruby
 authors:
 - Garen Torikian
@@ -24,7 +24,6 @@ authors:
 - Roberto Hidalgo
 - Ross Kaffenberger
 - Vitaliy Klachkov
-autorequire:
 bindir: bin
 cert_chain:
 - |
@@ -56,10 +55,8 @@ cert_chain:
   Q2K9NVun/S785AP05vKkXZEFYxqG6EW012U4oLcFl5MySFajYXRYbuUpH6AY+HP8
   voD0MPg1DssDLKwXyt1eKD/+Fq0bFWhwVM/1XiAXL7lyYUyOq24KHgQ2Csg=
   -----END CERTIFICATE-----
-date: 2024-08-19 00:00:00.000000000 Z
+date: 2025-03-22 00:00:00.000000000 Z
 dependencies: []
-description:
-email:
 executables: []
 extensions:
 - ext/markly/extconf.rb
@@ -152,7 +149,6 @@ metadata:
   documentation_uri: https://ioquatix.github.io/markly/
   funding_uri: https://github.com/sponsors/ioquatix/
   source_code_uri: https://github.com/ioquatix/markly.git
-post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -167,8 +163,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.5.11
-signing_key:
+rubygems_version: 3.6.2
 specification_version: 4
 summary: CommonMark parser and renderer. Written in C, wrapped in Ruby.
 test_files: []