Linux iad1-shared-b7-18 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64
Apache
: 67.205.6.31 | : 216.73.216.47
Cant Read [ /etc/named.conf ]
8.2.29
fernandoquevedo
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
share /
swig4.0 /
java /
[ HOME SHELL ]
Name
Size
Permission
Action
arrays_java.i
13.38
KB
-rw-r--r--
boost_intrusive_ptr.i
20.11
KB
-rw-r--r--
boost_shared_ptr.i
13.75
KB
-rw-r--r--
director.swg
15.71
KB
-rw-r--r--
enums.swg
4.42
KB
-rw-r--r--
enumsimple.swg
2.51
KB
-rw-r--r--
enumtypesafe.swg
4.52
KB
-rw-r--r--
enumtypeunsafe.swg
2.66
KB
-rw-r--r--
java.swg
50.37
KB
-rw-r--r--
javahead.swg
4.19
KB
-rw-r--r--
javakw.swg
1.24
KB
-rw-r--r--
std_array.i
1.18
KB
-rw-r--r--
std_auto_ptr.i
846
B
-rw-r--r--
std_common.i
102
B
-rw-r--r--
std_deque.i
28
B
-rw-r--r--
std_except.i
2.02
KB
-rw-r--r--
std_list.i
6.48
KB
-rw-r--r--
std_map.i
6.22
KB
-rw-r--r--
std_pair.i
774
B
-rw-r--r--
std_set.i
5.14
KB
-rw-r--r--
std_shared_ptr.i
68
B
-rw-r--r--
std_string.i
3.46
KB
-rw-r--r--
std_unordered_map.i
5.87
KB
-rw-r--r--
std_unordered_set.i
5.35
KB
-rw-r--r--
std_vector.i
5.41
KB
-rw-r--r--
std_wstring.i
4.94
KB
-rw-r--r--
stl.i
291
B
-rw-r--r--
swiginterface.i
3.33
KB
-rw-r--r--
typemaps.i
18.93
KB
-rw-r--r--
various.i
5.73
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : std_set.i
/* ----------------------------------------------------------------------------- * std_set.i * * SWIG typemaps for std::set * The Java proxy class extends java.util.AbstractSet. The std::set * container looks and feels much like a java.util.HashSet from Java. * ----------------------------------------------------------------------------- */ %include <std_common.i> // ------------------------------------------------------------------------ // std::set // ------------------------------------------------------------------------ %{ #include <set> #include <stdexcept> %} %fragment("SWIG_SetSize", "header", fragment="SWIG_JavaIntFromSize_t") { SWIGINTERN jint SWIG_SetSize(size_t size) { jint sz = SWIG_JavaIntFromSize_t(size); if (sz == -1) { throw std::out_of_range("set size is too large to fit into a Java int"); } return sz; } } %javamethodmodifiers std::set::sizeImpl "private"; %javamethodmodifiers std::set::containsImpl "private"; %javamethodmodifiers std::set::removeImpl "private"; %javamethodmodifiers std::set::hasNextImpl "private"; %javamethodmodifiers std::set::begin "private"; %javamethodmodifiers std::set::end "private"; %rename(Iterator) std::set::iterator; %nodefaultctor std::set::iterator; %javamethodmodifiers std::set::iterator::incrementUnchecked "private"; %javamethodmodifiers std::set::iterator::derefUnchecked "private"; %javamethodmodifiers std::set::iterator::isNot "private"; namespace std { template <class T> class set { %typemap(javabase) std::set<T> "java.util.AbstractSet<$typemap(jboxtype, T)>" %proxycode %{ public $javaclassname(java.util.Collection<? extends $typemap(jboxtype, T)> collection) { this(); addAll(collection); } public int size() { return sizeImpl(); } public boolean add($typemap(jboxtype, T) key) { return addImpl(key); } public boolean addAll(java.util.Collection<? extends $typemap(jboxtype, T)> collection) { boolean didAddElement = false; for (java.lang.Object object : collection) { didAddElement |= add(($typemap(jboxtype, T))object); } return didAddElement; } public java.util.Iterator<$typemap(jboxtype, T)> iterator() { return new java.util.Iterator<$typemap(jboxtype, T)>() { private Iterator curr; private Iterator end; private java.util.Iterator<$typemap(jboxtype, T)> init() { curr = $javaclassname.this.begin(); end = $javaclassname.this.end(); return this; } public $typemap(jboxtype, T) next() { if (!hasNext()) { throw new java.util.NoSuchElementException(); } // Save the current position, increment it, // then return the value at the position before the increment. final $typemap(jboxtype, T) currValue = curr.derefUnchecked(); curr.incrementUnchecked(); return currValue; } public boolean hasNext() { return curr.isNot(end); } }.init(); } public boolean containsAll(java.util.Collection<?> collection) { for (java.lang.Object object : collection) { if (!contains(object)) { return false; } } return true; } public boolean contains(java.lang.Object object) { if (!(object instanceof $typemap(jboxtype, T))) { return false; } return containsImpl(($typemap(jboxtype, T))object); } public boolean removeAll(java.util.Collection<?> collection) { boolean didRemoveElement = false; for (java.lang.Object object : collection) { didRemoveElement |= remove(object); } return didRemoveElement; } public boolean remove(java.lang.Object object) { if (!(object instanceof $typemap(jboxtype, T))) { return false; } return removeImpl(($typemap(jboxtype, T))object); } %} public: struct iterator { %typemap(javaclassmodifiers) iterator "protected class" %extend { void incrementUnchecked() { ++(*$self); } T derefUnchecked() const { return **$self; } bool isNot(iterator other) const { return (*$self != other); } } }; typedef size_t size_type; typedef ptrdiff_t difference_type; typedef T key_type; typedef T value_type; typedef value_type* pointer; typedef const value_type* const_pointer; typedef value_type& reference; typedef const value_type& const_reference; set(); set(const set& other); %rename(isEmpty) empty; bool empty() const; void clear(); iterator begin(); iterator end(); %extend { %fragment("SWIG_SetSize"); // Returns whether item was inserted. bool addImpl(const T& key) { return self->insert(key).second; } // Returns whether set contains key. bool containsImpl(const T& key) { return (self->count(key) > 0); } // Returns whether the item was erased. bool removeImpl(const T& key) { return (self->erase(key) > 0); } jint sizeImpl() const throw (std::out_of_range) { return SWIG_SetSize(self->size()); } bool hasNextImpl(const iterator& itr) const { return (itr != $self->end()); } } }; }
Close