All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.swirlds.logging.utils.StringUtils Maven / Gradle / Ivy

Go to download

Swirlds is a software platform designed to build fully-distributed applications that harness the power of the cloud without servers. Now you can develop applications with fairness in decision making, speed, trust and reliability, at a fraction of the cost of traditional server-based platforms.

There is a newer version: 0.56.5
Show newest version
/*
 * Copyright (C) 2024 Hedera Hashgraph, LLC
 *
 * 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.
 */

package com.swirlds.logging.utils;

/**
 * String utilities class
 */
public class StringUtils {
    private StringUtils() {}

    /**
     * Creates a String of digits of the number and pads to the left with 0. Examples:
     * 
    *
  • {@code toPaddedDigitsString(1, 1)} --> 1
  • *
  • {@code toPaddedDigitsString(1, 2)} --> 01
  • *
  • {@code toPaddedDigitsString(12, 1)} --> 2
  • *
  • {@code toPaddedDigitsString(12, 2)} --> 12
  • *
  • {@code toPaddedDigitsString(12, 3)} --> 012
  • *
  • {@code toPaddedDigitsString(123, 3)} --> 123
  • *
  • {@code toPaddedDigitsString(758, 4)} --> 0758
  • *
* * @param number The number to append in reverse order. * @param desiredLength The maximum length of the number to append. */ public static String toPaddedDigitsString(final int number, final int desiredLength) { StringBuilder buffer = new StringBuilder(); int actualLength = 0; int num = number; while ((num > 0) && actualLength < desiredLength) { int digit = num % 10; buffer.append(digit); num /= 10; actualLength++; } while (desiredLength > actualLength) { buffer.append(0); actualLength++; } return buffer.reverse().toString(); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy