- 11 1月, 2002 4 次提交
-
-
由 Bruce Momjian 提交于
-
由 Peter Eisentraut 提交于
footnote count.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 10 1月, 2002 10 次提交
-
-
由 Michael Meskes 提交于
-
由 Bruce Momjian 提交于
setting.
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
pgsql-hackers discussion of this date.
-
由 Tom Lane 提交于
the difference between a run-time type cast and casting a literal string to a specific type. Minor editorial work in same area.
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
Oliver Elphick. A few other minor cleanups while at it.
-
由 Tom Lane 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 09 1月, 2002 14 次提交
-
-
由 Bruce Momjian 提交于
-
由 Peter Eisentraut 提交于
And listing QNX 6 as both supported and unsupported is probably not helpful.
-
由 Tom Lane 提交于
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
pg_regress doesn't see it and you don't get any port-specific comparisons.
-
由 Peter Eisentraut 提交于
-
由 Bruce Momjian 提交于
< * Thomas is Thomas Lockhart <lockhart@alumni.caltech.edu> --- > * Thomas is Thomas Lockhart <lockhart@fourpalms.org>
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
-
由 Peter Eisentraut 提交于
the info to the main bibliography.
-
由 Tom Lane 提交于
multibyte encodings.
-
由 Peter Eisentraut 提交于
-
- 08 1月, 2002 9 次提交
-
-
由 Tom Lane 提交于
-
由 Peter Eisentraut 提交于
-
由 Michael Meskes 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
Marko Kreen says: This is so obvious that I would like to make it 'official'. Seems like the theology around bytea<>text casting kept me from seeing the simple :)
-
由 Tom Lane 提交于
granted the lock when awakened; the signal now only means that the lock is potentially available. The waiting process must retry its attempt to get the lock when it gets to run. This allows the lock releasing process to re-acquire the lock later in its timeslice. Since LWLocks are usually held for short periods, it is possible for a process to acquire and release the same lock many times in a timeslice. The old spinlock-based implementation of these locks allowed for that; but the original coding of LWLock would force a process swap for each acquisition if there was any contention. Although this approach reopens the door to process starvation (a waiter might repeatedly fail to get the lock), the odds of that being a big problem seem low, and the performance cost of the previous approach is considerable.
-
由 Michael Meskes 提交于
-
- 07 1月, 2002 3 次提交
-
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
to the client before closing the connection. Before 7.2 this was done correctly, but new code would simply close the connection with no report to the client.
-
由 Bruce Momjian 提交于
-