/**\r
* Composite transformer which aggregates multiple implementation and selects\r
* the one which accepts the input.\r
- * \r
- * \r
+ *\r
+ *\r
* @author Tony Tkacik\r
- * \r
+ *\r
* @param <I>\r
* Input class for transformation\r
* @param <P>\r
@Override\r
public int compare(TransformerWithPriority<I, P> o1,\r
TransformerWithPriority<I, P> o2) {\r
- return Integer.compare(o1.priority, o2.priority);\r
+ return Integer.valueOf(o1.priority).compareTo(Integer.valueOf(o2.priority));\r
}\r
\r
};\r
SimpleConditionalTransformer<I, P> {\r
final int priority;\r
final SimpleConditionalTransformer<I, P> transformer;\r
- \r
+\r
public TransformerWithPriority(\r
SimpleConditionalTransformer<I, P> transformer, int priority) {\r
this.priority = priority;\r
this.transformer = transformer;\r
}\r
- \r
+\r
@Override\r
public int hashCode() {\r
final int prime = 31;\r
+ ((transformer == null) ? 0 : transformer.hashCode());\r
return result;\r
}\r
- \r
+\r
@Override\r
public boolean equals(Object obj) {\r
if (this == obj)\r
return false;\r
return true;\r
}\r
- \r
+\r
@Override\r
public boolean isAcceptable(I input) {\r
return transformer.isAcceptable(input);\r
}\r
- \r
+\r
@Override\r
public P transform(I input) {\r
return transformer.transform(input);\r
}\r
- \r
- \r
- \r
- \r
- \r
+\r
+\r
+\r
+\r
+\r
}\r
}\r