Java Number Sum sumHadOverflow(long a, long b, long sum)

Here you can find the source of sumHadOverflow(long a, long b, long sum)

Description

sum Had Overflow

License

Open Source License

Declaration

public static boolean sumHadOverflow(long a, long b, long sum) 

Method Source Code

//package com.java2s;
/*//from  w  w w.j  a v  a 2s . c  om
 * Copyright (c) 2008-2019, Hazelcast, Inc. All Rights Reserved.
 *
 * Licensed 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.
 */

public class Main {
    public static boolean sumHadOverflow(long a, long b, long sum) {
        return ((a ^ sum) & (b ^ sum)) < 0;
    }
}

Related

  1. sumError(long samples, long count, double m2, double mean)
  2. sumFirstIntegers(final long i)
  3. sumFirstN(long n)
  4. sumFirstNDivisibleByM(long n, long m)
  5. sumFromNtoM(int n, int m)
  6. sumHash(int hash, String element)
  7. sumHash(int leftHash, int rightHash)
  8. sumIf(final Integer number, final Integer sum, final Boolean condition)
  9. sumIsMod10(int sum)