06-11-2009
Thanks for the try. I tried "-lt" as well and it didn't work. I don't have the output in front of me right now, but it would throw and actual error instead of just triggering the wrong response.
edit:
I get the following when I use -lt (and no quotes around anything)
[~]$ ./bkcheck.orig
99.9219
99.7949
99.8012
99.8723
./bkcheck.orig: line 28: [[: 99.9219: syntax error: invalid arithmetic operator (error token is ".9219")
As of 23:43:48,Brooklyn VOD is streaming at 99.9219%
./bkcheck.orig: line 36: [[: 99.7949: syntax error: invalid arithmetic operator (error token is ".7949")
As of 23:43:49,Queens VOD is streaming at 99.7949%
./bkcheck.orig: line 44: [[: 99.8012: syntax error: invalid arithmetic operator (error token is ".8012")
As of 23:43:49,S.Manhattan VOD is streaming at 99.8012%
./bkcheck.orig: line 52: [[: 99.8723: syntax error: invalid arithmetic operator (error token is ".8723")
As of 23:43:49,N.Manhattan VOD is streaming at 99.8723%
Last edited by DeCoTwc; 06-11-2009 at 12:52 AM..
9 More Discussions You Might Find Interesting
1. Programming
I use standard C random number generation logic in my application.
long nCounter;
long lRndNo;
char rand;
srand48(nCounter);
lRndNo = lrand48();
sprintf(rand,"%010.10d",lRndNo);
However we always find that the rand generated starts with '0','1' or '2'. I could not logically prove if... (1 Reply)
Discussion started by: asutoshch
1 Replies
2. UNIX for Advanced & Expert Users
Hi,
I am comparing two numbers, but it gives strange results:
My Code:
if
then
echo "True"
else
echo "False"
fi
This code gives False for the follwoing comparison
where as True for the following:
Any reason for this? Both Should have given False...
I am using... (9 Replies)
Discussion started by: shihabvk
9 Replies
3. Shell Programming and Scripting
Hi,
I was trying to do a string comparison using if. However, the comparison result is getting treated as a executable statement. I'm not sure where I'm making the mistake!
$ typeset TEST_VAR='YUP'
$ if ; then echo 'Got It!'; fi;
ksh: : not found.
Any help is appreciated! (3 Replies)
Discussion started by: waterdrop
3 Replies
4. Shell Programming and Scripting
hi all experts,
i=1;
while
do
echo $i
$i=$i+1
done
can I use
min=2
max=5
if (($min > $ max))
then
else (2 Replies)
Discussion started by: hamnsan
2 Replies
5. Shell Programming and Scripting
Can someone please help me with a unix logic for below. I tried to get the desired output by using change capture condition in Datastage but its not working properly. i have two files file1, file2 as below.
file1
ROW_NO VEND_NO CODE AIR_D OCEAN_D
----------------------------------------
1 ... (3 Replies)
Discussion started by: JSKOBS
3 Replies
6. Shell Programming and Scripting
I am trying to run following script in ksh on darwin 11.4.2:
freeSpace=2469606195
spaceNeeded=200
] && echo "no space" || echo "space available"
] && echo "no space" || echo "space available"
"-lt" is giving wrong answer as "no space" Whereas '<' works fine. When I change the freespace... (4 Replies)
Discussion started by: sabitha
4 Replies
7. Shell Programming and Scripting
Hi All,
I am trying to compare two negative numbers using awk on linux.But it is giving me wrong result.Same code is working perfectly on solaris.
print ((0+new_price) < MIN_PRICE)
e.g If I try to compare -1.32(new_price) and -500(min_price) using "<" operator, output is 1 i.e true.
... (5 Replies)
Discussion started by: Rashmee
5 Replies
8. Linux
Hi all,
currently I'm facing a issue in linking a .so file.
In my build machine, I've libcrypto.so.6 and there is a softlink as libcrypto.so.
In my make file I'm trying to link to the lib using -L -lcrypto and it is success and created my test.exe.
When I copy this test.exe to other... (4 Replies)
Discussion started by: vijkrr
4 Replies
9. Shell Programming and Scripting
Greetings Experts,
I need to handle the views created over monthly retention tables
for which every new table in YYYYMMDD format, there is
equivalent view created and the older table which might be
dropped, the view over it has to be re-created over a dummy
table so that it doesn't fail.... (2 Replies)
Discussion started by: chill3chee
2 Replies
LEARN ABOUT SUSE
bitmap_onto
BITMAP_ONTO(9) Basic Kernel Library Functions BITMAP_ONTO(9)
NAME
bitmap_onto - translate one bitmap relative to another
SYNOPSIS
void bitmap_onto(unsigned long * dst, const unsigned long * orig, const unsigned long * relmap, int bits);
ARGUMENTS
dst
resulting translated bitmap
orig
original untranslated bitmap
relmap
bitmap relative to which translated
bits
number of bits in each of these bitmaps
DESCRIPTION
Set the n-th bit of dst iff there exists some m such that the n-th bit of relmap is set, the m-th bit of orig is set, and the n-th bit of
relmap is also the m-th _set_ bit of relmap. (If you understood the previous sentence the first time your read it, you're overqualified for
your current job.)
In other words, orig is mapped onto (surjectively) dst, using the the map { <n, m> | the n-th bit of relmap is the m-th set bit of relmap
}.
Any set bits in orig above bit number W, where W is the weight of (number of set bits in) relmap are mapped nowhere. In particular, if for
all bits m set in orig, m >= W, then dst will end up empty. In situations where the possibility of such an empty result is not desired, one
way to avoid it is to use the bitmap_fold operator, below, to first fold the orig bitmap over itself so that all its set bits x are in the
range 0 <= x < W. The bitmap_fold operator does this by setting the bit (m % W) in dst, for each bit (m) set in orig.
Example [1] for bitmap_onto: Let's say relmap has bits 30-39 set, and orig has bits 1, 3, 5, 7, 9 and 11 set. Then on return from this
routine, dst will have bits 31, 33, 35, 37 and 39 set.
When bit 0 is set in orig, it means turn on the bit in dst corresponding to whatever is the first bit (if any) that is turned on in relmap.
Since bit 0 was off in the above example, we leave off that bit (bit 30) in dst.
When bit 1 is set in orig (as in the above example), it means turn on the bit in dst corresponding to whatever is the second bit that is
turned on in relmap. The second bit in relmap that was turned on in the above example was bit 31, so we turned on bit 31 in dst.
Similarly, we turned on bits 33, 35, 37 and 39 in dst, because they were the 4th, 6th, 8th and 10th set bits set in relmap, and the 4th,
6th, 8th and 10th bits of orig (i.e. bits 3, 5, 7 and 9) were also set.
When bit 11 is set in orig, it means turn on the bit in dst corresponding to whatever is the twelth bit that is turned on in relmap. In the
above example, there were only ten bits turned on in relmap (30..39), so that bit 11 was set in orig had no affect on dst.
Example [2] for bitmap_fold + bitmap_onto: Let's say relmap has these ten bits set: 40 41 42 43 45 48 53 61 74 95 (for the curious, that's
40 plus the first ten terms of the Fibonacci sequence.)
Further lets say we use the following code, invoking bitmap_fold then bitmap_onto, as suggested above to avoid the possitility of an empty
dst result:
unsigned long *tmp; // a temporary bitmap's bits
bitmap_fold(tmp, orig, bitmap_weight(relmap, bits), bits); bitmap_onto(dst, tmp, relmap, bits);
Then this table shows what various values of dst would be, for various orig's. I list the zero-based positions of each set bit. The tmp
column shows the intermediate result, as computed by using bitmap_fold to fold the orig bitmap modulo ten (the weight of relmap).
orig tmp dst 0 0 40 1 1 41 9 9 95 10 0 40 (*) 1 3 5 7 1 3 5 7 41 43 48 61 0 1 2 3 4 0 1 2 3 4 40 41 42 43 45 0 9 18 27 0 9 8 7 40 61 74 95
0 10 20 30 0 40 0 11 22 33 0 1 2 3 40 41 42 43 0 12 24 36 0 2 4 6 40 42 45 53 78 102 211 1 2 8 41 42 74 (*)
(*) For these marked lines, if we hadn't first done bitmap_fold into tmp, then the dst result would have been empty.
If either of orig or relmap is empty (no set bits), then dst will be returned empty.
If (as explained above) the only set bits in orig are in positions m where m >= W, (where W is the weight of relmap) then dst will once
again be returned empty.
All bits in dst not set by the above rule are cleared.
COPYRIGHT
Kernel Hackers Manual 2.6. July 2010 BITMAP_ONTO(9)