Repository URL to install this package:
Version:
7.7.1 ▾
|
#ifndef java_util_TreeSet_H
#define java_util_TreeSet_H
#include "java/util/AbstractSet.h"
namespace java {
namespace lang {
class Class;
class Object;
class Cloneable;
}
namespace io {
class Serializable;
}
namespace util {
class Iterator;
class Spliterator;
class NavigableSet;
class Collection;
class Comparator;
class SortedSet;
}
}
template<class T> class JArray;
namespace java {
namespace util {
class TreeSet : public ::java::util::AbstractSet {
public:
enum {
mid_init$_8f3f2318ac9f2278,
mid_init$_2af20814bcc2f732,
mid_init$_aa70c3846e521cda,
mid_init$_f51631f837be4d6c,
mid_add_e20b5385034fe104,
mid_addAll_c7c0358eea112949,
mid_ceiling_bae1575eb09fb61f,
mid_clear_8f3f2318ac9f2278,
mid_clone_20bf291edf262bce,
mid_comparator_99159b638f28138a,
mid_contains_e20b5385034fe104,
mid_descendingIterator_8155af189fa03751,
mid_descendingSet_13f6bcfcd1af4d50,
mid_first_20bf291edf262bce,
mid_floor_bae1575eb09fb61f,
mid_headSet_e8805eb70339425a,
mid_headSet_1bbae25aad8d8fad,
mid_higher_bae1575eb09fb61f,
mid_isEmpty_73162c5765d7dcfb,
mid_iterator_8155af189fa03751,
mid_last_20bf291edf262bce,
mid_lower_bae1575eb09fb61f,
mid_pollFirst_20bf291edf262bce,
mid_pollLast_20bf291edf262bce,
mid_remove_e20b5385034fe104,
mid_size_71bbd8ec4544910e,
mid_spliterator_78000e34f2a9de16,
mid_subSet_8f9b0ef21948c838,
mid_subSet_2dd98886a1fdc60f,
mid_tailSet_e8805eb70339425a,
mid_tailSet_1bbae25aad8d8fad,
max_mid
};
static ::java::lang::Class *class$;
static jmethodID *mids$;
static bool live$;
static jclass initializeClass(bool);
explicit TreeSet(jobject obj) : ::java::util::AbstractSet(obj) {
if (obj != NULL && mids$ == NULL)
env->getClass(initializeClass);
}
TreeSet(const TreeSet& obj) : ::java::util::AbstractSet(obj) {}
TreeSet();
TreeSet(const ::java::util::Collection &);
TreeSet(const ::java::util::SortedSet &);
TreeSet(const ::java::util::Comparator &);
jboolean add(const ::java::lang::Object &) const;
jboolean addAll(const ::java::util::Collection &) const;
::java::lang::Object ceiling(const ::java::lang::Object &) const;
void clear() const;
::java::lang::Object clone() const;
::java::util::Comparator comparator() const;
jboolean contains(const ::java::lang::Object &) const;
::java::util::Iterator descendingIterator() const;
::java::util::NavigableSet descendingSet() const;
::java::lang::Object first() const;
::java::lang::Object floor(const ::java::lang::Object &) const;
::java::util::SortedSet headSet(const ::java::lang::Object &) const;
::java::util::NavigableSet headSet(const ::java::lang::Object &, jboolean) const;
::java::lang::Object higher(const ::java::lang::Object &) const;
jboolean isEmpty() const;
::java::util::Iterator iterator() const;
::java::lang::Object last() const;
::java::lang::Object lower(const ::java::lang::Object &) const;
::java::lang::Object pollFirst() const;
::java::lang::Object pollLast() const;
jboolean remove(const ::java::lang::Object &) const;
jint size() const;
::java::util::Spliterator spliterator() const;
::java::util::SortedSet subSet(const ::java::lang::Object &, const ::java::lang::Object &) const;
::java::util::NavigableSet subSet(const ::java::lang::Object &, jboolean, const ::java::lang::Object &, jboolean) const;
::java::util::SortedSet tailSet(const ::java::lang::Object &) const;
::java::util::NavigableSet tailSet(const ::java::lang::Object &, jboolean) const;
};
}
}
#include <Python.h>
namespace java {
namespace util {
extern PyType_Def PY_TYPE_DEF(TreeSet);
extern PyTypeObject *PY_TYPE(TreeSet);
class t_TreeSet {
public:
PyObject_HEAD
TreeSet object;
PyTypeObject *parameters[1];
static PyTypeObject **parameters_(t_TreeSet *self)
{
return (PyTypeObject **) &(self->parameters);
}
static PyObject *wrap_Object(const TreeSet&);
static PyObject *wrap_jobject(const jobject&);
static PyObject *wrap_Object(const TreeSet&, PyTypeObject *);
static PyObject *wrap_jobject(const jobject&, PyTypeObject *);
static void install(PyObject *module);
static void initialize(PyObject *module);
};
}
}
#endif