anchor.diff:  
           ret = Math.min(ret, copyOfAllCharms.length); //don't be bigger than list
           for(int i = 0; i<ret; i++) {
  -            charms.add(copyOfAllCharms[i]..clone());
  +            charms.add(copyOfAllCharms[i].clone());
           }
       }
   
  
positive.code: 
          ret = Math.min(ret, copyOfAllCharms.length); //don't be bigger than list
          for(int i = 0; i<ret; i++) {
              charms.add(copyOfAllCharms[i]..clone());
          }
  
      }
  
negative.code:         }
          ret = Math.min(ret, copyOfAllCharms.length); //don't be bigger than list
          for(int i = 0; i<ret; i++) {
              charms.add(copyOfAllCharms[i].clone());
          }
      }
  
  