On Tue, Oct 11, 2011 at 05:17:03PM +0300, Zeeshan Ali (Khattak) wrote:
> Can't we declare that as more advanced/special use-case and
> therefore have the app developer use libxml directly? We will still be
> helping out by providing a direct pointer to XMLNode.
That's also an option, but that's
On Tue, Oct 11, 2011 at 3:35 PM, Christophe Fergeau wrote:
> On Fri, Oct 07, 2011 at 02:59:28PM +0300, Zeeshan Ali (Khattak) wrote:
>> Not sure about booleans though. Do
>> we really need to check if value is provided btw? AFAIK, every
>> node/attribute has a default value.
>
> Ah if they all have
On Fri, Oct 07, 2011 at 02:59:28PM +0300, Zeeshan Ali (Khattak) wrote:
> On Fri, Oct 7, 2011 at 12:40 PM, Christophe Fergeau
> wrote:
> > * I don't know how to handle XMLs where the same node appears multiple
> > times (eg "name"). If it's the latest name that wins, what do we do when
> > chang
On Mon, Oct 10, 2011 at 06:45:17PM +0100, Daniel P. Berrange wrote:
> Can you tell me what GIT commitref this series is based on ?
> I tried to git am the series over current head, but it didn't
> pan out.
The tree can be found at
https://gitorious.org/~teuf/libvirt/teuf-libvirt-glib/commits/gconf
On Fri, Oct 07, 2011 at 11:40:45AM +0200, Christophe Fergeau wrote:
> Hi,
>
> Here is a set of patches which start to implement functionality to
> libvirt-gconfig. The end result is that the "name", "memory" and
> "features" properties are implemented for the Domain class. Most of
> the work is ab
On Fri, Oct 7, 2011 at 12:40 PM, Christophe Fergeau wrote:
> Hi,
Hello,
> While writing this code, there were at least 2 questions that arose,
> some input would be welcome :)
>
> * I don't know how to handle XMLs where the same node appears multiple
> times (eg "name"). If it's the latest na
Hi,
Here is a set of patches which start to implement functionality to
libvirt-gconfig. The end result is that the "name", "memory" and
"features" properties are implemented for the Domain class. Most of
the work is about reworking the low-level plumbing to make the
implementation as easy as possi
