Add libbirdxml/XmlString.vala

Changed files (1)

• added libbirdxml/XmlString.vala

Diff

diff --git a/libbirdxml/XmlString.vala b/libbirdxml/XmlString.valanew file mode 100644index 0000000..1aaa458--- /dev/null+++ b/libbirdxml/XmlString.vala@@ -0,0 +1,140 @@+/*+    Copyright (C) 2014 Johan Mattsson++    This library is free software; you can redistribute it and/or modify +    it under the terms of the GNU Lesser General Public License as +    published by the Free Software Foundation; either version 3 of the +    License, or (at your option) any later version.++    This library is distributed in the hope that it will be useful, but +    WITHOUT ANY WARRANTY; without even the implied warranty of +    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +    Lesser General Public License for more details.+*/+namespace Bird {++/** + * Representation of a string in the XmlParser. This class adds reference counting and+ * copies a pointer to string instead of the data. It is faster if the string is + * huge.+ */+[Compact]+[CCode (ref_function = "bird_xml_string_ref", unref_function = "bird_xml_string_unref")]+public class XmlString {+	+	public int length;+	public char* data;+	public int refcount = 1;+	+	internal XmlString (char* data, int length) {+		this.data = data;+		this.length = length;+	}+	+	/** Increment the reference count.+	 * @return a pointer to this object+	 */+	public unowned XmlString @ref () {+		refcount++;+		return this;+	}+	+	/** Decrement the reference count and free the object when zero object are holding references to it.*/+	public void unref () {+		if (--refcount == 0) {+			this.finalize ();+		}+	}++	internal int index_of (string needle, int offset = 0) {+		int len = length;+		int needle_len = needle.length;+		char* needle_data = (char*) needle;+		char* haystack = data + offset;+		+		if (needle_len == 0 || offset > length) {+			return -1;+		}+		+		for (int i = 0; i < len; i++) {+			if (haystack[i] == '\0') {+				return -1;+			}+			+			for (int j = 0; j <= needle_len && i + j < len; j++) {+				if (j == needle_len) {+					return offset + i;+				}+				+				if (needle_data[j] != haystack[i + j]) {+					break;+				}+			}+		}+								+		return -1;+	}++	internal bool has_prefix (string prefix) {+		unowned string s = (string) data;+		bool p = s.has_prefix (prefix);++		if (!p) {+			return false;+		}+		+		return length > prefix.length;+	}++	internal bool has_suffix (string suffix) {+		int suffix_length = suffix.length;++		if (length < suffix_length) {+			return false;+		}+		+		return Posix.strncmp ((string) (data + length - suffix_length), suffix, suffix_length) == 0;+	}	++	internal bool get_next_char (ref int index, out unichar c) {+		unowned string s = (string) data;+		+		if (index < 0) {+			c = '\0';+			return false;			+		}+		+		if (index >= length) {+			c = '\0';+			return false;+		}+		+		return s.get_next_char (ref index, out c);+	}++	internal XmlString substring (int offset, int len = -1) {+		Posix.assert (offset >= 0);+		Posix.assert (offset < length);+		+		if (len == -1) {+			return new XmlString (data + offset, length - offset);+		}+		+		Posix.assert (len + offset < length); +		return new XmlString (data + offset, len);+	} +	+	public string to_string () {+		unowned string s = (string) data;+		+		if (length == 0) {+			return "".dup ();+		}		+		+		return s.ndup (length);+	}+	+	private extern void finalize ();+}++}