mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-04-25 14:05:15 +00:00
8f722302d9
Generate a sorted, compressed series of ranges in a match table for character classes, and use a binary search to find the matches. This is about a 3-4x speedup for character class match performance. :^)
40 lines
824 B
C++
40 lines
824 B
C++
/*
|
|
* Copyright (c) 2020, Emanuel Sprung <emanuel.sprung@gmail.com>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Types.h>
|
|
|
|
namespace regex {
|
|
struct CompareTypeAndValuePair;
|
|
|
|
enum class Error : u8;
|
|
class Lexer;
|
|
class PosixExtendedParser;
|
|
class ECMA262Parser;
|
|
|
|
class ByteCode;
|
|
class OpCode;
|
|
class OpCode_Exit;
|
|
class OpCode_Jump;
|
|
class OpCode_ForkJump;
|
|
class OpCode_ForkStay;
|
|
class OpCode_CheckBegin;
|
|
class OpCode_CheckEnd;
|
|
class OpCode_SaveLeftCaptureGroup;
|
|
class OpCode_SaveRightCaptureGroup;
|
|
class OpCode_SaveLeftNamedCaptureGroup;
|
|
class OpCode_SaveNamedLeftCaptureGroup;
|
|
class OpCode_SaveRightNamedCaptureGroup;
|
|
class OpCode_Compare;
|
|
class RegexStringView;
|
|
}
|
|
|
|
using regex::ECMA262Parser;
|
|
using regex::Error;
|
|
using regex::Lexer;
|
|
using regex::PosixExtendedParser;
|
|
using regex::RegexStringView;
|