Sample code for 30+ languages & platforms
Ruby

Compress XML Content

See more XML Examples

Demonstrates how to compress the content of an XML node. Note: This does not compress the node's children, only the text content.

The input XML, available at http://www.chilkatsoft.com/data/compress1.xml, is this:

<root>
    <fox>This is content that will be compressed.
		0The quick brown fox jumps over the lazy dog
		1The quick brown fox jumps over the lazy dog
		2The quick brown fox jumps over the lazy dog
		3The quick brown fox jumps over the lazy dog
		4The quick brown fox jumps over the lazy dog
		5The quick brown fox jumps over the lazy dog
		6The quick brown fox jumps over the lazy dog
		7The quick brown fox jumps over the lazy dog
		8The quick brown fox jumps over the lazy dog
		9The quick brown fox jumps over the lazy dog
        <child1>
            <grandchild>This is not compressed.</grandchild>
        </child1>
    </fox>
</root>

Chilkat Ruby Downloads

Ruby
require 'chilkat'

success = false

xml = Chilkat::CkXml.new()

# The sample input XML is available at http://www.chilkatsoft.com/data/compress1.xml
success = xml.LoadXmlFile("compress1.xml")
if (success != true)
    print xml.lastErrorText() + "\n";
    exit
end

# Navigate to the "fox" node, which is the 1st child:
success = xml.FirstChild2()

# Zip compress the content:
success = xml.ZipContent()

# Navigate back to the root:
xml.GetRoot2()

# Examine the new XML document:
print xml.getXml() + "\n";

# This is the XML w/ the compressed content in Base64 encoded format:

# <root>
#     <fox><![CDATA[lcvbEYIwFIThZ5ixh63A8QZqHzTA5UiiIQeTIGr1xhJ2Zp/++bYxNiKvV5/EJyTTJqzWOXSS4zQH
# iVGG7aYsil1jBM/F9g90QVePm75xX6Y5Ql8S8lfg2u8Hg45/vyf9gfRH0p9IX5G+Jv2Z9BfSXwn/
# Aw==
# ]]>
#         <child1>
#             <grandchild>This is not compressed.</grandchild>
#         </child1>
#     </fox>
# </root>

# Now uncompress and show that the original content was restored:
success = xml.FirstChild2()
success = xml.UnzipContent()
xml.GetRoot2()
print xml.getXml() + "\n";