GitLab

Converted indexing to std::size_t, and fixed the Node templated overloads to properly index any index type (determining what is an index type is a bit of a hack - it should be is_convertible<T, std::size_t> (I think), but I just explicitly wrote down a list)

Added templated Read() function that creates the output variable itself (so you don't need to have a temp variable)

Added emitting for a YAML::Node (instead of the ad-hoc std::ostream overload) so it'll actually emit valid YAML always

It's better organized now, I think - nodes only offer a single main way of getting the fundamental scalar (as a string), and now we can specialize a single template to read specific types.

Added a templated derived exception to KeyNotFound so that you can figure out *which* key wasn't found.

(Thanks to Vadim Zeitlin)

Added Read() functions for Node that return true/false, so we can easily check if a read is successful without throwing.
But we still have operator >> that throws on failure.

No commit message

Switched the Iterator implementation to a dedicated helper class  (to hide the specific implementation, since it's pretty messy and may change).

Fixed a bug in the last newline of a block folded scalar.

Specialized the overloaded [] operator for int/unsigned, and added a size() function, so that you can iterate through a sequence node like a vector.

Fixed a silly bug in the simple key pushing (queues are FIFO!).

Will be completely wiped, I think, in favor of a Scanner (to tokens), then Parser mechanism.

No commit message