They probably do, but only for database-related products, or maybe for software
in general. Trademarks are industry-specific.
Andy
> On Dec 13, 2019, at 9:22 PM, kddavidson...@gmail.com wrote:
>
> I would be surprised if they have a legal claim to "Ora" as well, otherwise
> the dental products
In looking back over some of these old conversations about converting C to
Go, I realized that there is some confusion about the different programs
named "c2go". There are basically 2:
rsc/c2go is the program that was used to convert the Go runtime, compiler,
and linker from C to Go. It is not
paragraphs of documentation
explaining what it does and how to use it would really help.
Andy
> On Apr 6, 2020, at 9:16 AM, Jan Mercl <0xj...@gmail.com> wrote:
>
> On Mon, Apr 6, 2020 at 6:08 PM Andy Balholm wrote:
>>
>> In looking back over some of these old conversa
The problem is that the function’s return type is already *os.File (rather than
io.WriteCloser or some other interface), so the type assertion is pointless.
Andy
> On May 7, 2020, at 5:09 AM, André kouamé wrote:
>
> Hi,
>
> I want to check, if the value return by my function has the type *os
I think by “at compile time” he means at JIT time (when converting bytecode to
machine language).
Andy
> On Jun 4, 2020, at 1:02 PM, Robert Engels wrote:
>
> The author either doesn’t know Java or had significant editing errors - Java
> determines uses the runtime processor type to optimize
hat regex?
>
>> On Jun 11, 2020, at 11:01 AM, Andy Balholm wrote:
>>
>> It’s apparently quadratic in some cases. Yesterday fuzzing on
>> github.com/andybalholm/cascadia <http://github.com/andybalholm/cascadia>
>> found an input that triggered a timeout.
ime is roughly quadratic in the number of repetitions.
Andy
> On Jun 11, 2020, at 12:55 PM, Andy Balholm wrote:
>
> Obviously any reasonable input validation or length limit would disallow it.
>
> The time requirement is only quadratic, not exponential, so it takes
> rid
Java.
> Any recommendations for Go profilers for this work would be appreciated.
>
> Ray
>
>
>
>
> On Thu, Jun 11, 2020 at 1:36 PM Andy Balholm <mailto:andybalh...@gmail.com>> wrote:
> Here is a simpler reproducer: https://play.golang.org/p/82UBmyfyqV-
> &l
Right. That’s why I left the double bar in my example.
Basically all the time is spent appending to a linked list in
regexp/syntax.patchlist.append. Which makes sense, because appending to a
linked list when you only have a head pointer is O(n) in the length of the
list. So building the whole
exp/syntax/compile.go>
>
> Using a singly linked list with a pointer to the tail pointer would give
> constant time append
>
> Ray
>
> On Thu, Jun 11, 2020 at 5:40 PM Andy Balholm <mailto:andybalh...@gmail.com>> wrote:
> Right. That’s why I left the double bar in my
I would be surprised if there were any performance differences (unless
you configured the client differently), since the only difference is
whether you're using a global client that you created or one that the
http package created.
Andy
On 11/30/20 9:58 AM, jun min wrote:
I'm make a simple ht
By the way, this existed at one point. Early versions of the Go
toolchain included C compilers (6c, 8c, etc.) designed to work together
nicely with Go code. If I remember right, most of the Go runtime was
written in C, and compiled with these compilers. But they used an
unusual dialect of C (wh
It is likely a code for GOARCH=amd64. Back in the distant past, there
were separate Go compilers for different CPU architectures. The one for
amd64 was 6g, for 386 it was 8g, etc.
It looks like the x86 directory is code that was originally written for
amd64, and then generalized to cover 386 a
You don't need a full PostScript interpreter to use a Type 1 font. They
use a very limited subset of PS.
To embed one in a PDF, I don't think you need to parse it at all, if you
know the metrics and the encoding already. You can just embed it as a
binary blob, if I'm not mistaken.
Andy
On 9
Many data-compression schemes are conceptually composed of two steps:
LZ77 (finding repeated sequences) and entropy encoding. But I've never
found a compression library that treats those steps as separate
components. So I made one: github.com/andybalholm/pack. It defines
interfaces for the two
I would guess that in the case of AST nodes, you're likely more interested
in the *identity* of the nodes than their *values*. In that case, you
should use the pointers to the nodes as your map keys.
If the *values* truly are what you care about, use the go/format package to
convert the node ba
On both of them, someone did a mention of @mpvl (Marcel van Lohuizen), so I
assume he is the primary maintainer of the package, and everyone else is
waiting for him to do something.
Andy
On Thursday, March 20, 2025 at 6:23:09 AM UTC-7 Patrick wrote:
> Hello all,
>
> I have opened two issues fo
101 - 117 of 117 matches
Mail list logo
