04-26-2005
fflush(stdin) as far as the C99 standard goes has undefined behavior. That means if
it works, wonderful, but you may not always be able to count on it working. The reason is that fflush behavior is defined for output streams but not input streams.
Check your compiler documentation.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I have the following problem. The file contains many lines already sorted according to their first arguments. Some of these first arguments are repetitive. For each first argument value, I need to keep the first and the last line that contain it. For example,
...
1 234
1 348
...
...
5 483... (2 Replies)
Discussion started by: jijibabawu
2 Replies
2. Shell Programming and Scripting
looking for a bit of help with sed.
I have a file that looks a bit like this:
sdfghhjk
asdfdfghgj
asdfhgghj
werdfvtfh
edftbgh
1211211221
sdffgfm
dfghnhjm
dfvfsgbgh
adsfv bdhgn
1111111dffg
dfv1122
dsgvbghn111111
fffffffgbdghn
fffffff
sfgh3333gs vdf (5 Replies)
Discussion started by: robsonde
5 Replies
3. Programming
I was using vim about an hour ago doing abit of python (i only just started using vim). And I think i typed something wrong, and all of a sudden the letter i is always highlighted. Turning syntax off and on didn't work. and i couldent find the solution online.
Thanks in advanced. (1 Reply)
Discussion started by: vimhelp
1 Replies
4. Shell Programming and Scripting
Hi,
I am using a mail application, When I use to check with the command, I will get the outputs as
q -s
6128175 (9, 9/6128175)
Return-path: minka.bell@abcd.org
From: "Minka Bell" <minka.bell@abcd.org>
To: <dcrouch@xyz.org>,
Subject: Open items with new PICT system
Date: Wed,... (12 Replies)
Discussion started by: gsiva
12 Replies
5. Shell Programming and Scripting
I have a list like this:
todu
todo
tofe
tafo
I want to grep only the lines where the 2nd and the 4th character are the same.
In this case I would get only "todo".
Thanks. (3 Replies)
Discussion started by: rlopes
3 Replies
6. Shell Programming and Scripting
I have this script that routinely ssh into another host to collect data from that host.
However we have these annoying boilerplates on all our machines that flood the screen from all the ssh's.
Any way to filter this stdout but allow all the other stdout? In other words, the second you ssh... (4 Replies)
Discussion started by: stevenswj
4 Replies
7. Shell Programming and Scripting
Hi below is the input file, i need to find repeated words and sum up the values of it which is second field from the repeated work.Im trying but getting no where close to it.Kindly give me a hint on how to go about it
Input
fruits,apple,20,fruits,mango,20,veg,carrot,12,veg,raddish,30... (11 Replies)
Discussion started by: 100bees
11 Replies
8. Shell Programming and Scripting
Hi all
if i want to get the 3 lines of the most repeated lines here
tony,1,x
tony,1,x
tony,2,x
tony,2,x
tony,3,x
tony,4,x
tony,5,x
adam,1,y
to get output
tony,1,x
tony,2,x
tony3,x
adam,1,y (3 Replies)
Discussion started by: teefa
3 Replies
9. Shell Programming and Scripting
Hi all ,
i want to get the most repeated column in my file
File:
name,ID
adam,12345 ----1
adam,12345 ----2
adam,934
adam,12345 ----3
john,14
john,13
john,25 ----1
john,25 ----2
tom,1 -----1
tom,2 -----1
so my output to be (5 Replies)
Discussion started by: teefa
5 Replies
10. UNIX for Dummies Questions & Answers
I have a requirement where I have to read the lines between a repeated string
FileName: abc.txt
ls /data/abc.txt
1
2
#ZENCO
3
4
5
6
#ZENCO
11
213
454
7
#ZENCO (8 Replies)
Discussion started by: eskay
8 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)