mirror of
https://github.com/mappu/miqt.git
synced 2024-12-23 01:18:37 +00:00
60 lines
1.3 KiB
C++
60 lines
1.3 KiB
C++
#include <QHashData>
|
|
#define WORKAROUND_INNER_CLASS_DEFINITION_QHashData__Node
|
|
#include <QHashDummyValue>
|
|
#include <qhash.h>
|
|
#include "gen_qhash.h"
|
|
#include "_cgo_export.h"
|
|
|
|
void* QHashData_AllocateNode(QHashData* self, int nodeAlign) {
|
|
return self->allocateNode(static_cast<int>(nodeAlign));
|
|
}
|
|
|
|
void QHashData_FreeNode(QHashData* self, void* node) {
|
|
self->freeNode(node);
|
|
}
|
|
|
|
bool QHashData_WillGrow(QHashData* self) {
|
|
return self->willGrow();
|
|
}
|
|
|
|
void QHashData_HasShrunk(QHashData* self) {
|
|
self->hasShrunk();
|
|
}
|
|
|
|
void QHashData_Rehash(QHashData* self, int hint) {
|
|
self->rehash(static_cast<int>(hint));
|
|
}
|
|
|
|
QHashData__Node* QHashData_FirstNode(QHashData* self) {
|
|
return self->firstNode();
|
|
}
|
|
|
|
QHashData__Node* QHashData_NextNode(QHashData__Node* node) {
|
|
return QHashData::nextNode(node);
|
|
}
|
|
|
|
QHashData__Node* QHashData_PreviousNode(QHashData__Node* node) {
|
|
return QHashData::previousNode(node);
|
|
}
|
|
|
|
void QHashData_Delete(QHashData* self) {
|
|
delete self;
|
|
}
|
|
|
|
QHashDummyValue* QHashDummyValue_new() {
|
|
return new QHashDummyValue();
|
|
}
|
|
|
|
QHashDummyValue* QHashDummyValue_new2(QHashDummyValue* param1) {
|
|
return new QHashDummyValue(*param1);
|
|
}
|
|
|
|
void QHashDummyValue_Delete(QHashDummyValue* self) {
|
|
delete self;
|
|
}
|
|
|
|
void QHashData__Node_Delete(QHashData__Node* self) {
|
|
delete self;
|
|
}
|
|
|