Commit 9298c136 authored by Boris Lukačovič's avatar Boris Lukačovič
Browse files

EDIT: removed unnecessary prints to STDERR

parent 374d5c49

src/main/java/mtree/MTree.java

+4 −4
Original line number Diff line number Diff line
@@ -619,8 +619,8 @@ public class MTree extends Algorithm implements Serializable, SplittableAlgorith 
        

        boolean unbalancedSplit = false;

        if (objectList1 == null || objectList2 == null || Math.abs(objectList1.size() - objectList2.size()) > ((objectList1.size() + objectList2.size()) / 5)) {

            System.err.println("Splitting a node " + n + " produces highly uneven partitions: " + ((objectList1 == null) ? -1 : objectList1.size())

                    + ":" + ((objectList2 == null) ? -1 : objectList2.size()));

//            System.err.println("Splitting a node " + n + " produces highly uneven partitions: " + ((objectList1 == null) ? -1 : objectList1.size())

//                    + ":" + ((objectList2 == null) ? -1 : objectList2.size()));

            unbalancedSplit = true;

        }
@@ -663,8 +663,8 @@ public class MTree extends Algorithm implements Serializable, SplittableAlgorith 
                    r2 = Math.max(d2, r2);

                }

            }

            if (unbalancedSplit) 

                System.err.println("Splitting a node " + n + " produces highly uneven partitions - complete split: " + objectList1.size() + ":" + objectList2.size());

//            if (unbalancedSplit)

//                System.err.println("Splitting a node " + n + " produces highly uneven partitions - complete split: " + objectList1.size() + ":" + objectList2.size());

        }



        // Internal node entry pointing to the subtree n1 and n2, respectively.

src/main/java/mtree/utils/Split.java

+0 −5
Original line number Diff line number Diff line
@@ -167,11 +167,6 @@ public class Split { 
//            }

//        }



        if (minIdx > 0) {

            System.err.println("Notice: Splitting used " + (minIdx+1) + "th longest edge to partition data: " + ((objectList1 == null) ? -1 : objectList1.size())

                    + ":" + ((objectList2 == null) ? -1 : objectList2.size()));

        }

        

        return le;

    }