1. 04 9月, 2009 3 次提交
    • L
      Introduce QDict · fb08dde0
      Luiz Capitulino 提交于
      QDict is a high-level dictionary data type that can be used to store a
      collection of QObjects. A unique key is associated with only one
      QObject.
      
      The following functions are available:
      
      - qdict_new()    Create a new QDict
      - qdict_put()    Add a new 'key:object' pair
      - qdict_get()    Get the QObject of a given key
      - qdict_del()    Delete a 'key:object' pair
      - qdict_size()   Return the size of the dictionary
      - qdict_haskey() Check if a given 'key' exists
      
      Some high-level helpers to operate on QStrings and QInts objects
      are also provided.
      Signed-off-by: NLuiz Capitulino <lcapitulino@redhat.com>
      Signed-off-by: NAnthony Liguori <aliguori@us.ibm.com>
      fb08dde0
    • L
      Introduce QString · 66f70487
      Luiz Capitulino 提交于
      QString is a high-level data type that can be used to represent
      C strings.
      
      The following functions are available:
      
      - qstring_from_str() Create a new QString
      - qstring_get_str()  Get a pointer to the stored string
      
      Note that qstring_get_str() is too low-level for a data type like
      this, but it's interesting for quick read-only accesses.
      Signed-off-by: NLuiz Capitulino <lcapitulino@redhat.com>
      Signed-off-by: NAnthony Liguori <aliguori@us.ibm.com>
      66f70487
    • L
      Introduce QInt · 6b8d1ece
      Luiz Capitulino 提交于
      QInt is a high-level data type that can be used to represent integers,
      internally it stores an int64_t value.
      
      The following functions are available:
      
      - qint_from_int() Create a new QInt
      - qint_get_int()  Get the stored integer
      Signed-off-by: NLuiz Capitulino <lcapitulino@redhat.com>
      Signed-off-by: NAnthony Liguori <aliguori@us.ibm.com>
      6b8d1ece
  2. 28 8月, 2009 2 次提交
  3. 24 8月, 2009 4 次提交
  4. 19 8月, 2009 1 次提交
  5. 16 8月, 2009 1 次提交
  6. 15 8月, 2009 2 次提交
  7. 11 8月, 2009 19 次提交
  8. 31 7月, 2009 1 次提交
  9. 28 7月, 2009 7 次提交