* In other words `ALL_NAMES(scope)` is a subset of `scope.getAllNames()`
     */
    public fun getAllPossibleNames(): Set<Name> = withValidityAssertion {
        getPossibleCallableNames() + getPossibleClassifierNames()
    }

    /**
     * Returns a **superset** of callable names which current scope may contain.
     * In other words `ALL_CALLABLE_NAMES(scope)` is a subset of `scope.getCallableNames()`

<component name="ProjectDictionaryState">
  <dictionary name="sergej.jaskiewicz">
    <words>
      <w>lowerings</w>
      <w>unmuted</w>
    </words>
  </dictionary>

fun <T> Array<T>.check(f: (T) -> Boolean): Boolean = false

fun test(words: Array<String>) {
    if (<expr>words.check { it.length == 5 }</expr>) {
        consume("OK")
    }
}

	n := 0          // number of mantissa words
	if x.form == finite {
		// add space for mantissa and exponent
		n = int((x.prec + (_W - 1)) / _W) // required mantissa length in words for given precision
		// actual mantissa slice could be shorter (trailing 0's) or longer (unused bits):
		// - if shorter, only encode the words present
		// - if longer, cut off unused words when encoding in bytes

          $ref: '#/components/responses/InternalServerError'

  /popular-words:
    get:
      tags:
        - popularword
      summary: List popular words
      description: Returns available labels
      operationId: listPopularWords
      parameters:
        - name: seed
          in: query
          description: Random seed to return popular words
          required: false
          schema:
            type: string

	ADDV	R4, R5, R6

	// if less than 8 bytes, do one byte at a time
	SGTU	$8, R5, R8
	BNE	R8, out

	// do one byte at a time until 8-aligned
	AND	$7, R4, R8
	BEQ	R8, words
	MOVB	R0, (R4)
	ADDV	$1, R4
	JMP	-4(PC)

words:
	// do 8 bytes at a time if there is room
	ADDV	$-7, R6, R5

	PCALIGN	$16
	SGTU	R5, R4, R8
	BEQ	R8, out
	MOVV	R0, (R4)
	ADDV	$8, R4
	JMP	-4(PC)

out:

  });
}

TEST(CppOpGenCaseFormat, test_hyphen_delimiter) {
  TestAllVariations(
      Variations{
          "threeNTest33Words",
          "three-n-test33-words",
          "ThreeNTest33Words",
          "THREE-N-TEST33-WORDS",
      },
      '-');
}

TEST(CppOpGenCaseFormat, test_trailing_underscore) {
  TestAllVariations(Variations{
      "threeNTest33Words_",
      "three_n_test33_words_",

KaDataFlowExitPointSnapshot:
  defaultExpressionInfo = DefaultExpressionInfo:
    expression = words.check { it.length == 5 }
    type = kotlin.Boolean
  hasEscapingJumps = false
  hasJumps = false
  hasMultipleJumpKinds = false
  hasMultipleJumpTargets = false
  jumpExpressions = []
  returnValueType = null
  valuedReturnExpressions = []

The [RuneLen] function returns the number of 16-bit words in
the UTF-16 encoding of the rune. It returns -1 if the rune

	BNE	R7, out

	// if less than 8 bytes, do byte copying
	SGTU	$8, R6, R7
	BNE	R7, out

	// do one byte at a time until 8-aligned
	AND	$7, R4, R8
	BEQ	R8, words
	MOVB	(R5), R7
	ADDV	$1, R5
	MOVB	R7, (R4)
	ADDV	$1, R4
	JMP	-6(PC)

words:
	// do 8 bytes at a time if there is room
	ADDV	$-7, R9, R6 // R6 is end pointer-7

	PCALIGN	$16
	SGTU	R6, R4, R8
	BEQ	R8, out
	MOVV	(R5), R7
	ADDV	$8, R5