Re: Range types
От | Nicolas Barbier |
---|---|
Тема | Re: Range types |
Дата | |
Msg-id | b0f3f5a10912150716g6d0b8f6at11074035a6c6cf06@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: Range types (Tom Lane <tgl@sss.pgh.pa.us>) |
Ответы |
Re: Range types
Re: Range types |
Список | pgsql-hackers |
2009/12/15 Tom Lane <tgl@sss.pgh.pa.us>: > tomas@tuxteam.de writes: > >> (and as Andrew Dunstan pointed out off-list: I was wrong with my bold >> assertion that one can squeeze infinitely many (arbitrary length) >> strings between two given. This is not always the case). > > Really? If the string length is unbounded I think you were right. Assuming lexicographical ordering (first different character determines order; end-of-string is sorted before anything else), consider the following two strings: <whatever> and <same whatever as before> + the character with the lowest value in lexicographical ordering. I don't think it is possible to get anything in between those two strings. Nicolas
В списке pgsql-hackers по дате отправления: