Is realy so much software necessary? Isnt enough the ghostscript driver?
Not posssible without cups?
Rodrigo.
skin...@britvault.co.uk (Craig Skinner) wrote:
The HP LaserJet 1100 has been working with CUPS when connected to an old
[...]
Long version for others with this printer (2
I wrote:
[...] Why should
be difficult to track the indices in yytext of the beginning and the end
of each matching subexpression, in two arrays of integers (one for
the beginning and one for the end)? [...]
More exactly: in the first array the index of the first element of
the matching
Otto Moerbeek o...@drijf.net wrote:
Refering to subpatterns is not available in flex. I suppose it is not
available since it would require a more complex re engine.
Interpretation of the lexical value should be hand-crafted.
I also though caomplexity can be the reason, but I have doubts.
Otto Moerbeek o...@drijf.net wrote:
Tradiotionally, { } pattersn are not part of awk re's.
Posix added them, but we do not include them afaik. Gnu awk only accepts
them if given an extra arg (--posix or --re-interval).
I think this should be documented.
Although there is a clear theory
Dear Sirs!
I am having a problem with the above command. I am using an older
version of OpenBSD, but perhaps the problem is also in newer versions.
Experiment:
(1) Write a file with 5 lines, each containg only the character a.
(2) apply the following two lines command:
g/a/\
d
Does it
Andreas Kusalananda Kähäri andreas.kah...@icm.uu.se wrote:
g/a/\
d
The command that you give is, according to the manual, equivalent to
g/a/p\
d
(since A newline alone in command-list is equivalent to a p command).
So, it prints all lines matching /a/ and then deletes them.
Invoking ed -s file.txt, where file does not contain a newline at the
end, sends to stderr in spite of -s flag: newline appended. Is this
normal behaviour?
Does ed/sed spoil files with non ascii bytes (for example unicode characters)?
By experience seems to me that they, as also lex, do not
I have just discovered this nice, fast emacs imitate. The man page
says:
CAVEATS
Since it is written completely in C, there is currently no language in
which you can write extensions; however, you can rebind keys and change
certain parameters in startup files.
[...]
In my
On Thu, 9 Apr 2015, Marcus MERIGHI mcmer-open...@tor.at wrote:
Sorry, no. But I can confirm failure. Are you sure AT+GCAP is the
right command? I'd be interested in such a fax-capable device as well...
+GCAP is a standard command to ask capabilities, see for example:
I have an elementary question about serial ports. Perhaps someone here
have the answer, as he perhaps knows, how the driver works.
I observed that two modems attached to the DSUB9 (RS232 Serial) behave
different.
I can speak with the Elsa Microlink 33.6TQV with almost any
speed (using cu
On Sun, 14 Sep 2014, Stuart Henderson wrote:
Personally I'd go for a modern cheap PC based on a soldered-on Atom,
Celeron or AMD Fusion type system.
I use an old Celeron 800 Mhz, and thinking to downgrade to 500Mhz,
to a geode LX 800. OpenBSD seems to run OK there, I tried it as
diskless. I
On Thu, 18 Sep 2014, Christer Solskogen wrote:
This one: http://www.pcengines.ch/apu.htm ?
No. It was a ready 19 server. But this is also an interesting piece
of hardware.
The power consume, noise and reliability also depends on the power supply.
My Asus M35M1-M consumes much more than what
patrick keshishian pkesh...@gmail.com wrote:
[...]
| ... the NSA has more than 1,000 experts
| devoted to ferreting out such flaws using
| sophisticated analysis techniques, many of them
| classified. The agency found Heartbleed shortly
| after its introduction, according to one of the
|
John Moser john.r.mo...@gmail.com wrote:
On Thu, Apr 10, 2014 at 4:18 PM, John Moser john.r.mo...@gmail.com wrote:
Also why has nobody corrected me on this yet? I've read El Reg's
analysis, and they missed a critical detail that I didn't see until I read
the code in context: IT
On Mon, 7 Oct 2013, James Griffin wrote:
[...] But when people don't listen, or continuosly repeat themselves
unnecessarily, the discussion digresses and becomes irrelevent and/or
annoying for those of us subscribed to the list. That's the point I
tried to make. Anyway, this is digressing
dera...@cvs.openbsd.org wrote:
Layers of hurt being thrown around. Why?
This is a legitim question.
Since I am here, I think I received twice an Email from you: I
remember you as a polite person. But I did read a little of what
people write about you arround.
Some weeks ago a question of
Predrag Punosevac punoseva...@gmail.com wrote:
On 2013-09-26 Thu 10:15 AM |, Roberto E. Vargas Caballero wrote:
I use mutt basically because it has threading support, and I cannot
live without it.
NetBSD version of mailx does support threading as well
mayur...@devio.us (Mayuresh Kathe) wrote:
hi, how do mailx users currently handle mime?
I use nail. I think metamail OpenBSD port was broken, I tried it
long ago and do not remember.
Rodrigo.
Eric Johnson eri...@mathlab.gruver.net wrote:
On Wed, 25 Sep 2013, Dmitrij D. Czarkoff wrote:
Mayuresh Kathe said:
hi, how do mailx users currently handle mime?
They don't. They install mutt, s-nail or whatever.
pine/alpine
Alpine is what I normally use. As imap client very nice,
Dmitrij D. Czarkoff czark...@gmail.com wrote:
And you don't need threaded view for IMAP?
I dont need it, because I never had it and never used it. Perhaps a
good thing to have.
For reading IMAP it would be nice to have the possibility to mount the
remote folder as a local file (no work in
Predrag Punosevac punoseva...@gmail.com wrote:
That is not true! NetBSD version of mailx does support MIME. Porting
[...]
I looked the NetBSD code and most likely it would talk one afternoon for
an experienced OpenBSD hacker to compile that thing on OpenBSD.
But what speaks against my
On Fri, 20 Sep 2013, Johan Mellberg wrote:
Your error in thinking is that if we have an extremely large set of strings,
a very large set is mapped to each hash value. Therefore you reason that a
collision is very likely. But if you are comparing two specific strings, the
likelihood of them
Andreas Gunnarsson o-m...@zzlevo.net wrote:
On Thu, Sep 19, 2013 at 01:46:20PM +, hru...@gmail.com wrote:
Raimo, if people believe that hash(A)=hash(B) implies A=B, so strong
believe, that they use it in their programs,
It's a matter of engineering. Usually that is good enough.
If
Janne Johansson icepic...@gmail.com wrote:
In practical terms, if I rsync a file from X to Y, and rsync says it is
complete, how to verify the 4G files actually are equal?
Given that rsync only knows that hash(A) was equal to hash(B) at the end,
what do you propose to use for verification?
I want to give a hint for those working till now in the problem of
estimating the probability of A=B under the condition of hash(A)=hash(B).
Just suppose that hash is any function from a set X to Y, first suppose
that X is finite (but very big), and that the probability to pick any
element is
Raimo Niskanen raimo+open...@erix.ericsson.se wrote:
Rodrigo,
was there anything wrong with my answer below (and others equal),
apart from it not being the one you wanted, since you keep repeating
the same question over and over again?
Do you have a better answer? Please share it for us
Henning Brauer lists-open...@bsws.de wrote:
* hru...@gmail.com hru...@gmail.com [2013-09-16 21:33]:
It confirms that it supposes: A=B if hash(A)=hash(B).
which is fine even with a relatively poor hash like md5 when the size
is also checked.
A=B because parts of the file in the server
What was the probability?
Rodrigo.
Eric Furman ericfur...@fastmail.net wrote:
Troll, the question has been answered.
You are an entertaining troll, though.
It is highly amusing seeing someone make themselves look so silly.
On Tue, Sep 17, 2013, at 11:28 AM, hru...@gmail.com wrote:
Marc
Alexander Hall alexan...@beard.se wrote:
Marc already anwered all your questions. Let me quote it.
Fuck off
The most brilliant answers of the experts:
Date: Tue, 17 Sep 2013 19:18:03 +0200
From: Marc Espie es...@nerim.net
To: hru...@gmail.com
Cc:
Alexander Hall alexan...@beard.se wrote:
Leaving the internals of rsync aside (of which I assume much but *know*
little), if I consider two 4TB blobs to be equal just because they have
the same SHA1 hash, I can easily see myself ending up in one of these
conditions (but not both):
This
Marc Espie es...@nerim.net wrote:
On Mon, Sep 16, 2013 at 08:16:50PM +, hru...@gmail.com wrote:
Marc Espie es...@nerim.net wrote:
From a checksum I expect two things: (1) the pre-images of elements
in the range have all similar sizes,
Why ? This makes no sense, and is in
Raimo Niskanen raimo+open...@erix.ericsson.se wrote:
When you have two different real world contents the collision probability
is just that; 2^-160 for SHA-1. It is when you deliberately craft a
second content to match a known hash value there may be weaknesses
in cryptographic hash
Marc Espie es...@nerim.net wrote:
On Tue, Sep 17, 2013 at 07:23:07AM +, hru...@gmail.com wrote:
In the case of rsync the hash is applied to strings of a fixed lenth.
In this case the input is finite and we can argue with cardinality.
Just imagine the set finite strings mapped to a
I wrote to the list. If you have something to say about the thema,
then please to the list. Your impolite mails are not welcome in
my mailbox.
Rodrigo.
Jan Stary h...@stare.cz wrote:
On Sep 17 13:21:04, hru...@gmail.com wrote:
Raimo Niskanen raimo+open...@erix.ericsson.se wrote:
When
Intentionally I left the problem generic. Is the probability near to 1?
You can suppose that A is 500 bytes long, that the server knows the hash
value of A (but not A), that it searchs only strings of this
length with the same hash value, that it found such a string
B, that the hash function is
Marc Espie es...@nerim.net wrote:
You have strings A and B, and you know only that hash(A)=hash(B): what
is the probability that A=B? 2^-160?
No, that's never the problem.
You have a *given* string A, and another string B.
O.K. You have string A in the client with hash(A)=n. You find
Kenneth R Westerback kwesterb...@rogers.com wrote:
And your endless meanderings around the pointless questions you pose
are not welcome on the list. They certainly have NOTHING to do with
OpenBSD.
What you say in the last sentence is exactly what I hope. One
of my questions was:
This is a
Raimo Niskanen raimo+open...@erix.ericsson.se wrote:
A resembling application is the Git version control system that is
based on the assumption that all content blobs can be uniquely
decribed by their 128-bit SHA1 hash value. If two blobs have
the same hash value they are assumed to be
Marc Espie es...@nerim.net wrote:
From a checksum I expect two things: (1) the pre-images of elements
in the range have all similar sizes,
Why ? This makes no sense, and is in contradiction with (2).
I must correct my previous mail. The Domain is numerable, to speak
about cardinality as
Marc Espie es...@nerim.net wrote:
And now we are back to my starting poit. The checksum is not used
in rsync as a pure checksum to find accidental errors. That was my
critic.
No, it is. Really. Read the papers. Do your homework, check the maths.
I have read this:
Dear Sirs!
I have a question, perhaps a little of-topic, but it arose as I
read about cvsync in openbsd web page. And OpenBsd people sure know
a lot about cryptography :)
Does rsync suppose that a part of a file in the server is equal to
a part of a file in the client, if a hash value of these
Kenneth R Westerback kwesterb...@rogers.com wrote:
People use cvsync or rsync to create/maintain a local copy or copies
[...]
Not sure what your 'reliable' metrics are, but works for me.
My question was not about what people do or if it works (till now)
for you. It was about the algorithm.
Marc Espie es...@nerim.net wrote:
On Sat, Sep 14, 2013 at 03:09:48PM +, hru...@gmail.com wrote:
A completely other thing is to conclude that two *arbitrary* pieces of
data are the same only because they have the same hash. Arbitrary
means here that the one was not a copy of the
Marc Espie es...@nerim.net wrote:
I consider 1/2^128 to be *vanishingly small*.
Christian Weisgerber mentions that a relative small range of
the hash function would be a problem, but a big range is not
enough: the whole depends on the hash function itself. But this would
be a big discussion:
Dear Sirs!
I managed to boot OpenBSD 5.3 in a Fujitsu Siemens Futro A220 (AMD Geode
LX800) thin client from a Celeron Machine running OpenBSD 4.8.
I followed what I read in DISKLESS(8) and PXEBOOT(8) almost blindly,
without understandig very much. Perhaps the pages could be more
understandable.
Miod Vallat m...@online.fr wrote:
Thanks for the good tips!
I think the bootparams swap file information will be used correctly (I
remember seeing a fix in this area some time ago). It doesn't hurt
anyway to mention it in /etc/fstab with the nfsmntpt option.
OK, both, swap and rootfs, again
46 matches
Mail list logo
