Tom Lane wrote:
Stefan Kaltenbrunner [EMAIL PROTECTED] writes:
animal: lionfishwarnings: 16
scan.l:180: warning, the character range [80-FF] is ambiguous in a
case-insensitive scanner
scan.l:180: warning, the character range [80-FF] is ambiguous in a
case-insensitive scanner
Tom Lane wrote:
Stefan Kaltenbrunner [EMAIL PROTECTED] writes:
some more(I have removed duplicates and ones that should be fixed by
your latest commits though):
I did what I could with this batch. Some comments:
animal: salamander warnings: 27
cash.c: In function `cash_in':
Tom Lane wrote:
[...]
animal: clownfish warnings: 12
dynloader.c, line 4: warning: empty translation unit
postgres.c, line 3758: warning: loop not entered at top
The first of these is not a bug, the second seems to be some weird
aberration in their statement-not-reached detection.
Tom Lane wrote:
Stefan Kaltenbrunner [EMAIL PROTECTED] writes:
ok I did that for a few members (removing all the statement not reached
ones as well as some purely informal notices and all the flex related
warnings) and came up with something similiar to:
[snip]
Yeah, this looks like a good
Howdy,
I'm working on a patch to extend the stats collector to handle stored procedure
statistics (call counts, duration etc). The goal is to make this information
visible via pg_stat functions/views. The collection would be controllable via
stats_function_level GUC and will have minimal
Heikki Linnakangas [EMAIL PROTECTED] writes:
Zdenek Kotala wrote:
I don't see any const keyword there.
Right after that:
where int conv(int num_msg, const struct pam_message **msg, struct
pam_response **resp, void *appdata_ptr);
How confusing...
And the pam_start page he cited earlier
has anyone looked at burstsort
https://sourceforge.net/projects/burstsort
they claim that Copy-Burstsort is a sorting algorithm for strings that
is cache-efficient. Burstsort and its variants are much faster than
Quicksort and Radixsort especially on large datasets. Copy-Burstsort
works best for
Heikki Linnakangas wrote:
Zdenek Kotala wrote:
If I look there
http://www.opengroup.org/onlinepubs/008329799/chap5.htm#tagcjh_06
in Call Back Information section. The structure is defined as
struct pam_conv{ int (*conv) (int, struct pam_message **, struct
pam_response **, void *); void
On Fri, 13 Jul 2007, Zdenek Kotala wrote:
Tom Lane wrote:
Kris Jurka [EMAIL PROTECTED] writes:
So pam_message ** isn't const.
Ah, thanks. I see luna_moth is giving the same warning, so it's still
not const in Solaris 11 either.
Is it worth working around this? It's strictly cosmetic
Stefan Kaltenbrunner wrote:
Zdenek Kotala wrote:
For sun studio -erroff=E_STATEMENT_NOT_REACHED is useful there. If you
want to determine warning tags for each warning add -errtags.
Is that supported on all versions of sun studio(Sun WorkShop 6, Sun
Studio 8,11) we have on the farm ?
Yes.
Zdenek Kotala wrote:
If I look there
http://www.opengroup.org/onlinepubs/008329799/chap5.htm#tagcjh_06
in Call Back Information section. The structure is defined as
struct pam_conv{ int (*conv) (int, struct pam_message **, struct
pam_response **, void *); void *appdata_ptr; };
I don't
Kris Jurka wrote:
On Fri, 13 Jul 2007, Zdenek Kotala wrote:
Tom Lane wrote:
Kris Jurka [EMAIL PROTECTED] writes:
So pam_message ** isn't const.
Ah, thanks. I see luna_moth is giving the same warning, so it's still
not const in Solaris 11 either.
Is it worth working around this? It's
Tom Lane wrote:
Kris Jurka [EMAIL PROTECTED] writes:
So pam_message ** isn't const.
Ah, thanks. I see luna_moth is giving the same warning, so it's still
not const in Solaris 11 either.
Is it worth working around this? It's strictly cosmetic AFAICS.
The main issue in my mind would be how
Stefan Kaltenbrunner wrote:
Peter Eisentraut wrote:
Am Donnerstag, 12. Juli 2007 15:25 schrieb Stefan Kaltenbrunner:
a lot of those are simply noise (like the LOOP VECTORIZED stuff from the
icc boxes or the statement not reached spam from the sun compilers)
but others might indicate real
Tom Lane wrote:
Heikki Linnakangas [EMAIL PROTECTED] writes:
Zdenek Kotala wrote:
I don't see any const keyword there.
Right after that:
where int conv(int num_msg, const struct pam_message **msg, struct pam_response **resp, void *appdata_ptr);
How confusing...
And the pam_start
Hannu Krosing [EMAIL PROTECTED] writes:
has anyone looked at burstsort
https://sourceforge.net/projects/burstsort
they claim that Copy-Burstsort is a sorting algorithm for strings that
is cache-efficient.
If its reason for living is cache efficiency, then I wonder
(1) how well does it work
Hannu Krosing [EMAIL PROTECTED] writes:
has anyone looked at burstsort
https://sourceforge.net/projects/burstsort
they claim that Copy-Burstsort is a sorting algorithm for strings that
is cache-efficient. Burstsort and its variants are much faster than
Quicksort and Radixsort especially on
Chidambaram Janamaddi wrote:
Hello!
Can you please let me know whether postgreSQL has
Distributed Database supporting features?
Which of the Distributed database functionalities are totally or partially
supported among the following ..
This is the hackers
Hello!
Can you please let me know whether postgreSQL has
Distributed Database supporting features?
Which of the Distributed database functionalities are totally or partially
supported among the following ..
- Local autonomy
- No reliance on a central
Kris Jurka wrote:
On Thu, 12 Jul 2007, Tom Lane wrote:
static int pam_passwd_conv_proc(int num_msg, const struct pam_message
** msg,
struct pam_response ** resp, void *appdata_ptr);
which exactly matches what my Fedora 6 pam header file says it should
be. What is it on
Zdenek Kotala wrote:
Stefan Kaltenbrunner wrote:
Peter Eisentraut wrote:
Am Donnerstag, 12. Juli 2007 15:25 schrieb Stefan Kaltenbrunner:
a lot of those are simply noise (like the LOOP VECTORIZED stuff from
the
icc boxes or the statement not reached spam from the sun compilers)
but others
Gregory Stark [EMAIL PROTECTED] writes:
The key to the algorithm is that it uses a trie to bin rows with common
leading prefixes together. This avoids performing redundant comparisons
between those columns later.
Interesting, but doesn't that make it utterly useless for sorting in
non-C
Tom Lane wrote:
Gregory Stark [EMAIL PROTECTED] writes:
The key to the algorithm is that it uses a trie to bin rows with common
leading prefixes together. This avoids performing redundant comparisons
between those columns later.
Interesting, but doesn't that make it utterly useless for
I just took a look at adding gssapi build support on solaris (solaris
10/x86_64, sun studio 10, 64bit build) which seemed easy enough by
educating configure to look for -lgss but while it compiles just fine
the resulting tree will not be able to complete a make check due to
psql(!) segfaulting as
Stefan Kaltenbrunner wrote:
I just took a look at adding gssapi build support on solaris (solaris
10/x86_64, sun studio 10, 64bit build) which seemed easy enough by
educating configure to look for -lgss but while it compiles just fine
the resulting tree will not be able to complete a make
On Fri, 2007-07-13 at 14:11 +0300, Martin Pihlak wrote:
I'm working on a patch to extend the stats collector to handle stored
procedure
statistics (call counts, duration etc). The goal is to make this information
visible via pg_stat functions/views. The collection would be controllable via
Stefan Kaltenbrunner wrote:
I just took a look at adding gssapi build support on solaris (solaris
10/x86_64, sun studio 10, 64bit build) which seemed easy enough by
educating configure to look for -lgss but while it compiles just fine
the resulting tree will not be able to complete a make check
According to http://developer.postgresql.org/index.php/Feature_Matrix,
8.2 has non-blocking CREATE INDEX, which is news to me. Is it correct?
http://developer.postgresql.org/index.php?title=Feature_Matrixoldid=1734
is the version where that was added (very early in the history of the
page).
--
On Fri, 2007-07-13 at 15:38 -0500, Jim C. Nasby wrote:
According to http://developer.postgresql.org/index.php/Feature_Matrix,
8.2 has non-blocking CREATE INDEX, which is news to me. Is it correct?
http://www.postgresql.org/docs/8.2/static/sql-createindex.html
See the CONCURRENTLY clause.
Jim C. Nasby wrote:
According to http://developer.postgresql.org/index.php/Feature_Matrix,
8.2 has non-blocking CREATE INDEX, which is news to me. Is it correct?
CREATE INDEX CONCURRENTLY
:)
Joshua D. Drake
http://developer.postgresql.org/index.php?title=Feature_Matrixoldid=1734
is the
On Fri, Jul 13, 2007 at 01:45:18PM -0700, Joshua D. Drake wrote:
Jim C. Nasby wrote:
According to http://developer.postgresql.org/index.php/Feature_Matrix,
8.2 has non-blocking CREATE INDEX, which is news to me. Is it correct?
CREATE INDEX CONCURRENTLY
Well, I guess it's a good thing
[EMAIL PROTECTED] (Stefan Kaltenbrunner) writes:
Tom Lane wrote:
[...]
animal: clownfish warnings: 12
dynloader.c, line 4: warning: empty translation unit
postgres.c, line 3758: warning: loop not entered at top
The first of these is not a bug, the second seems to be some weird
Patch submitted.
--
Affan Salman
EnterpriseDB Corporation http://www.enterprisedb.com
---(end of broadcast)---
TIP 6: explain analyze is your friend
33 matches
Mail list logo
