Skip to main content

Several Cases of Bit Torrent Sync

Here we are going to test several cases when using BitTorrent Sync.

Assuming we have two devices, A and B. Below are the cases:

Case 1
1) Create and share folder test1 on Device A, and use the readonly key to create the same folder on Device B.
2) Create test.txt in folder test1 on Device A, the file is synced correctly on Device B.
3) Change test.txt in on Device A, the change is synced correctly on Device B.
4) Create other files in folder test1 on Device B, nothing synced back to Device A.
5) Change the test.txt in Device B, nothing synced back to Device A.
6) Change the test.txt in Device A, nothing synced to Device B.
7) Create test2.txt in folder test1 on Device A, the file is synced correctly on Device B, but test.txt remains modified version on Device B.
8) Remove test.txt in Device B, nothing happend.
9) Change the test.txt in Device A, nothing happened.
10) Remove the folder test1 on Device B from btsync, and readd it with the readonly key, all files in Device A synced to Device B correctly.
11) Again change the test.txt in Device B, and then change the test.txt in Device A, nothing happened.
12) Remove the folder test1 on Device B from btsync, adn readd it with the readonly key, the test.txt remains the modified version on Device B(The one on Device A does not overwrite it).

The conclusion is that the in readonly mode, the existed file or modified file will not be overwrited.

Comments

Post a Comment

Popular posts from this blog

A simple implementation of DTW(Dynamic Time Warping) in C#/python

DTW(Dynamic Time Warping) is a very useful tools for time series analysis. This is a very simple (but not very efficient) c# implementation of DTW, the source code is available at  https://gist.github.com/1966342  . Use the program as below: double[] x = {9,3,1,5,1,2,0,1,0,2,2,8,1,7,0,6,4,4,5}; double[] y = {1,0,5,5,0,1,0,1,0,3,3,2,8,1,0,6,4,4,5}; SimpleDTW dtw = new SimpleDTW(x,y); dtw.calculateDTW(); The python implementation is available at  https://gist.github.com/3265694  . from python-dtw import Dtw import math dtw = Dtw([1, 2, 3, 4, 6], [1, 2, 3, 5],           distance_func=lambda x, y: math.fabs(x - y)) print dtw.calculate() #calculate the distance print dtw.get_path() #calculate the mapping path
14 comments
Read more

Install mysql-python with mariadb

mysql-python requires libmysqlclient-dev in ubuntu, but the installation of mariadb will have the lib with unmet dependenccies, so the error of "mysql_config not found" may occurred if you install mysql-python via pip. The case is that mariadb has a compatible package, if you have the ppa setup as in  http://downloads.mariadb.org/ . Just "sudo apt-get install libmariadbclient-dev".
2 comments
Read more

PrefixSpan source code in python

The prefixspan is a key algorithm for mining sequential patterns. I have implemented the algorithm in Python. The algorithm is based on the following paper: Jian Pei, Jiawei Han, Senior Member, Behzad Mortazavi-asl, Jianyong Wang, Helen Pinto, Qiming Chen, Umeshwar Dayal. Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach. IEEE Transactions on Knowledge and Data Engineering, 2004. or their conference paper You may download the source code at the following addresses: Link1
4 comments
Read more