- 26 8月, 2003 6 次提交
-
-
由 Teodor Sigaev 提交于
-
由 Barry Lind 提交于
I think this should fix the problem, but since I don't have a reproducable test case, I can't be sure. This problem is reported by Kim Ho of redhat, who will test this fix. This also includes a test case for the original functionality. Modified Files: jdbc/org/postgresql/jdbc1/AbstractJdbc1Statement.java jdbc/org/postgresql/test/jdbc2/ResultSetTest.java
-
由 Tom Lane 提交于
ACT and ACST were already present. AMT and AMST conflict with the existing entries for Armenia; no change there for the moment.
-
由 Tom Lane 提交于
syntax '040506' for '04:05:06', as well as '0405' for '04:05:00'. This has been broken since 7.2 but was only recently complained of.
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
perform a timestamp-to-date coercion. Instead both routines share a subroutine that delivers the parsing result as a struct tm. This avoids problems with timezone dependency of to_date's result, and should be at least marginally faster too.
-
- 25 8月, 2003 11 次提交
-
-
由 Michael Meskes 提交于
-
由 Bruce Momjian 提交于
> * Add a libpq function to support Parse/DescribeStatement capability
-
由 Bruce Momjian 提交于
-
由 Tatsuo Ishii 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
* Allow TRUNCATE ... CASCADE/RESTRICT
-
由 Barry Lind 提交于
- adds a finalizer method to AbstractJdbc1Statement to clean up in the case of poor user code which fails to close the statement object - fix ant build file to correctly detect dependencies across jdbc1/jdbc2/jdbc3 - fix a coupld of server prepared statement bugs and added regression test for them Applied patch from Kim Ho: - adds support for get/setMaxFieldSize(). Also fixed build.xml to provide a better error message in the event that an older version of the driver exists in the classpath when trying to build.
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
-
- 24 8月, 2003 1 次提交
-
-
由 Tatsuo Ishii 提交于
-
- 23 8月, 2003 6 次提交
-
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
the source tree.
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
expr_lists. This appears to be the only remaining O(N^2) bottleneck in processing many-way 'x IN (a,b,c,...)' conditions.
-
由 Tom Lane 提交于
handling many-way scans: instead of re-evaluating all prior indexscan quals to see if a tuple has been fetched more than once, use a hash table indexed by tuple CTID. But fall back to the old way if the hash table grows to exceed SortMem.
-
- 21 8月, 2003 2 次提交
-
-
由 Teodor Sigaev 提交于
-
由 Peter Eisentraut 提交于
-
- 19 8月, 2003 3 次提交
-
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
as well as the hash function (formerly the comparison function was hardwired as memcmp()). This makes it possible to eliminate the special-purpose hashtable management code in execGrouping.c in favor of using dynahash to manage tuple hashtables; which is a win because dynahash knows how to expand a hashtable when the original size estimate was too small, whereas the special-purpose code was too stupid to do that. (See recent gripe from Stephan Szabo about poor performance when hash table size estimate is way off.) Free side benefit: when using string_hash, the default comparison function is now strncmp() instead of memcmp(). This should eliminate some part of the overhead associated with larger NAMEDATALEN values.
-
由 Tom Lane 提交于
the trigger is attached to in the hashkey. This ensures that we will create separate compiled trees for each table the trigger is used with, avoiding possible datatype-mismatch problems if the tables have different rowtypes. This is essentially the same bug recently identified in plpython --- though plpgsql doesn't seem as prone to crash when the rowtype changes underneath it. But failing robustly is no substitute for just working.
-
- 18 8月, 2003 7 次提交
-
-
由 Bruce Momjian 提交于
> * -Add btree index support for reltime, tinterval, regproc (Tom)
-
由 Tom Lane 提交于
be anything yielding an array of the proper kind, not only sub-ARRAY[] constructs; do subscript checking at runtime not parse time. Also, adjust array_cat to make array || array comply with the SQL99 spec. Joe Conway
-
由 Tom Lane 提交于
No change in behavior, but old code would have failed to detect overrun of MAX_LOCKMODES.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
are now driven by the default btree opclass, rather than assuming that particular operator names have the needed semantics.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
datatype by array_eq and array_cmp; use this to solve problems with memory leaks in array indexing support. The parser's equality_oper and ordering_oper routines also use the cache. Change the operator search algorithms to look for appropriate btree or hash index opclasses, instead of assuming operators named '<' or '=' have the right semantics. (ORDER BY ASC/DESC now also look at opclasses, instead of assuming '<' and '>' are the right things.) Add several more index opclasses so that there is no regression in functionality for base datatypes. initdb forced due to catalog additions.
-
- 17 8月, 2003 4 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
> * Allow PREPARE of cursors
-
由 Bruce Momjian 提交于
This useless routine will removed in 7.5. It's already discussed (see hackers list archive). Karel Zak
-
由 Bruce Momjian 提交于
> * Fix upper()/lower() to work for multibyte encodings >
-