org.ojalgo.netio.ASCII Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of ojalgo Show documentation

oj! Algorithms - ojAlgo - is Open Source Java code that has to do with mathematics, linear algebra and optimisation.

There is a newer version: 55.0.1

/*
 * Copyright 1997-2022 Optimatika
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
package org.ojalgo.netio;

import java.util.function.IntPredicate;

/**
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * 
 * ASCII codes 0 1 2 3 4 5 6 7
0 NUL SOH STX ETX EOT ENQ ACK BEL
8 BS HT LF VT FF CR SO SI
16 DLE DC1 DC2 DC3 DC4 NAK SYN ETB
24 CAN EM SUB ESC FS GS RS US
32 SP ! " # $ % & '
40 ( ) * + , - . /
48 0 1 2 3 4 5 6 7
56 8 9 : ; < = > ?
64 @ A B C D E F G
72 H I J K L M N O
80 P Q R S T U V W
88 X Y Z [ \ ] ^ _
96 ` a b c d e f g
104 h i j k l m n o
112 p q r s t u v w
120 x y z { | ~ DEL
 * http://www.lammertbies.nl/comm/info/ascii-characters.html
 *
 * @author apete
 */
public abstract class ASCII {

    public static final char COMMA = ',';
    public static final char CR = (char) 13; // Carriage Return
    public static final char DECIMAL_NINE = '9';
    public static final char DECIMAL_ZERO = '0';
    public static final char DEL = (char) 127;
    public static final char EQUALS = '=';
    public static final char HT = (char) 9; // TAB (Horizontal Tab)
    public static final char LCB = '{'; // Left Curly Bracket
    public static final char LF = (char) 10; // Line Feed
    public static final char LOWERCASE_A = 'a';
    public static final char LOWERCASE_Z = 'z';
    public static final char NBSP = (char) 160; // Non Breaking SPace
    public static final char NULL = (char) 0;
    public static final char RCB = '}'; // Right Curly Bracket
    public static final char SEMICOLON = (char) 59;
    public static final char SP = (char) 32; // SPace
    public static final char UNDERSCORE = (char) 95;
    public static final char UPPERCASE_A = 'A';
    public static final char UPPERCASE_Z = 'Z';

    /**
     * @param length The length of the random string
     * @param predicate Need to pass this test
     * @return A String of the specified length containing ASCII characters that pass the predicate test.
     */
    public static String generateRandom(final int length, final IntPredicate predicate) {
        StringBuilder builder = new StringBuilder();
        int soFar = 0;
        while (soFar < length) {
            int maybe = (int) (Double.doubleToRawLongBits(Math.random()) % 128L);
            if (predicate.test(maybe)) {
                builder.append((char) maybe);
                soFar++;
            }
        }
        return builder.toString();
    }

    public static boolean isAlphabetic(final int aChar) {
        return ASCII.isLowercase(aChar) || ASCII.isUppercase(aChar);
    }

    public static boolean isAlphanumeric(final int aChar) {
        return ASCII.isAlphabetic(aChar) || ASCII.isDigit(aChar);
    }

    /**
     * @return True if aChar is an ASCII character.
     */
    public static boolean isAscii(final int aChar) {
        return (NULL <= aChar) && (aChar <= DEL);
    }

    public static boolean isControl(final int aChar) {
        return ((NULL <= aChar) && (aChar < SP)) || (aChar == DEL);
    }

    public static boolean isDigit(final int aChar) {
        return (DECIMAL_ZERO <= aChar) && (aChar <= DECIMAL_NINE);
    }

    public static boolean isGraph(final int aChar) {
        return (SP < aChar) && (aChar < DEL);
    }

    /**
     * @return true if aChar is an lowercase character
     */
    public static boolean isLowercase(final int aChar) {
        return (LOWERCASE_A <= aChar) && (aChar <= LOWERCASE_Z);
    }

    public static boolean isPrintable(final int aChar) {
        return (SP <= aChar) && (aChar < DEL);
    }

    /**
     * Not sure this is correct
     */
    public static boolean isPunctuation(final int aChar) {
        return ASCII.isGraph(aChar) && !ASCII.isAlphanumeric(aChar);
    }

    public static boolean isSpace(final int aChar) {
        return (aChar == SP) || ((9 <= aChar) && (aChar <= 13));
    }

    /**
     * @return true if aChar is an uppercase character
     */
    public static boolean isUppercase(final int aChar) {
        return (UPPERCASE_A <= aChar) && (aChar <= UPPERCASE_Z);
    }

    /**
     * If aChar is an uppercase character it is converted to the corresponding lowercase character. Otherwise
     * it is returned unaltered.
     */
    public static int toLowercase(final int aChar) {
        return ASCII.isUppercase(aChar) ? aChar + SP : aChar;
    }

    public static int toPrintable(final int aChar) {
        return ASCII.isPrintable(aChar) ? aChar : SP;
    }

    /**
     * If aChar is a lowercase character it is converted to the corresponding uppercase character. Otherwise
     * it is returned unaltered.
     */
    public static int toUppercase(final int aChar) {
        return ASCII.isLowercase(aChar) ? aChar - SP : aChar;
    }

    private ASCII() {
        super();
    }

}

	0	1	2	3	4	5	6	7
0	NUL	SOH	STX	ETX	EOT	ENQ	ACK	BEL
8	BS	HT	LF	VT	FF	CR	SO	SI
16	DLE	DC1	DC2	DC3	DC4	NAK	SYN	ETB
24	CAN	EM	SUB	ESC	FS	GS	RS	US
32	SP	!	"	#	$	%	&	'
40	(	)	*	+	,	-	.	/
48	0	1	2	3	4	5	6	7
56	8	9	:	;	<	=	>	?
64	@	A	B	C	D	E	F	G
72	H	I	J	K	L	M	N	O
80	P	Q	R	S	T	U	V	W
88	X	Y	Z	[	\	]	^	_
96	`	a	b	c	d	e	f	g
104	h	i	j	k	l	m	n	o
112	p	q	r	s	t	u	v	w
120	x	y	z	{	\|		~	DEL

	0	1	2	3	4	5	6	7
0	NUL	SOH	STX	ETX	EOT	ENQ	ACK	BEL
8	BS	HT	LF	VT	FF	CR	SO	SI
16	DLE	DC1	DC2	DC3	DC4	NAK	SYN	ETB
24	CAN	EM	SUB	ESC	FS	GS	RS	US
32	SP	!	"	#	$	%	&	'
40	(	)	*	+	,	-	.	/
48	0	1	2	3	4	5	6	7
56	8	9	:	;	<	=	>	?
64	@	A	B	C	D	E	F	G
72	H	I	J	K	L	M	N	O
80	P	Q	R	S	T	U	V	W
88	X	Y	Z	[	\	]	^	_
96	`	a	b	c	d	e	f	g
104	h	i	j	k	l	m	n	o
112	p	q	r	s	t	u	v	w
120	x	y	z	{	\|		~	DEL

	0	1	2	3	4	5	6	7
0	NUL	SOH	STX	ETX	EOT	ENQ	ACK	BEL
8	BS	HT	LF	VT	FF	CR	SO	SI
16	DLE	DC1	DC2	DC3	DC4	NAK	SYN	ETB
24	CAN	EM	SUB	ESC	FS	GS	RS	US
32	SP	!	"	#	$	%	&	'
40	(	)	*	+	,	-	.	/
48	0	1	2	3	4	5	6	7
56	8	9	:	;	<	=	>	?
64	@	A	B	C	D	E	F	G
72	H	I	J	K	L	M	N	O
80	P	Q	R	S	T	U	V	W
88	X	Y	Z	[	\	]	^	_
96	`	a	b	c	d	e	f	g
104	h	i	j	k	l	m	n	o
112	p	q	r	s	t	u	v	w
120	x	y	z	{	\|		~	DEL