Home
last modified time | relevance | path

Searched refs:item_exists (Results 1 – 25 of 112) sorted by relevance

12345

/dports/databases/py-sqlalchemy14/SQLAlchemy-1.4.27/test/sql/
H A Dtest_ddlemit.py16 def _mock_connection(self, item_exists): argument
18 return item_exists(name)
21 return item_exists(idxname)
38 connection = self._mock_connection(item_exists)
50 connection = self._mock_connection(item_exists)
191 True, [i1], item_exists=lambda idx: True
198 True, [i1], item_exists=lambda idx: False
205 False, [i1], item_exists=lambda idx: True
219 True, [i1], item_exists=lambda idx: True
226 True, [i1], item_exists=lambda idx: False
[all …]
/dports/databases/py-sqlalchemy11/SQLAlchemy-1.1.18/test/sql/
H A Dtest_ddlemit.py10 def _mock_connection(self, item_exists): argument
12 return item_exists(name)
23 connection = self._mock_connection(item_exists)
31 connection = self._mock_connection(item_exists)
93 t1, t2], item_exists=lambda t: t in (
130 item_exists=lambda t: t not in (
141 item_exists=lambda t: t in (
161 item_exists=lambda t: t not in (
172 item_exists=lambda t: t in (
183 item_exists=lambda t: t not in (
[all …]
/dports/databases/py-sqlalchemy10/SQLAlchemy-1.0.14/test/sql/
H A Dtest_ddlemit.py10 def _mock_connection(self, item_exists): argument
12 return item_exists(name)
23 connection = self._mock_connection(item_exists)
31 connection = self._mock_connection(item_exists)
93 t1, t2], item_exists=lambda t: t in (
130 item_exists=lambda t: t not in (
141 item_exists=lambda t: t in (
161 item_exists=lambda t: t not in (
172 item_exists=lambda t: t in (
183 item_exists=lambda t: t not in (
[all …]
/dports/databases/py-sqlalchemy12/SQLAlchemy-1.2.19/test/sql/
H A Dtest_ddlemit.py15 def _mock_connection(self, item_exists): argument
17 return item_exists(name)
30 self, checkfirst, tables, item_exists=lambda item: False argument
32 connection = self._mock_connection(item_exists)
42 self, checkfirst, tables, item_exists=lambda item: True argument
44 connection = self._mock_connection(item_exists)
112 False, [t1], item_exists=lambda t: t not in ("t1",)
160 True, [], item_exists=lambda t: t not in ("t2", "t4")
168 True, [], item_exists=lambda t: t in ("t2", "t4")
192 True, None, item_exists=lambda t: t in ("t2", "t4")
[all …]
/dports/databases/py-sqlalchemy13/SQLAlchemy-1.3.24/test/sql/
H A Dtest_ddlemit.py15 def _mock_connection(self, item_exists): argument
17 return item_exists(name)
30 self, checkfirst, tables, item_exists=lambda item: False argument
32 connection = self._mock_connection(item_exists)
42 self, checkfirst, tables, item_exists=lambda item: True argument
44 connection = self._mock_connection(item_exists)
112 False, [t1], item_exists=lambda t: t not in ("t1",)
160 True, [], item_exists=lambda t: t not in ("t2", "t4")
168 True, [], item_exists=lambda t: t in ("t2", "t4")
192 True, None, item_exists=lambda t: t in ("t2", "t4")
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/src/corelib/tools/
H A Dqiterator.h120 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
141 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
142 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
160 inline bool item_exists() const { return n != c.constEnd(); } \
174 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
175 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
193 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
213 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
214 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
215 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/x11-toolkits/qt5-gui/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sqldrivers-sqlite2/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sqldrivers-tds/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sqldrivers-sqlite3/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sql/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sqldrivers-mysql/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sqldrivers-odbc/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sqldrivers-ibase/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/databases/qt5-sqldrivers-pgsql/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/net/qt5-network/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/textproc/qt5-xml/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/x11-toolkits/qt5-widgets/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/devel/qt5-testlib/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/devel/qt5-dbus/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/devel/qt5-buildtools/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/devel/qt5-concurrent/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/devel/qt5-qmake/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/print/qt5-printsupport/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
/dports/graphics/qt5-opengl/kde-qtbase-5.15.2p263/src/corelib/tools/
H A Dqiterator.h86 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
104 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
105 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
122 inline bool item_exists() const { return n != c.constEnd(); } \
137 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
138 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \
155 inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } \
174 inline T &value() { Q_ASSERT(item_exists()); return *n; } \
175 inline const T &value() const { Q_ASSERT(item_exists()); return *n; } \
176 inline const Key &key() const { Q_ASSERT(item_exists()); return n.key(); } \

12345