Skip to content

rxdelta/ldiff

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Introduction

this library is for calculating minimum changes of two collection in java using Levenshtein algorithm.

Usage

here's two sample for using this api

simple sample

    //simple sample
    
    ArrayList<Integer> origin = new ArrayList<>(List.of(1,2,3,4,5,6,7,8));
    List<Integer> target = List.of(1,2,13,4,40,5,7,8);
    System.out.println("old version: "+origin);
    
    int diff = LevenshteinDiff.ldiffAndApply(Modifiers.fromList(origin), target );
    
    System.out.println("new version: "+origin);
    System.out.println("number of changes: "+diff); // 3

deep inspect sample

    //deep inspect example
    
    ArrayList<Optional<Integer>> origin = 
            new ArrayList<>(List.of(1,2,3,4,5,6,7,8,9)
            .stream()
            .map(o->Optional.of(o))
            .collect(Collectors.toList())
    ); //convert to list of optionals
    
    List<Integer> target = List.of(1,2,13,4,40,5,6,7,8);
    
    System.out.println("old version: "+origin);
    
    int diff = LevenshteinDiff.ldiffAndApply(new Modifier<Optional<Integer>, Integer>() {
        
        ListIterator<Optional<Integer>> it = origin.listIterator();
        Optional<Integer> oldv;
        
        @Override
        public void reset() {
            System.out.println("# reset items");
            it = origin.listIterator();
        }

        @Override
        public void set(Integer t) {
            System.out.println("# update item: "+oldv+" -> "+t);
            it.set(Optional.of(t));
        }

        @Override
        public void insert(Integer t) {
            System.out.println("# insert item: "+t+" (after "+oldv);
            it.add(Optional.of(t));
        }

        @Override
        public void remove() {
            System.out.println("# removed item: "+oldv);
            it.remove();
        }

        @Override
        public boolean hasNext() {
            return it.hasNext();
        }

        @Override
        public Optional<Integer> next() {
            oldv = it.next();
            return oldv;
        }
    }, (t,u) -> t.get().equals(u), target);
    
    System.out.println("new version: "+origin);
    System.out.println("number of changes: "+diff);

About

Levenshtein-based chain of diff in java

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published