/**
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
package org.apache.curator.framework.recipes.cache;

import com.google.common.base.Preconditions;

class TreeRefreshOperation implements Operation
{
    private final TreeCache cache;
    private final String path;
    private final TreeCache.RefreshMode mode;

    TreeRefreshOperation(TreeCache cache, String path, TreeCache.RefreshMode mode)
    {
        this.cache = Preconditions.checkNotNull(cache,"cache");
        this.path = Preconditions.checkNotNull(path,"path");
        this.mode = Preconditions.checkNotNull(mode,"mode");
    }

    @Override
    public void invoke() throws Exception
    {
        cache.refresh(path, mode);
    }

    @Override
    public boolean equals(Object o)
    {
        if ( this == o )
        {
            return true;
        }
        if ( o == null || getClass() != o.getClass() )
        {
            return false;
        }

        TreeRefreshOperation that = (TreeRefreshOperation)o;

        //noinspection RedundantIfStatement
        if ( mode != that.mode )
        {
            return false;
        }

        return true;
    }

    @Override
    public int hashCode()
    {
        return mode.hashCode();
    }

    @Override
    public String toString()
    {
        return "RefreshOperation(" + mode + "){}";
    }
}

@@ -1499,20 +1499,16 @@
 bject o)
-%0A   
  %7B%0A     
@@ -1514,17 +1514,16 @@
     if (
- 
 this == 
@@ -1527,32 +1527,9 @@
 == o
- )%0A        %7B%0A           
+)
  ret
@@ -1538,26 +1538,16 @@
 n true;%0A
-        %7D%0A
         
@@ -1550,17 +1550,16 @@
     if (
- 
 o == nul
@@ -1593,32 +1593,9 @@
 ss()
- )%0A        %7B%0A           
+)
  ret
@@ -1600,34 +1600,24 @@
 eturn false;
-%0A        %7D
 %0A%0A        Tr
@@ -1668,56 +1668,13 @@
 ion)
+ 
 o;%0A%0A
-        //noinspection RedundantIfStatement%0A
     
@@ -1681,17 +1681,16 @@
     if (
- 
 mode != 
@@ -1702,32 +1702,95 @@
 mode
- )%0A        %7B%0A           
+) return false;%0A        if (path != null ? !path.equals(that.path) : that.path != null)
  ret
@@ -1803,18 +1803,8 @@
 lse;
-%0A        %7D
 %0A%0A  
@@ -1872,45 +1872,158 @@
 de()
+ %7B
 %0A    
-%7B%0A        return mode.hashCode()
+    int result = path != null ? path.hashCode() : 0;%0A        result = 31 * result + (mode != null ? mode.hashCode() : 0);%0A        return result
 ;%0A  
@@ -2112,16 +2112,29 @@
 tion(%22 +
+ path + %22,%22 +
  mode + 

Fix equality of tree refresh operation in the tree cache.