• Home
• com.smartdevicelink
• sdl_java_se
• 5.5.0
• source code
• Mime.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

com.smartdevicelink.trace.Mime Maven / Gradle / Ivy

/*
 * Copyright (c) 2017 - 2019, SmartDeviceLink Consortium, Inc.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following
 * disclaimer in the documentation and/or other materials provided with the
 * distribution.
 *
 * Neither the name of the SmartDeviceLink Consortium, Inc. nor the names of its
 * contributors may be used to endorse or promote products derived from this
 * software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */
package com.smartdevicelink.trace;

// Borrowed from Dave Boll's infamous SdlLinkRelay.java

import java.nio.charset.StandardCharsets;

public class Mime {

    private static final String BASE_64_CHARS = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";

    /**
     * @param str A String to encode into base64 String.
     * @return Base64 encoded String or a null String if input is null.
     */
    public static String base64Encode(String str) {
        if (str == null) {
            return null;
        }

        String b64String = "";
        try {
            byte[] strBytes = str.getBytes(StandardCharsets.US_ASCII);
            b64String = base64Encode(strBytes);
        } catch (Exception ex) {
            // Don't care?
        }
        return b64String;
    }

    /**
     * @param bytesToEncode A byte array to encode into base64 String.
     * @return Base64 encoded String or a null String if input array is null.
     */
    public static String base64Encode(byte[] bytesToEncode) {
        if (bytesToEncode != null) {
            return base64Encode(bytesToEncode, 0, bytesToEncode.length);
        }
        return null;
    }

    /**
     * @param bytesToEncode A byte array to encode into base64 String.
     * @param offset        Offset to begin at
     * @param length        Length to read
     * @return Base64 encoded String or a null String if input array is null or the input range is out of bounds.
     */
    public static String base64Encode(byte[] bytesToEncode, int offset, int length) {
        if (bytesToEncode == null || bytesToEncode.length < length || bytesToEncode.length < offset + length) {
            return null;
        }

        StringBuilder sb = new StringBuilder();

        int idxin = 0;
        int b64idx = 0;

        for (idxin = offset; idxin < offset + length; idxin++) {
            switch ((idxin - offset) % 3) {
                case 0:
                    b64idx = (bytesToEncode[idxin] >> 2) & 0x3f;
                    break;
                case 1:
                    b64idx = (bytesToEncode[idxin] >> 4) & 0x0f;
                    b64idx |= ((bytesToEncode[idxin - 1] << 4) & 0x30);
                    break;
                case 2:
                    b64idx = (bytesToEncode[idxin] >> 6) & 0x03;
                    b64idx |= ((bytesToEncode[idxin - 1] << 2) & 0x3c);
                    sb.append(getBase64Char(b64idx));
                    b64idx = bytesToEncode[idxin] & 0x3f;
                    break;
            }
            sb.append(getBase64Char(b64idx));
        }

        switch ((idxin - offset) % 3) {
            case 0:
                break;
            case 1:
                b64idx = (bytesToEncode[idxin - 1] << 4) & 0x30;
                sb.append(getBase64Char(b64idx));
                sb.append("==");
                break;
            case 2:
                b64idx = ((bytesToEncode[idxin - 1] << 2) & 0x3c);
                sb.append(getBase64Char(b64idx));
                sb.append('=');
                break;
        }

        return sb.toString();

    }

    private static char getBase64Char(int b64idx) {
        if (b64idx >= 0 && b64idx < BASE_64_CHARS.length()) {
            return BASE_64_CHARS.charAt(b64idx);
        } else {
            return 0x20;
        }
    }
}