- 20 8月, 2000 4 次提交
-
-
由 Peter Eisentraut 提交于
PGLIB or use any option anymore.
-
由 Peter Eisentraut 提交于
unsupported platforms.
-
由 Tom Lane 提交于
CREATE INDEX fooi ON foo (lower(f1)) where f1 is varchar rather than text.
-
由 Peter Eisentraut 提交于
reported by Mark Hollomon
-
- 13 8月, 2000 1 次提交
-
-
由 Tom Lane 提交于
right thing with variable-free clauses that contain noncachable functions, such as 'WHERE random() < 0.5' --- these are evaluated once per potential output tuple. Expressions that contain only Params are now candidates to be indexscan quals --- for example, 'var = ($1 + 1)' can now be indexed. Cope with RelabelType nodes atop potential indexscan variables --- this oversight prevents 7.0.* from recognizing some potentially indexscanable situations.
-
- 12 8月, 2000 6 次提交
-
-
由 Tom Lane 提交于
take 'em out of pg_operator. Also remove from scan.l's set of legal operator characters. Update documentation.
-
由 Tom Lane 提交于
as UPDATE foo SET arr[3] = 42.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
including utility statements. Still can't copy or compare executor state, but at present that doesn't seem to be necessary. This makes it possible to execute most (all?) utility statements in plpgsql. Had to change parsetree representation of CreateTrigStmt so that it contained only legal Nodes, and not bare string constants.
-
由 Tom Lane 提交于
first place :-(
-
由 Tom Lane 提交于
backwards compatibility with old behavior.
-
- 10 8月, 2000 1 次提交
-
-
由 Hiroshi Inoue 提交于
are running.
-
- 09 8月, 2000 1 次提交
-
-
由 Thomas G. Lockhart 提交于
-
- 08 8月, 2000 4 次提交
-
-
由 Tom Lane 提交于
from Param nodes, per discussion a few days ago on pghackers. Add new expression node type FieldSelect that implements the functionality where it's actually needed. Clean up some other unused fields in Func nodes as well. NOTE: initdb forced due to change in stored expression trees for rules.
-
由 Philip Warner 提交于
-
由 Tom Lane 提交于
as MaxHeapAttributeNumber. Increase MaxAttrSize to something more reasonable (given what it's used for, namely checking char(n) declarations, I didn't make it the full 1G that it could theoretically be --- 10Mb seemed a more reasonable number). Improve calculation of MaxTupleSize.
-
由 Tom Lane 提交于
-
- 07 8月, 2000 10 次提交
-
-
由 Philip Warner 提交于
CVs: ----------------------------------------------------------------------
-
由 Philip Warner 提交于
-
由 Thomas G. Lockhart 提交于
are allowed in the func_name production. Otherwise, we can't define more like() and ilike() functions for new data types.
-
由 Thomas G. Lockhart 提交于
If the backslash default is still wanted, just pass a backslash to MatchText() for the two-parameter callable routines.
-
由 Thomas G. Lockhart 提交于
-
由 Thomas G. Lockhart 提交于
-
由 Tom Lane 提交于
that RAND_MAX applies to them, since it doesn't. Instead add a config.h parameter MAX_RANDOM_VALUE. This is currently set at 2^31-1 but could be auto-configured if that ever proves necessary. Also fix some outright bugs like calling srand() where srandom() is appropriate.
-
由 Thomas G. Lockhart 提交于
rather than the "~~" operator; this made it easy to add ESCAPE features. Implement ILIKE, NOT ILIKE, and the ESCAPE clause for them. afaict this is not MultiByte clean, but lots of other stuff isn't either. Fix up underlying support code for LIKE/NOT LIKE. Things should be faster and does not require internal string copying. Update regression test to add explicit checks for LIKE/NOT LIKE/ILIKE/NOT ILIKE. Remove colon and semi-colon operators as threatened in 7.0. Implement SQL99 COMMIT/AND NO CHAIN. Throw elog(ERROR) on COMMIT/AND CHAIN per spec since we don't yet support it. Implement SQL99 CREATE/DROP SCHEMA as equivalent to CREATE DATABASE. This is only a stopgap or demo since schemas will have another implementation soon. Remove a few unused production rules to get rid of warnings which crept in on the last commit. Fix up tabbing in some places by removing embedded spaces.
-
由 Thomas G. Lockhart 提交于
rather than the "~~" operator; this made it easy to add ESCAPE features. Implement ILIKE, NOT ILIKE, and the ESCAPE clause for them. afaict this is not MultiByte clean, but lots of other stuff isn't either. Fix up underlying support code for LIKE/NOT LIKE. Things should be faster and does not require internal string copying. Update regression test to add explicit checks for LIKE/NOT LIKE/ILIKE/NOT ILIKE. Remove colon and semi-colon operators as threatened in 7.0. Implement SQL99 COMMIT/AND NO CHAIN. Throw elog(ERROR) on COMMIT/AND CHAIN per spec since we don't yet support it. Implement SQL99 CREATE/DROP SCHEMA as equivalent to CREATE DATABASE. This is only a stopgap or demo since schemas will have another implementation soon. Remove a few unused production rules to get rid of warnings which crept in on the last commit. Fix up tabbing in some places by removing embedded spaces.
-
由 Thomas G. Lockhart 提交于
Allow this in the parser and in pg_dump, but it is probably not enough for a complete solution. Better to have the feature started then never here.
-
- 06 8月, 2000 4 次提交
-
-
由 Tom Lane 提交于
that giving pg_proc a toast table required solving the same problems we'd have to solve for pg_class --- pg_proc is one of the relations that gets bootstrapped in relcache.c. Solution is to go back at the end of initialization and read in the *real* pg_class row to replace the phony entry created by formrdesc(). This should work as long as there's no need to touch any toasted values during initialization, which seems a reasonable assumption. Although I did not add a toast-table for every single system table with a varlena attribute, I believe that it would work to just do ALTER TABLE pg_class CREATE TOAST TABLE. So anyone who's really intent on having several thousand ACL entries for a rel could do it. NOTE: I didn't force initdb, but you must do one to see the effects of this patch.
-
由 Tom Lane 提交于
thing when there are multiple result relations. Formerly, during something like 'UPDATE foo*', foo's constraints and *only* foo's constraints would be applied to all foo's children. Wrong-o ...
-
由 Tom Lane 提交于
Without this, an elog during cache-entry load leaves that catcache unusable. elog in that segment of code is pretty unusual but it can happen.
-
由 Tom Lane 提交于
multiple times in the parsetree (can happen in COALESCE or BETWEEN contexts, for example). This is a pretty grotty solution --- it will do for now, but perhaps we can do better when we redesign querytrees. What we need is a consistent policy about whether querytrees should be considered read-only structures or not ...
-
- 05 8月, 2000 5 次提交
-
-
由 Bruce Momjian 提交于
Ooops, I forget... here it is again. > > > If encoding is not supported returns ERROR. and if multibyte not enabled too.... Thanks. Karel ~
-
由 Philip Warner 提交于
-
由 Philip Warner 提交于
- disable triggers prior to BLOB load - better query for loading blob xrefs - Fixes to error handling code
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 04 8月, 2000 4 次提交
-
-
由 Bruce Momjian 提交于
- encode 'text' from database encoding to ASCII to_ascii('\256\341k') to_ascii( text, int4 ) - encode 'text' from 'int4' encoding to ASCII to_ascii('\256\341k', 8) to_ascii( text, name ) - encode 'text' from 'name' encoding to ASCII to_ascii('\256\341k', 'LATIN2') Now is supported LATIN1, LATIN2, WIN1250. For other character sets I haven't good resources. Add new encoding is easy... If encoding is not supported returns ERROR. Note --- not exists total corect conversion to ASCII, this function try convert chars those is _probably_ interpret-able in ASCII for others use ' '. But for example for all Czech characters it is sufficient ... hmm Chinese / JAP and other complicated langs have bad luck here :-( Karel
-
由 Hiroshi Inoue 提交于
-
由 Tom Lane 提交于
trying to toast tuples inserted into toast tables! Fix is two-pronged: first, ensure all columns of a toast table are marked attstorage='p', and second, alter the target chunk size so that it's less than the threshold for trying to toast a tuple. (Code tried to do that but the expression was wrong.) A few cosmetic cleanups in tuptoaster too. NOTE: initdb forced due to change in toaster chunk-size.
-
由 Tom Lane 提交于
on myself to do something about the non-self-consistency of the inet comparison functions. The results are probably still semantically wrong (inet and cidr should have different comparison semantics, I think) but at least the boolean operators now agree with each other and with the sort order of indexes on inet/cidr.
-