10 More Discussions You Might Find Interesting
1. Programming
Hi all,
How am I read a file, find the match regular expression and overwrite to the same files.
open DESTINATION_FILE, "<tmptravl.dat" or die "tmptravl.dat";
open NEW_DESTINATION_FILE, ">new_tmptravl.dat" or die "new_tmptravl.dat";
while (<DESTINATION_FILE>)
{
# print... (1 Reply)
Discussion started by: jessy83
1 Replies
2. Shell Programming and Scripting
Hi,
I am getting a string in the file, I want to parse the srting and extract the percentage from the string. Sample string are -
ASAD112_sd12.34%adnmfk
ASAsds_1.34%adnmfk
ASAdf 2 sd12.34%adnmfk
ASAD112_sd 12.34% adnmfk
ASAD112_sd12.34% adnmfk
I want to extract the numeric value... (3 Replies)
Discussion started by: meetvipin
3 Replies
3. Shell Programming and Scripting
#! /bin/csh
set umr=UMR
foreach i ( `ls`)
set file_nm=$i
set bh_nm=`echo $file_nm | cut -d"_" -f2`
if($bh_nm !=$umr) then
{
set bh_ext=`echo $file_nm | cut -d"_" -f4`
set bh_num_nm="$bh_nm $bh_ext a .txt"
mv $file_nm $bh_num_nm
}
... (1 Reply)
Discussion started by: jdsignature88
1 Replies
4. Shell Programming and Scripting
Hi,
I would like to know if the parameter i am passing to a shell script is contain
the following charachter : ASM.
I belive that i should use regular expresion here.
Can one help ?
Bellow is the "if statment" i need to fix with the reg exp:
if ; then
#echo "IT IS AN RDBMS... (4 Replies)
Discussion started by: yoavbe
4 Replies
5. UNIX for Dummies Questions & Answers
In regular expressions with grep(or egrep), ^ works if we want something in starting of line..but what if we write ^^^ or ^ for pattern matching??..Hope u all r familiar with regular expressions for pattern matching.. (1 Reply)
Discussion started by: aadi_uni
1 Replies
6. Shell Programming and Scripting
Here's my script
read number
if echo $number | grep ""
I want this "if" statement to return true only when numbers without letters is matched.
For example 45 - true, 923 - true, r5 - false, tg/f - false and so on.
In this script even a single digit number like "3" returns false.
Thanks. (1 Reply)
Discussion started by: eXPlosion
1 Replies
7. Shell Programming and Scripting
Hi All,
Is my script still error??
i try to running and still error??
need help (1 Reply)
Discussion started by: justbow
1 Replies
8. Linux
Regular expression to extract "y" from "abc/x.y.z" (2 Replies)
Discussion started by: rag84dec
2 Replies
9. Shell Programming and Scripting
:confused:
Is there any way to use in awk a regular exprexion with a format not previusly known?
I mean something like /VAR/ ,obviously VAR is the variable exprexion.
Thak you all in advance. (4 Replies)
Discussion started by: Klashxx
4 Replies
10. UNIX for Dummies Questions & Answers
I receive windows files via the internet on my solaris server. Since unix doesn't handle blanks well I change the blanks to ? which works just fine. I take these files and ftp them to windows so our analysts can work with them. Recently I received a file with the following structure:
... (3 Replies)
Discussion started by: gillbates
3 Replies
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)