mirror of
https://github.com/github/codeql.git
synced 2025-12-21 03:06:31 +01:00
120 lines
6.7 KiB
Java
Generated
120 lines
6.7 KiB
Java
Generated
// Generated automatically from io.netty.util.AsciiString for testing purposes
|
|
|
|
package io.netty.util;
|
|
|
|
import io.netty.util.ByteProcessor;
|
|
import io.netty.util.HashingStrategy;
|
|
import java.nio.ByteBuffer;
|
|
import java.nio.charset.Charset;
|
|
import java.util.Collection;
|
|
|
|
public class AsciiString implements CharSequence, Comparable<CharSequence>
|
|
{
|
|
protected AsciiString() {}
|
|
public AsciiString concat(CharSequence p0){ return null; }
|
|
public AsciiString replace(char p0, char p1){ return null; }
|
|
public AsciiString subSequence(int p0){ return null; }
|
|
public AsciiString subSequence(int p0, int p1){ return null; }
|
|
public AsciiString subSequence(int p0, int p1, boolean p2){ return null; }
|
|
public AsciiString toLowerCase(){ return null; }
|
|
public AsciiString toUpperCase(){ return null; }
|
|
public AsciiString trim(){ return null; }
|
|
public AsciiString(ByteBuffer p0){}
|
|
public AsciiString(ByteBuffer p0, boolean p1){}
|
|
public AsciiString(ByteBuffer p0, int p1, int p2, boolean p3){}
|
|
public AsciiString(CharSequence p0){}
|
|
public AsciiString(CharSequence p0, Charset p1){}
|
|
public AsciiString(CharSequence p0, Charset p1, int p2, int p3){}
|
|
public AsciiString(CharSequence p0, int p1, int p2){}
|
|
public AsciiString(byte[] p0){}
|
|
public AsciiString(byte[] p0, boolean p1){}
|
|
public AsciiString(byte[] p0, int p1, int p2, boolean p3){}
|
|
public AsciiString(char[] p0){}
|
|
public AsciiString(char[] p0, Charset p1){}
|
|
public AsciiString(char[] p0, Charset p1, int p2, int p3){}
|
|
public AsciiString(char[] p0, int p1, int p2){}
|
|
public AsciiString[] split(String p0, int p1){ return null; }
|
|
public AsciiString[] split(char p0){ return null; }
|
|
public String toString(){ return null; }
|
|
public String toString(int p0){ return null; }
|
|
public String toString(int p0, int p1){ return null; }
|
|
public boolean contains(CharSequence p0){ return false; }
|
|
public boolean contentEquals(CharSequence p0){ return false; }
|
|
public boolean contentEqualsIgnoreCase(CharSequence p0){ return false; }
|
|
public boolean endsWith(CharSequence p0){ return false; }
|
|
public boolean equals(Object p0){ return false; }
|
|
public boolean isEmpty(){ return false; }
|
|
public boolean isEntireArrayUsed(){ return false; }
|
|
public boolean matches(String p0){ return false; }
|
|
public boolean parseBoolean(){ return false; }
|
|
public boolean regionMatches(boolean p0, int p1, CharSequence p2, int p3, int p4){ return false; }
|
|
public boolean regionMatches(int p0, CharSequence p1, int p2, int p3){ return false; }
|
|
public boolean startsWith(CharSequence p0){ return false; }
|
|
public boolean startsWith(CharSequence p0, int p1){ return false; }
|
|
public byte byteAt(int p0){ return 0; }
|
|
public byte[] array(){ return null; }
|
|
public byte[] toByteArray(){ return null; }
|
|
public byte[] toByteArray(int p0, int p1){ return null; }
|
|
public char charAt(int p0){ return '0'; }
|
|
public char parseChar(){ return '0'; }
|
|
public char parseChar(int p0){ return '0'; }
|
|
public char[] toCharArray(){ return null; }
|
|
public char[] toCharArray(int p0, int p1){ return null; }
|
|
public double parseDouble(){ return 0; }
|
|
public double parseDouble(int p0, int p1){ return 0; }
|
|
public float parseFloat(){ return 0; }
|
|
public float parseFloat(int p0, int p1){ return 0; }
|
|
public int arrayOffset(){ return 0; }
|
|
public int compareTo(CharSequence p0){ return 0; }
|
|
public int forEachByte(ByteProcessor p0){ return 0; }
|
|
public int forEachByte(int p0, int p1, ByteProcessor p2){ return 0; }
|
|
public int forEachByteDesc(ByteProcessor p0){ return 0; }
|
|
public int forEachByteDesc(int p0, int p1, ByteProcessor p2){ return 0; }
|
|
public int hashCode(){ return 0; }
|
|
public int indexOf(CharSequence p0){ return 0; }
|
|
public int indexOf(CharSequence p0, int p1){ return 0; }
|
|
public int indexOf(char p0, int p1){ return 0; }
|
|
public int lastIndexOf(CharSequence p0){ return 0; }
|
|
public int lastIndexOf(CharSequence p0, int p1){ return 0; }
|
|
public int length(){ return 0; }
|
|
public int parseInt(){ return 0; }
|
|
public int parseInt(int p0){ return 0; }
|
|
public int parseInt(int p0, int p1){ return 0; }
|
|
public int parseInt(int p0, int p1, int p2){ return 0; }
|
|
public long parseLong(){ return 0; }
|
|
public long parseLong(int p0){ return 0; }
|
|
public long parseLong(int p0, int p1){ return 0; }
|
|
public long parseLong(int p0, int p1, int p2){ return 0; }
|
|
public short parseShort(){ return 0; }
|
|
public short parseShort(int p0){ return 0; }
|
|
public short parseShort(int p0, int p1){ return 0; }
|
|
public short parseShort(int p0, int p1, int p2){ return 0; }
|
|
public static AsciiString EMPTY_STRING = null;
|
|
public static AsciiString cached(String p0){ return null; }
|
|
public static AsciiString of(CharSequence p0){ return null; }
|
|
public static CharSequence trim(CharSequence p0){ return null; }
|
|
public static HashingStrategy<CharSequence> CASE_INSENSITIVE_HASHER = null;
|
|
public static HashingStrategy<CharSequence> CASE_SENSITIVE_HASHER = null;
|
|
public static boolean contains(CharSequence p0, CharSequence p1){ return false; }
|
|
public static boolean containsAllContentEqualsIgnoreCase(Collection<CharSequence> p0, Collection<CharSequence> p1){ return false; }
|
|
public static boolean containsContentEqualsIgnoreCase(Collection<CharSequence> p0, CharSequence p1){ return false; }
|
|
public static boolean containsIgnoreCase(CharSequence p0, CharSequence p1){ return false; }
|
|
public static boolean contentEquals(CharSequence p0, CharSequence p1){ return false; }
|
|
public static boolean contentEqualsIgnoreCase(CharSequence p0, CharSequence p1){ return false; }
|
|
public static boolean isUpperCase(byte p0){ return false; }
|
|
public static boolean isUpperCase(char p0){ return false; }
|
|
public static boolean regionMatches(CharSequence p0, boolean p1, int p2, CharSequence p3, int p4, int p5){ return false; }
|
|
public static boolean regionMatchesAscii(CharSequence p0, boolean p1, int p2, CharSequence p3, int p4, int p5){ return false; }
|
|
public static byte c2b(char p0){ return 0; }
|
|
public static char b2c(byte p0){ return '0'; }
|
|
public static char toLowerCase(char p0){ return '0'; }
|
|
public static int INDEX_NOT_FOUND = 0;
|
|
public static int hashCode(CharSequence p0){ return 0; }
|
|
public static int indexOf(CharSequence p0, char p1, int p2){ return 0; }
|
|
public static int indexOfIgnoreCase(CharSequence p0, CharSequence p1, int p2){ return 0; }
|
|
public static int indexOfIgnoreCaseAscii(CharSequence p0, CharSequence p1, int p2){ return 0; }
|
|
public void arrayChanged(){}
|
|
public void copy(int p0, byte[] p1, int p2, int p3){}
|
|
public void copy(int p0, char[] p1, int p2, int p3){}
|
|
}
|