PageRenderTime 41ms CodeModel.GetById 25ms RepoModel.GetById 2ms app.codeStats 0ms

/utils/src/mdfs/utils/tests/FSTree_Test.java

https://bitbucket.org/crholm/mdfs
Java | 94 lines | 35 code | 23 blank | 36 comment | 4 complexity | b2df95867bdfa9b88404e66d48a68f60 MD5 | raw file
  1. package mdfs.utils.tests;
  2. import mdfs.utils.FSTree;
  3. public class FSTree_Test {
  4. public FSTree_Test(){
  5. FSTree<String> md = new FSTree<String>("/", "/");
  6. String d;
  7. for(int i = 0; i < 3; i++){
  8. d = new String();
  9. d = ("/" + Integer.toString(i));
  10. md.put(d, d);
  11. for(int j = 0; j < 3; j++){
  12. d = new String();
  13. d = ("/" + Integer.toString(i) + "/" + Integer.toString(j));
  14. md.put(d, d);
  15. for(int n = 0; n < 3; n++){
  16. d = new String();
  17. d = ("/" + Integer.toString(i) + "/" + Integer.toString(j)+ "/" + Integer.toString(n) );
  18. md.put(d, d);
  19. }
  20. }
  21. }
  22. System.out.println(md.isEmpty());
  23. for(int i = 0; i < 10; i++){
  24. String key = "/" + Integer.toString((int)(Math.random()*3)) +
  25. "/" + Integer.toString((int)(Math.random()*3)) +
  26. "/" + Integer.toString((int)(Math.random()*3));
  27. System.out.println("Searchin for :" + key);
  28. System.out.println("Found: " + md.get(key) + "\n");
  29. }
  30. }
  31. public static void main(String[] args){
  32. System.out.println("sad");
  33. new FSTree_Test();
  34. /*
  35. FSTree<String> tree = new FSTree<String>("/", "/");
  36. tree.put("/raz", "/raz");
  37. tree.put("/raz", "/raz2");
  38. tree.put("/raz/1", "/raz/1");
  39. tree.put("/raz/2", "/raz/2");
  40. tree.put("/raz/3", "/raz/3");
  41. tree.put("/raz/3", "/raz/3");
  42. tree.put("/raz/3", "/raz/4");
  43. tree.put("/raz1", "/raz1");
  44. tree.put("/raz1/1", "/raz1/1");
  45. tree.put("/raz1/1", "/raz1/1");
  46. tree.put("/raz1/1", "/raz1/1");
  47. tree.put("/raz1/1/1", "/raz1/1/1");
  48. tree.put("/raz1/1/2", "/raz1/1/2");
  49. tree.put("/raz3", "/raz3");
  50. tree.put("/raz3/4/5", "/raz3/4/5");
  51. System.out.println(tree.get("/raz"));
  52. System.out.println(tree.get("/raz/2"));
  53. System.out.println(tree.get("/raz/3"));
  54. System.out.println(tree.get("/raz1/1/2"));
  55. System.out.println("-->" + tree.get("/raz3/4/5"));
  56. */
  57. /*
  58. String[] a = new String[4];
  59. a = tree.getChildernArray("/raz", a);
  60. for (String string : a) {
  61. System.out.println(string);
  62. }
  63. */
  64. }
  65. }