Hamann W wrote:
> in unicode letter ä exists in two versions - linux and windows use a
> composite whereas macos prefers
> the decomposed form. Is there any way to make a semi-exact match that
> accepts both variants?
Aside from normalizing the strings into the same normal form
before com
"David G. Johnston" writes:
> On Monday, May 17, 2021, Tom Lane wrote:
>> It looks like it won't be started if you set
>> max_logical_replication_workers = 0.
> I was wondering about that. Would you mind posting a link to the code
> where that is checked? I actually looked though admittedly no
On Mon, May 17, 2021 at 7:37 PM David G. Johnston
wrote:
>
> On Monday, May 17, 2021, Tom Lane wrote:
>>
>> "David G. Johnston" writes:
>> > On Sunday, May 16, 2021, Loles wrote:
>> >> I don't understand why the server starts that process if I'm not using
>> >> replication of any kind.
>>
>> >
On Monday, May 17, 2021, Tom Lane wrote:
> "David G. Johnston" writes:
> > On Sunday, May 16, 2021, Loles wrote:
> >> I don't understand why the server starts that process if I'm not using
> >> replication of any kind.
>
> > It starts the process because at any time someone can execute a “crea
On Mon, 17 May 2021 15:45:00 +0200
Matthias Apitz wrote:
> There is only *one* codepoint for the German letter a Umlaut:
> LATIN SMALL LETTER A WITH DIAERESI U+00E4
True. On the other hand, the sequence:
* U+0061 LATIN SMALL LETTER A
* U+0308 COMBINING DIAERESIS
will render exactly the same gly
On 17 May 2021 13:27:40 -
haman...@t-online.de wrote:
> in unicode letter ä exists in two versions - linux and windows use a
> composite whereas macos prefers the decomposed form. Is there any
> way to make a semi-exact match that accepts both variants?
Actually, re-reading your request, you w
El día lunes, mayo 17, 2021 a las 01:27:40p. m. -, haman...@t-online.de
escribió:
> Hi,
>
> in unicode letter ä exists in two versions - linux and windows use a
> composite whereas macos prefers
> the decomposed form. Is there any way to make a semi-exact match that accepts
> both variants
On 17 May 2021 13:27:40 -
haman...@t-online.de wrote:
> in unicode letter ä exists in two versions - linux and windows use a
> composite whereas macos prefers the decomposed form. Is there any way
> to make a semi-exact match that accepts both variants?
You should probably normalise the string
"David G. Johnston" writes:
> On Sunday, May 16, 2021, Loles wrote:
>> I don't understand why the server starts that process if I'm not using
>> replication of any kind.
> It starts the process because at any time someone can execute a “create
> subscription” command. If no one does so the amo
Hi,
in unicode letter ä exists in two versions - linux and windows use a composite
whereas macos prefers
the decomposed form. Is there any way to make a semi-exact match that accepts
both variants?
This question is not about fulltext but about matching filenames across a
network - I wish to av
Ok, now I know.
Thank you very much to all!!
El lun, 17 may 2021 a las 8:37, David G. Johnston (<
david.g.johns...@gmail.com>) escribió:
> On Sunday, May 16, 2021, Loles wrote:
>
>> I don't understand why the server starts that process if I'm not using
>> replication of any kind.
>>
>>
>> The s
11 matches
Mail list logo