eslint-plugin-react-x 3.0.0-next.33 → 3.0.0-next.36

package/dist/index.js

@@ -68,7 +68,7 @@ const rules$7 = {
 //#endregion
 //#region package.json
 var name$6 = "eslint-plugin-react-x";
-var version = "3.0.0-next.33";
+var version = "3.0.0-next.36";
 
 //#endregion
 //#region src/utils/create-rule.ts
@@ -224,7 +224,7 @@ function getTypeVariants(types) {
 }
 
 //#endregion
-//#region src/rules/component-hook-factories.ts
+//#region src/rules/component-hook-factories/component-hook-factories.ts
 const RULE_NAME$62 = "component-hook-factories";
 var component_hook_factories_default = createRule({
 	meta: {
@@ -283,7 +283,7 @@ function create$62(context) {
 }
 
 //#endregion
-//#region src/rules/error-boundaries.ts
+//#region src/rules/error-boundaries/error-boundaries.ts
 const RULE_NAME$61 = "error-boundaries";
 var error_boundaries_default = createRule({
 	meta: {
@@ -332,7 +332,7 @@ function create$61(context) {
 }
 
 //#endregion
-//#region src/rules/exhaustive-deps.ts
+//#region src/rules/exhaustive-deps/exhaustive-deps.ts
 const rule$1 = {
 	meta: {
 		type: "suggestion",
@@ -1238,7 +1238,7 @@ function getUnknownDependenciesMessage(reactiveHookName) {
 }
 
 //#endregion
-//#region src/rules/immutability.ts
+//#region src/rules/immutability/immutability.ts
 const RULE_NAME$60 = "immutability";
 /**
 * Array methods that mutate the array in place.
@@ -1402,7 +1402,7 @@ function create$60(context) {
 }
 
 //#endregion
-//#region src/rules/jsx-dollar.ts
+//#region src/rules/jsx-dollar/jsx-dollar.ts
 const RULE_NAME$59 = "jsx-dollar";
 var jsx_dollar_default = createRule({
 	meta: {
@@ -1460,7 +1460,7 @@ function create$59(context) {
 }
 
 //#endregion
-//#region src/rules/jsx-key-before-spread.ts
+//#region src/rules/jsx-key-before-spread/jsx-key-before-spread.ts
 const RULE_NAME$58 = "jsx-key-before-spread";
 var jsx_key_before_spread_default = createRule({
 	meta: {
@@ -1496,7 +1496,7 @@ function create$58(context) {
 }
 
 //#endregion
-//#region src/rules/jsx-no-comment-textnodes.ts
+//#region src/rules/jsx-no-comment-textnodes/jsx-no-comment-textnodes.ts
 const RULE_NAME$57 = "jsx-no-comment-textnodes";
 var jsx_no_comment_textnodes_default = createRule({
 	meta: {
@@ -1529,7 +1529,7 @@ function create$57(context) {
 }
 
 //#endregion
-//#region src/rules/jsx-no-duplicate-props.ts
+//#region src/rules/jsx-no-duplicate-props/jsx-no-duplicate-props.ts
 const RULE_NAME$56 = "jsx-no-duplicate-props";
 var jsx_no_duplicate_props_default = createRule({
 	meta: {
@@ -1562,7 +1562,7 @@ function create$56(context) {
 }
 
 //#endregion
-//#region src/rules/jsx-shorthand-boolean.ts
+//#region src/rules/jsx-shorthand-boolean/jsx-shorthand-boolean.ts
 const RULE_NAME$55 = "jsx-shorthand-boolean";
 const defaultOptions$4 = [1];
 const schema$4 = [{
@@ -1608,7 +1608,7 @@ function create$55(context) {
 }
 
 //#endregion
-//#region src/rules/jsx-shorthand-fragment.ts
+//#region src/rules/jsx-shorthand-fragment/jsx-shorthand-fragment.ts
 const RULE_NAME$54 = "jsx-shorthand-fragment";
 const defaultOptions$3 = [1];
 const schema$3 = [{
@@ -1661,7 +1661,7 @@ function create$54(context) {
 }
 
 //#endregion
-//#region src/rules/jsx-uses-react.ts
+//#region src/rules/jsx-uses-react/jsx-uses-react.ts
 const RULE_NAME$53 = "jsx-uses-react";
 var jsx_uses_react_default = createRule({
 	meta: {
@@ -1704,7 +1704,7 @@ function debugReport(context, node, name) {
 }
 
 //#endregion
-//#region src/rules/jsx-uses-vars.ts
+//#region src/rules/jsx-uses-vars/jsx-uses-vars.ts
 const RULE_NAME$52 = "jsx-uses-vars";
 var jsx_uses_vars_default = createRule({
 	meta: {
@@ -1734,7 +1734,7 @@ function create$52(context) {
 }
 
 //#endregion
-//#region src/rules/no-access-state-in-setstate.ts
+//#region src/rules/no-access-state-in-setstate/no-access-state-in-setstate.ts
 const RULE_NAME$51 = "no-access-state-in-setstate";
 function isKeyLiteral$2(node, key) {
 	return match(key).with({ type: AST_NODE_TYPES.Literal }, constTrue).with({
@@ -1823,7 +1823,7 @@ function create$51(context) {
 }
 
 //#endregion
-//#region src/rules/no-array-index-key.ts
+//#region src/rules/no-array-index-key/no-array-index-key.ts
 const RULE_NAME$50 = "no-array-index-key";
 const REACT_CHILDREN_METHOD = ["forEach", "map"];
 function getIndexParamPosition(methodName) {
@@ -1952,7 +1952,7 @@ function create$50(context) {
 }
 
 //#endregion
-//#region src/rules/no-children-count.ts
+//#region src/rules/no-children-count/no-children-count.ts
 const RULE_NAME$49 = "no-children-count";
 var no_children_count_default = createRule({
 	meta: {
@@ -1975,7 +1975,7 @@ function create$49(context) {
 }
 
 //#endregion
-//#region src/rules/no-children-for-each.ts
+//#region src/rules/no-children-for-each/no-children-for-each.ts
 const RULE_NAME$48 = "no-children-for-each";
 var no_children_for_each_default = createRule({
 	meta: {
@@ -1998,7 +1998,7 @@ function create$48(context) {
 }
 
 //#endregion
-//#region src/rules/no-children-map.ts
+//#region src/rules/no-children-map/no-children-map.ts
 const RULE_NAME$47 = "no-children-map";
 var no_children_map_default = createRule({
 	meta: {
@@ -2021,7 +2021,7 @@ function create$47(context) {
 }
 
 //#endregion
-//#region src/rules/no-children-only.ts
+//#region src/rules/no-children-only/no-children-only.ts
 const RULE_NAME$46 = "no-children-only";
 var no_children_only_default = createRule({
 	meta: {
@@ -2044,7 +2044,7 @@ function create$46(context) {
 }
 
 //#endregion
-//#region src/rules/no-children-prop.ts
+//#region src/rules/no-children-prop/no-children-prop.ts
 const RULE_NAME$45 = "no-children-prop";
 var no_children_prop_default = createRule({
 	meta: {
@@ -2068,7 +2068,7 @@ function create$45(context) {
 }
 
 //#endregion
-//#region src/rules/no-children-to-array.ts
+//#region src/rules/no-children-to-array/no-children-to-array.ts
 const RULE_NAME$44 = "no-children-to-array";
 var no_children_to_array_default = createRule({
 	meta: {
@@ -2091,7 +2091,7 @@ function create$44(context) {
 }
 
 //#endregion
-//#region src/rules/no-class-component.ts
+//#region src/rules/no-class-component/no-class-component.ts
 const RULE_NAME$43 = "no-class-component";
 var no_class_component_default = createRule({
 	meta: {
@@ -2120,7 +2120,7 @@ function create$43(context) {
 }
 
 //#endregion
-//#region src/rules/no-clone-element.ts
+//#region src/rules/no-clone-element/no-clone-element.ts
 const RULE_NAME$42 = "no-clone-element";
 var no_clone_element_default = createRule({
 	meta: {
@@ -2143,7 +2143,7 @@ function create$42(context) {
 }
 
 //#endregion
-//#region src/rules/no-component-will-mount.ts
+//#region src/rules/no-component-will-mount/no-component-will-mount.ts
 const RULE_NAME$41 = "no-component-will-mount";
 var no_component_will_mount_default = createRule({
 	meta: {
@@ -2176,7 +2176,7 @@ function create$41(context) {
 }
 
 //#endregion
-//#region src/rules/no-component-will-receive-props.ts
+//#region src/rules/no-component-will-receive-props/no-component-will-receive-props.ts
 const RULE_NAME$40 = "no-component-will-receive-props";
 var no_component_will_receive_props_default = createRule({
 	meta: {
@@ -2209,7 +2209,7 @@ function create$40(context) {
 }
 
 //#endregion
-//#region src/rules/no-component-will-update.ts
+//#region src/rules/no-component-will-update/no-component-will-update.ts
 const RULE_NAME$39 = "no-component-will-update";
 var no_component_will_update_default = createRule({
 	meta: {
@@ -2242,7 +2242,7 @@ function create$39(context) {
 }
 
 //#endregion
-//#region src/rules/no-context-provider.ts
+//#region src/rules/no-context-provider/no-context-provider.ts
 const RULE_NAME$38 = "no-context-provider";
 var no_context_provider_default = createRule({
 	meta: {
@@ -2282,7 +2282,7 @@ function create$38(context) {
 }
 
 //#endregion
-//#region src/rules/no-create-ref.ts
+//#region src/rules/no-create-ref/no-create-ref.ts
 const RULE_NAME$37 = "no-create-ref";
 var no_create_ref_default = createRule({
 	meta: {
@@ -2305,7 +2305,7 @@ function create$37(context) {
 }
 
 //#endregion
-//#region src/rules/no-direct-mutation-state.ts
+//#region src/rules/no-direct-mutation-state/no-direct-mutation-state.ts
 const RULE_NAME$36 = "no-direct-mutation-state";
 function isConstructorFunction(node) {
 	return ast.isOneOf([AST_NODE_TYPES.FunctionDeclaration, AST_NODE_TYPES.FunctionExpression])(node) && ast.isMethodOrProperty(node.parent) && node.parent.key.type === AST_NODE_TYPES.Identifier && node.parent.key.name === "constructor";
@@ -2334,7 +2334,7 @@ function create$36(context) {
 }
 
 //#endregion
-//#region src/rules/no-duplicate-key.ts
+//#region src/rules/no-duplicate-key/no-duplicate-key.ts
 const RULE_NAME$35 = "no-duplicate-key";
 var no_duplicate_key_default = createRule({
 	meta: {
@@ -2401,7 +2401,7 @@ function create$35(context) {
 }
 
 //#endregion
-//#region src/rules/no-forward-ref.ts
+//#region src/rules/no-forward-ref/no-forward-ref.ts
 const RULE_NAME$34 = "no-forward-ref";
 var no_forward_ref_default = createRule({
 	meta: {
@@ -2509,7 +2509,7 @@ function getComponentPropsFixes(context, fixer, node, typeArguments) {
 }
 
 //#endregion
-//#region src/rules/no-implicit-key.ts
+//#region src/rules/no-implicit-key/no-implicit-key.ts
 const RULE_NAME$33 = "no-implicit-key";
 var no_implicit_key_default = createRule({
 	meta: {
@@ -2539,7 +2539,7 @@ function create$33(context) {
 }
 
 //#endregion
-//#region src/rules/no-leaked-conditional-rendering.ts
+//#region src/rules/no-leaked-conditional-rendering/no-leaked-conditional-rendering.ts
 const RULE_NAME$32 = "no-leaked-conditional-rendering";
 var no_leaked_conditional_rendering_default = createRule({
 	meta: {
@@ -2608,7 +2608,7 @@ function create$32(context) {
 }
 
 //#endregion
-//#region src/rules/no-missing-component-display-name.ts
+//#region src/rules/no-missing-component-display-name/no-missing-component-display-name.ts
 const RULE_NAME$31 = "no-missing-component-display-name";
 var no_missing_component_display_name_default = createRule({
 	meta: {
@@ -2642,7 +2642,7 @@ function create$31(context) {
 }
 
 //#endregion
-//#region src/rules/no-missing-context-display-name.ts
+//#region src/rules/no-missing-context-display-name/no-missing-context-display-name.ts
 const RULE_NAME$30 = "no-missing-context-display-name";
 var no_missing_context_display_name_default = createRule({
 	meta: {
@@ -2707,7 +2707,7 @@ function create$30(context) {
 }
 
 //#endregion
-//#region src/rules/no-missing-key.ts
+//#region src/rules/no-missing-key/no-missing-key.ts
 const RULE_NAME$29 = "no-missing-key";
 var no_missing_key_default = createRule({
 	meta: {
@@ -2793,7 +2793,7 @@ function create$29(ctx) {
 }
 
 //#endregion
-//#region src/rules/no-misused-capture-owner-stack.ts
+//#region src/rules/no-misused-capture-owner-stack/no-misused-capture-owner-stack.ts
 const RULE_NAME$28 = "no-misused-capture-owner-stack";
 var no_misused_capture_owner_stack_default = createRule({
 	meta: {
@@ -2839,7 +2839,7 @@ function isDevelopmentOnlyCheck(node) {
 }
 
 //#endregion
-//#region src/rules/no-nested-component-definitions.ts
+//#region src/rules/no-nested-component-definitions/no-nested-component-definitions.ts
 const RULE_NAME$27 = "no-nested-component-definitions";
 var no_nested_component_definitions_default = createRule({
 	meta: {
@@ -2957,7 +2957,7 @@ function isInsideCreateElementProps(context, node) {
 }
 
 //#endregion
-//#region src/rules/no-nested-lazy-component-declarations.ts
+//#region src/rules/no-nested-lazy-component-declarations/no-nested-lazy-component-declarations.ts
 const RULE_NAME$26 = "no-nested-lazy-component-declarations";
 var no_nested_lazy_component_declarations_default = createRule({
 	meta: {
@@ -2998,7 +2998,7 @@ function create$26(context) {
 }
 
 //#endregion
-//#region src/rules/no-redundant-should-component-update.ts
+//#region src/rules/no-redundant-should-component-update/no-redundant-should-component-update.ts
 const RULE_NAME$25 = "no-redundant-should-component-update";
 function isShouldComponentUpdate(node) {
 	return ast.isMethodOrProperty(node) && node.key.type === AST_NODE_TYPES.Identifier && node.key.name === "shouldComponentUpdate";
@@ -3031,7 +3031,7 @@ function create$25(context) {
 }
 
 //#endregion
-//#region src/rules/no-set-state-in-component-did-mount.ts
+//#region src/rules/no-set-state-in-component-did-mount/no-set-state-in-component-did-mount.ts
 const RULE_NAME$24 = "no-set-state-in-component-did-mount";
 var no_set_state_in_component_did_mount_default = createRule({
 	meta: {
@@ -3061,7 +3061,7 @@ function create$24(context) {
 }
 
 //#endregion
-//#region src/rules/no-set-state-in-component-did-update.ts
+//#region src/rules/no-set-state-in-component-did-update/no-set-state-in-component-did-update.ts
 const RULE_NAME$23 = "no-set-state-in-component-did-update";
 var no_set_state_in_component_did_update_default = createRule({
 	meta: {
@@ -3091,7 +3091,7 @@ function create$23(context) {
 }
 
 //#endregion
-//#region src/rules/no-set-state-in-component-will-update.ts
+//#region src/rules/no-set-state-in-component-will-update/no-set-state-in-component-will-update.ts
 const RULE_NAME$22 = "no-set-state-in-component-will-update";
 var no_set_state_in_component_will_update_default = createRule({
 	meta: {
@@ -3121,7 +3121,7 @@ function create$22(context) {
 }
 
 //#endregion
-//#region src/rules/no-unnecessary-use-callback.ts
+//#region src/rules/no-unnecessary-use-callback/no-unnecessary-use-callback.ts
 const RULE_NAME$21 = "no-unnecessary-use-callback";
 var no_unnecessary_use_callback_default = createRule({
 	meta: {
@@ -3198,7 +3198,7 @@ function checkForUsageInsideUseEffect$1(sourceCode, node) {
 }
 
 //#endregion
-//#region src/rules/no-unnecessary-use-memo.ts
+//#region src/rules/no-unnecessary-use-memo/no-unnecessary-use-memo.ts
 const RULE_NAME$20 = "no-unnecessary-use-memo";
 var no_unnecessary_use_memo_default = createRule({
 	meta: {
@@ -3279,7 +3279,7 @@ function checkForUsageInsideUseEffect(sourceCode, node) {
 }
 
 //#endregion
-//#region src/rules/no-unnecessary-use-prefix.ts
+//#region src/rules/no-unnecessary-use-prefix/no-unnecessary-use-prefix.ts
 const RULE_NAME$19 = "no-unnecessary-use-prefix";
 const WELL_KNOWN_HOOKS = ["useMDXComponents"];
 function containsUseComments(context, node) {
@@ -3315,7 +3315,7 @@ function create$19(context) {
 }
 
 //#endregion
-//#region src/rules/no-unsafe-component-will-mount.ts
+//#region src/rules/no-unsafe-component-will-mount/no-unsafe-component-will-mount.ts
 const RULE_NAME$18 = "no-unsafe-component-will-mount";
 var no_unsafe_component_will_mount_default = createRule({
 	meta: {
@@ -3343,7 +3343,7 @@ function create$18(context) {
 }
 
 //#endregion
-//#region src/rules/no-unsafe-component-will-receive-props.ts
+//#region src/rules/no-unsafe-component-will-receive-props/no-unsafe-component-will-receive-props.ts
 const RULE_NAME$17 = "no-unsafe-component-will-receive-props";
 var no_unsafe_component_will_receive_props_default = createRule({
 	meta: {
@@ -3371,7 +3371,7 @@ function create$17(context) {
 }
 
 //#endregion
-//#region src/rules/no-unsafe-component-will-update.ts
+//#region src/rules/no-unsafe-component-will-update/no-unsafe-component-will-update.ts
 const RULE_NAME$16 = "no-unsafe-component-will-update";
 var no_unsafe_component_will_update_default = createRule({
 	meta: {
@@ -3399,7 +3399,7 @@ function create$16(context) {
 }
 
 //#endregion
-//#region src/rules/no-unstable-context-value.ts
+//#region src/rules/no-unstable-context-value/no-unstable-context-value.ts
 const RULE_NAME$15 = "no-unstable-context-value";
 var no_unstable_context_value_default = createRule({
 	meta: {
@@ -3463,7 +3463,7 @@ function isContextName(name, isReact18OrBelow) {
 }
 
 //#endregion
-//#region src/rules/no-unstable-default-props.ts
+//#region src/rules/no-unstable-default-props/no-unstable-default-props.ts
 const RULE_NAME$14 = "no-unstable-default-props";
 const defaultOptions$2 = [{ safeDefaultProps: [] }];
 const schema$2 = [{
@@ -3538,7 +3538,7 @@ function create$14(context, [options]) {
 }
 
 //#endregion
-//#region src/rules/no-unused-class-component-members.ts
+//#region src/rules/no-unused-class-component-members/no-unused-class-component-members.ts
 const RULE_NAME$13 = "no-unused-class-component-members";
 const LIFECYCLE_METHODS = new Set([
 	"componentDidCatch",
@@ -3654,7 +3654,7 @@ function create$13(context) {
 }
 
 //#endregion
-//#region src/rules/no-unused-props.ts
+//#region src/rules/no-unused-props/no-unused-props.ts
 const RULE_NAME$12 = "no-unused-props";
 var no_unused_props_default = createRule({
 	meta: {
@@ -3766,7 +3766,7 @@ function reportUnusedProp(context, services, prop) {
 }
 
 //#endregion
-//#region src/rules/no-unused-state.ts
+//#region src/rules/no-unused-state/no-unused-state.ts
 const RULE_NAME$11 = "no-unused-state";
 function isKeyLiteral(node, key) {
 	return match(key).with({ type: AST_NODE_TYPES.Literal }, constTrue).with({
@@ -3893,7 +3893,7 @@ function create$11(context) {
 }
 
 //#endregion
-//#region src/rules/no-use-context.ts
+//#region src/rules/no-use-context/no-use-context.ts
 const RULE_NAME$10 = "no-use-context";
 var no_use_context_default = createRule({
 	meta: {
@@ -3971,7 +3971,7 @@ function getCorrelativeTokens(context, node) {
 }
 
 //#endregion
-//#region src/rules/no-useless-fragment.ts
+//#region src/rules/no-useless-fragment/no-useless-fragment.ts
 const RULE_NAME$9 = "no-useless-fragment";
 const defaultOptions$1 = [{
 	allowEmptyFragment: false,
@@ -4111,7 +4111,7 @@ function trimLikeReact(text) {
 }
 
 //#endregion
-//#region src/rules/prefer-destructuring-assignment.ts
+//#region src/rules/prefer-destructuring-assignment/prefer-destructuring-assignment.ts
 const RULE_NAME$8 = "prefer-destructuring-assignment";
 var prefer_destructuring_assignment_default = createRule({
 	meta: {
@@ -4147,7 +4147,7 @@ function create$8(context) {
 }
 
 //#endregion
-//#region src/rules/prefer-namespace-import.ts
+//#region src/rules/prefer-namespace-import/prefer-namespace-import.ts
 const RULE_NAME$7 = "prefer-namespace-import";
 var prefer_namespace_import_default = createRule({
 	meta: {
@@ -4184,7 +4184,7 @@ function create$7(context) {
 }
 
 //#endregion
-//#region src/rules/purity.ts
+//#region src/rules/purity/purity.ts
 const RULE_NAME$6 = "purity";
 function isImpureMemberCall(node) {
 	if (node.callee.type !== AST_NODE_TYPES.MemberExpression) return false;
@@ -4268,7 +4268,7 @@ function create$6(context) {
 }
 
 //#endregion
-//#region src/rules/refs.ts
+//#region src/rules/refs/refs.ts
 const RULE_NAME$5 = "refs";
 function isWriteAccess(node) {
 	const { parent } = node;
@@ -4447,707 +4447,223 @@ function create$5(context) {
 }
 
 //#endregion
-//#region src/rules/rules-of-hooks.ts
+//#region src/rules/rules-of-hooks/code-path-analyzer.mts
+function assert(cond, message) {
+	if (!cond) throw new Error(message ?? "Assertion violated.");
+}
 /**
-* Catch all identifiers that begin with "use" followed by an uppercase Latin
-* character to exclude identifiers like "user".
+* Checks whether or not a given segment is reachable.
 */
-function isHookName(s) {
-	return s === "use" || /^use[A-Z0-9]/.test(s);
+function isReachable$1(segment) {
+	return segment.reachable;
 }
 /**
-* We consider hooks to be a hook name identifier or a member expression
-* containing a hook name.
+* A code path segment.
 */
-function isHook(node) {
-	if (node.type === "Identifier") return isHookName(node.name);
-	else if (node.type === "MemberExpression" && !node.computed && isHook(node.property)) {
-		const obj = node.object;
-		return obj.type === "Identifier" && /^[A-Z].*/.test(obj.name);
-	} else return false;
-}
+var CodePathSegment = class CodePathSegment {
+	/**
+	* The identifier of this code path.
+	* Rules use it to store additional information of each rule.
+	*/
+	id;
+	/** An array of the next reachable segments. */
+	nextSegments;
+	/** An array of the previous reachable segments. */
+	prevSegments;
+	/** An array of all next segments (including unreachable). */
+	allNextSegments;
+	/** An array of all previous segments (including unreachable). */
+	allPrevSegments;
+	/** Whether this segment is reachable. */
+	reachable;
+	/** Internal bookkeeping data. */
+	internal;
+	/**
+	* @param id An identifier.
+	* @param allPrevSegments An array of the previous segments (including unreachable).
+	* @param reachable Whether this segment is reachable.
+	*/
+	constructor(id, allPrevSegments, reachable) {
+		this.id = id;
+		this.nextSegments = [];
+		this.prevSegments = allPrevSegments.filter(isReachable$1);
+		this.allNextSegments = [];
+		this.allPrevSegments = allPrevSegments;
+		this.reachable = reachable;
+		this.internal = {
+			used: false,
+			loopedPrevSegments: []
+		};
+	}
+	/**
+	* Checks if a given previous segment is coming from the end of a loop.
+	*/
+	isLoopedPrevSegment(segment) {
+		return this.internal.loopedPrevSegments.includes(segment);
+	}
+	/**
+	* Creates the root segment.
+	*/
+	static newRoot(id) {
+		return new CodePathSegment(id, [], true);
+	}
+	/**
+	* Creates a segment that follows given segments.
+	*/
+	static newNext(id, allPrevSegments) {
+		return new CodePathSegment(id, CodePathSegment.flattenUnusedSegments(allPrevSegments), allPrevSegments.some(isReachable$1));
+	}
+	/**
+	* Creates an unreachable segment that follows given segments.
+	*/
+	static newUnreachable(id, allPrevSegments) {
+		const segment = new CodePathSegment(id, CodePathSegment.flattenUnusedSegments(allPrevSegments), false);
+		CodePathSegment.markUsed(segment);
+		return segment;
+	}
+	/**
+	* Creates a segment that follows given segments.
+	* This factory method does not connect with `allPrevSegments`.
+	* But this inherits `reachable` flag.
+	*/
+	static newDisconnected(id, allPrevSegments) {
+		return new CodePathSegment(id, [], allPrevSegments.some(isReachable$1));
+	}
+	/**
+	* Makes a given segment being used.
+	* Also registers the segment into the previous segments as a next.
+	*/
+	static markUsed(segment) {
+		if (segment.internal.used) return;
+		segment.internal.used = true;
+		let i;
+		if (segment.reachable) for (i = 0; i < segment.allPrevSegments.length; ++i) {
+			const prevSegment = segment.allPrevSegments[i];
+			prevSegment.allNextSegments.push(segment);
+			prevSegment.nextSegments.push(segment);
+		}
+		else for (i = 0; i < segment.allPrevSegments.length; ++i) segment.allPrevSegments[i].allNextSegments.push(segment);
+	}
+	/**
+	* Marks a previous segment as looped.
+	*/
+	static markPrevSegmentAsLooped(segment, prevSegment) {
+		segment.internal.loopedPrevSegments.push(prevSegment);
+	}
+	/**
+	* Replaces unused segments with the previous segments of each unused segment.
+	*/
+	static flattenUnusedSegments(segments) {
+		const done = Object.create(null);
+		const retv = [];
+		for (let i = 0; i < segments.length; ++i) {
+			const segment = segments[i];
+			if (done[segment.id]) continue;
+			if (!segment.internal.used) for (let j = 0; j < segment.allPrevSegments.length; ++j) {
+				const prevSegment = segment.allPrevSegments[j];
+				if (!done[prevSegment.id]) {
+					done[prevSegment.id] = true;
+					retv.push(prevSegment);
+				}
+			}
+			else {
+				done[segment.id] = true;
+				retv.push(segment);
+			}
+		}
+		return retv;
+	}
+};
 /**
-* Checks if the node is a React component name. React component names must
-* always start with an uppercase letter.
+* Gets whether or not a given segment is reachable.
 */
-function isComponentName(node) {
-	return node.type === "Identifier" && /^[A-Z]/.test(node.name);
-}
-function isReactFunction(node, functionName) {
-	return "name" in node && node.name === functionName || node.type === "MemberExpression" && "name" in node.object && node.object.name === "React" && "name" in node.property && node.property.name === functionName;
+function isReachable(segment) {
+	return segment.reachable;
 }
 /**
-* Checks if the node is a callback argument of forwardRef. This render function
-* should follow the rules of hooks.
+* Creates new segments from the specific range of `context.segmentsList`.
+*
+* When `context.segmentsList` is `[[a, b], [c, d], [e, f]]`, `begin` is `0`, and
+* `end` is `-1`, this creates `[g, h]`. This `g` is from `a`, `c`, and `e`.
+* This `h` is from `b`, `d`, and `f`.
 */
-function isForwardRefCallback(node) {
-	return !!(node.parent && "callee" in node.parent && node.parent.callee && isReactFunction(node.parent.callee, "forwardRef"));
+function makeSegments(context, begin, end, create) {
+	const list = context.segmentsList;
+	const normalizedBegin = begin >= 0 ? begin : list.length + begin;
+	const normalizedEnd = end >= 0 ? end : list.length + end;
+	const segments = [];
+	for (let i = 0; i < context.count; ++i) {
+		const allPrevSegments = [];
+		for (let j = normalizedBegin; j <= normalizedEnd; ++j) allPrevSegments.push(list[j][i]);
+		segments.push(create(context.idGenerator.next(), allPrevSegments));
+	}
+	return segments;
 }
 /**
-* Checks if the node is a callback argument of React.memo. This anonymous
-* functional component should follow the rules of hooks.
+* `segments` becomes doubly in a `finally` block. Then if a code path exits by a
+* control statement (such as `break`, `continue`) from the `finally` block, the
+* destination's segments may be half of the source segments. In that case, this
+* merges segments.
 */
-function isMemoCallback(node) {
-	return !!(node.parent && "callee" in node.parent && node.parent.callee && isReactFunction(node.parent.callee, "memo"));
-}
-function isInsideComponentOrHook(node) {
-	while (node) {
-		const functionName = getFunctionName(node);
-		if (functionName) {
-			if (isComponentName(functionName) || isHook(functionName)) return true;
-		}
-		if (isForwardRefCallback(node) || isMemoCallback(node)) return true;
-		node = node.parent;
+function mergeExtraSegments(context, segments) {
+	let currentSegments = segments;
+	while (currentSegments.length > context.count) {
+		const merged = [];
+		for (let i = 0, length = currentSegments.length / 2 | 0; i < length; ++i) merged.push(CodePathSegment.newNext(context.idGenerator.next(), [currentSegments[i], currentSegments[i + length]]));
+		currentSegments = merged;
 	}
-	return false;
+	return currentSegments;
 }
-function isInsideDoWhileLoop(node) {
-	while (node) {
-		if (node.type === "DoWhileStatement") return true;
-		node = node.parent;
+/**
+* A class to manage forking.
+*/
+var ForkContext = class ForkContext {
+	idGenerator;
+	upper;
+	count;
+	segmentsList;
+	constructor(idGenerator, upper, count) {
+		this.idGenerator = idGenerator;
+		this.upper = upper;
+		this.count = count;
+		this.segmentsList = [];
 	}
-	return false;
-}
-function isInsideTryCatch(node) {
-	while (node) {
-		if (node.type === "TryStatement" || node.type === "CatchClause") return true;
-		node = node.parent;
+	/** The head segments. */
+	get head() {
+		const list = this.segmentsList;
+		return list.length === 0 ? [] : list[list.length - 1];
 	}
-	return false;
-}
-function getNodeWithoutReactNamespace(node) {
-	if (node.type === "MemberExpression" && node.object.type === "Identifier" && node.object.name === "React" && node.property.type === "Identifier" && !node.computed) return node.property;
-	return node;
-}
-function isEffectIdentifier(node, additionalHooks) {
-	if (node.type === "Identifier" && (node.name === "useEffect" || node.name === "useLayoutEffect" || node.name === "useInsertionEffect")) return true;
-	if (additionalHooks && node.type === "Identifier") return additionalHooks.test(node.name);
-	return false;
-}
-function isUseEffectEventIdentifier(node) {
-	return node.type === "Identifier" && node.name === "useEffectEvent";
-}
-function useEffectEventError(fn, called) {
-	if (fn === null) return "React Hook \"useEffectEvent\" can only be called at the top level of your component. It cannot be passed down.";
-	return `\`${fn}\` is a function created with React Hook "useEffectEvent", and can only be called from Effects and Effect Events in the same component.` + (called ? "" : " It cannot be assigned to a variable or passed down.");
-}
-function isUseIdentifier(node) {
-	return isReactFunction(node, "use");
-}
-const rule = {
-	meta: {
-		type: "problem",
-		docs: {
-			description: "Enforces the Rules of Hooks.",
-			recommended: true,
-			url: "https://react.dev/reference/rules/rules-of-hooks"
-		},
-		schema: [{
-			type: "object",
-			additionalProperties: false,
-			properties: { additionalHooks: { type: "string" } }
-		}]
-	},
-	create(context) {
-		context.settings;
-		const rawOptions = context.options && context.options[0];
-		const additionalEffectHooks = rawOptions && rawOptions.additionalHooks ? new RegExp(rawOptions.additionalHooks) : getSettingsFromContext(context).additionalEffectHooks;
-		let lastEffect = null;
-		const codePathReactHooksMapStack = [];
-		const codePathSegmentStack = [];
-		const useEffectEventFunctions = /* @__PURE__ */ new WeakSet();
-		function recordAllUseEffectEventFunctions(scope) {
-			for (const reference of scope.references) {
-				const parent = reference.identifier.parent;
-				if (parent?.type === "VariableDeclarator" && parent.init && parent.init.type === "CallExpression" && parent.init.callee && isUseEffectEventIdentifier(parent.init.callee)) {
-					if (reference.resolved === null) throw new Error("Unexpected null reference.resolved");
-					for (const ref of reference.resolved.references) if (ref !== reference) useEffectEventFunctions.add(ref.identifier);
-				}
-			}
-		}
-		/**
-		* SourceCode that also works down to ESLint 3.0.0
-		*/
-		const getSourceCode = typeof context.getSourceCode === "function" ? () => {
-			return context.getSourceCode();
-		} : () => {
-			return context.sourceCode;
-		};
-		/**
-		* SourceCode#getScope that also works down to ESLint 3.0.0
-		*/
-		const getScope = typeof context.getScope === "function" ? () => {
-			return context.getScope();
-		} : (node) => {
-			return getSourceCode().getScope(node);
-		};
-		function hasFlowSuppression(node, suppression) {
-			const comments = getSourceCode().getAllComments();
-			const flowSuppressionRegex = new RegExp("\\$FlowFixMe\\[" + suppression + "\\]");
-			return comments.some((commentNode) => flowSuppressionRegex.test(commentNode.value) && commentNode.loc != null && node.loc != null && commentNode.loc.end.line === node.loc.start.line - 1);
-		}
-		const analyzer = new CodePathAnalyzer({
-			onCodePathSegmentStart: (segment) => codePathSegmentStack.push(segment),
-			onCodePathSegmentEnd: () => codePathSegmentStack.pop(),
-			onCodePathStart: () => codePathReactHooksMapStack.push(/* @__PURE__ */ new Map()),
-			onCodePathEnd(codePath, codePathNode) {
-				const reactHooksMap = codePathReactHooksMapStack.pop();
-				if (reactHooksMap?.size === 0) return;
-				else if (typeof reactHooksMap === "undefined") throw new Error("Unexpected undefined reactHooksMap");
-				const cyclic = /* @__PURE__ */ new Set();
-				/**
-				* Count the number of code paths from the start of the function to this
-				* segment. For example:
-				*
-				* ```js
-				* function MyComponent() {
-				*   if (condition) {
-				*     // Segment 1
-				*   } else {
-				*     // Segment 2
-				*   }
-				*   // Segment 3
-				* }
-				* ```
-				*
-				* Segments 1 and 2 have one path to the beginning of `MyComponent` and
-				* segment 3 has two paths to the beginning of `MyComponent` since we
-				* could have either taken the path of segment 1 or segment 2.
-				*
-				* Populates `cyclic` with cyclic segments.
-				*/
-				function countPathsFromStart(segment, pathHistory) {
-					const { cache } = countPathsFromStart;
-					let paths = cache.get(segment.id);
-					const pathList = new Set(pathHistory);
-					if (pathList.has(segment.id)) {
-						const pathArray = [...pathList];
-						const cyclicSegments = pathArray.slice(pathArray.indexOf(segment.id) + 1);
-						for (const cyclicSegment of cyclicSegments) cyclic.add(cyclicSegment);
-						return BigInt("0");
-					}
-					pathList.add(segment.id);
-					if (paths !== void 0) return paths;
-					if (codePath.thrownSegments.includes(segment)) paths = BigInt("0");
-					else if (segment.prevSegments.length === 0) paths = BigInt("1");
-					else {
-						paths = BigInt("0");
-						for (const prevSegment of segment.prevSegments) paths += countPathsFromStart(prevSegment, pathList);
-					}
-					if (segment.reachable && paths === BigInt("0")) cache.delete(segment.id);
-					else cache.set(segment.id, paths);
-					return paths;
-				}
-				/**
-				* Count the number of code paths from this segment to the end of the
-				* function. For example:
-				*
-				* ```js
-				* function MyComponent() {
-				*   // Segment 1
-				*   if (condition) {
-				*     // Segment 2
-				*   } else {
-				*     // Segment 3
-				*   }
-				* }
-				* ```
-				*
-				* Segments 2 and 3 have one path to the end of `MyComponent` and
-				* segment 1 has two paths to the end of `MyComponent` since we could
-				* either take the path of segment 1 or segment 2.
-				*
-				* Populates `cyclic` with cyclic segments.
-				*/
-				function countPathsToEnd(segment, pathHistory) {
-					const { cache } = countPathsToEnd;
-					let paths = cache.get(segment.id);
-					const pathList = new Set(pathHistory);
-					if (pathList.has(segment.id)) {
-						const pathArray = Array.from(pathList);
-						const cyclicSegments = pathArray.slice(pathArray.indexOf(segment.id) + 1);
-						for (const cyclicSegment of cyclicSegments) cyclic.add(cyclicSegment);
-						return BigInt("0");
-					}
-					pathList.add(segment.id);
-					if (paths !== void 0) return paths;
-					if (codePath.thrownSegments.includes(segment)) paths = BigInt("0");
-					else if (segment.nextSegments.length === 0) paths = BigInt("1");
-					else {
-						paths = BigInt("0");
-						for (const nextSegment of segment.nextSegments) paths += countPathsToEnd(nextSegment, pathList);
-					}
-					cache.set(segment.id, paths);
-					return paths;
-				}
-				/**
-				* Gets the shortest path length to the start of a code path.
-				* For example:
-				*
-				* ```js
-				* function MyComponent() {
-				*   if (condition) {
-				*     // Segment 1
-				*   }
-				*   // Segment 2
-				* }
-				* ```
-				*
-				* There is only one path from segment 1 to the code path start. Its
-				* length is one so that is the shortest path.
-				*
-				* There are two paths from segment 2 to the code path start. One
-				* through segment 1 with a length of two and another directly to the
-				* start with a length of one. The shortest path has a length of one
-				* so we would return that.
-				*/
-				function shortestPathLengthToStart(segment) {
-					const { cache } = shortestPathLengthToStart;
-					let length = cache.get(segment.id);
-					if (length === null) return Infinity;
-					if (length !== void 0) return length;
-					cache.set(segment.id, null);
-					if (segment.prevSegments.length === 0) length = 1;
-					else {
-						length = Infinity;
-						for (const prevSegment of segment.prevSegments) {
-							const prevLength = shortestPathLengthToStart(prevSegment);
-							if (prevLength < length) length = prevLength;
-						}
-						length += 1;
-					}
-					cache.set(segment.id, length);
-					return length;
-				}
-				countPathsFromStart.cache = /* @__PURE__ */ new Map();
-				countPathsToEnd.cache = /* @__PURE__ */ new Map();
-				shortestPathLengthToStart.cache = /* @__PURE__ */ new Map();
-				const allPathsFromStartToEnd = countPathsToEnd(codePath.initialSegment);
-				const codePathFunctionName = getFunctionName(codePathNode);
-				const isSomewhereInsideComponentOrHook = isInsideComponentOrHook(codePathNode);
-				const isDirectlyInsideComponentOrHook = codePathFunctionName ? isComponentName(codePathFunctionName) || isHook(codePathFunctionName) : isForwardRefCallback(codePathNode) || isMemoCallback(codePathNode);
-				let shortestFinalPathLength = Infinity;
-				for (const finalSegment of codePath.finalSegments) {
-					if (!finalSegment.reachable) continue;
-					const length = shortestPathLengthToStart(finalSegment);
-					if (length < shortestFinalPathLength) shortestFinalPathLength = length;
-				}
-				for (const [segment, reactHooks] of reactHooksMap) {
-					if (!segment.reachable) continue;
-					const possiblyHasEarlyReturn = segment.nextSegments.length === 0 ? shortestFinalPathLength <= shortestPathLengthToStart(segment) : shortestFinalPathLength < shortestPathLengthToStart(segment);
-					const pathsFromStartToEnd = countPathsFromStart(segment) * countPathsToEnd(segment);
-					const cycled = cyclic.has(segment.id);
-					for (const hook of reactHooks) {
-						if (hasFlowSuppression(hook, "react-rule-hook")) continue;
-						if (isUseIdentifier(hook) && isInsideTryCatch(hook)) context.report({
-							node: hook,
-							message: `React Hook "${getSourceCode().getText(hook)}" cannot be called in a try/catch block.`
-						});
-						if ((cycled || isInsideDoWhileLoop(hook)) && !isUseIdentifier(hook)) context.report({
-							node: hook,
-							message: `React Hook "${getSourceCode().getText(hook)}" may be executed more than once. Possibly because it is called in a loop. React Hooks must be called in the exact same order in every component render.`
-						});
-						if (isDirectlyInsideComponentOrHook) {
-							if (codePathNode.async) context.report({
-								node: hook,
-								message: `React Hook "${getSourceCode().getText(hook)}" cannot be called in an async function.`
-							});
-							if (!cycled && pathsFromStartToEnd !== allPathsFromStartToEnd && !isUseIdentifier(hook) && !isInsideDoWhileLoop(hook)) {
-								const message = `React Hook "${getSourceCode().getText(hook)}" is called conditionally. React Hooks must be called in the exact same order in every component render.` + (possiblyHasEarlyReturn ? " Did you accidentally call a React Hook after an early return?" : "");
-								context.report({
-									node: hook,
-									message
-								});
-							}
-						} else if (codePathNode.parent != null && (codePathNode.parent.type === "MethodDefinition" || codePathNode.parent.type === "ClassProperty" || codePathNode.parent.type === "PropertyDefinition") && codePathNode.parent.value === codePathNode) {
-							const message = `React Hook "${getSourceCode().getText(hook)}" cannot be called in a class component. React Hooks must be called in a React function component or a custom React Hook function.`;
-							context.report({
-								node: hook,
-								message
-							});
-						} else if (codePathFunctionName) {
-							const message = `React Hook "${getSourceCode().getText(hook)}" is called in function "${getSourceCode().getText(codePathFunctionName)}" that is neither a React function component nor a custom React Hook function. React component names must start with an uppercase letter. React Hook names must start with the word "use".`;
-							context.report({
-								node: hook,
-								message
-							});
-						} else if (codePathNode.type === "Program") {
-							const message = `React Hook "${getSourceCode().getText(hook)}" cannot be called at the top level. React Hooks must be called in a React function component or a custom React Hook function.`;
-							context.report({
-								node: hook,
-								message
-							});
-						} else if (isSomewhereInsideComponentOrHook && !isUseIdentifier(hook)) {
-							const message = `React Hook "${getSourceCode().getText(hook)}" cannot be called inside a callback. React Hooks must be called in a React function component or a custom React Hook function.`;
-							context.report({
-								node: hook,
-								message
-							});
-						}
-					}
-				}
-			}
-		});
-		return {
-			"*"(node) {
-				analyzer.enterNode(node);
-			},
-			"*:exit"(node) {
-				analyzer.leaveNode(node);
-			},
-			CallExpression(node) {
-				if (isHook(node.callee)) {
-					const reactHooksMap = last(codePathReactHooksMapStack);
-					const codePathSegment = last(codePathSegmentStack);
-					let reactHooks = reactHooksMap.get(codePathSegment);
-					if (!reactHooks) {
-						reactHooks = [];
-						reactHooksMap.set(codePathSegment, reactHooks);
-					}
-					reactHooks.push(node.callee);
-				}
-				const nodeWithoutNamespace = getNodeWithoutReactNamespace(node.callee);
-				if ((isEffectIdentifier(nodeWithoutNamespace, additionalEffectHooks) || isUseEffectEventIdentifier(nodeWithoutNamespace)) && node.arguments.length > 0) lastEffect = node;
-				if (isUseEffectEventIdentifier(nodeWithoutNamespace) && node.parent?.type !== "VariableDeclarator" && node.parent?.type !== "ExpressionStatement") {
-					const message = useEffectEventError(null, false);
-					context.report({
-						node,
-						message
-					});
-				}
-			},
-			Identifier(node) {
-				if (lastEffect == null && useEffectEventFunctions.has(node)) {
-					const message = useEffectEventError(getSourceCode().getText(node), node.parent.type === "CallExpression");
-					context.report({
-						node,
-						message
-					});
-				}
-			},
-			"CallExpression:exit"(node) {
-				if (node === lastEffect) lastEffect = null;
-			},
-			FunctionDeclaration(node) {
-				if (isInsideComponentOrHook(node)) recordAllUseEffectEventFunctions(getScope(node));
-			},
-			ArrowFunctionExpression(node) {
-				if (isInsideComponentOrHook(node)) recordAllUseEffectEventFunctions(getScope(node));
-			},
-			ComponentDeclaration(node) {
-				recordAllUseEffectEventFunctions(getScope(node));
-			},
-			HookDeclaration(node) {
-				recordAllUseEffectEventFunctions(getScope(node));
-			}
-		};
-	}
-};
-/**
-* Gets the static name of a function AST node. For function declarations it is
-* easy. For anonymous function expressions it is much harder. If you search for
-* `IsAnonymousFunctionDefinition()` in the ECMAScript spec you'll find places
-* where JS gives anonymous function expressions names. We roughly detect the
-* same AST nodes with some exceptions to better fit our use case.
-*/
-function getFunctionName(node) {
-	if (node.type === "ComponentDeclaration" || node.type === "HookDeclaration" || node.type === "FunctionDeclaration" || node.type === "FunctionExpression" && node.id) return node.id;
-	else if (node.type === "FunctionExpression" || node.type === "ArrowFunctionExpression") if (node.parent?.type === "VariableDeclarator" && node.parent.init === node) return node.parent.id;
-	else if (node.parent?.type === "AssignmentExpression" && node.parent.right === node && node.parent.operator === "=") return node.parent.left;
-	else if (node.parent?.type === "Property" && node.parent.value === node && !node.parent.computed) return node.parent.key;
-	else if (node.parent?.type === "AssignmentPattern" && node.parent.right === node && !node.parent.computed) return node.parent.left;
-	else return;
-	else return;
-}
-/**
-* Convenience function for peeking the last item in a stack.
-*/
-function last(array) {
-	return array[array.length - 1];
-}
-function assert(cond) {
-	if (!cond) throw new Error("Assertion violated.");
-}
-/**
-* Checks whether or not a given segment is reachable.
-* @param {CodePathSegment} segment A segment to check.
-* @returns {boolean} `true` if the segment is reachable.
-*/
-function isReachable$1(segment) {
-	return segment.reachable;
-}
-/**
-* A code path segment.
-*/
-var CodePathSegment = class CodePathSegment {
-	/**
-	* @param {string} id An identifier.
-	* @param {CodePathSegment[]} allPrevSegments An array of the previous segments.
-	*   This array includes unreachable segments.
-	* @param {boolean} reachable A flag which shows this is reachable.
-	*/
-	constructor(id, allPrevSegments, reachable) {
-		/**
-		* The identifier of this code path.
-		* Rules use it to store additional information of each rule.
-		* @type {string}
-		*/
-		this.id = id;
-		/**
-		* An array of the next segments.
-		* @type {CodePathSegment[]}
-		*/
-		this.nextSegments = [];
-		/**
-		* An array of the previous segments.
-		* @type {CodePathSegment[]}
-		*/
-		this.prevSegments = allPrevSegments.filter(isReachable$1);
-		/**
-		* An array of the next segments.
-		* This array includes unreachable segments.
-		* @type {CodePathSegment[]}
-		*/
-		this.allNextSegments = [];
-		/**
-		* An array of the previous segments.
-		* This array includes unreachable segments.
-		* @type {CodePathSegment[]}
-		*/
-		this.allPrevSegments = allPrevSegments;
-		/**
-		* A flag which shows this is reachable.
-		* @type {boolean}
-		*/
-		this.reachable = reachable;
-		Object.defineProperty(this, "internal", { value: {
-			used: false,
-			loopedPrevSegments: []
-		} });
-	}
-	/**
-	* Checks a given previous segment is coming from the end of a loop.
-	* @param {CodePathSegment} segment A previous segment to check.
-	* @returns {boolean} `true` if the segment is coming from the end of a loop.
-	*/
-	isLoopedPrevSegment(segment) {
-		return this.internal.loopedPrevSegments.includes(segment);
-	}
-	/**
-	* Creates the root segment.
-	* @param {string} id An identifier.
-	* @returns {CodePathSegment} The created segment.
-	*/
-	static newRoot(id) {
-		return new CodePathSegment(id, [], true);
-	}
-	/**
-	* Creates a segment that follows given segments.
-	* @param {string} id An identifier.
-	* @param {CodePathSegment[]} allPrevSegments An array of the previous segments.
-	* @returns {CodePathSegment} The created segment.
-	*/
-	static newNext(id, allPrevSegments) {
-		return new CodePathSegment(id, CodePathSegment.flattenUnusedSegments(allPrevSegments), allPrevSegments.some(isReachable$1));
-	}
-	/**
-	* Creates an unreachable segment that follows given segments.
-	* @param {string} id An identifier.
-	* @param {CodePathSegment[]} allPrevSegments An array of the previous segments.
-	* @returns {CodePathSegment} The created segment.
-	*/
-	static newUnreachable(id, allPrevSegments) {
-		const segment = new CodePathSegment(id, CodePathSegment.flattenUnusedSegments(allPrevSegments), false);
-		CodePathSegment.markUsed(segment);
-		return segment;
-	}
-	/**
-	* Creates a segment that follows given segments.
-	* This factory method does not connect with `allPrevSegments`.
-	* But this inherits `reachable` flag.
-	* @param {string} id An identifier.
-	* @param {CodePathSegment[]} allPrevSegments An array of the previous segments.
-	* @returns {CodePathSegment} The created segment.
-	*/
-	static newDisconnected(id, allPrevSegments) {
-		return new CodePathSegment(id, [], allPrevSegments.some(isReachable$1));
-	}
-	/**
-	* Makes a given segment being used.
-	*
-	* And this function registers the segment into the previous segments as a next.
-	* @param {CodePathSegment} segment A segment to mark.
-	* @returns {void}
-	*/
-	static markUsed(segment) {
-		if (segment.internal.used) return;
-		segment.internal.used = true;
-		let i;
-		if (segment.reachable) for (i = 0; i < segment.allPrevSegments.length; ++i) {
-			const prevSegment = segment.allPrevSegments[i];
-			prevSegment.allNextSegments.push(segment);
-			prevSegment.nextSegments.push(segment);
-		}
-		else for (i = 0; i < segment.allPrevSegments.length; ++i) segment.allPrevSegments[i].allNextSegments.push(segment);
-	}
-	/**
-	* Marks a previous segment as looped.
-	* @param {CodePathSegment} segment A segment.
-	* @param {CodePathSegment} prevSegment A previous segment to mark.
-	* @returns {void}
-	*/
-	static markPrevSegmentAsLooped(segment, prevSegment) {
-		segment.internal.loopedPrevSegments.push(prevSegment);
-	}
-	/**
-	* Replaces unused segments with the previous segments of each unused segment.
-	* @param {CodePathSegment[]} segments An array of segments to replace.
-	* @returns {CodePathSegment[]} The replaced array.
-	*/
-	static flattenUnusedSegments(segments) {
-		const done = Object.create(null);
-		const retv = [];
-		for (let i = 0; i < segments.length; ++i) {
-			const segment = segments[i];
-			if (done[segment.id]) continue;
-			if (!segment.internal.used) for (let j = 0; j < segment.allPrevSegments.length; ++j) {
-				const prevSegment = segment.allPrevSegments[j];
-				if (!done[prevSegment.id]) {
-					done[prevSegment.id] = true;
-					retv.push(prevSegment);
-				}
-			}
-			else {
-				done[segment.id] = true;
-				retv.push(segment);
-			}
-		}
-		return retv;
-	}
-};
-/**
-* Gets whether or not a given segment is reachable.
-* @param {CodePathSegment} segment A segment to get.
-* @returns {boolean} `true` if the segment is reachable.
-*/
-function isReachable(segment) {
-	return segment.reachable;
-}
-/**
-* Creates new segments from the specific range of `context.segmentsList`.
-*
-* When `context.segmentsList` is `[[a, b], [c, d], [e, f]]`, `begin` is `0`, and
-* `end` is `-1`, this creates `[g, h]`. This `g` is from `a`, `c`, and `e`.
-* This `h` is from `b`, `d`, and `f`.
-* @param {ForkContext} context An instance.
-* @param {number} begin The first index of the previous segments.
-* @param {number} end The last index of the previous segments.
-* @param {Function} create A factory function of new segments.
-* @returns {CodePathSegment[]} New segments.
-*/
-function makeSegments(context, begin, end, create) {
-	const list = context.segmentsList;
-	const normalizedBegin = begin >= 0 ? begin : list.length + begin;
-	const normalizedEnd = end >= 0 ? end : list.length + end;
-	const segments = [];
-	for (let i = 0; i < context.count; ++i) {
-		const allPrevSegments = [];
-		for (let j = normalizedBegin; j <= normalizedEnd; ++j) allPrevSegments.push(list[j][i]);
-		segments.push(create(context.idGenerator.next(), allPrevSegments));
-	}
-	return segments;
-}
-/**
-* `segments` becomes doubly in a `finally` block. Then if a code path exits by a
-* control statement (such as `break`, `continue`) from the `finally` block, the
-* destination's segments may be half of the source segments. In that case, this
-* merges segments.
-* @param {ForkContext} context An instance.
-* @param {CodePathSegment[]} segments Segments to merge.
-* @returns {CodePathSegment[]} The merged segments.
-*/
-function mergeExtraSegments(context, segments) {
-	let currentSegments = segments;
-	while (currentSegments.length > context.count) {
-		const merged = [];
-		for (let i = 0, length = currentSegments.length / 2 | 0; i < length; ++i) merged.push(CodePathSegment.newNext(context.idGenerator.next(), [currentSegments[i], currentSegments[i + length]]));
-		currentSegments = merged;
-	}
-	return currentSegments;
-}
-/**
-* A class to manage forking.
-*/
-var ForkContext = class ForkContext {
-	/**
-	* @param {IdGenerator} idGenerator An identifier generator for segments.
-	* @param {ForkContext|null} upper An upper fork context.
-	* @param {number} count A number of parallel segments.
-	*/
-	constructor(idGenerator, upper, count) {
-		this.idGenerator = idGenerator;
-		this.upper = upper;
-		this.count = count;
-		this.segmentsList = [];
-	}
-	/**
-	* The head segments.
-	* @type {CodePathSegment[]}
-	*/
-	get head() {
-		const list = this.segmentsList;
-		return list.length === 0 ? [] : list[list.length - 1];
-	}
-	/**
-	* A flag which shows empty.
-	* @type {boolean}
-	*/
+	/** Whether the segments list is empty. */
 	get empty() {
 		return this.segmentsList.length === 0;
 	}
-	/**
-	* A flag which shows reachable.
-	* @type {boolean}
-	*/
+	/** Whether any head segment is reachable. */
 	get reachable() {
 		const segments = this.head;
 		return segments.length > 0 && segments.some(isReachable);
 	}
 	/**
 	* Creates new segments from this context.
-	* @param {number} begin The first index of previous segments.
-	* @param {number} end The last index of previous segments.
-	* @returns {CodePathSegment[]} New segments.
 	*/
 	makeNext(begin, end) {
 		return makeSegments(this, begin, end, CodePathSegment.newNext);
 	}
 	/**
-	* Creates new segments from this context.
-	* The new segments is always unreachable.
-	* @param {number} begin The first index of previous segments.
-	* @param {number} end The last index of previous segments.
-	* @returns {CodePathSegment[]} New segments.
+	* Creates new unreachable segments from this context.
 	*/
 	makeUnreachable(begin, end) {
 		return makeSegments(this, begin, end, CodePathSegment.newUnreachable);
 	}
 	/**
-	* Creates new segments from this context.
-	* The new segments don't have connections for previous segments.
-	* But these inherit the reachable flag from this context.
-	* @param {number} begin The first index of previous segments.
-	* @param {number} end The last index of previous segments.
-	* @returns {CodePathSegment[]} New segments.
+	* Creates new disconnected segments from this context.
+	* The new segments don't have connections for previous segments,
+	* but inherit the reachable flag.
 	*/
 	makeDisconnected(begin, end) {
 		return makeSegments(this, begin, end, CodePathSegment.newDisconnected);
 	}
 	/**
-	* Adds segments into this context.
-	* The added segments become the head.
-	* @param {CodePathSegment[]} segments Segments to add.
-	* @returns {void}
+	* Adds segments into this context. The added segments become the head.
 	*/
 	add(segments) {
 		assert(segments.length >= this.count, `${segments.length} >= ${this.count}`);
@@ -5156,8 +4672,6 @@ var ForkContext = class ForkContext {
 	/**
 	* Replaces the head segments with given segments.
 	* The current head segments are removed.
-	* @param {CodePathSegment[]} segments Segments to add.
-	* @returns {void}
 	*/
 	replaceHead(segments) {
 		assert(segments.length >= this.count, `${segments.length} >= ${this.count}`);
@@ -5165,8 +4679,6 @@ var ForkContext = class ForkContext {
 	}
 	/**
 	* Adds all segments of a given fork context into this context.
-	* @param {ForkContext} context A fork context to add.
-	* @returns {void}
 	*/
 	addAll(context) {
 		assert(context.count === this.count);
@@ -5175,15 +4687,12 @@ var ForkContext = class ForkContext {
 	}
 	/**
 	* Clears all segments in this context.
-	* @returns {void}
 	*/
 	clear() {
 		this.segmentsList = [];
 	}
 	/**
 	* Creates the root fork context.
-	* @param {IdGenerator} idGenerator An identifier generator for segments.
-	* @returns {ForkContext} New fork context.
 	*/
 	static newRoot(idGenerator) {
 		const context = new ForkContext(idGenerator, null, 1);
@@ -5192,9 +4701,6 @@ var ForkContext = class ForkContext {
 	}
 	/**
 	* Creates an empty fork context preceded by a given context.
-	* @param {ForkContext} parentContext The parent fork context.
-	* @param {boolean} forkLeavingPath A flag which shows inside of `finally` block.
-	* @returns {ForkContext} New fork context.
 	*/
 	static newEmpty(parentContext, forkLeavingPath) {
 		return new ForkContext(parentContext.idGenerator, parentContext, (forkLeavingPath ? 2 : 1) * parentContext.count);
@@ -5202,15 +4708,10 @@ var ForkContext = class ForkContext {
 };
 /**
 * Adds given segments into the `dest` array.
-* If the `others` array does not includes the given segments, adds to the `all`
+* If the `others` array does not include the given segments, adds to the `all`
 * array as well.
 *
 * This adds only reachable and used segments.
-* @param {CodePathSegment[]} dest A destination array (`returnedSegments` or `thrownSegments`).
-* @param {CodePathSegment[]} others Another destination array (`returnedSegments` or `thrownSegments`).
-* @param {CodePathSegment[]} all The unified destination array (`finalSegments`).
-* @param {CodePathSegment[]} segments Segments to add.
-* @returns {void}
 */
 function addToReturnedOrThrown(dest, others, all, segments) {
 	for (let i = 0; i < segments.length; ++i) {
@@ -5221,9 +4722,6 @@ function addToReturnedOrThrown(dest, others, all, segments) {
 }
 /**
 * Gets a loop-context for a `continue` statement.
-* @param {CodePathState} state A state to get.
-* @param {string} label The label of a `continue` statement.
-* @returns {LoopContext} A loop-context for a `continue` statement.
 */
 function getContinueContext(state, label) {
 	if (!label) return state.loopContext;
@@ -5237,9 +4735,6 @@ function getContinueContext(state, label) {
 }
 /**
 * Gets a context for a `break` statement.
-* @param {CodePathState} state A state to get.
-* @param {string} label The label of a `break` statement.
-* @returns {LoopContext|SwitchContext} A context for a `break` statement.
 */
 function getBreakContext(state, label) {
 	let context = state.breakContext;
@@ -5252,8 +4747,6 @@ function getBreakContext(state, label) {
 }
 /**
 * Gets a context for a `return` statement.
-* @param {CodePathState} state A state to get.
-* @returns {TryContext|CodePathState} A context for a `return` statement.
 */
 function getReturnContext(state) {
 	let context = state.tryContext;
@@ -5265,8 +4758,6 @@ function getReturnContext(state) {
 }
 /**
 * Gets a context for a `throw` statement.
-* @param {CodePathState} state A state to get.
-* @returns {TryContext|CodePathState} A context for a `throw` statement.
 */
 function getThrowContext(state) {
 	let context = state.tryContext;
@@ -5278,9 +4769,6 @@ function getThrowContext(state) {
 }
 /**
 * Removes a given element from a given array.
-* @param {any[]} xs An array to remove the specific element.
-* @param {any} x An element to be removed.
-* @returns {void}
 */
 function remove(xs, x) {
 	xs.splice(xs.indexOf(x), 1);
@@ -5291,9 +4779,6 @@ function remove(xs, x) {
 * This is used in a process for switch statements.
 * If there is the "default" chunk before other cases, the order is different
 * between node's and running's.
-* @param {CodePathSegment[]} prevSegments Forward segments to disconnect.
-* @param {CodePathSegment[]} nextSegments Backward segments to disconnect.
-* @returns {void}
 */
 function removeConnection(prevSegments, nextSegments) {
 	for (let i = 0; i < prevSegments.length; ++i) {
@@ -5307,10 +4792,6 @@ function removeConnection(prevSegments, nextSegments) {
 }
 /**
 * Creates looping path.
-* @param {CodePathState} state The instance.
-* @param {CodePathSegment[]} unflattenedFromSegments Segments which are source.
-* @param {CodePathSegment[]} unflattenedToSegments Segments which are destination.
-* @returns {void}
 */
 function makeLooped(state, unflattenedFromSegments, unflattenedToSegments) {
 	const fromSegments = CodePathSegment.flattenUnusedSegments(unflattenedFromSegments);
@@ -5332,10 +4813,6 @@ function makeLooped(state, unflattenedFromSegments, unflattenedToSegments) {
 *
 * - Adds `false` paths to paths which are leaving from the loop.
 * - Sets `true` paths to paths which go to the body.
-* @param {LoopContext} context A loop context to modify.
-* @param {ChoiceContext} choiceContext A choice context of this loop.
-* @param {CodePathSegment[]} head The current head paths.
-* @returns {void}
 */
 function finalizeTestSegmentsOfFor(context, choiceContext, head) {
 	if (!choiceContext.processed) {
@@ -5350,11 +4827,20 @@ function finalizeTestSegmentsOfFor(context, choiceContext, head) {
 * A class which manages state to analyze code paths.
 */
 var CodePathState = class {
-	/**
-	* @param {IdGenerator} idGenerator An id generator to generate id for code
-	*   path segments.
-	* @param {Function} onLooped A callback function to notify looping.
-	*/
+	idGenerator;
+	notifyLooped;
+	forkContext;
+	choiceContext;
+	switchContext;
+	tryContext;
+	loopContext;
+	breakContext;
+	chainContext;
+	currentSegments;
+	initialSegment;
+	finalSegments;
+	returnedForkContext;
+	thrownForkContext;
 	constructor(idGenerator, onLooped) {
 		this.idGenerator = idGenerator;
 		this.notifyLooped = onLooped;
@@ -5367,23 +4853,22 @@ var CodePathState = class {
 		this.chainContext = null;
 		this.currentSegments = [];
 		this.initialSegment = this.forkContext.head[0];
-		const final = this.finalSegments = [];
-		const returned = this.returnedForkContext = [];
-		const thrown = this.thrownForkContext = [];
+		const final = [];
+		this.finalSegments = final;
+		const returned = [];
+		const thrown = [];
+		this.returnedForkContext = returned;
+		this.thrownForkContext = thrown;
 		returned.add = addToReturnedOrThrown.bind(null, returned, thrown, final);
 		thrown.add = addToReturnedOrThrown.bind(null, thrown, returned, final);
 	}
-	/**
-	* The head segments.
-	* @type {CodePathSegment[]}
-	*/
+	/** The head segments. */
 	get headSegments() {
 		return this.forkContext.head;
 	}
 	/**
 	* The parent forking context.
 	* This is used for the root of new forks.
-	* @type {ForkContext}
 	*/
 	get parentForkContext() {
 		const current = this.forkContext;
@@ -5391,9 +4876,6 @@ var CodePathState = class {
 	}
 	/**
 	* Creates and stacks new forking context.
-	* @param {boolean} forkLeavingPath A flag which shows being in a
-	*   "finally" block.
-	* @returns {ForkContext} The created context.
 	*/
 	pushForkContext(forkLeavingPath) {
 		this.forkContext = ForkContext.newEmpty(this.forkContext, forkLeavingPath);
@@ -5401,7 +4883,6 @@ var CodePathState = class {
 	}
 	/**
 	* Pops and merges the last forking context.
-	* @returns {ForkContext} The last context.
 	*/
 	popForkContext() {
 		const lastContext = this.forkContext;
@@ -5411,7 +4892,6 @@ var CodePathState = class {
 	}
 	/**
 	* Creates a new path.
-	* @returns {void}
 	*/
 	forkPath() {
 		this.forkContext.add(this.parentForkContext.makeNext(-1, -1));
@@ -5419,40 +4899,22 @@ var CodePathState = class {
 	/**
 	* Creates a bypass path.
 	* This is used for such as IfStatement which does not have "else" chunk.
-	* @returns {void}
 	*/
 	forkBypassPath() {
 		this.forkContext.add(this.parentForkContext.head);
 	}
 	/**
-	* Creates a context for ConditionalExpression, LogicalExpression, AssignmentExpression (logical assignments only),
-	* IfStatement, WhileStatement, DoWhileStatement, or ForStatement.
-	*
-	* LogicalExpressions have cases that it goes different paths between the
-	* `true` case and the `false` case.
-	*
-	* For Example:
-	*
-	*     if (a || b) {
-	*         foo();
-	*     } else {
-	*         bar();
-	*     }
+	* Creates a context for ConditionalExpression, LogicalExpression,
+	* AssignmentExpression (logical assignments only), IfStatement,
+	* WhileStatement, DoWhileStatement, or ForStatement.
 	*
-	* In this case, `b` is evaluated always in the code path of the `else`
-	* block, but it's not so in the code path of the `if` block.
-	* So there are 3 paths.
-	*
-	*     a -> foo();
-	*     a -> b -> foo();
-	*     a -> b -> bar();
-	* @param {string} kind A kind string.
-	*   If the new context is LogicalExpression's or AssignmentExpression's, this is `"&&"` or `"||"` or `"??"`.
+	* @param kind A kind string.
+	*   If the new context is LogicalExpression's or AssignmentExpression's,
+	*   this is `"&&"` or `"||"` or `"??"`.
 	*   If it's IfStatement's or ConditionalExpression's, this is `"test"`.
 	*   Otherwise, this is `"loop"`.
-	* @param {boolean} isForkingAsResult A flag that shows that goes different
+	* @param isForkingAsResult A flag that shows that goes different
 	*   paths between `true` and `false`.
-	* @returns {void}
 	*/
 	pushChoiceContext(kind, isForkingAsResult) {
 		this.choiceContext = {
@@ -5467,8 +4929,6 @@ var CodePathState = class {
 	}
 	/**
 	* Pops the last choice context and finalizes it.
-	* @throws {Error} (Unreachable.)
-	* @returns {ChoiceContext} The popped context.
 	*/
 	popChoiceContext() {
 		const context = this.choiceContext;
@@ -5513,8 +4973,6 @@ var CodePathState = class {
 	/**
 	* Makes a code path segment of the right-hand operand of a logical
 	* expression.
-	* @throws {Error} (Unreachable.)
-	* @returns {void}
 	*/
 	makeLogicalRight() {
 		const context = this.choiceContext;
@@ -5555,7 +5013,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment of the `if` block.
-	* @returns {void}
 	*/
 	makeIfConsequent() {
 		const context = this.choiceContext;
@@ -5570,7 +5027,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment of the `else` block.
-	* @returns {void}
 	*/
 	makeIfAlternate() {
 		const context = this.choiceContext;
@@ -5583,8 +5039,8 @@ var CodePathState = class {
 	/**
 	* Push a new `ChainExpression` context to the stack.
 	* This method is called on entering to each `ChainExpression` node.
-	* This context is used to count forking in the optional chain then merge them on the exiting from the `ChainExpression` node.
-	* @returns {void}
+	* This context is used to count forking in the optional chain then merge
+	* them on exiting from the `ChainExpression` node.
 	*/
 	pushChainContext() {
 		this.chainContext = {
@@ -5596,7 +5052,6 @@ var CodePathState = class {
 	* Pop a `ChainExpression` context from the stack.
 	* This method is called on exiting from each `ChainExpression` node.
 	* This merges all forks of the last optional chaining.
-	* @returns {void}
 	*/
 	popChainContext() {
 		const context = this.chainContext;
@@ -5607,7 +5062,6 @@ var CodePathState = class {
 	* Create a choice context for optional access.
 	* This method is called on entering to each `(Call|Member)Expression[optional=true]` node.
 	* This creates a choice context as similar to `LogicalExpression[operator="??"]` node.
-	* @returns {void}
 	*/
 	makeOptionalNode() {
 		if (this.chainContext) {
@@ -5617,18 +5071,14 @@ var CodePathState = class {
 	}
 	/**
 	* Create a fork.
-	* This method is called on entering to the `arguments|property` property of each `(Call|Member)Expression` node.
-	* @returns {void}
+	* This method is called on entering to the `arguments|property` property
+	* of each `(Call|Member)Expression` node.
 	*/
 	makeOptionalRight() {
 		if (this.chainContext) this.makeLogicalRight();
 	}
 	/**
 	* Creates a context object of SwitchStatement and stacks it.
-	* @param {boolean} hasCase `true` if the switch statement has one or more
-	*   case parts.
-	* @param {string|null} label The label text.
-	* @returns {void}
 	*/
 	pushSwitchContext(hasCase, label) {
 		this.switchContext = {
@@ -5649,7 +5099,6 @@ var CodePathState = class {
 	* - Creates the next code path segment from `context.brokenForkContext`.
 	* - If the last `SwitchCase` node is not a `default` part, creates a path
 	*   to the `default` body.
-	* @returns {void}
 	*/
 	popSwitchContext() {
 		const context = this.switchContext;
@@ -5676,9 +5125,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for a `SwitchCase` node.
-	* @param {boolean} isEmpty `true` if the body is empty.
-	* @param {boolean} isDefault `true` if the body is the default case.
-	* @returns {void}
 	*/
 	makeSwitchCaseBody(isEmpty, isDefault) {
 		const context = this.switchContext;
@@ -5699,9 +5145,6 @@ var CodePathState = class {
 	}
 	/**
 	* Creates a context object of TryStatement and stacks it.
-	* @param {boolean} hasFinalizer `true` if the try statement has a
-	*   `finally` block.
-	* @returns {void}
 	*/
 	pushTryContext(hasFinalizer) {
 		this.tryContext = {
@@ -5716,7 +5159,6 @@ var CodePathState = class {
 	}
 	/**
 	* Pops the last context of TryStatement and finalizes it.
-	* @returns {void}
 	*/
 	popTryContext() {
 		const context = this.tryContext;
@@ -5727,19 +5169,18 @@ var CodePathState = class {
 		}
 		const returned = context.returnedForkContext;
 		const thrown = context.thrownForkContext;
-		if (returned.empty && thrown.empty) return;
+		if ((returned == null || returned.empty) && thrown.empty) return;
 		const headSegments = this.forkContext.head;
 		this.forkContext = this.forkContext.upper;
 		const normalSegments = headSegments.slice(0, headSegments.length / 2 | 0);
 		const leavingSegments = headSegments.slice(headSegments.length / 2 | 0);
-		if (!returned.empty) getReturnContext(this).returnedForkContext.add(leavingSegments);
+		if (returned && !returned.empty) getReturnContext(this).returnedForkContext.add(leavingSegments);
 		if (!thrown.empty) getThrowContext(this).thrownForkContext.add(leavingSegments);
 		this.forkContext.replaceHead(normalSegments);
-		if (!context.lastOfTryIsReachable && !context.lastOfCatchIsReachable) this.forkContext.makeUnreachable();
+		if (!context.lastOfTryIsReachable && !context.lastOfCatchIsReachable) this.forkContext.makeUnreachable(-1, -1);
 	}
 	/**
 	* Makes a code path segment for a `catch` block.
-	* @returns {void}
 	*/
 	makeCatchBlock() {
 		const context = this.tryContext;
@@ -5760,7 +5201,6 @@ var CodePathState = class {
 	* In the `finally` block, parallel paths are created. The parallel paths
 	* are used as leaving-paths. The leaving-paths are paths from `return`
 	* statements and `throw` statements in a `try` block or a `catch` block.
-	* @returns {void}
 	*/
 	makeFinallyBlock() {
 		const context = this.tryContext;
@@ -5788,7 +5228,6 @@ var CodePathState = class {
 	/**
 	* Makes a code path segment from the first throwable node to the `catch`
 	* block or the `finally` block.
-	* @returns {void}
 	*/
 	makeFirstThrowablePathInTryBlock() {
 		const forkContext = this.forkContext;
@@ -5800,12 +5239,6 @@ var CodePathState = class {
 	}
 	/**
 	* Creates a context object of a loop statement and stacks it.
-	* @param {string} type The type of the node which was triggered. One of
-	*   `WhileStatement`, `DoWhileStatement`, `ForStatement`, `ForInStatement`,
-	*   and `ForStatement`.
-	* @param {string|null} label A label of the node which was triggered.
-	* @throws {Error} (Unreachable - unknown type.)
-	* @returns {void}
 	*/
 	pushLoopContext(type, label) {
 		const forkContext = this.forkContext;
@@ -5815,7 +5248,7 @@ var CodePathState = class {
 				this.pushChoiceContext("loop", false);
 				this.loopContext = {
 					upper: this.loopContext,
-					type,
+					type: "WhileStatement",
 					label,
 					test: void 0,
 					continueDestSegments: null,
@@ -5826,7 +5259,7 @@ var CodePathState = class {
 				this.pushChoiceContext("loop", false);
 				this.loopContext = {
 					upper: this.loopContext,
-					type,
+					type: "DoWhileStatement",
 					label,
 					test: void 0,
 					entrySegments: null,
@@ -5838,7 +5271,7 @@ var CodePathState = class {
 				this.pushChoiceContext("loop", false);
 				this.loopContext = {
 					upper: this.loopContext,
-					type,
+					type: "ForStatement",
 					label,
 					test: void 0,
 					endOfInitSegments: null,
@@ -5868,8 +5301,6 @@ var CodePathState = class {
 	}
 	/**
 	* Pops the last context of a loop statement and finalizes it.
-	* @throws {Error} (Unreachable - unknown type.)
-	* @returns {void}
 	*/
 	popLoopContext() {
 		const context = this.loopContext;
@@ -5905,8 +5336,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for the test part of a WhileStatement.
-	* @param {boolean|undefined} test The test value (only when constant).
-	* @returns {void}
 	*/
 	makeWhileTest(test) {
 		const context = this.loopContext;
@@ -5918,7 +5347,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for the body part of a WhileStatement.
-	* @returns {void}
 	*/
 	makeWhileBody() {
 		const context = this.loopContext;
@@ -5933,7 +5361,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for the body part of a DoWhileStatement.
-	* @returns {void}
 	*/
 	makeDoWhileBody() {
 		const context = this.loopContext;
@@ -5944,8 +5371,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for the test part of a DoWhileStatement.
-	* @param {boolean|undefined} test The test value (only when constant).
-	* @returns {void}
 	*/
 	makeDoWhileTest(test) {
 		const context = this.loopContext;
@@ -5959,8 +5384,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for the test part of a ForStatement.
-	* @param {boolean|undefined} test The test value (only when constant).
-	* @returns {void}
 	*/
 	makeForTest(test) {
 		const context = this.loopContext;
@@ -5974,7 +5397,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for the update part of a ForStatement.
-	* @returns {void}
 	*/
 	makeForUpdate() {
 		const context = this.loopContext;
@@ -5988,7 +5410,6 @@ var CodePathState = class {
 	}
 	/**
 	* Makes a code path segment for the body part of a ForStatement.
-	* @returns {void}
 	*/
 	makeForBody() {
 		const context = this.loopContext;
@@ -6012,7 +5433,6 @@ var CodePathState = class {
 	/**
 	* Makes a code path segment for the left part of a ForInStatement and a
 	* ForOfStatement.
-	* @returns {void}
 	*/
 	makeForInOfLeft() {
 		const context = this.loopContext;
@@ -6025,7 +5445,6 @@ var CodePathState = class {
 	/**
 	* Makes a code path segment for the right part of a ForInStatement and a
 	* ForOfStatement.
-	* @returns {void}
 	*/
 	makeForInOfRight() {
 		const context = this.loopContext;
@@ -6039,7 +5458,6 @@ var CodePathState = class {
 	/**
 	* Makes a code path segment for the body part of a ForInStatement and a
 	* ForOfStatement.
-	* @returns {void}
 	*/
 	makeForInOfBody() {
 		const context = this.loopContext;
@@ -6053,10 +5471,6 @@ var CodePathState = class {
 	}
 	/**
 	* Creates new context for BreakStatement.
-	* @param {boolean} breakable The flag to indicate it can break by
-	*      an unlabeled BreakStatement.
-	* @param {string|null} label The label of this context.
-	* @returns {Object} The new context.
 	*/
 	pushBreakContext(breakable, label) {
 		this.breakContext = {
@@ -6068,787 +5482,1111 @@ var CodePathState = class {
 		return this.breakContext;
 	}
 	/**
-	* Removes the top item of the break context stack.
-	* @returns {Object} The removed context.
+	* Removes the top item of the break context stack.
+	*/
+	popBreakContext() {
+		const context = this.breakContext;
+		const forkContext = this.forkContext;
+		this.breakContext = context.upper;
+		if (!context.breakable) {
+			const brokenForkContext = context.brokenForkContext;
+			if (!brokenForkContext.empty) {
+				brokenForkContext.add(forkContext.head);
+				forkContext.replaceHead(brokenForkContext.makeNext(0, -1));
+			}
+		}
+		return context;
+	}
+	/**
+	* Makes a path for a `break` statement.
+	*
+	* It registers the head segment to a context of `break`.
+	* It makes new unreachable segment, then it set the head with the segment.
+	*/
+	makeBreak(label) {
+		const forkContext = this.forkContext;
+		if (!forkContext.reachable) return;
+		const context = getBreakContext(this, label);
+		if (context) context.brokenForkContext.add(forkContext.head);
+		/* c8 ignore next */
+		forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+	}
+	/**
+	* Makes a path for a `continue` statement.
+	*
+	* It makes a looping path.
+	* It makes new unreachable segment, then it set the head with the segment.
+	*/
+	makeContinue(label) {
+		const forkContext = this.forkContext;
+		if (!forkContext.reachable) return;
+		const context = getContinueContext(this, label);
+		if (context) if (context.continueDestSegments != null) {
+			makeLooped(this, forkContext.head, context.continueDestSegments);
+			if (context.type === "ForInStatement" || context.type === "ForOfStatement") context.brokenForkContext.add(forkContext.head);
+		} else context.continueForkContext.add(forkContext.head);
+		forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+	}
+	/**
+	* Makes a path for a `return` statement.
+	*
+	* It registers the head segment to a context of `return`.
+	* It makes new unreachable segment, then it set the head with the segment.
+	*/
+	makeReturn() {
+		const forkContext = this.forkContext;
+		if (forkContext.reachable) {
+			getReturnContext(this).returnedForkContext.add(forkContext.head);
+			forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+		}
+	}
+	/**
+	* Makes a path for a `throw` statement.
+	*
+	* It registers the head segment to a context of `throw`.
+	* It makes new unreachable segment, then it set the head with the segment.
+	*/
+	makeThrow() {
+		const forkContext = this.forkContext;
+		if (forkContext.reachable) {
+			getThrowContext(this).thrownForkContext.add(forkContext.head);
+			forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+		}
+	}
+	/**
+	* Makes the final path.
+	*/
+	makeFinal() {
+		const segments = this.currentSegments;
+		if (segments.length > 0 && segments[0].reachable) this.returnedForkContext.add(segments);
+	}
+};
+/**
+* A generator for unique ids.
+*/
+var IdGenerator = class {
+	prefix;
+	n;
+	constructor(prefix) {
+		this.prefix = String(prefix);
+		this.n = 0;
+	}
+	/**
+	* Generates id.
+	*/
+	next() {
+		this.n = 1 + this.n | 0;
+		/* c8 ignore start */
+		if (this.n < 0) this.n = 1;
+		return this.prefix + this.n;
+	}
+};
+/**
+* A code path.
+*/
+var CodePath = class {
+	/** The identifier of this code path. */
+	id;
+	/**
+	* The reason that this code path was started. May be "program",
+	* "function", "class-field-initializer", or "class-static-block".
+	*/
+	origin;
+	/** The code path of the upper function scope. */
+	upper;
+	/** The code paths of nested function scopes. */
+	childCodePaths;
+	/** Internal state for the code path. */
+	internal;
+	constructor({ id, origin, upper, onLooped }) {
+		this.id = id;
+		this.origin = origin;
+		this.upper = upper;
+		this.childCodePaths = [];
+		this.internal = new CodePathState(new IdGenerator(`${id}_`), onLooped);
+		if (upper) upper.childCodePaths.push(this);
+	}
+	/**
+	* Gets the state of a given code path.
 	*/
-	popBreakContext() {
-		const context = this.breakContext;
-		const forkContext = this.forkContext;
-		this.breakContext = context.upper;
-		if (!context.breakable) {
-			const brokenForkContext = context.brokenForkContext;
-			if (!brokenForkContext.empty) {
-				brokenForkContext.add(forkContext.head);
-				forkContext.replaceHead(brokenForkContext.makeNext(0, -1));
-			}
-		}
-		return context;
+	static getState(codePath) {
+		return codePath.internal;
+	}
+	/** The initial code path segment. */
+	get initialSegment() {
+		return this.internal.initialSegment;
 	}
 	/**
-	* Makes a path for a `break` statement.
-	*
-	* It registers the head segment to a context of `break`.
-	* It makes new unreachable segment, then it set the head with the segment.
-	* @param {string} label A label of the break statement.
-	* @returns {void}
+	* Final code path segments.
+	* This array is a mix of `returnedSegments` and `thrownSegments`.
 	*/
-	makeBreak(label) {
-		const forkContext = this.forkContext;
-		if (!forkContext.reachable) return;
-		const context = getBreakContext(this, label);
-		if (context) context.brokenForkContext.add(forkContext.head);
-		/* c8 ignore next */
-		forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+	get finalSegments() {
+		return this.internal.finalSegments;
 	}
 	/**
-	* Makes a path for a `continue` statement.
-	*
-	* It makes a looping path.
-	* It makes new unreachable segment, then it set the head with the segment.
-	* @param {string} label A label of the continue statement.
-	* @returns {void}
+	* Final code path segments which is with `return` statements.
+	* This array contains the last path segment if it's reachable.
+	* Since the reachable last path returns `undefined`.
 	*/
-	makeContinue(label) {
-		const forkContext = this.forkContext;
-		if (!forkContext.reachable) return;
-		const context = getContinueContext(this, label);
-		if (context) if (context.continueDestSegments) {
-			makeLooped(this, forkContext.head, context.continueDestSegments);
-			if (context.type === "ForInStatement" || context.type === "ForOfStatement") context.brokenForkContext.add(forkContext.head);
-		} else context.continueForkContext.add(forkContext.head);
-		forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+	get returnedSegments() {
+		return this.internal.returnedForkContext;
+	}
+	/** Final code path segments which is with `throw` statements. */
+	get thrownSegments() {
+		return this.internal.thrownForkContext;
+	}
+	/** Current code path segments. */
+	get currentSegments() {
+		return this.internal.currentSegments;
 	}
 	/**
-	* Makes a path for a `return` statement.
+	* Traverses all segments in this code path.
 	*
-	* It registers the head segment to a context of `return`.
-	* It makes new unreachable segment, then it set the head with the segment.
-	* @returns {void}
+	* This method enumerates segments in order from the head.
+	*
+	* The `controller` object has two methods:
+	* - `controller.skip()` - Skip the following segments in this branch.
+	* - `controller.break()` - Skip all following segments.
 	*/
-	makeReturn() {
-		const forkContext = this.forkContext;
-		if (forkContext.reachable) {
-			getReturnContext(this).returnedForkContext.add(forkContext.head);
-			forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+	traverseSegments(options, callback) {
+		let resolvedOptions;
+		let resolvedCallback;
+		if (typeof options === "function") {
+			resolvedCallback = options;
+			resolvedOptions = {};
+		} else {
+			resolvedOptions = options || {};
+			resolvedCallback = callback;
+		}
+		const startSegment = resolvedOptions.first || this.internal.initialSegment;
+		const lastSegment = resolvedOptions.last;
+		let item = null;
+		let index = 0;
+		let end = 0;
+		let segment = null;
+		const visited = Object.create(null);
+		const stack = [[startSegment, 0]];
+		let skippedSegment = null;
+		let broken = false;
+		const controller = {
+			skip() {
+				if (stack.length <= 1) broken = true;
+				else skippedSegment = stack[stack.length - 2][0];
+			},
+			break() {
+				broken = true;
+			}
+		};
+		function isVisited(prevSegment) {
+			return visited[prevSegment.id] || segment.isLoopedPrevSegment(prevSegment);
+		}
+		while (stack.length > 0) {
+			item = stack[stack.length - 1];
+			segment = item[0];
+			index = item[1];
+			if (index === 0) {
+				if (visited[segment.id]) {
+					stack.pop();
+					continue;
+				}
+				if (segment !== startSegment && segment.prevSegments.length > 0 && !segment.prevSegments.every(isVisited)) {
+					stack.pop();
+					continue;
+				}
+				if (skippedSegment && segment.prevSegments.includes(skippedSegment)) skippedSegment = null;
+				visited[segment.id] = true;
+				if (!skippedSegment) {
+					resolvedCallback.call(this, segment, controller);
+					if (segment === lastSegment) controller.skip();
+					if (broken) break;
+				}
+			}
+			end = segment.nextSegments.length - 1;
+			if (index < end) {
+				item[1] += 1;
+				stack.push([segment.nextSegments[index], 0]);
+			} else if (index === end) {
+				item[0] = segment.nextSegments[index];
+				item[1] = 0;
+			} else stack.pop();
+		}
+	}
+};
+const breakableTypePattern = /^(?:(?:Do)?While|For(?:In|Of)?|Switch)Statement$/u;
+/**
+* Checks whether or not a given node is a `case` node (not `default` node).
+*/
+function isCaseNode(node) {
+	return Boolean(node.test);
+}
+/**
+* Checks if a given node appears as the value of a PropertyDefinition node.
+*/
+function isPropertyDefinitionValue(node) {
+	const parent = node.parent;
+	return parent && parent.type === "PropertyDefinition" && parent.value === node;
+}
+/**
+* Checks whether the given logical operator is taken into account for the code
+* path analysis.
+*/
+function isHandledLogicalOperator(operator) {
+	return operator === "&&" || operator === "||" || operator === "??";
+}
+/**
+* Checks whether the given assignment operator is a logical assignment operator.
+* Logical assignments are taken into account for the code path analysis
+* because of their short-circuiting semantics.
+*/
+function isLogicalAssignmentOperator(operator) {
+	return operator === "&&=" || operator === "||=" || operator === "??=";
+}
+/**
+* Gets the label if the parent node of a given node is a LabeledStatement.
+*/
+function getLabel(node) {
+	if (node.parent.type === "LabeledStatement") return node.parent.label.name;
+	return null;
+}
+/**
+* Checks whether or not a given logical expression node goes different path
+* between the `true` case and the `false` case.
+*/
+function isForkingByTrueOrFalse(node) {
+	const parent = node.parent;
+	switch (parent.type) {
+		case "ConditionalExpression":
+		case "IfStatement":
+		case "WhileStatement":
+		case "DoWhileStatement":
+		case "ForStatement": return parent.test === node;
+		case "LogicalExpression": return isHandledLogicalOperator(parent.operator);
+		case "AssignmentExpression": return isLogicalAssignmentOperator(parent.operator);
+		default: return false;
+	}
+}
+/**
+* Gets the boolean value of a given literal node.
+*
+* This is used to detect infinity loops (e.g. `while (true) {}`).
+* Statements preceded by an infinity loop are unreachable if the loop didn't
+* have any `break` statement.
+*/
+function getBooleanValueIfSimpleConstant(node) {
+	if (node.type === "Literal") return Boolean(node.value);
+}
+/**
+* Checks that a given identifier node is a reference or not.
+*
+* This is used to detect the first throwable node in a `try` block.
+*/
+function isIdentifierReference(node) {
+	const parent = node.parent;
+	switch (parent.type) {
+		case "LabeledStatement":
+		case "BreakStatement":
+		case "ContinueStatement":
+		case "ArrayPattern":
+		case "RestElement":
+		case "ImportSpecifier":
+		case "ImportDefaultSpecifier":
+		case "ImportNamespaceSpecifier":
+		case "CatchClause": return false;
+		case "FunctionDeclaration":
+		case "ComponentDeclaration":
+		case "HookDeclaration":
+		case "FunctionExpression":
+		case "ArrowFunctionExpression":
+		case "ClassDeclaration":
+		case "ClassExpression":
+		case "VariableDeclarator": return parent.id !== node;
+		case "Property":
+		case "PropertyDefinition":
+		case "MethodDefinition": return parent.key !== node || parent.computed || parent.shorthand;
+		case "AssignmentPattern": return parent.key !== node;
+		default: return true;
+	}
+}
+/**
+* Updates the current segment with the head segment.
+* This is similar to local branches and tracking branches of git.
+*
+* To separate the current and the head is in order to not make useless segments.
+*
+* In this process, both "onCodePathSegmentStart" and "onCodePathSegmentEnd"
+* events are fired.
+*/
+function forwardCurrentToHead(analyzer, node) {
+	const codePath = analyzer.codePath;
+	const state = CodePath.getState(codePath);
+	const currentSegments = state.currentSegments;
+	const headSegments = state.headSegments;
+	const end = Math.max(currentSegments.length, headSegments.length);
+	let i;
+	let currentSegment;
+	let headSegment;
+	for (i = 0; i < end; ++i) {
+		currentSegment = currentSegments[i];
+		headSegment = headSegments[i];
+		if (currentSegment !== headSegment && currentSegment) {
+			if (currentSegment.reachable) analyzer.emitter.emit("onCodePathSegmentEnd", currentSegment, node);
 		}
 	}
-	/**
-	* Makes a path for a `throw` statement.
-	*
-	* It registers the head segment to a context of `throw`.
-	* It makes new unreachable segment, then it set the head with the segment.
-	* @returns {void}
-	*/
-	makeThrow() {
-		const forkContext = this.forkContext;
-		if (forkContext.reachable) {
-			getThrowContext(this).thrownForkContext.add(forkContext.head);
-			forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
+	state.currentSegments = headSegments;
+	for (i = 0; i < end; ++i) {
+		currentSegment = currentSegments[i];
+		headSegment = headSegments[i];
+		if (currentSegment !== headSegment && headSegment) {
+			CodePathSegment.markUsed(headSegment);
+			if (headSegment.reachable) analyzer.emitter.emit("onCodePathSegmentStart", headSegment, node);
 		}
 	}
+}
+/**
+* Updates the current segment with empty.
+* This is called at the last of functions or the program.
+*/
+function leaveFromCurrentSegment(analyzer, node) {
+	const state = CodePath.getState(analyzer.codePath);
+	const currentSegments = state.currentSegments;
+	for (let i = 0; i < currentSegments.length; ++i) {
+		const currentSegment = currentSegments[i];
+		if (currentSegment.reachable) analyzer.emitter.emit("onCodePathSegmentEnd", currentSegment, node);
+	}
+	state.currentSegments = [];
+}
+/**
+* Updates the code path due to the position of a given node in the parent node
+* thereof.
+*
+* For example, if the node is `parent.consequent`, this creates a fork from the
+* current path.
+*/
+function preprocess(analyzer, node) {
+	const codePath = analyzer.codePath;
+	const state = CodePath.getState(codePath);
+	const parent = node.parent;
+	switch (parent.type) {
+		case "CallExpression":
+			if (parent.optional === true && parent.arguments.length >= 1 && parent.arguments[0] === node) state.makeOptionalRight();
+			break;
+		case "MemberExpression":
+			if (parent.optional === true && parent.property === node) state.makeOptionalRight();
+			break;
+		case "LogicalExpression":
+			if (parent.right === node && isHandledLogicalOperator(parent.operator)) state.makeLogicalRight();
+			break;
+		case "AssignmentExpression":
+			if (parent.right === node && isLogicalAssignmentOperator(parent.operator)) state.makeLogicalRight();
+			break;
+		case "ConditionalExpression":
+		case "IfStatement":
+			if (parent.consequent === node) state.makeIfConsequent();
+			else if (parent.alternate === node) state.makeIfAlternate();
+			break;
+		case "SwitchCase":
+			if (parent.consequent[0] === node) state.makeSwitchCaseBody(false, !parent.test);
+			break;
+		case "TryStatement":
+			if (parent.handler === node) state.makeCatchBlock();
+			else if (parent.finalizer === node) state.makeFinallyBlock();
+			break;
+		case "WhileStatement":
+			if (parent.test === node) state.makeWhileTest(getBooleanValueIfSimpleConstant(node));
+			else {
+				assert(parent.body === node);
+				state.makeWhileBody();
+			}
+			break;
+		case "DoWhileStatement":
+			if (parent.body === node) state.makeDoWhileBody();
+			else {
+				assert(parent.test === node);
+				state.makeDoWhileTest(getBooleanValueIfSimpleConstant(node));
+			}
+			break;
+		case "ForStatement":
+			if (parent.test === node) state.makeForTest(getBooleanValueIfSimpleConstant(node));
+			else if (parent.update === node) state.makeForUpdate();
+			else if (parent.body === node) state.makeForBody();
+			break;
+		case "ForInStatement":
+		case "ForOfStatement":
+			if (parent.left === node) state.makeForInOfLeft();
+			else if (parent.right === node) state.makeForInOfRight();
+			else {
+				assert(parent.body === node);
+				state.makeForInOfBody();
+			}
+			break;
+		case "AssignmentPattern":
+			if (parent.right === node) {
+				state.pushForkContext();
+				state.forkBypassPath();
+				state.forkPath();
+			}
+			break;
+		default: break;
+	}
+}
+/**
+* Updates the code path due to the type of a given node in entering.
+*/
+function processCodePathToEnter(analyzer, node) {
+	let codePath = analyzer.codePath;
+	let state = codePath && CodePath.getState(codePath);
+	const parent = node.parent;
 	/**
-	* Makes the final path.
-	* @returns {void}
+	* Creates a new code path and trigger the onCodePathStart event
+	* based on the currently selected node.
 	*/
-	makeFinal() {
-		const segments = this.currentSegments;
-		if (segments.length > 0 && segments[0].reachable) this.returnedForkContext.add(segments);
+	function startCodePath(origin) {
+		if (codePath) forwardCurrentToHead(analyzer, node);
+		codePath = analyzer.codePath = new CodePath({
+			id: analyzer.idGenerator.next(),
+			origin,
+			upper: codePath,
+			onLooped: analyzer.onLooped
+		});
+		state = CodePath.getState(codePath);
+		analyzer.emitter.emit("onCodePathStart", codePath, node);
+	}
+	if (isPropertyDefinitionValue(node)) startCodePath("class-field-initializer");
+	switch (node.type) {
+		case "Program":
+			startCodePath("program");
+			break;
+		case "FunctionDeclaration":
+		case "ComponentDeclaration":
+		case "HookDeclaration":
+		case "FunctionExpression":
+		case "ArrowFunctionExpression":
+			startCodePath("function");
+			break;
+		case "StaticBlock":
+			startCodePath("class-static-block");
+			break;
+		case "ChainExpression":
+			state.pushChainContext();
+			break;
+		case "CallExpression":
+			if (node.optional === true) state.makeOptionalNode();
+			break;
+		case "MemberExpression":
+			if (node.optional === true) state.makeOptionalNode();
+			break;
+		case "LogicalExpression":
+			if (isHandledLogicalOperator(node.operator)) state.pushChoiceContext(node.operator, isForkingByTrueOrFalse(node));
+			break;
+		case "AssignmentExpression":
+			if (isLogicalAssignmentOperator(node.operator)) state.pushChoiceContext(node.operator.slice(0, -1), isForkingByTrueOrFalse(node));
+			break;
+		case "ConditionalExpression":
+		case "IfStatement":
+			state.pushChoiceContext("test", false);
+			break;
+		case "SwitchStatement":
+			state.pushSwitchContext(node.cases.some(isCaseNode), getLabel(node));
+			break;
+		case "TryStatement":
+			state.pushTryContext(Boolean(node.finalizer));
+			break;
+		case "SwitchCase":
+			if (parent.discriminant !== node && parent.cases[0] !== node) state.forkPath();
+			break;
+		case "WhileStatement":
+		case "DoWhileStatement":
+		case "ForStatement":
+		case "ForInStatement":
+		case "ForOfStatement":
+			state.pushLoopContext(node.type, getLabel(node));
+			break;
+		case "LabeledStatement":
+			if (!breakableTypePattern.test(node.body.type)) state.pushBreakContext(false, node.label.name);
+			break;
+		default: break;
+	}
+	forwardCurrentToHead(analyzer, node);
+}
+/**
+* Updates the code path due to the type of a given node in leaving.
+*/
+function processCodePathToExit(analyzer, node) {
+	const codePath = analyzer.codePath;
+	const state = CodePath.getState(codePath);
+	let dontForward = false;
+	switch (node.type) {
+		case "ChainExpression":
+			state.popChainContext();
+			break;
+		case "IfStatement":
+		case "ConditionalExpression":
+			state.popChoiceContext();
+			break;
+		case "LogicalExpression":
+			if (isHandledLogicalOperator(node.operator)) state.popChoiceContext();
+			break;
+		case "AssignmentExpression":
+			if (isLogicalAssignmentOperator(node.operator)) state.popChoiceContext();
+			break;
+		case "SwitchStatement":
+			state.popSwitchContext();
+			break;
+		case "SwitchCase":
+			if (node.consequent.length === 0) state.makeSwitchCaseBody(true, !node.test);
+			if (state.forkContext.reachable) dontForward = true;
+			break;
+		case "TryStatement":
+			state.popTryContext();
+			break;
+		case "BreakStatement":
+			forwardCurrentToHead(analyzer, node);
+			state.makeBreak(node.label && node.label.name);
+			dontForward = true;
+			break;
+		case "ContinueStatement":
+			forwardCurrentToHead(analyzer, node);
+			state.makeContinue(node.label && node.label.name);
+			dontForward = true;
+			break;
+		case "ReturnStatement":
+			forwardCurrentToHead(analyzer, node);
+			state.makeReturn();
+			dontForward = true;
+			break;
+		case "ThrowStatement":
+			forwardCurrentToHead(analyzer, node);
+			state.makeThrow();
+			dontForward = true;
+			break;
+		case "Identifier":
+			if (isIdentifierReference(node)) {
+				state.makeFirstThrowablePathInTryBlock();
+				dontForward = true;
+			}
+			break;
+		case "CallExpression":
+		case "ImportExpression":
+		case "MemberExpression":
+		case "NewExpression":
+		case "YieldExpression":
+			state.makeFirstThrowablePathInTryBlock();
+			break;
+		case "WhileStatement":
+		case "DoWhileStatement":
+		case "ForStatement":
+		case "ForInStatement":
+		case "ForOfStatement":
+			state.popLoopContext();
+			break;
+		case "AssignmentPattern":
+			state.popForkContext();
+			break;
+		case "LabeledStatement":
+			if (!breakableTypePattern.test(node.body.type)) state.popBreakContext();
+			break;
+		default: break;
 	}
-};
+	if (!dontForward) forwardCurrentToHead(analyzer, node);
+}
 /**
-* A generator for unique ids.
+* Updates the code path to finalize the current code path.
 */
-var IdGenerator = class {
-	/**
-	* @param {string} prefix Optional. A prefix of generated ids.
-	*/
-	constructor(prefix) {
-		this.prefix = String(prefix);
-		this.n = 0;
+function postprocess(analyzer, node) {
+	function endCodePath() {
+		const codePath = analyzer.codePath;
+		CodePath.getState(codePath).makeFinal();
+		leaveFromCurrentSegment(analyzer, node);
+		analyzer.emitter.emit("onCodePathEnd", codePath, node);
+		analyzer.codePath = analyzer.codePath.upper;
 	}
-	/**
-	* Generates id.
-	* @returns {string} A generated id.
-	*/
-	next() {
-		this.n = 1 + this.n | 0;
-		/* c8 ignore start */
-		if (this.n < 0) this.n = 1;
-		return this.prefix + this.n;
+	switch (node.type) {
+		case "Program":
+		case "FunctionDeclaration":
+		case "ComponentDeclaration":
+		case "HookDeclaration":
+		case "FunctionExpression":
+		case "ArrowFunctionExpression":
+		case "StaticBlock":
+			endCodePath();
+			break;
+		case "CallExpression":
+			if (node.optional === true && node.arguments.length === 0) CodePath.getState(analyzer.codePath).makeOptionalRight();
+			break;
+		default: break;
 	}
-};
+	if (isPropertyDefinitionValue(node)) endCodePath();
+}
 /**
-* A code path.
+* The class to analyze code paths.
+* This class implements the EventGenerator interface.
 */
-var CodePath = class {
-	/**
-	* Creates a new instance.
-	* @param {Object} options Options for the function (see below).
-	* @param {string} options.id An identifier.
-	* @param {string} options.origin The type of code path origin.
-	* @param {CodePath|null} options.upper The code path of the upper function scope.
-	* @param {Function} options.onLooped A callback function to notify looping.
-	*/
-	constructor({ id, origin, upper, onLooped }) {
-		/**
-		* The identifier of this code path.
-		* Rules use it to store additional information of each rule.
-		* @type {string}
-		*/
-		this.id = id;
-		/**
-		* The reason that this code path was started. May be "program",
-		* "function", "class-field-initializer", or "class-static-block".
-		* @type {string}
-		*/
-		this.origin = origin;
-		/**
-		* The code path of the upper function scope.
-		* @type {CodePath|null}
-		*/
-		this.upper = upper;
-		/**
-		* The code paths of nested function scopes.
-		* @type {CodePath[]}
-		*/
-		this.childCodePaths = [];
-		Object.defineProperty(this, "internal", { value: new CodePathState(new IdGenerator(`${id}_`), onLooped) });
-		if (upper) upper.childCodePaths.push(this);
+var CodePathAnalyzer = class {
+	emitter;
+	codePath;
+	idGenerator;
+	currentNode;
+	onLooped;
+	constructor(emitters) {
+		this.emitter = { emit(event, ...args) {
+			emitters[event]?.(...args);
+		} };
+		this.codePath = null;
+		this.idGenerator = new IdGenerator("s");
+		this.currentNode = null;
+		this.onLooped = this._onLooped.bind(this);
 	}
 	/**
-	* Gets the state of a given code path.
-	* @param {CodePath} codePath A code path to get.
-	* @returns {CodePathState} The state of the code path.
+	* Does the process to enter a given AST node.
+	* This updates state of analysis and calls `enterNode` of the wrapped.
 	*/
-	static getState(codePath) {
-		return codePath.internal;
+	enterNode(node) {
+		this.currentNode = node;
+		if (node.parent) preprocess(this, node);
+		processCodePathToEnter(this, node);
+		this.currentNode = null;
 	}
 	/**
-	* The initial code path segment.
-	* @type {CodePathSegment}
+	* Does the process to leave a given AST node.
+	* This updates state of analysis and calls `leaveNode` of the wrapped.
 	*/
-	get initialSegment() {
-		return this.internal.initialSegment;
+	leaveNode(node) {
+		this.currentNode = node;
+		processCodePathToExit(this, node);
+		postprocess(this, node);
+		this.currentNode = null;
 	}
 	/**
-	* Final code path segments.
-	* This array is a mix of `returnedSegments` and `thrownSegments`.
-	* @type {CodePathSegment[]}
+	* This is called on a code path looped.
+	* Then this raises a looped event.
 	*/
-	get finalSegments() {
-		return this.internal.finalSegments;
+	_onLooped(fromSegment, toSegment) {
+		if (fromSegment.reachable && toSegment.reachable) this.emitter.emit("onCodePathSegmentLoop", fromSegment, toSegment, this.currentNode);
 	}
-	/**
-	* Final code path segments which is with `return` statements.
-	* This array contains the last path segment if it's reachable.
-	* Since the reachable last path returns `undefined`.
-	* @type {CodePathSegment[]}
-	*/
-	get returnedSegments() {
-		return this.internal.returnedForkContext;
+};
+
+//#endregion
+//#region src/rules/rules-of-hooks/rules-of-hooks.ts
+/**
+* Catch all identifiers that begin with "use" followed by an uppercase Latin
+* character to exclude identifiers like "user".
+*/
+function isHookName(s) {
+	return s === "use" || /^use[A-Z0-9]/.test(s);
+}
+/**
+* We consider hooks to be a hook name identifier or a member expression
+* containing a hook name.
+*/
+function isHook(node) {
+	if (node.type === "Identifier") return isHookName(node.name);
+	else if (node.type === "MemberExpression" && !node.computed && isHook(node.property)) {
+		const obj = node.object;
+		return obj.type === "Identifier" && /^[A-Z].*/.test(obj.name);
+	} else return false;
+}
+/**
+* Checks if the node is a React component name. React component names must
+* always start with an uppercase letter.
+*/
+function isComponentName(node) {
+	return node.type === "Identifier" && /^[A-Z]/.test(node.name);
+}
+function isReactFunction(node, functionName) {
+	return "name" in node && node.name === functionName || node.type === "MemberExpression" && "name" in node.object && node.object.name === "React" && "name" in node.property && node.property.name === functionName;
+}
+/**
+* Checks if the node is a callback argument of forwardRef. This render function
+* should follow the rules of hooks.
+*/
+function isForwardRefCallback(node) {
+	return !!(node.parent && "callee" in node.parent && node.parent.callee && isReactFunction(node.parent.callee, "forwardRef"));
+}
+/**
+* Checks if the node is a callback argument of React.memo. This anonymous
+* functional component should follow the rules of hooks.
+*/
+function isMemoCallback(node) {
+	return !!(node.parent && "callee" in node.parent && node.parent.callee && isReactFunction(node.parent.callee, "memo"));
+}
+function isInsideComponentOrHook(node) {
+	while (node) {
+		const functionName = getFunctionName(node);
+		if (functionName) {
+			if (isComponentName(functionName) || isHook(functionName)) return true;
+		}
+		if (isForwardRefCallback(node) || isMemoCallback(node)) return true;
+		node = node.parent;
 	}
-	/**
-	* Final code path segments which is with `throw` statements.
-	* @type {CodePathSegment[]}
-	*/
-	get thrownSegments() {
-		return this.internal.thrownForkContext;
+	return false;
+}
+function isInsideDoWhileLoop(node) {
+	while (node) {
+		if (node.type === "DoWhileStatement") return true;
+		node = node.parent;
 	}
-	/**
-	* Current code path segments.
-	* @type {CodePathSegment[]}
-	*/
-	get currentSegments() {
-		return this.internal.currentSegments;
+	return false;
+}
+function isInsideTryCatch(node) {
+	while (node) {
+		if (node.type === "TryStatement" || node.type === "CatchClause") return true;
+		node = node.parent;
 	}
-	/**
-	* Traverses all segments in this code path.
-	*
-	*     codePath.traverseSegments(function(segment, controller) {
-	*         // do something.
-	*     });
-	*
-	* This method enumerates segments in order from the head.
-	*
-	* The `controller` object has two methods.
-	*
-	* - `controller.skip()` - Skip the following segments in this branch.
-	* - `controller.break()` - Skip all following segments.
-	* @param {Object} [options] Omittable.
-	* @param {CodePathSegment} [options.first] The first segment to traverse.
-	* @param {CodePathSegment} [options.last] The last segment to traverse.
-	* @param {Function} callback A callback function.
-	* @returns {void}
-	*/
-	traverseSegments(options, callback) {
-		let resolvedOptions;
-		let resolvedCallback;
-		if (typeof options === "function") {
-			resolvedCallback = options;
-			resolvedOptions = {};
-		} else {
-			resolvedOptions = options || {};
-			resolvedCallback = callback;
-		}
-		const startSegment = resolvedOptions.first || this.internal.initialSegment;
-		const lastSegment = resolvedOptions.last;
-		let item = null;
-		let index = 0;
-		let end = 0;
-		let segment = null;
-		const visited = Object.create(null);
-		const stack = [[startSegment, 0]];
-		let skippedSegment = null;
-		let broken = false;
-		const controller = {
-			skip() {
-				if (stack.length <= 1) broken = true;
-				else skippedSegment = stack[stack.length - 2][0];
-			},
-			break() {
-				broken = true;
+	return false;
+}
+function getNodeWithoutReactNamespace(node) {
+	if (node.type === "MemberExpression" && node.object.type === "Identifier" && node.object.name === "React" && node.property.type === "Identifier" && !node.computed) return node.property;
+	return node;
+}
+function isEffectIdentifier(node, additionalHooks) {
+	if (node.type === "Identifier" && (node.name === "useEffect" || node.name === "useLayoutEffect" || node.name === "useInsertionEffect")) return true;
+	if (additionalHooks && node.type === "Identifier") return additionalHooks.test(node.name);
+	return false;
+}
+function isUseEffectEventIdentifier(node) {
+	return node.type === "Identifier" && node.name === "useEffectEvent";
+}
+function useEffectEventError(fn, called) {
+	if (fn === null) return "React Hook \"useEffectEvent\" can only be called at the top level of your component. It cannot be passed down.";
+	return `\`${fn}\` is a function created with React Hook "useEffectEvent", and can only be called from Effects and Effect Events in the same component.` + (called ? "" : " It cannot be assigned to a variable or passed down.");
+}
+function isUseIdentifier(node) {
+	return isReactFunction(node, "use");
+}
+const rule = {
+	meta: {
+		type: "problem",
+		docs: {
+			description: "Enforces the Rules of Hooks.",
+			recommended: true,
+			url: "https://react.dev/reference/rules/rules-of-hooks"
+		},
+		schema: [{
+			type: "object",
+			additionalProperties: false,
+			properties: { additionalHooks: { type: "string" } }
+		}]
+	},
+	create(context) {
+		context.settings;
+		const rawOptions = context.options && context.options[0];
+		const additionalEffectHooks = rawOptions && rawOptions.additionalHooks ? new RegExp(rawOptions.additionalHooks) : getSettingsFromContext(context).additionalEffectHooks;
+		let lastEffect = null;
+		const codePathReactHooksMapStack = [];
+		const codePathSegmentStack = [];
+		const useEffectEventFunctions = /* @__PURE__ */ new WeakSet();
+		function recordAllUseEffectEventFunctions(scope) {
+			for (const reference of scope.references) {
+				const parent = reference.identifier.parent;
+				if (parent?.type === "VariableDeclarator" && parent.init && parent.init.type === "CallExpression" && parent.init.callee && isUseEffectEventIdentifier(parent.init.callee)) {
+					if (reference.resolved === null) throw new Error("Unexpected null reference.resolved");
+					for (const ref of reference.resolved.references) if (ref !== reference) useEffectEventFunctions.add(ref.identifier);
+				}
 			}
+		}
+		/**
+		* SourceCode that also works down to ESLint 3.0.0
+		*/
+		const getSourceCode = typeof context.getSourceCode === "function" ? () => {
+			return context.getSourceCode();
+		} : () => {
+			return context.sourceCode;
 		};
 		/**
-		* Checks a given previous segment has been visited.
-		* @param {CodePathSegment} prevSegment A previous segment to check.
-		* @returns {boolean} `true` if the segment has been visited.
+		* SourceCode#getScope that also works down to ESLint 3.0.0
 		*/
-		function isVisited(prevSegment) {
-			return visited[prevSegment.id] || segment.isLoopedPrevSegment(prevSegment);
+		const getScope = typeof context.getScope === "function" ? () => {
+			return context.getScope();
+		} : (node) => {
+			return getSourceCode().getScope(node);
+		};
+		function hasFlowSuppression(node, suppression) {
+			const comments = getSourceCode().getAllComments();
+			const flowSuppressionRegex = new RegExp("\\$FlowFixMe\\[" + suppression + "\\]");
+			return comments.some((commentNode) => flowSuppressionRegex.test(commentNode.value) && commentNode.loc != null && node.loc != null && commentNode.loc.end.line === node.loc.start.line - 1);
 		}
-		while (stack.length > 0) {
-			item = stack[stack.length - 1];
-			segment = item[0];
-			index = item[1];
-			if (index === 0) {
-				if (visited[segment.id]) {
-					stack.pop();
-					continue;
+		const analyzer = new CodePathAnalyzer({
+			onCodePathSegmentStart: (segment) => codePathSegmentStack.push(segment),
+			onCodePathSegmentEnd: () => codePathSegmentStack.pop(),
+			onCodePathStart: () => codePathReactHooksMapStack.push(/* @__PURE__ */ new Map()),
+			onCodePathEnd(codePath, codePathNode) {
+				const reactHooksMap = codePathReactHooksMapStack.pop();
+				if (reactHooksMap?.size === 0) return;
+				else if (typeof reactHooksMap === "undefined") throw new Error("Unexpected undefined reactHooksMap");
+				const cyclic = /* @__PURE__ */ new Set();
+				/**
+				* Count the number of code paths from the start of the function to this
+				* segment. For example:
+				*
+				* ```js
+				* function MyComponent() {
+				*   if (condition) {
+				*     // Segment 1
+				*   } else {
+				*     // Segment 2
+				*   }
+				*   // Segment 3
+				* }
+				* ```
+				*
+				* Segments 1 and 2 have one path to the beginning of `MyComponent` and
+				* segment 3 has two paths to the beginning of `MyComponent` since we
+				* could have either taken the path of segment 1 or segment 2.
+				*
+				* Populates `cyclic` with cyclic segments.
+				*/
+				function countPathsFromStart(segment, pathHistory) {
+					const { cache } = countPathsFromStart;
+					let paths = cache.get(segment.id);
+					const pathList = new Set(pathHistory);
+					if (pathList.has(segment.id)) {
+						const pathArray = [...pathList];
+						const cyclicSegments = pathArray.slice(pathArray.indexOf(segment.id) + 1);
+						for (const cyclicSegment of cyclicSegments) cyclic.add(cyclicSegment);
+						return BigInt("0");
+					}
+					pathList.add(segment.id);
+					if (paths !== void 0) return paths;
+					if (codePath.thrownSegments.includes(segment)) paths = BigInt("0");
+					else if (segment.prevSegments.length === 0) paths = BigInt("1");
+					else {
+						paths = BigInt("0");
+						for (const prevSegment of segment.prevSegments) paths += countPathsFromStart(prevSegment, pathList);
+					}
+					if (segment.reachable && paths === BigInt("0")) cache.delete(segment.id);
+					else cache.set(segment.id, paths);
+					return paths;
+				}
+				/**
+				* Count the number of code paths from this segment to the end of the
+				* function. For example:
+				*
+				* ```js
+				* function MyComponent() {
+				*   // Segment 1
+				*   if (condition) {
+				*     // Segment 2
+				*   } else {
+				*     // Segment 3
+				*   }
+				* }
+				* ```
+				*
+				* Segments 2 and 3 have one path to the end of `MyComponent` and
+				* segment 1 has two paths to the end of `MyComponent` since we could
+				* either take the path of segment 1 or segment 2.
+				*
+				* Populates `cyclic` with cyclic segments.
+				*/
+				function countPathsToEnd(segment, pathHistory) {
+					const { cache } = countPathsToEnd;
+					let paths = cache.get(segment.id);
+					const pathList = new Set(pathHistory);
+					if (pathList.has(segment.id)) {
+						const pathArray = Array.from(pathList);
+						const cyclicSegments = pathArray.slice(pathArray.indexOf(segment.id) + 1);
+						for (const cyclicSegment of cyclicSegments) cyclic.add(cyclicSegment);
+						return BigInt("0");
+					}
+					pathList.add(segment.id);
+					if (paths !== void 0) return paths;
+					if (codePath.thrownSegments.includes(segment)) paths = BigInt("0");
+					else if (segment.nextSegments.length === 0) paths = BigInt("1");
+					else {
+						paths = BigInt("0");
+						for (const nextSegment of segment.nextSegments) paths += countPathsToEnd(nextSegment, pathList);
+					}
+					cache.set(segment.id, paths);
+					return paths;
+				}
+				/**
+				* Gets the shortest path length to the start of a code path.
+				* For example:
+				*
+				* ```js
+				* function MyComponent() {
+				*   if (condition) {
+				*     // Segment 1
+				*   }
+				*   // Segment 2
+				* }
+				* ```
+				*
+				* There is only one path from segment 1 to the code path start. Its
+				* length is one so that is the shortest path.
+				*
+				* There are two paths from segment 2 to the code path start. One
+				* through segment 1 with a length of two and another directly to the
+				* start with a length of one. The shortest path has a length of one
+				* so we would return that.
+				*/
+				function shortestPathLengthToStart(segment) {
+					const { cache } = shortestPathLengthToStart;
+					let length = cache.get(segment.id);
+					if (length === null) return Infinity;
+					if (length !== void 0) return length;
+					cache.set(segment.id, null);
+					if (segment.prevSegments.length === 0) length = 1;
+					else {
+						length = Infinity;
+						for (const prevSegment of segment.prevSegments) {
+							const prevLength = shortestPathLengthToStart(prevSegment);
+							if (prevLength < length) length = prevLength;
+						}
+						length += 1;
+					}
+					cache.set(segment.id, length);
+					return length;
+				}
+				countPathsFromStart.cache = /* @__PURE__ */ new Map();
+				countPathsToEnd.cache = /* @__PURE__ */ new Map();
+				shortestPathLengthToStart.cache = /* @__PURE__ */ new Map();
+				const allPathsFromStartToEnd = countPathsToEnd(codePath.initialSegment);
+				const codePathFunctionName = getFunctionName(codePathNode);
+				const isSomewhereInsideComponentOrHook = isInsideComponentOrHook(codePathNode);
+				const isDirectlyInsideComponentOrHook = codePathFunctionName ? isComponentName(codePathFunctionName) || isHook(codePathFunctionName) : isForwardRefCallback(codePathNode) || isMemoCallback(codePathNode);
+				let shortestFinalPathLength = Infinity;
+				for (const finalSegment of codePath.finalSegments) {
+					if (!finalSegment.reachable) continue;
+					const length = shortestPathLengthToStart(finalSegment);
+					if (length < shortestFinalPathLength) shortestFinalPathLength = length;
+				}
+				for (const [segment, reactHooks] of reactHooksMap) {
+					if (!segment.reachable) continue;
+					const possiblyHasEarlyReturn = segment.nextSegments.length === 0 ? shortestFinalPathLength <= shortestPathLengthToStart(segment) : shortestFinalPathLength < shortestPathLengthToStart(segment);
+					const pathsFromStartToEnd = countPathsFromStart(segment) * countPathsToEnd(segment);
+					const cycled = cyclic.has(segment.id);
+					for (const hook of reactHooks) {
+						if (hasFlowSuppression(hook, "react-rule-hook")) continue;
+						if (isUseIdentifier(hook) && isInsideTryCatch(hook)) context.report({
+							node: hook,
+							message: `React Hook "${getSourceCode().getText(hook)}" cannot be called in a try/catch block.`
+						});
+						if ((cycled || isInsideDoWhileLoop(hook)) && !isUseIdentifier(hook)) context.report({
+							node: hook,
+							message: `React Hook "${getSourceCode().getText(hook)}" may be executed more than once. Possibly because it is called in a loop. React Hooks must be called in the exact same order in every component render.`
+						});
+						if (isDirectlyInsideComponentOrHook) {
+							if (codePathNode.async) context.report({
+								node: hook,
+								message: `React Hook "${getSourceCode().getText(hook)}" cannot be called in an async function.`
+							});
+							if (!cycled && pathsFromStartToEnd !== allPathsFromStartToEnd && !isUseIdentifier(hook) && !isInsideDoWhileLoop(hook)) {
+								const message = `React Hook "${getSourceCode().getText(hook)}" is called conditionally. React Hooks must be called in the exact same order in every component render.` + (possiblyHasEarlyReturn ? " Did you accidentally call a React Hook after an early return?" : "");
+								context.report({
+									node: hook,
+									message
+								});
+							}
+						} else if (codePathNode.parent != null && (codePathNode.parent.type === "MethodDefinition" || codePathNode.parent.type === "ClassProperty" || codePathNode.parent.type === "PropertyDefinition") && codePathNode.parent.value === codePathNode) {
+							const message = `React Hook "${getSourceCode().getText(hook)}" cannot be called in a class component. React Hooks must be called in a React function component or a custom React Hook function.`;
+							context.report({
+								node: hook,
+								message
+							});
+						} else if (codePathFunctionName) {
+							const message = `React Hook "${getSourceCode().getText(hook)}" is called in function "${getSourceCode().getText(codePathFunctionName)}" that is neither a React function component nor a custom React Hook function. React component names must start with an uppercase letter. React Hook names must start with the word "use".`;
+							context.report({
+								node: hook,
+								message
+							});
+						} else if (codePathNode.type === "Program") {
+							const message = `React Hook "${getSourceCode().getText(hook)}" cannot be called at the top level. React Hooks must be called in a React function component or a custom React Hook function.`;
+							context.report({
+								node: hook,
+								message
+							});
+						} else if (isSomewhereInsideComponentOrHook && !isUseIdentifier(hook)) {
+							const message = `React Hook "${getSourceCode().getText(hook)}" cannot be called inside a callback. React Hooks must be called in a React function component or a custom React Hook function.`;
+							context.report({
+								node: hook,
+								message
+							});
+						}
+					}
+				}
+			}
+		});
+		return {
+			"*"(node) {
+				analyzer.enterNode(node);
+			},
+			"*:exit"(node) {
+				analyzer.leaveNode(node);
+			},
+			CallExpression(node) {
+				if (isHook(node.callee)) {
+					const reactHooksMap = last(codePathReactHooksMapStack);
+					const codePathSegment = last(codePathSegmentStack);
+					let reactHooks = reactHooksMap.get(codePathSegment);
+					if (!reactHooks) {
+						reactHooks = [];
+						reactHooksMap.set(codePathSegment, reactHooks);
+					}
+					reactHooks.push(node.callee);
 				}
-				if (segment !== startSegment && segment.prevSegments.length > 0 && !segment.prevSegments.every(isVisited)) {
-					stack.pop();
-					continue;
+				const nodeWithoutNamespace = getNodeWithoutReactNamespace(node.callee);
+				if ((isEffectIdentifier(nodeWithoutNamespace, additionalEffectHooks) || isUseEffectEventIdentifier(nodeWithoutNamespace)) && node.arguments.length > 0) lastEffect = node;
+				if (isUseEffectEventIdentifier(nodeWithoutNamespace) && node.parent?.type !== "VariableDeclarator" && node.parent?.type !== "ExpressionStatement") {
+					const message = useEffectEventError(null, false);
+					context.report({
+						node,
+						message
+					});
 				}
-				if (skippedSegment && segment.prevSegments.includes(skippedSegment)) skippedSegment = null;
-				visited[segment.id] = true;
-				if (!skippedSegment) {
-					resolvedCallback.call(this, segment, controller);
-					if (segment === lastSegment) controller.skip();
-					if (broken) break;
+			},
+			Identifier(node) {
+				if (lastEffect == null && useEffectEventFunctions.has(node)) {
+					const message = useEffectEventError(getSourceCode().getText(node), node.parent.type === "CallExpression");
+					context.report({
+						node,
+						message
+					});
 				}
+			},
+			"CallExpression:exit"(node) {
+				if (node === lastEffect) lastEffect = null;
+			},
+			FunctionDeclaration(node) {
+				if (isInsideComponentOrHook(node)) recordAllUseEffectEventFunctions(getScope(node));
+			},
+			ArrowFunctionExpression(node) {
+				if (isInsideComponentOrHook(node)) recordAllUseEffectEventFunctions(getScope(node));
+			},
+			ComponentDeclaration(node) {
+				recordAllUseEffectEventFunctions(getScope(node));
+			},
+			HookDeclaration(node) {
+				recordAllUseEffectEventFunctions(getScope(node));
 			}
-			end = segment.nextSegments.length - 1;
-			if (index < end) {
-				item[1] += 1;
-				stack.push([segment.nextSegments[index], 0]);
-			} else if (index === end) {
-				item[0] = segment.nextSegments[index];
-				item[1] = 0;
-			} else stack.pop();
-		}
-	}
-};
-const breakableTypePattern = /^(?:(?:Do)?While|For(?:In|Of)?|Switch)Statement$/u;
-/**
-* Checks whether or not a given node is a `case` node (not `default` node).
-* @param {ASTNode} node A `SwitchCase` node to check.
-* @returns {boolean} `true` if the node is a `case` node (not `default` node).
-*/
-function isCaseNode(node) {
-	return Boolean(node.test);
-}
-/**
-* Checks if a given node appears as the value of a PropertyDefinition node.
-* @param {ASTNode} node THe node to check.
-* @returns {boolean} `true` if the node is a PropertyDefinition value,
-*      false if not.
-*/
-function isPropertyDefinitionValue(node) {
-	const parent = node.parent;
-	return parent && parent.type === "PropertyDefinition" && parent.value === node;
-}
-/**
-* Checks whether the given logical operator is taken into account for the code
-* path analysis.
-* @param {string} operator The operator found in the LogicalExpression node
-* @returns {boolean} `true` if the operator is "&&" or "||" or "??"
-*/
-function isHandledLogicalOperator(operator) {
-	return operator === "&&" || operator === "||" || operator === "??";
-}
-/**
-* Checks whether the given assignment operator is a logical assignment operator.
-* Logical assignments are taken into account for the code path analysis
-* because of their short-circuiting semantics.
-* @param {string} operator The operator found in the AssignmentExpression node
-* @returns {boolean} `true` if the operator is "&&=" or "||=" or "??="
-*/
-function isLogicalAssignmentOperator(operator) {
-	return operator === "&&=" || operator === "||=" || operator === "??=";
-}
-/**
-* Gets the label if the parent node of a given node is a LabeledStatement.
-* @param {ASTNode} node A node to get.
-* @returns {string|null} The label or `null`.
-*/
-function getLabel(node) {
-	if (node.parent.type === "LabeledStatement") return node.parent.label.name;
-	return null;
-}
-/**
-* Checks whether or not a given logical expression node goes different path
-* between the `true` case and the `false` case.
-* @param {ASTNode} node A node to check.
-* @returns {boolean} `true` if the node is a test of a choice statement.
-*/
-function isForkingByTrueOrFalse(node) {
-	const parent = node.parent;
-	switch (parent.type) {
-		case "ConditionalExpression":
-		case "IfStatement":
-		case "WhileStatement":
-		case "DoWhileStatement":
-		case "ForStatement": return parent.test === node;
-		case "LogicalExpression": return isHandledLogicalOperator(parent.operator);
-		case "AssignmentExpression": return isLogicalAssignmentOperator(parent.operator);
-		default: return false;
-	}
-}
-/**
-* Gets the boolean value of a given literal node.
-*
-* This is used to detect infinity loops (e.g. `while (true) {}`).
-* Statements preceded by an infinity loop are unreachable if the loop didn't
-* have any `break` statement.
-* @param {ASTNode} node A node to get.
-* @returns {boolean|undefined} a boolean value if the node is a Literal node,
-*   otherwise `undefined`.
-*/
-function getBooleanValueIfSimpleConstant(node) {
-	if (node.type === "Literal") return Boolean(node.value);
-}
-/**
-* Checks that a given identifier node is a reference or not.
-*
-* This is used to detect the first throwable node in a `try` block.
-* @param {ASTNode} node An Identifier node to check.
-* @returns {boolean} `true` if the node is a reference.
-*/
-function isIdentifierReference(node) {
-	const parent = node.parent;
-	switch (parent.type) {
-		case "LabeledStatement":
-		case "BreakStatement":
-		case "ContinueStatement":
-		case "ArrayPattern":
-		case "RestElement":
-		case "ImportSpecifier":
-		case "ImportDefaultSpecifier":
-		case "ImportNamespaceSpecifier":
-		case "CatchClause": return false;
-		case "FunctionDeclaration":
-		case "ComponentDeclaration":
-		case "HookDeclaration":
-		case "FunctionExpression":
-		case "ArrowFunctionExpression":
-		case "ClassDeclaration":
-		case "ClassExpression":
-		case "VariableDeclarator": return parent.id !== node;
-		case "Property":
-		case "PropertyDefinition":
-		case "MethodDefinition": return parent.key !== node || parent.computed || parent.shorthand;
-		case "AssignmentPattern": return parent.key !== node;
-		default: return true;
-	}
-}
-/**
-* Updates the current segment with the head segment.
-* This is similar to local branches and tracking branches of git.
-*
-* To separate the current and the head is in order to not make useless segments.
-*
-* In this process, both "onCodePathSegmentStart" and "onCodePathSegmentEnd"
-* events are fired.
-* @param {CodePathAnalyzer} analyzer The instance.
-* @param {ASTNode} node The current AST node.
-* @returns {void}
-*/
-function forwardCurrentToHead(analyzer, node) {
-	const codePath = analyzer.codePath;
-	const state = CodePath.getState(codePath);
-	const currentSegments = state.currentSegments;
-	const headSegments = state.headSegments;
-	const end = Math.max(currentSegments.length, headSegments.length);
-	let i, currentSegment, headSegment;
-	for (i = 0; i < end; ++i) {
-		currentSegment = currentSegments[i];
-		headSegment = headSegments[i];
-		if (currentSegment !== headSegment && currentSegment) {
-			if (currentSegment.reachable) analyzer.emitter.emit("onCodePathSegmentEnd", currentSegment, node);
-		}
-	}
-	state.currentSegments = headSegments;
-	for (i = 0; i < end; ++i) {
-		currentSegment = currentSegments[i];
-		headSegment = headSegments[i];
-		if (currentSegment !== headSegment && headSegment) {
-			CodePathSegment.markUsed(headSegment);
-			if (headSegment.reachable) analyzer.emitter.emit("onCodePathSegmentStart", headSegment, node);
-		}
-	}
-}
-/**
-* Updates the current segment with empty.
-* This is called at the last of functions or the program.
-* @param {CodePathAnalyzer} analyzer The instance.
-* @param {ASTNode} node The current AST node.
-* @returns {void}
-*/
-function leaveFromCurrentSegment(analyzer, node) {
-	const state = CodePath.getState(analyzer.codePath);
-	const currentSegments = state.currentSegments;
-	for (let i = 0; i < currentSegments.length; ++i) {
-		const currentSegment = currentSegments[i];
-		if (currentSegment.reachable) analyzer.emitter.emit("onCodePathSegmentEnd", currentSegment, node);
-	}
-	state.currentSegments = [];
-}
-/**
-* Updates the code path due to the position of a given node in the parent node
-* thereof.
-*
-* For example, if the node is `parent.consequent`, this creates a fork from the
-* current path.
-* @param {CodePathAnalyzer} analyzer The instance.
-* @param {ASTNode} node The current AST node.
-* @returns {void}
-*/
-function preprocess(analyzer, node) {
-	const codePath = analyzer.codePath;
-	const state = CodePath.getState(codePath);
-	const parent = node.parent;
-	switch (parent.type) {
-		case "CallExpression":
-			if (parent.optional === true && parent.arguments.length >= 1 && parent.arguments[0] === node) state.makeOptionalRight();
-			break;
-		case "MemberExpression":
-			if (parent.optional === true && parent.property === node) state.makeOptionalRight();
-			break;
-		case "LogicalExpression":
-			if (parent.right === node && isHandledLogicalOperator(parent.operator)) state.makeLogicalRight();
-			break;
-		case "AssignmentExpression":
-			if (parent.right === node && isLogicalAssignmentOperator(parent.operator)) state.makeLogicalRight();
-			break;
-		case "ConditionalExpression":
-		case "IfStatement":
-			if (parent.consequent === node) state.makeIfConsequent();
-			else if (parent.alternate === node) state.makeIfAlternate();
-			break;
-		case "SwitchCase":
-			if (parent.consequent[0] === node) state.makeSwitchCaseBody(false, !parent.test);
-			break;
-		case "TryStatement":
-			if (parent.handler === node) state.makeCatchBlock();
-			else if (parent.finalizer === node) state.makeFinallyBlock();
-			break;
-		case "WhileStatement":
-			if (parent.test === node) state.makeWhileTest(getBooleanValueIfSimpleConstant(node));
-			else {
-				assert(parent.body === node);
-				state.makeWhileBody();
-			}
-			break;
-		case "DoWhileStatement":
-			if (parent.body === node) state.makeDoWhileBody();
-			else {
-				assert(parent.test === node);
-				state.makeDoWhileTest(getBooleanValueIfSimpleConstant(node));
-			}
-			break;
-		case "ForStatement":
-			if (parent.test === node) state.makeForTest(getBooleanValueIfSimpleConstant(node));
-			else if (parent.update === node) state.makeForUpdate();
-			else if (parent.body === node) state.makeForBody();
-			break;
-		case "ForInStatement":
-		case "ForOfStatement":
-			if (parent.left === node) state.makeForInOfLeft();
-			else if (parent.right === node) state.makeForInOfRight();
-			else {
-				assert(parent.body === node);
-				state.makeForInOfBody();
-			}
-			break;
-		case "AssignmentPattern":
-			if (parent.right === node) {
-				state.pushForkContext();
-				state.forkBypassPath();
-				state.forkPath();
-			}
-			break;
-		default: break;
-	}
-}
-/**
-* Updates the code path due to the type of a given node in entering.
-* @param {CodePathAnalyzer} analyzer The instance.
-* @param {ASTNode} node The current AST node.
-* @returns {void}
-*/
-function processCodePathToEnter(analyzer, node) {
-	let codePath = analyzer.codePath;
-	let state = codePath && CodePath.getState(codePath);
-	const parent = node.parent;
-	/**
-	* Creates a new code path and trigger the onCodePathStart event
-	* based on the currently selected node.
-	* @param {string} origin The reason the code path was started.
-	* @returns {void}
-	*/
-	function startCodePath(origin) {
-		if (codePath) forwardCurrentToHead(analyzer, node);
-		codePath = analyzer.codePath = new CodePath({
-			id: analyzer.idGenerator.next(),
-			origin,
-			upper: codePath,
-			onLooped: analyzer.onLooped
-		});
-		state = CodePath.getState(codePath);
-		analyzer.emitter.emit("onCodePathStart", codePath, node);
-	}
-	if (isPropertyDefinitionValue(node)) startCodePath("class-field-initializer");
-	switch (node.type) {
-		case "Program":
-			startCodePath("program");
-			break;
-		case "FunctionDeclaration":
-		case "ComponentDeclaration":
-		case "HookDeclaration":
-		case "FunctionExpression":
-		case "ArrowFunctionExpression":
-			startCodePath("function");
-			break;
-		case "StaticBlock":
-			startCodePath("class-static-block");
-			break;
-		case "ChainExpression":
-			state.pushChainContext();
-			break;
-		case "CallExpression":
-			if (node.optional === true) state.makeOptionalNode();
-			break;
-		case "MemberExpression":
-			if (node.optional === true) state.makeOptionalNode();
-			break;
-		case "LogicalExpression":
-			if (isHandledLogicalOperator(node.operator)) state.pushChoiceContext(node.operator, isForkingByTrueOrFalse(node));
-			break;
-		case "AssignmentExpression":
-			if (isLogicalAssignmentOperator(node.operator)) state.pushChoiceContext(node.operator.slice(0, -1), isForkingByTrueOrFalse(node));
-			break;
-		case "ConditionalExpression":
-		case "IfStatement":
-			state.pushChoiceContext("test", false);
-			break;
-		case "SwitchStatement":
-			state.pushSwitchContext(node.cases.some(isCaseNode), getLabel(node));
-			break;
-		case "TryStatement":
-			state.pushTryContext(Boolean(node.finalizer));
-			break;
-		case "SwitchCase":
-			if (parent.discriminant !== node && parent.cases[0] !== node) state.forkPath();
-			break;
-		case "WhileStatement":
-		case "DoWhileStatement":
-		case "ForStatement":
-		case "ForInStatement":
-		case "ForOfStatement":
-			state.pushLoopContext(node.type, getLabel(node));
-			break;
-		case "LabeledStatement":
-			if (!breakableTypePattern.test(node.body.type)) state.pushBreakContext(false, node.label.name);
-			break;
-		default: break;
+		};
 	}
-	forwardCurrentToHead(analyzer, node);
-}
+};
 /**
-* Updates the code path due to the type of a given node in leaving.
-* @param {CodePathAnalyzer} analyzer The instance.
-* @param {ASTNode} node The current AST node.
-* @returns {void}
+* Gets the static name of a function AST node. For function declarations it is
+* easy. For anonymous function expressions it is much harder. If you search for
+* `IsAnonymousFunctionDefinition()` in the ECMAScript spec you'll find places
+* where JS gives anonymous function expressions names. We roughly detect the
+* same AST nodes with some exceptions to better fit our use case.
 */
-function processCodePathToExit(analyzer, node) {
-	const codePath = analyzer.codePath;
-	const state = CodePath.getState(codePath);
-	let dontForward = false;
-	switch (node.type) {
-		case "ChainExpression":
-			state.popChainContext();
-			break;
-		case "IfStatement":
-		case "ConditionalExpression":
-			state.popChoiceContext();
-			break;
-		case "LogicalExpression":
-			if (isHandledLogicalOperator(node.operator)) state.popChoiceContext();
-			break;
-		case "AssignmentExpression":
-			if (isLogicalAssignmentOperator(node.operator)) state.popChoiceContext();
-			break;
-		case "SwitchStatement":
-			state.popSwitchContext();
-			break;
-		case "SwitchCase":
-			if (node.consequent.length === 0) state.makeSwitchCaseBody(true, !node.test);
-			if (state.forkContext.reachable) dontForward = true;
-			break;
-		case "TryStatement":
-			state.popTryContext();
-			break;
-		case "BreakStatement":
-			forwardCurrentToHead(analyzer, node);
-			state.makeBreak(node.label && node.label.name);
-			dontForward = true;
-			break;
-		case "ContinueStatement":
-			forwardCurrentToHead(analyzer, node);
-			state.makeContinue(node.label && node.label.name);
-			dontForward = true;
-			break;
-		case "ReturnStatement":
-			forwardCurrentToHead(analyzer, node);
-			state.makeReturn();
-			dontForward = true;
-			break;
-		case "ThrowStatement":
-			forwardCurrentToHead(analyzer, node);
-			state.makeThrow();
-			dontForward = true;
-			break;
-		case "Identifier":
-			if (isIdentifierReference(node)) {
-				state.makeFirstThrowablePathInTryBlock();
-				dontForward = true;
-			}
-			break;
-		case "CallExpression":
-		case "ImportExpression":
-		case "MemberExpression":
-		case "NewExpression":
-		case "YieldExpression":
-			state.makeFirstThrowablePathInTryBlock();
-			break;
-		case "WhileStatement":
-		case "DoWhileStatement":
-		case "ForStatement":
-		case "ForInStatement":
-		case "ForOfStatement":
-			state.popLoopContext();
-			break;
-		case "AssignmentPattern":
-			state.popForkContext();
-			break;
-		case "LabeledStatement":
-			if (!breakableTypePattern.test(node.body.type)) state.popBreakContext();
-			break;
-		default: break;
-	}
-	if (!dontForward) forwardCurrentToHead(analyzer, node);
+function getFunctionName(node) {
+	if (node.type === "ComponentDeclaration" || node.type === "HookDeclaration" || node.type === "FunctionDeclaration" || node.type === "FunctionExpression" && node.id) return node.id;
+	else if (node.type === "FunctionExpression" || node.type === "ArrowFunctionExpression") if (node.parent?.type === "VariableDeclarator" && node.parent.init === node) return node.parent.id;
+	else if (node.parent?.type === "AssignmentExpression" && node.parent.right === node && node.parent.operator === "=") return node.parent.left;
+	else if (node.parent?.type === "Property" && node.parent.value === node && !node.parent.computed) return node.parent.key;
+	else if (node.parent?.type === "AssignmentPattern" && node.parent.right === node && !node.parent.computed) return node.parent.left;
+	else return;
+	else return;
 }
 /**
-* Updates the code path to finalize the current code path.
-* @param {CodePathAnalyzer} analyzer The instance.
-* @param {ASTNode} node The current AST node.
-* @returns {void}
+* Convenience function for peeking the last item in a stack.
 */
-function postprocess(analyzer, node) {
-	/**
-	* Ends the code path for the current node.
-	* @returns {void}
-	*/
-	function endCodePath() {
-		let codePath = analyzer.codePath;
-		CodePath.getState(codePath).makeFinal();
-		leaveFromCurrentSegment(analyzer, node);
-		analyzer.emitter.emit("onCodePathEnd", codePath, node);
-		codePath = analyzer.codePath = analyzer.codePath.upper;
-	}
-	switch (node.type) {
-		case "Program":
-		case "FunctionDeclaration":
-		case "ComponentDeclaration":
-		case "HookDeclaration":
-		case "FunctionExpression":
-		case "ArrowFunctionExpression":
-		case "StaticBlock":
-			endCodePath();
-			break;
-		case "CallExpression":
-			if (node.optional === true && node.arguments.length === 0) CodePath.getState(analyzer.codePath).makeOptionalRight();
-			break;
-		default: break;
-	}
-	if (isPropertyDefinitionValue(node)) endCodePath();
+function last(array) {
+	return array[array.length - 1];
 }
-/**
-* The class to analyze code paths.
-* This class implements the EventGenerator interface.
-*/
-var CodePathAnalyzer = class {
-	/**
-	* @param {EventGenerator} eventGenerator An event generator to wrap.
-	*/
-	constructor(emitters) {
-		this.emitter = { emit(event, ...args) {
-			emitters[event]?.(...args);
-		} };
-		this.codePath = null;
-		this.idGenerator = new IdGenerator("s");
-		this.currentNode = null;
-		this.onLooped = this.onLooped.bind(this);
-	}
-	/**
-	* Does the process to enter a given AST node.
-	* This updates state of analysis and calls `enterNode` of the wrapped.
-	* @param {ASTNode} node A node which is entering.
-	* @returns {void}
-	*/
-	enterNode(node) {
-		this.currentNode = node;
-		if (node.parent) preprocess(this, node);
-		processCodePathToEnter(this, node);
-		this.currentNode = null;
-	}
-	/**
-	* Does the process to leave a given AST node.
-	* This updates state of analysis and calls `leaveNode` of the wrapped.
-	* @param {ASTNode} node A node which is leaving.
-	* @returns {void}
-	*/
-	leaveNode(node) {
-		this.currentNode = node;
-		processCodePathToExit(this, node);
-		postprocess(this, node);
-		this.currentNode = null;
-	}
-	/**
-	* This is called on a code path looped.
-	* Then this raises a looped event.
-	* @param {CodePathSegment} fromSegment A segment of prev.
-	* @param {CodePathSegment} toSegment A segment of next.
-	* @returns {void}
-	*/
-	onLooped(fromSegment, toSegment) {
-		if (fromSegment.reachable && toSegment.reachable) this.emitter.emit("onCodePathSegmentLoop", fromSegment, toSegment, this.currentNode);
-	}
-};
 
 //#endregion
-//#region src/rules/set-state-in-effect.ts
+//#region src/rules/set-state-in-effect/set-state-in-effect.ts
 const RULE_NAME$4 = "set-state-in-effect";
 var set_state_in_effect_default = createRule({
 	meta: {
@@ -7066,7 +6804,7 @@ function create$4(context) {
 }
 
 //#endregion
-//#region src/rules/set-state-in-render.ts
+//#region src/rules/set-state-in-render/set-state-in-render.ts
 const RULE_NAME$3 = "set-state-in-render";
 var set_state_in_render_default = createRule({
 	meta: {
@@ -7203,7 +6941,7 @@ function create$3(context) {
 }
 
 //#endregion
-//#region src/rules/unsupported-syntax.ts
+//#region src/rules/unsupported-syntax/unsupported-syntax.ts
 const RULE_NAME$2 = "unsupported-syntax";
 var unsupported_syntax_default = createRule({
 	meta: {
@@ -7284,7 +7022,7 @@ function create$2(context) {
 }
 
 //#endregion
-//#region src/rules/use-memo.ts
+//#region src/rules/use-memo/use-memo.ts
 const RULE_NAME$1 = "use-memo";
 var use_memo_default = createRule({
 	meta: {
@@ -7333,7 +7071,7 @@ function create$1(context) {
 }
 
 //#endregion
-//#region src/rules/use-state.ts
+//#region src/rules/use-state/use-state.ts
 const RULE_NAME = "use-state";
 const defaultOptions = [{
 	enforceAssignment: true,