I think this is a very challenging problem I am facing and I have no idea how to deal with it
Suppose I have two csv files
A.csv
Toyota Camry,1998,blue
Honda Civic,1999,blue
B.csv
Toyota Inc. Camry, 2000km
Honda Corp Civic,1500km
I want to generate C.csv
Toyota Camry,1998,blue... (7 Replies)
hi
i have an error in script language when run it
i use python 2.4, CentOS 5.5, Qt C++ 2010/04
the error is
SystemError: null argument to internal routine
the Python Code
def main(i):
print i
if __name__ == "__main__":
main(i)
the C++ Code
PyObject *objModule =... (0 Replies)
Hi,
I followed the step written in README.
It got some error message when I type " #python setup.py build"
running build
running build_py
copying MySQLdb/release.py -> build/lib.solaris-2.11-i86pc-2.4/MySQLdb
running build_ext
building '_mysql' extension
/usr/lib/python2.4/pycc -DNDEBUG... (2 Replies)
Hey all,
I'm trying to enter some data into a database and I keep getting this error:
Traceback (most recent call last):
File "./ais_file_parser.py", line 77, in <module>
cursor.execute(sql)
File "/usr/lib/pymodules/python2.7/MySQLdb/cursors.py", line 166, in execute
... (1 Reply)
Hi
I have written a script in python and used it inside Ubuntu and its worked for me.
The script import email.utils, however in centos when I try to run the script I get:
Traceback (most recent call last):
File "./warning.py", line 4, in ?
import email.utils
ImportError: No... (2 Replies)
I'm trying to pull a google calendar (successful) and then put the contents into a mysql db (almost successful). On one of the field I keep getting an encode error:
#!/usr/bin/python
from xml.etree import ElementTree
import gdata.calendar.data
import gdata.calendar.client
import... (12 Replies)
I am working on requirement on spreadsheet in python scripting.
I have a spreadsheet containing cell values and with background color.
I am able to read the value value but unable to get the background color of that particular cell.
Actually my requirement is to read the cell value along... (1 Reply)
Hi,
I am getting the below error:
AttributeError: 'tuple' object has no attribute 'field_id'
This line is complaining on the below code snippet:
field_list =
for f in source_rows:
field_list.append(f.field_id)
Where source_rows returns multiple rows of... (1 Reply)
Hi all...
As you know I like making code backwards compatible for as many platforms as possible.
This Python script was in fact dedicated for the AMIGA A1200 using Pythons 1.4.0, 1.5.2, 1.6.0, 2.0.1, and 2.4.6 as that is all we have for varying levels of upgrades from a HDD and 4MB FastRam... (1 Reply)
Discussion started by: wisecracker
1 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)