{"signature":"private fun pushFilledTail ( root : Array < Any ? > , filledTail : Array < Any ? > , newTail : Array < Any ? > ) : PersistentVector < E >","body":"{ if ( size shr LOG_MAX_BUFFER_SIZE > shl rootShift ) { var newRoot = presizedBufferWith ( root ) val newRootShift = rootShift + LOG_MAX_BUFFER_SIZE newRoot = pushTail ( newRoot , newRootShift , filledTail ) return PersistentVector ( newRoot , newTail , size + , newRootShift ) } val newRoot = pushTail ( root , rootShift , filledTail ) return PersistentVector ( newRoot , newTail , size + , rootShift ) }","docstring":"/**\n * Appends the specified entirely filled [tail] as a leaf buffer to the next free position in the [root] trie.\n */"} {"signature":"private fun pushTail ( root : Array < Any ? > ? , shift : Int , tail : Array < Any ? > ) : Array < Any ? >","body":"{ val bufferIndex = indexSegment ( size - , shift ) val newRootNode = root ? . copyOf ( MAX_BUFFER_SIZE ) ? : arrayOfNulls < Any ? > ( MAX_BUFFER_SIZE ) if ( shift == LOG_MAX_BUFFER_SIZE ) { newRootNode [ bufferIndex ] = tail } else { @ Suppress ( \"\" ) newRootNode [ bufferIndex ] = pushTail ( newRootNode [ bufferIndex ] as Array < Any ? > ? , shift - LOG_MAX_BUFFER_SIZE , tail ) } return newRootNode }","docstring":"/**\n * Appends the specified entirely filled [tail] as a leaf buffer to the next free position in the [root] trie.\n * The trie must not be filled entirely.\n */"} {"signature":"private fun insertIntoRoot ( root : Array < Any ? > , shift : Int , index : Int , element : Any ? , elementCarry : ObjectRef ) : Array < Any ? >","body":"{ val bufferIndex = indexSegment ( index , shift ) if ( shift == ) { val newRoot = if ( bufferIndex == ) arrayOfNulls < Any ? > ( MAX_BUFFER_SIZE ) else root . copyOf ( MAX_BUFFER_SIZE ) root . copyInto ( newRoot , bufferIndex + , bufferIndex , MAX_BUFFER_SIZE_MINUS_ONE ) elementCarry . value = root [ MAX_BUFFER_SIZE_MINUS_ONE ] newRoot [ bufferIndex ] = element return newRoot } val newRoot = root . copyOf ( MAX_BUFFER_SIZE ) val lowerLevelShift = shift - LOG_MAX_BUFFER_SIZE @ Suppress ( \"\" ) newRoot [ bufferIndex ] = insertIntoRoot ( root [ bufferIndex ] as Array < Any ? > , lowerLevelShift , index , element , elementCarry ) for ( i in bufferIndex + until MAX_BUFFER_SIZE ) { if ( newRoot [ i ] == null ) break @ Suppress ( \"\" ) newRoot [ i ] = insertIntoRoot ( root [ i ] as Array < Any ? > , lowerLevelShift , , elementCarry . value , elementCarry ) } return newRoot }","docstring":"/**\n * Insert the specified [element] into the [root] trie at the specified trie [index].\n *\n * [elementCarry] contains the last element of this trie that was popped out by the insertion operation.\n *\n * @return new root trie\n */"} {"signature":"private fun pullLastBufferFromRoot ( root : Array < Any ? > , rootSize : Int , shift : Int ) : PersistentList < E >","body":"{ if ( shift == ) { val buffer = if ( root . size == MUTABLE_BUFFER_SIZE ) root . copyOf ( MAX_BUFFER_SIZE ) else root return SmallPersistentVector ( buffer ) } val tailCarry = ObjectRef ( null ) val newRoot = pullLastBuffer ( root , shift , rootSize - , tailCarry ) ! ! @ Suppress ( \"\" ) val newTail = tailCarry . value as Array < Any ? > if ( newRoot [ ] == null ) { @ Suppress ( \"\" ) val lowerLevelRoot = newRoot [ ] as Array < Any ? > return PersistentVector ( lowerLevelRoot , newTail , rootSize , shift - LOG_MAX_BUFFER_SIZE ) } return PersistentVector ( newRoot , newTail , rootSize , shift ) }","docstring":"/**\n * Extracts the last entirely filled leaf buffer from the trie of this vector and makes it a tail in the returned [PersistentVector].\n *\n * Used when there are no elements left in current tail.\n *\n * Requires the trie to contain at least one leaf buffer.\n *\n * If the trie becomes empty after the operation, returns a tail-only vector ([SmallPersistentVector]).\n */"} {"signature":"private fun pullLastBuffer ( root : Array < Any ? > , shift : Int , index : Int , tailCarry : ObjectRef ) : Array < Any ? > ?","body":"{ val bufferIndex = indexSegment ( index , shift ) val newBufferAtIndex = if ( shift == LOG_MAX_BUFFER_SIZE ) { tailCarry . value = root [ bufferIndex ] null } else { @ Suppress ( \"\" ) pullLastBuffer ( root [ bufferIndex ] as Array < Any ? > , shift - LOG_MAX_BUFFER_SIZE , index , tailCarry ) } if ( newBufferAtIndex == null && bufferIndex == ) { return null } val newRoot = root . copyOf ( MAX_BUFFER_SIZE ) newRoot [ bufferIndex ] = newBufferAtIndex return newRoot }","docstring":"/**\n * Extracts the last leaf buffer from trie and returns new trie without it or `null` if there's no more leaf elements in this trie.\n *\n * [tailCarry] on output contains the extracted leaf buffer.\n */"} {"signature":"private fun removeFromRootAt ( root : Array < Any ? > , shift : Int , index : Int , tailCarry : ObjectRef ) : Array < Any ? >","body":"{ val bufferIndex = indexSegment ( index , shift ) if ( shift == ) { val newRoot = if ( bufferIndex == ) arrayOfNulls < Any ? > ( MAX_BUFFER_SIZE ) else root . copyOf ( MAX_BUFFER_SIZE ) root . copyInto ( newRoot , bufferIndex , bufferIndex + , MAX_BUFFER_SIZE ) newRoot [ MAX_BUFFER_SIZE - ] = tailCarry . value tailCarry . value = root [ bufferIndex ] return newRoot } var bufferLastIndex = MAX_BUFFER_SIZE_MINUS_ONE if ( root [ bufferLastIndex ] == null ) { bufferLastIndex = indexSegment ( rootSize ( ) - , shift ) } val newRoot = root . copyOf ( MAX_BUFFER_SIZE ) val lowerLevelShift = shift - LOG_MAX_BUFFER_SIZE for ( i in bufferLastIndex downTo bufferIndex + ) { @ Suppress ( \"\" ) newRoot [ i ] = removeFromRootAt ( newRoot [ i ] as Array < Any ? > , lowerLevelShift , , tailCarry ) } @ Suppress ( \"\" ) newRoot [ bufferIndex ] = removeFromRootAt ( newRoot [ bufferIndex ] as Array < Any ? > , lowerLevelShift , index , tailCarry ) return newRoot }","docstring":"/**\n * Removes element from trie at the specified trie [index].\n *\n * [tailCarry] on input contains the first element of the adjacent trie to fill the last vacant element with.\n * [tailCarry] on output contains the first element of this trie.\n *\n * @return the new root of the trie.\n */"} {"signature":"private fun bufferFor ( index : Int ) : Array < Any ? >","body":"{ if ( rootSize ( ) <= index ) { return tail } var buffer = root var shift = rootShift while ( shift > ) { @ Suppress ( \"\" ) buffer = buffer [ indexSegment ( index , shift ) ] as Array < Any ? > shift -= LOG_MAX_BUFFER_SIZE } return buffer }","docstring":"/** Returns either leaf buffer of the trie or the tail, that contains element with the specified [index]. */"} {"signature":"private fun areTypesTheSame ( ktTypeRef : KtTypeReference , psiType : PsiType , varArgs : Boolean ) : Boolean","body":"{ val qualifiedName = getQualifiedName ( ktTypeRef . typeElement , ktTypeRef . getAllModifierLists ( ) . any { it . hasSuspendModifier ( ) } ) ? : return false return if ( psiType is PsiArrayType && psiType . componentType !is PsiPrimitiveType ) { qualifiedName == StandardNames . FqNames . array . asString ( ) || varArgs && areTypesTheSame ( ktTypeRef , psiType . componentType , false ) } else { psiType . isTheSame ( psiType ( qualifiedName , ktTypeRef ) ) } }","docstring":"/**\n * Compare erased types\n */"} {"signature":"fun flatIter ( ) : Iterator < T >","body":"{ return FlatIterator ( this . data ? : throw NumKtException ( \"\" ) , this . ndim , this . strides , this . itemsize , this . shape , this . dtype , p ) }","docstring":"/**\n * Returns [FlatIterator].\n */"} {"signature":"fun toList ( ) : List < T >","body":"= ArrayList < T > ( this . size ) . also { for ( el in this . flatIter ( ) ) { it . add ( el ) } }","docstring":"/**\n * Returns 1-D [List].\n */"} {"signature":"fun toList2d ( ) : List < List < T > >","body":"{ assert ( this . ndim == ) return MutableList ( shape [ ] ) { this [ it ] . toList ( ) } }","docstring":"/**\n * Returns 2-D [List].\n */"} {"signature":"fun toList3d ( ) : List < List < List < T > > >","body":"{ assert ( this . ndim == ) return MutableList ( this . shape [ ] ) { this [ it ] . toList2d ( ) } }","docstring":"/**\n * Returns 3-D [List].\n */"} {"signature":"operator fun iterator ( ) : Iterator < KtNDArray < T > >","body":"= NDIterator ( this . getPointer ( ) )","docstring":"/**\n * Iterator over ndarray elements.\n *\n * Iteration takes place on the direct buffer indexes obtained from the nditer.\n * This iterator is equivalent to ndarray.flat or nditer with order 'C'.\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"{ if ( other !is KtNDArray < * > ) return false if ( isScalar ( ) ) { return this . scalar == other . scalar } return arrayEqual ( this , other ) }","docstring":"/**\n * Uses [arrayEqual]\n */"} {"signature":"protected fun finalize ( )","body":"{ if ( isNotScalar ( ) ) interp . freeArray ( pointer , data ! ! ) }","docstring":"/**\n * If the array is not a scalar, the counter of the array decreases by one.\n * If the counter is zero, python will free up memory.\n */"} {"signature":"infix fun < T : Any , C : Number > KtNDArray < T > . lt ( other : C ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , other ) )","docstring":"/**\n * <\n */"} {"signature":"infix fun < T : Any , C : Number > KtNDArray < T > . le ( other : C ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , other ) )","docstring":"/**\n * <=\n */"} {"signature":"infix fun < T : Any , C : Number > KtNDArray < T > . gt ( other : C ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , other ) )","docstring":"/**\n * >\n */"} {"signature":"infix fun < T : Any , C : Number > KtNDArray < T > . ge ( other : C ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , other ) )","docstring":"/**\n * >=\n */"} {"signature":"infix fun < T : Any , C : Number > KtNDArray < T > . eq ( other : C ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , other ) )","docstring":"/**\n * ==\n */"} {"signature":"infix fun < T : Any , C : Number > KtNDArray < T > . ne ( other : C ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , other ) )","docstring":"/**\n * !=\n */"} {"signature":"fun produceCAdapterBitcode ( clang : ClangArgs , cppFile : File , bitcodeFile : File )","body":"{ val clangCommand = clang . clangCXX ( \"\" , cppFile . absoluteFile . normalize ( ) . path , \"\" , \"\" , \"\" , bitcodeFile . absoluteFile . normalize ( ) . path ) Command ( clangCommand ) . execute ( ) }","docstring":"/**\n * Fourth phase of C export: compile runtime bindings to bitcode.\n */"} {"signature":"private fun FirFunctionSymbol < * > . hasDifferentParameterNames ( other : FirFunctionSymbol < * > ) : Boolean","body":"{ return valueParameterSymbols . drop ( ) . map { it . name } != other . valueParameterSymbols . drop ( ) . map { it . name } }","docstring":"/**\n * This function basically checks that these two functions have different objective-C signature.\n *\n * This signature consists of function name and parameter names except first.\n *\n * So we ignore the first parameter name, but check others\n */"} {"signature":"fun resetCurrentMapKey ( )","body":"{ if ( indicies [ currentDepth ] == - ) { currentObjectPath [ currentDepth ] = Tombstone } }","docstring":"/** Used to indicate that we are in the process of decoding the key itself and can't specify it in path */"} {"signature":"internal fun ijListenTestTask ( task : AbstractTestTask )","body":"{ try { Class . forName ( \"\" ) ? . getMethod ( \"\" ) ? . invoke ( null , task ) } catch ( e : ClassNotFoundException ) { } }","docstring":"/**\n * Experimental test reporting for Intellij Ultimate only\n */"} {"signature":"fun runLazyResolverByPhase ( phase : FirResolvePhase , target : LLFirResolveTarget )","body":"{ val lazyResolver = LLFirLazyPhaseResolverByPhase . getByPhase ( phase ) LLFirGlobalResolveComponents . getInstance ( target . session ) . lockProvider . withGlobalLock { lazyResolver . resolve ( target ) } }","docstring":"/**\n * Runs [resolver][LLFirLazyResolver] associated with [phase] for [target].\n *\n * @see LLFirLazyPhaseResolverByPhase\n */"} {"signature":"fun ConeIntegerLiteralType . Companion . findCommonSuperType ( types : Collection < SimpleTypeMarker > ) : SimpleTypeMarker ?","body":"{ return ConeIntegerLiteralTypeExtensions . findCommonSuperType ( types ) }","docstring":"/**\n * This methods detects common super type only for special rules for integer literal types\n * If it returns null then CST will be found by regular rules using real supertypes\n * of integer literal types\n */"} {"signature":"fun disableConDy ( ) : String ?","body":"{ return System . setProperty ( CONDY_SYSTEM_PARAM_NAME , \"\" ) }","docstring":"/**\n * Disable JVM ConDy during instrumentation.\n *\n * @return previous value of ConDy setting\n */"} {"signature":"fun restoreConDy ( prevValue : String ? )","body":"{ if ( prevValue == null ) { System . clearProperty ( CONDY_SYSTEM_PARAM_NAME ) } else { System . setProperty ( CONDY_SYSTEM_PARAM_NAME , prevValue ) } }","docstring":"/**\n * Restore previous value of JVM ConDy setting.\n *\n * Returns prevValue new setting value.\n */"} {"signature":"private fun OverloadCandidate . preserveCalleeInapplicability ( )","body":"{ val callSite = candidate . callInfo . callSite val calleeReference = callSite . toReference ( firSession ) as? FirDiagnosticHolder ? : return val diagnostic = calleeReference . diagnostic as? ConeInapplicableCandidateError ? : return if ( diagnostic . applicability != CandidateApplicability . INAPPLICABLE ) return candidate . addDiagnostic ( InapplicableCandidate ) }","docstring":"/**\n * Post-processes a candidate to carry the callee's inapplicability over into the candidate. Without this post-processing, an issue may\n * arise where [getAllCandidates] produces \"applicable\" candidates with inapplicable callee references.\n *\n * For example, a function call `generic` of function `fun generic() { }` is correctly marked as inapplicable\n * by the compiler (due to the missing type argument), but the `firFile` built during [getAllCandidates] will contain an inapplicable\n * function call `generic` (with the missing type argument inferred as an error type). The *subsequent*\n * resolution by `bodyResolveComponents.callResolver.collectAllCandidates` feeds this call to\n * [org.jetbrains.kotlin.fir.resolve.calls.CandidateFactory], which doesn't make any guarantees for inapplicable calls. Hence, the\n * resulting candidate is *not* marked as inapplicable and needs to be post-processed.\n */"} {"signature":"public fun < T > DataFrame < T > . drop ( n : Int ) : DataFrame < T >","body":"{ require ( n >= ) { \"\" } return getRows ( n . coerceAtMost ( nrow ) until nrow ) }","docstring":"/**\n * Returns a DataFrame containing all rows except first [n] rows.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun < T > DataFrame < T > . dropLast ( n : Int = ) : DataFrame < T >","body":"{ require ( n >= ) { \"\" } return take ( ( nrow - n ) . coerceAtLeast ( ) ) }","docstring":"/**\n * Returns a DataFrame containing all rows except last [n] rows.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun < T > DataFrame < T > . drop ( predicate : RowFilter < T > ) : DataFrame < T >","body":"= filter { ! predicate ( it , it ) }","docstring":"/**\n * Returns a DataFrame containing all rows except rows that satisfy the given [predicate].\n */"} {"signature":"public fun < T > DataFrame < T > . dropWhile ( predicate : RowFilter < T > ) : DataFrame < T >","body":"= firstOrNull { ! predicate ( it , it ) } ? . let { drop ( it . index ) } ? : this","docstring":"/**\n * Returns a DataFrame containing all rows except first rows that satisfy the given [predicate].\n */"} {"signature":"public fun < C > ColumnSet < C > . drop ( n : Int ) : ColumnSet < C >","body":"= transform { it . drop ( n ) }","docstring":"/**\n * @include [CommonDropFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[drop][ColumnSet.drop]`(2) }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[drop][ColumnSet.drop]`(2) }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . drop ( n : Int ) : ColumnSet < * >","body":"= asSingleColumn ( ) . dropCols ( n )","docstring":"/**\n * @include [CommonDropFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[drop][ColumnsSelectionDsl.drop]`(5) }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . dropCols ( n : Int ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . drop ( n ) }","docstring":"/**\n * @include [CommonDropFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[dropCols][SingleColumn.dropCols]`(1) }`\n */"} {"signature":"public fun String . dropCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropCols ( n )","docstring":"/**\n * @include [CommonDropFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[dropCols][String.dropCols]`(1) }`\n */"} {"signature":"public fun KProperty < * > . dropCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropCols ( n )","docstring":"/**\n * @include [CommonDropFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[dropCols][KProperty.dropCols]`(1) }`\n */"} {"signature":"public fun ColumnPath . dropCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropCols ( n )","docstring":"/**\n * @include [CommonDropFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[dropCols][ColumnPath.dropCols]`(1) }`\n */"} {"signature":"public fun < C > ColumnSet < C > . dropLast ( n : Int = ) : ColumnSet < C >","body":"= transform { it . dropLast ( n ) }","docstring":"/**\n * @include [CommonDropLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[dropLast][ColumnSet.dropLast]`(2) }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[dropLast][ColumnSet.dropLast]`() }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . dropLast ( n : Int = ) : ColumnSet < * >","body":"= this . asSingleColumn ( ) . dropLastCols ( n )","docstring":"/**\n * @include [CommonDropLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[dropLast][ColumnsSelectionDsl.dropLast]`(5) }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . dropLastCols ( n : Int ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . dropLast ( n ) }","docstring":"/**\n * @include [CommonDropLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[dropLastCols][SingleColumn.dropLastCols]`() }`\n */"} {"signature":"public fun String . dropLastCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropLastCols ( n )","docstring":"/**\n * @include [CommonDropLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[dropLastCols][String.dropLastCols]`(1) }`\n */"} {"signature":"public fun KProperty < * > . dropLastCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropLastCols ( n )","docstring":"/**\n * @include [CommonDropLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[dropLastCols][KProperty.dropLastCols]`(1) }`\n */"} {"signature":"public fun ColumnPath . dropLastCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropLastCols ( n )","docstring":"/**\n * @include [CommonDropLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[dropLastCols][ColumnPath.dropLastCols]`(1) }`\n */"} {"signature":"public fun < C > ColumnSet < C > . dropWhile ( predicate : ColumnFilter < C > ) : ColumnSet < C >","body":"= transform { it . dropWhile ( predicate ) }","docstring":"/**\n * @include [CommonDropWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[dropWhile][ColumnSet.dropWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[dropWhile][ColumnSet.dropWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . dropWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= this . asSingleColumn ( ) . dropColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[dropWhile][ColumnsSelectionDsl.dropWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . dropColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . dropWhile ( predicate ) }","docstring":"/**\n * @include [CommonDropWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[dropColsWhile][SingleColumn.dropColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun String . dropColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[dropColsWhile][String.dropColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun KProperty < * > . dropColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[dropColsWhile][KProperty.dropColsWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun ColumnPath . dropColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[dropColsWhile][ColumnPath.dropColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun < C > ColumnSet < C > . dropLastWhile ( predicate : ColumnFilter < C > ) : ColumnSet < C >","body":"= transform { it . dropLastWhile ( predicate ) }","docstring":"/**\n * @include [CommonDropLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[dropLastWhile][ColumnSet.dropLastWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[dropLastWhile][ColumnSet.dropLastWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . dropLastWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= this . asSingleColumn ( ) . dropLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[dropLastWhile][ColumnsSelectionDsl.dropLastWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . dropLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . dropLastWhile ( predicate ) }","docstring":"/**\n * @include [CommonDropLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[dropLastColsWhile][SingleColumn.dropLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun String . dropLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[dropLastColsWhile][String.dropLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun KProperty < * > . dropLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[dropLastColsWhile][SingleColumn.dropLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[dropLastColsWhile][KProperty.dropLastColsWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun ColumnPath . dropLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . dropLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonDropLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[dropLastColsWhile][ColumnPath.dropLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"protected fun buildFirstStageArgs ( klibPath : String )","body":"= mutableListOf < String > ( ) . apply { addArg ( \"\" , klibPath ) addArg ( \"\" , CompilerOutputKind . LIBRARY . name . lowercase ( Locale . getDefault ( ) ) ) addAll ( buildCommonArgs ( ) ) addAll ( firstStageExtraOpts ( ) ) allSourceFiles . mapTo ( this ) { it . absolutePath } commonSrcFiles . flatMap { it . files } . mapTo ( this ) { \"\" } }","docstring":"/** Args passed to the compiler at the first stage of two-stage compilation (klib building). */"} {"signature":"protected fun buildSecondStageArgs ( klibPath : String )","body":"= mutableListOf < String > ( ) . apply { addArg ( \"\" , artifact . canonicalPath ) addArg ( \"\" , produce . name . lowercase ( Locale . getDefault ( ) ) ) addArgIfNotNull ( \"\" , entryPoint ) addAll ( buildCommonArgs ( ) ) addFileArgs ( \"\" , nativeLibraries ) linkerOpts . forEach { addArg ( \"\" , it ) } addAll ( secondStageExtraOpts ( ) ) add ( \"\" ) }","docstring":"/** Args passed to the compiler at the second stage of two-stage compilation (producing a final binary from the klib). */"} {"signature":"protected open fun buildCommonArgs ( )","body":"= mutableListOf < String > ( ) . apply { if ( platformConfigurationFiles . files . isNotEmpty ( ) ) { platformConfigurationFiles . files . filter { it . name . endsWith ( \"\" ) } . forEach { addArg ( \"\" , it . absolutePath ) } } addFileArgs ( \"\" , libraries . klibFiles ) addArgs ( \"\" , libraries . artifacts . map { it . artifact . canonicalPath } ) addArgIfNotNull ( \"\" , konanTarget . visibleName ) addArgIfNotNull ( \"\" , languageVersion ) addArgIfNotNull ( \"\" , apiVersion ) addArgIfNotNull ( \"\" , entryPoint ) addKey ( \"\" , enableDebug ) addKey ( \"\" , noStdLib ) addKey ( \"\" , noMain ) addKey ( \"\" , enableOptimizations ) addKey ( \"\" , enableAssertions ) addKey ( \"\" , measureTime ) addKey ( \"\" , measureTime ) addKey ( \"\" , noDefaultLibs ) addKey ( \"\" , noEndorsedLibs ) addKey ( \"\" , enableMultiplatform ) if ( libraries . friends . isNotEmpty ( ) ) addArg ( \"\" , libraries . friends . joinToString ( File . pathSeparator ) ) }","docstring":"/** Args passed to the compiler at both stages of the two-stage compilation and during the singe-stage compilation. */"} {"signature":"fun buildSingleStageArgs ( )","body":"= mutableListOf < String > ( ) . apply { addArg ( \"\" , artifact . canonicalPath ) addArg ( \"\" , produce . name . lowercase ( Locale . getDefault ( ) ) ) addArgIfNotNull ( \"\" , entryPoint ) addAll ( buildCommonArgs ( ) ) addFileArgs ( \"\" , nativeLibraries ) linkerOpts . forEach { addArg ( \"\" , it ) } if ( produce != CompilerOutputKind . LIBRARY ) { add ( \"\" ) add ( \"\" ) } addAll ( extraOpts ) allSourceFiles . mapTo ( this ) { it . absolutePath } commonSrcFiles . flatMap { it . files } . mapTo ( this ) { \"\" } }","docstring":"/** Args passed to the compiler if the two-stage compilation is disabled. */"} {"signature":"@ Deprecated ( IDENTITY_FUNCTION , ReplaceWith ( COL_REPLACE ) ) public fun < C > col ( col : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"= col","docstring":"/**\n * @include [ColReferenceDocs] {@set [CommonColDocs.ReceiverArg]}\n * {@set [CommonColDocs.Note] NOTE: This overload is an identity function and can be omitted.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . col ( col : ColumnAccessor < C > ) : SingleColumn < C >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( col ) ? : throw IllegalStateException ( \"\" ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [ColReferenceDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . col ( col : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"= this . ensureIsColumnGroup ( ) . column ( col . path ( ) )","docstring":"/**\n * @include [ColReferenceDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > String . col ( col : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( col . path ( ) )","docstring":"/**\n * @include [ColReferenceDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > KProperty < * > . col ( col : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( col . path ( ) )","docstring":"/**\n * @include [ColReferenceDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > ColumnPath . col ( col : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( col . path ( ) )","docstring":"/**\n * @include [ColReferenceDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun col ( name : String ) : ColumnAccessor < * >","body":"= column < Any ? > ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > col ( name : String ) : ColumnAccessor < C >","body":"= column ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg]}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . col ( name : String ) : SingleColumn < * >","body":"= col < Any ? > ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . col ( name : String ) : SingleColumn < C >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( name ) ? . cast < C > ( ) ? : throw IllegalStateException ( \"\" ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun AnyColumnGroupAccessor . col ( name : String ) : ColumnAccessor < * >","body":"= col < Any ? > ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . col ( name : String ) : ColumnAccessor < C >","body":"= this . ensureIsColumnGroup ( ) . column ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . col ( name : String ) : ColumnAccessor < * >","body":"= col < Any ? > ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . col ( name : String ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . col ( name : String ) : ColumnAccessor < * >","body":"= col < Any ? > ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . col ( name : String ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . col ( name : String ) : ColumnAccessor < * >","body":"= col < Any ? > ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . col ( name : String ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( name )","docstring":"/**\n * @include [ColNameDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun col ( path : ColumnPath ) : ColumnAccessor < * >","body":"= column < Any ? > ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > col ( path : ColumnPath ) : ColumnAccessor < C >","body":"= column ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg]}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . col ( path : ColumnPath ) : SingleColumn < * >","body":"= col < Any ? > ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . col ( path : ColumnPath ) : SingleColumn < C >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( path ) ? . cast < C > ( ) ? : throw IllegalStateException ( \"\" ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun AnyColumnGroupAccessor . col ( path : ColumnPath ) : ColumnAccessor < * >","body":"= col < Any ? > ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . col ( path : ColumnPath ) : ColumnAccessor < C >","body":"= this . ensureIsColumnGroup ( ) . column ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . col ( path : ColumnPath ) : ColumnAccessor < * >","body":"= col < Any ? > ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . col ( path : ColumnPath ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . col ( path : ColumnPath ) : ColumnAccessor < * >","body":"= col < Any ? > ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . col ( path : ColumnPath ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . col ( path : ColumnPath ) : ColumnAccessor < * >","body":"= col < Any ? > ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . col ( path : ColumnPath ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( path )","docstring":"/**\n * @include [ColPathDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"public fun < C > col ( property : KProperty < C > ) : SingleColumn < C >","body":"= column ( property )","docstring":"/**\n * @include [ColKPropertyDocs] {@set [CommonColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . col ( property : KProperty < C > ) : SingleColumn < C >","body":"= col < C > ( property . name )","docstring":"/**\n * @include [ColKPropertyDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . col ( property : KProperty < C > ) : ColumnAccessor < C >","body":"= this . ensureIsColumnGroup ( ) . column ( property )","docstring":"/**\n * @include [ColKPropertyDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > String . col ( property : KProperty < C > ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( property )","docstring":"/**\n * @include [ColKPropertyDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > KProperty < * > . col ( property : KProperty < C > ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( property )","docstring":"/**\n * @include [ColKPropertyDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > ColumnPath . col ( property : KProperty < C > ) : ColumnAccessor < C >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . column ( property )","docstring":"/**\n * @include [ColKPropertyDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnSet < C > . col ( index : Int ) : SingleColumn < C >","body":"= getAt ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] `[colsOf][ColumnsSelectionDsl.colsOf]`<`[Int][Int]`>().}\n * @include [CommonColDocs.ColumnTypeParam]\n * {@set [CommonColDocs.ExampleArg]\n * {@include [CommonColDocs.SingleExample]}\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][ColumnsSelectionDsl.colsOf]`<`[String][String]`>()`[`[`][col]`1`[`]`][col]` \\}`\n * }\n * {@set [CommonColDocs.Note] NOTE: You can use the get-[] operator on [ColumnSets][ColumnSet] as well!}\n */"} {"signature":"public operator fun < C > ColumnSet < C > . get ( index : Int ) : SingleColumn < C >","body":"= col ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] `[colsOf][ColumnsSelectionDsl.colsOf]`<`[Int][Int]`>().}\n * @include [CommonColDocs.ColumnTypeParam]\n * {@set [CommonColDocs.ExampleArg]\n * {@include [CommonColDocs.SingleExample]}\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][ColumnsSelectionDsl.colsOf]`<`[String][String]`>()`[`[`][col]`1`[`]`][col]` \\}`\n * }\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnsSelectionDsl < * > . col ( index : Int ) : SingleColumn < * >","body":"= col < Any ? > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > ColumnsSelectionDsl < * > . col ( index : Int ) : SingleColumn < C >","body":"= asSingleColumn ( ) . col < C > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg]}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . col ( index : Int ) : SingleColumn < * >","body":"= col < Any ? > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . col ( index : Int ) : SingleColumn < C >","body":"= this . ensureIsColumnGroup ( ) . allColumnsInternal ( ) . getAt ( index ) . cast ( )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . col ( index : Int ) : SingleColumn < * >","body":"= col < Any ? > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . col ( index : Int ) : SingleColumn < C >","body":"= columnGroup ( this ) . col < C > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . col ( index : Int ) : SingleColumn < * >","body":"= col < Any ? > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . col ( index : Int ) : SingleColumn < C >","body":"= columnGroup ( this ) . col < C > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . col ( index : Int ) : SingleColumn < * >","body":"= col < Any ? > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . col ( index : Int ) : SingleColumn < C >","body":"= columnGroup ( this ) . col < C > ( index )","docstring":"/**\n * @include [ColIndexDocs] {@set [CommonColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonColDocs.ColumnTypeParam]\n */"} {"signature":"internal fun getCanonicalClassInternal ( ch : Int ) : Int","body":"{ return getCanonicalClass ( ch ) }","docstring":"/** Gets canonical class for given codepoint from decomposition mappings table. */"} {"signature":"internal fun hasSingleCodepointDecompositionInternal ( ch : Int ) : Boolean","body":"{ val index : Int = binarySearchRange ( singleDecompositions , ch ) return index != - && singleDecompositions [ index ] == ch }","docstring":"/** Check if the given character is in table of single decompositions. */"} {"signature":"internal fun decomposeString ( inputCodePoints : IntArray , inputLength : Int , outputCodePoints : IntArray ) : Int","body":"{ if ( inputLength == ) return var outputLength = for ( i in until inputLength ) { val decomposition = getDecomposition ( inputCodePoints [ i ] ) if ( decomposition == null ) { outputCodePoints [ outputLength ++ ] = inputCodePoints [ i ] } else { decomposition . copyInto ( outputCodePoints , outputLength ) outputLength += decomposition . size } } return outputLength }","docstring":"/**\n * Decomposes the given string represented as an array of codepoints. Saves the decomposition into [outputCodepoints] array.\n * Returns the length of the decomposition.\n */"} {"signature":"internal fun decomposeCodePoint ( codePoint : Int , outputCodePoints : IntArray , fromIndex : Int ) : Int","body":"{ val decomposition = getDecomposition ( codePoint ) if ( decomposition == null ) { outputCodePoints [ fromIndex ] = codePoint return } else { decomposition . copyInto ( outputCodePoints , fromIndex ) return decomposition . size } }","docstring":"/**\n * Decomposes the given codepoint. Saves the decomposition into [outputCodepoints] array starting with [fromIndex].\n * Returns the length of the decomposition.\n */"} {"signature":"private fun binarySearchRange ( array : IntArray , needle : Int ) : Int","body":"{ var bottom = var top = array . size - var middle = - var value = while ( bottom <= top ) { middle = ( bottom + top ) / value = array [ middle ] if ( needle > value ) bottom = middle + else if ( needle == value ) return middle else top = middle - } return middle - ( if ( needle < value ) else ) }","docstring":"/**\n * Returns the index of the largest element in [array] smaller or equal to the specified [needle],\n * or -1 if [needle] is smaller than the smallest element in [array].\n */"} {"signature":"private fun computeRebindTarget ( function : FirFunction ) : FirFunction ?","body":"{ if ( functionsToRebind . isNullOrEmpty ( ) ) return null val realPsi = function . realPsi if ( realPsi != null ) { return functionsToRebind . firstOrNull { it . realPsi == realPsi } } val accessor = function as? FirPropertyAccessor ? : return null val accessorPsi = accessor . psi ? : return null return functionsToRebind . firstOrNull { it is FirPropertyAccessor && it . isGetter == accessor . isGetter && it . psi == accessorPsi } }","docstring":"/**\n * @return [FirFunction] if another function should be used instead of [function] for [FirFunctionTarget]\n *\n * @see bindFunctionTarget\n * @see functionsToRebind\n */"} {"signature":"private fun generateForwardStruct ( s : StructDecl ) : List < StubIrElement >","body":"= when ( context . platform ) { KotlinPlatform . JVM -> { val classifier = context . getKotlinClassForPointed ( s ) val superClass = context . platform . getRuntimeType ( \"\" ) val rawPtrConstructorParam = FunctionParameterStub ( \"\" , context . platform . getRuntimeType ( \"\" ) ) val superClassInit = SuperClassInit ( superClass , listOf ( GetConstructorParameter ( rawPtrConstructorParam ) ) ) val origin = StubOrigin . Struct ( s ) val primaryConstructor = ConstructorStub ( listOf ( rawPtrConstructorParam ) , emptyList ( ) , isPrimary = true , origin = origin ) listOf ( ClassStub . Simple ( classifier , ClassStubModality . NONE , constructors = listOf ( primaryConstructor ) , superClassInit = superClassInit , origin = origin ) ) } KotlinPlatform . NATIVE -> emptyList ( ) }","docstring":"/**\n * Produces to [out] the definition of Kotlin class representing the reference to given forward (incomplete) struct.\n */"} {"signature":"private fun generateEnumAsConstants ( enumDef : EnumDef ) : List < StubIrElement >","body":"{ val entries = mutableListOf < PropertyStub > ( ) val typealiases = mutableListOf < TypealiasStub > ( ) val constants = enumDef . constants . filter { it . name !in context . macroConstantsByName } val kotlinType : KotlinType val baseKotlinType = context . mirror ( enumDef . baseType ) . argType val meta = if ( enumDef . isAnonymous ) { kotlinType = baseKotlinType StubContainerMeta ( textAtStart = if ( constants . isNotEmpty ( ) ) \"\" else \"\" ) } else { val typeMirror = context . mirror ( EnumType ( enumDef ) ) if ( typeMirror !is TypeMirror . ByValue ) { error ( \"\" ) } val varTypeName = typeMirror . info . constructPointedType ( typeMirror . valueType ) val varTypeClassifier = typeMirror . pointedType . classifier val valueTypeClassifier = typeMirror . valueType . classifier val origin = StubOrigin . Enum ( enumDef ) typealiases += TypealiasStub ( varTypeClassifier , varTypeName . toStubIrType ( ) , StubOrigin . VarOf ( origin ) ) typealiases += TypealiasStub ( valueTypeClassifier , baseKotlinType . toStubIrType ( ) , origin ) kotlinType = typeMirror . valueType StubContainerMeta ( ) } for ( constant in constants ) { val literal = context . tryCreateIntegralStub ( enumDef . baseType , constant . value ) ? : continue val kind = when ( context . generationMode ) { GenerationMode . SOURCE_CODE -> { val getter = PropertyAccessor . Getter . SimpleGetter ( constant = literal ) PropertyStub . Kind . Val ( getter ) } GenerationMode . METADATA -> { PropertyStub . Kind . Constant ( literal ) } } entries += PropertyStub ( constant . name , kotlinType . toStubIrType ( ) , kind , MemberStubModality . FINAL , null , origin = StubOrigin . EnumEntry ( constant ) ) } val container = SimpleStubContainer ( meta , properties = entries . toList ( ) , typealiases = typealiases . toList ( ) ) return listOf ( container ) }","docstring":"/**\n * Produces to [out] the Kotlin definitions for given enum which shouldn't be represented as Kotlin enum.\n */"} {"signature":"internal suspend fun < T > withRestrictedStages ( allowed : Set < KotlinPluginLifecycle . Stage > , block : suspend ( ) -> T ) : T","body":"{ val newCoroutineContext = coroutineContext + KotlinPluginLifecycleStageRestriction ( currentKotlinPluginLifecycle ( ) , allowed ) return suspendCoroutine { continuation -> val newContinuation = object : Continuation < T > { override val context : CoroutineContext get ( ) = newCoroutineContext override fun resumeWith ( result : Result < T > ) { continuation . resumeWith ( result ) } } block . startCoroutine ( newContinuation ) } }","docstring":"/**\n * Will ensure that the given [block] cannot leave the specified allowed stages [allowed]\n * e.g.\n *\n * ```kotlin\n * project.launchInStage(Stage.BeforeFinaliseDsl) {\n * withRestrictedStages(Stage.upTo(Stage.FinaliseDsl)) {\n * await(Stage.FinaliseDsl) // <- OK, since still in allowed stages\n * await(Stage.AfterFinaliseDsl) // <- fails, since not in allowed stages!\n * }\n * }\n * ```\n */"} {"signature":"fun CartViewModel . Companion . provideFactory ( snackbarManager : SnackbarManager = SnackbarManager , snackRepository : SnackRepo = SnackRepo ) : ViewModelProvider . Factory","body":"= object : ViewModelProvider . Factory { @ Suppress ( \"\" ) override fun < T : ViewModel > create ( modelClass : Class < T > ) : T { return CartViewModel ( snackbarManager , snackRepository ) as T } }","docstring":"/**\n * Factory for CartViewModel that takes SnackbarManager as a dependency\n */"} {"signature":"fun shouldUseK2 ( ) : Boolean","body":"= getBooleanProperty ( TRY_K2 )","docstring":"/**\n * By default, it is disabled\n */"} {"signature":"inline fun < reified T > ifExhaustive ( vararg values : T ) : Array < out T >","body":"{ return if ( TestEnvironment . isExhaustive ) values else emptyArray ( ) }","docstring":"/**\n * Will only return values if [TestEnvironment.isExhaustive] is set to true\n */"} {"signature":"private fun collectLlvmModules ( generationState : NativeGenerationState , generatedBitcodeFiles : List < String > ) : LlvmModules","body":"{ val config = generationState . config val ( bitcodePartOfStdlib , bitcodeLibraries ) = generationState . dependenciesTracker . bitcodeToLink . partition { it . isNativeStdlib && generationState . producedLlvmModuleContainsStdlib } . toList ( ) . map { libraries -> libraries . flatMap { it . bitcodePaths } . filter { it . isBitcode } } val nativeLibraries = config . nativeLibraries + config . launcherNativeLibraries . takeIf { config . produce == CompilerOutputKind . PROGRAM } . orEmpty ( ) val additionalBitcodeFilesToLink = generationState . llvm . additionalProducedBitcodeFiles val exceptionsSupportNativeLibrary = listOf ( config . exceptionsSupportNativeLibrary ) . takeIf { config . produce == CompilerOutputKind . DYNAMIC_CACHE } . orEmpty ( ) val xcTestRunnerNativeLibrary = listOf ( config . xcTestLauncherNativeLibrary ) . takeIf { config . produce == CompilerOutputKind . TEST_BUNDLE } . orEmpty ( ) val additionalBitcodeFiles = nativeLibraries + generatedBitcodeFiles + additionalBitcodeFilesToLink + bitcodeLibraries + exceptionsSupportNativeLibrary + xcTestRunnerNativeLibrary val runtimeNativeLibraries = config . runtimeNativeLibraries fun parseBitcodeFiles ( files : List < String > ) : List < LLVMModuleRef > = files . map { bitcodeFile -> val parsedModule = parseBitcodeFile ( generationState . llvmContext , bitcodeFile ) if ( ! generationState . shouldUseDebugInfoFromNativeLibs ( ) ) { LLVMStripModuleDebugInfo ( parsedModule ) } parsedModule } val runtimeModules = parseBitcodeFiles ( ( runtimeNativeLibraries + bitcodePartOfStdlib ) . takeIf { generationState . shouldLinkRuntimeNativeLibraries } . orEmpty ( ) ) val additionalModules = parseBitcodeFiles ( additionalBitcodeFiles ) return LlvmModules ( runtimeModules . ifNotEmpty { this + generationState . generateRuntimeConstantsModule ( ) } ? : emptyList ( ) , additionalModules + listOfNotNull ( patchObjCRuntimeModule ( generationState ) ) ) }","docstring":"/**\n * Deserialize, generate, patch all bitcode dependencies and classify them into two sets:\n * - Runtime modules. These may be used as an input for a separate LTO (e.g. for debug builds).\n * - Everything else.\n */"} {"signature":"@ Throws ( IOException :: class ) public fun extractFashionImages ( archivePath : String ) : Array < FloatArray >","body":"{ val archiveStream = DataInputStream ( GZIPInputStream ( OnHeapDataset :: class . java . classLoader . getResourceAsStream ( archivePath ) ) ) val magic = archiveStream . readInt ( ) require ( IMAGE_ARCHIVE_MAGIC == magic ) { \"\" } val imageCount = archiveStream . readInt ( ) val imageRows = archiveStream . readInt ( ) val imageCols = archiveStream . readInt ( ) println ( String . format ( \"\" , imageCount , imageRows , imageCols , archivePath ) ) val imageBuffer = ByteArray ( imageRows * imageCols ) val images = Array ( imageCount ) { archiveStream . readFully ( imageBuffer ) toNormalizedVector ( imageBuffer ) } return images }","docstring":"/**\n * Extracts Fashion Mnist images from [archivePath].\n */"} {"signature":"@ Throws ( IOException :: class ) public fun extractFashionLabels ( archivePath : String , numClasses : Int ) : Array < FloatArray >","body":"{ val archiveStream = DataInputStream ( GZIPInputStream ( OnHeapDataset :: class . java . classLoader . getResourceAsStream ( archivePath ) ) ) val magic = archiveStream . readInt ( ) require ( LABEL_ARCHIVE_MAGIC == magic ) { \"\" } val labelCount = archiveStream . readInt ( ) println ( String . format ( \"\" , labelCount , archivePath ) ) val labelBuffer = ByteArray ( labelCount ) archiveStream . readFully ( labelBuffer ) val floats = Array ( labelCount ) { OnHeapDataset . toOneHotVector ( numClasses , labelBuffer [ it ] ) } return floats }","docstring":"/**\n * Extracts Fashion Mnist labels from [archivePath] with number of classes [numClasses].\n */"} {"signature":"override fun subList ( fromIndex : Int , toIndex : Int ) : ImmutableList < E >","body":"= SubList ( this , fromIndex , toIndex )","docstring":"/**\n * Returns a view of the portion of this list between the specified [fromIndex] (inclusive) and [toIndex] (exclusive).\n *\n * The returned list is backed by this list.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this list.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"override fun subList ( fromIndex : Int , toIndex : Int ) : ImmutableList < E >","body":"{ ListImplementation . checkRangeIndexes ( fromIndex , toIndex , this . _size ) return SubList ( source , this . fromIndex + fromIndex , this . fromIndex + toIndex ) }","docstring":"/**\n * Returns a view of the portion of this list between the specified [fromIndex] (inclusive) and [toIndex] (exclusive).\n *\n * The returned list is backed by this list.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this list.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"override fun add ( element : @ UnsafeVariance E ) : PersistentList < E >","body":"override fun add ( element : @ UnsafeVariance E ) : PersistentList < E >","docstring":"/**\n * Returns a new persistent list with the specified [element] appended.\n */"} {"signature":"override fun addAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentList < E >","body":"override fun addAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentList < E >","docstring":"/**\n * Returns the result of appending all elements of the specified [elements] collection to this list.\n *\n * The elements are appended in the order they appear in the specified collection.\n *\n * @return a new persistent list with elements of the specified [elements] collection appended;\n * or this instance if the specified collection is empty.\n */"} {"signature":"override fun remove ( element : @ UnsafeVariance E ) : PersistentList < E >","body":"override fun remove ( element : @ UnsafeVariance E ) : PersistentList < E >","docstring":"/**\n * Returns the result of removing the first appearance of the specified [element] from this list.\n *\n * @return a new persistent list with the first appearance of the specified [element] removed;\n * or this instance if there is no such element in this list.\n */"} {"signature":"override fun removeAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentList < E >","body":"override fun removeAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentList < E >","docstring":"/**\n * Returns the result of removing all elements in this list that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent list with elements in this list that are also\n * contained in the specified [elements] collection removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"override fun removeAll ( predicate : ( E ) -> Boolean ) : PersistentList < E >","body":"override fun removeAll ( predicate : ( E ) -> Boolean ) : PersistentList < E >","docstring":"/**\n * Returns the result of removing all elements in this list that match the specified [predicate].\n *\n * @return a new persistent list with elements matching the specified [predicate] removed;\n * or this instance if no elements match the predicate.\n */"} {"signature":"override fun retainAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentList < E >","body":"override fun retainAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentList < E >","docstring":"/**\n * Returns all elements in this list that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent list with elements in this list that are also\n * contained in the specified [elements] collection;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"override fun clear ( ) : PersistentList < E >","body":"override fun clear ( ) : PersistentList < E >","docstring":"/**\n * Returns an empty persistent list.\n */"} {"signature":"public fun addAll ( index : Int , c : Collection < @ UnsafeVariance E > ) : PersistentList < E >","body":"public fun addAll ( index : Int , c : Collection < @ UnsafeVariance E > ) : PersistentList < E >","docstring":"/**\n * Returns the result of inserting the specified [c] collection at the specified [index].\n *\n * @return a new persistent list with the specified [c] collection inserted at the specified [index];\n * or this instance if the specified collection is empty.\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this list.\n */"} {"signature":"public fun set ( index : Int , element : @ UnsafeVariance E ) : PersistentList < E >","body":"public fun set ( index : Int , element : @ UnsafeVariance E ) : PersistentList < E >","docstring":"/**\n * Returns a new persistent list with the element at the specified [index] replaced with the specified [element].\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this list.\n */"} {"signature":"public fun add ( index : Int , element : @ UnsafeVariance E ) : PersistentList < E >","body":"public fun add ( index : Int , element : @ UnsafeVariance E ) : PersistentList < E >","docstring":"/**\n * Returns a new persistent list with the specified [element] inserted at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this list.\n */"} {"signature":"public fun removeAt ( index : Int ) : PersistentList < E >","body":"public fun removeAt ( index : Int ) : PersistentList < E >","docstring":"/**\n * Returns a new persistent list with the element at the specified [index] removed.\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this list.\n */"} {"signature":"public fun < T > x ( column : ColumnReference < T > , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X , column . name ( ) , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `x` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the x-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > x ( column : KProperty < T > , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X , column . name , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `x` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the x-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun x ( column : String , parameters : LetsPlotPositionalMappingParametersContinuous < Any ? > . ( ) -> Unit = { } ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping < Any ? > ( X , column , LetsPlotPositionalMappingParametersContinuous < Any ? > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `x` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the x-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > x ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X , values . toList ( ) , name , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `x` aesthetic to iterable of values.\n *\n * @param values the iterable containing the x-coordinate values.\n * @param name optional name for this aesthetic mapping.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > x ( values : DataColumn < T > , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X , values , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `x` aesthetic to a data column.\n *\n * @param values the data column to map to the x-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun x ( parameters : AxisParametersWithSetter . ( ) -> Unit = { } )","body":"{ x . apply ( parameters ) }","docstring":"/**\n * Applies configurations to x-axis parameters.\n *\n * @param parameters the configurations to apply to the x-axis parameters.\n */"} {"signature":"public fun collectPossibleReferenceShortenings ( file : KtFile , selection : TextRange = file . textRange , shortenOptions : ShortenOptions = ShortenOptions . DEFAULT , classShortenStrategy : ( KtClassLikeSymbol ) -> ShortenStrategy = defaultClassShortenStrategy , callableShortenStrategy : ( KtCallableSymbol ) -> ShortenStrategy = defaultCallableShortenStrategy ) : ShortenCommand","body":"= withValidityAssertion { analysisSession . referenceShortener . collectShortenings ( file , selection , shortenOptions , classShortenStrategy , callableShortenStrategy ) }","docstring":"/**\n * Collects possible references to shorten. By default, it shortens a fully-qualified members to the outermost class and does not\n * shorten enum entries. In case of KDoc shortens reference only if it is already imported.\n *\n * N.B. This API is not implemented for the FE10 implementation!\n * For a K1- and K2-compatible API, use [org.jetbrains.kotlin.idea.base.codeInsight.ShortenReferencesFacility].\n *\n * Also see [org.jetbrains.kotlin.idea.base.analysis.api.utils.shortenReferences] and functions around it.\n */"} {"signature":"public fun collectPossibleReferenceShorteningsInElement ( element : KtElement , shortenOptions : ShortenOptions = ShortenOptions . DEFAULT , classShortenStrategy : ( KtClassLikeSymbol ) -> ShortenStrategy = defaultClassShortenStrategy , callableShortenStrategy : ( KtCallableSymbol ) -> ShortenStrategy = defaultCallableShortenStrategy ) : ShortenCommand","body":"= withValidityAssertion { analysisSession . referenceShortener . collectShortenings ( element . containingKtFile , element . textRange , shortenOptions , classShortenStrategy , callableShortenStrategy ) }","docstring":"/**\n * Collects possible references to shorten in [element]s text range. By default, it shortens a fully-qualified members to the outermost\n * class and does not shorten enum entries.\n *\n * N.B. This API is not implemented for the FE10 implementation!\n * For a K1- and K2-compatible API, use [org.jetbrains.kotlin.idea.base.codeInsight.ShortenReferencesFacility].\n *\n * Also see [org.jetbrains.kotlin.idea.base.analysis.api.utils.shortenReferences] and functions around it.\n */"} {"signature":"public fun getResolveExtensionScopeWithTopLevelDeclarations ( ) : KtScope","body":"= withValidityAssertion { analysisSession . resolveExtensionInfoProvider . getResolveExtensionScopeWithTopLevelDeclarations ( ) }","docstring":"/**\n * Returns [KtScope] which contains all top-level callable declarations which are generated by [KtResolveExtension]\n *\n * @see org.jetbrains.kotlin.analysis.api.resolve.extensions.KtResolveExtension\n * @see org.jetbrains.kotlin.analysis.api.resolve.extensions.KtResolveExtensionProvider\n */"} {"signature":"public fun KtElement . getResolveExtensionNavigationElements ( ) : Collection < PsiElement >","body":"= withValidityAssertion { analysisSession . resolveExtensionInfoProvider . getResolveExtensionNavigationElements ( this ) }","docstring":"/**\n * Returns the [PsiElement]s which should be used as a navigation target in place of this [KtElement]\n * provided by a [KtResolveExtension].\n *\n * These [PsiElement]s will typically be the source item(s) that caused the given [KtElement] to be generated\n * by the [KtResolveExtension]. For example, for a [KtElement] generated by a resource compiler, this will\n * typically be a list of the [PsiElement]s of the resource items in the corresponding resource file.\n *\n * @see org.jetbrains.kotlin.analysis.api.resolve.extensions.KtResolveExtension\n * @see org.jetbrains.kotlin.analysis.api.resolve.extensions.KtResolveExtensionProvider\n */"} {"signature":"private fun cleanBlockHoundTraces ( frames : List < String > ) : List < String >","body":"{ val result = mutableListOf < String > ( ) val blockHoundSubstr = \"\" var i = while ( i < frames . size ) { result . add ( frames [ i ] . replace ( blockHoundSubstr , \"\" ) ) if ( frames [ i ] . contains ( blockHoundSubstr ) ) { i += } i += } return result }","docstring":"/** Clean the stacktraces from artifacts of BlockHound instrumentation\n *\n * BlockHound works by switching a native call by a class generated with ByteBuddy, which, if the blocking\n * call is allowed in this context, in turn calls the real native call that is now available under a\n * different name.\n *\n * The traces thus undergo the following two changes when the execution is instrumented:\n * - The original native call is replaced with a non-native one with the same FQN, and\n * - An additional native call is placed on top of the stack, with the original name that also has\n * `$$BlockHound$$_` prepended at the last component.\n */"} {"signature":"private fun removeJavaUtilConcurrentTraces ( frames : List < String > ) : List < String >","body":"= frames . filter { ! it . contains ( \"\" ) }","docstring":"/**\n * Removes all frames that contain \"java.util.concurrent\" in it.\n *\n * We do leverage Java's locks for proper rendezvous and to fix the coroutine stack's state,\n * but this API doesn't have (nor expected to) stable stacktrace, so we are filtering all such\n * frames out.\n *\n * See https://github.com/Kotlin/kotlinx.coroutines/issues/3700 for the example of failure\n */"} {"signature":"fun parse ( header : String ) : CoroutineDumpHeader","body":"{ val ( identFull , stateFull ) = header . split ( \"\" , limit = ) val nameAndClassName = identFull . removePrefix ( \"\" ) . split ( '' , limit = ) [ ] val ( name , className ) = nameAndClassName . split ( '' , limit = ) . let { parts -> val ( quotedName , classNameWithState ) = if ( parts . size == ) { null to parts [ ] } else { parts [ ] to parts [ ] } val name = quotedName ? . removeSurrounding ( \"\" ) ? . split ( '' , limit = ) ? . get ( ) val className = classNameWithState . replace ( \"\" . toRegex ( ) , \"\" ) name to className } val state = stateFull . removePrefix ( \"\" ) return CoroutineDumpHeader ( name , className , state ) }","docstring":"/**\n * Parses following strings:\n *\n * - Coroutine \"coroutine#10\":DeferredCoroutine{Active}@66d87651, state: RUNNING\n * - Coroutine DeferredCoroutine{Active}@66d87651, state: RUNNING\n *\n * into:\n *\n * - `CoroutineDumpHeader(name = \"coroutine\", className = \"DeferredCoroutine\", state = \"RUNNING\")`\n * - `CoroutineDumpHeader(name = null, className = \"DeferredCoroutine\", state = \"RUNNING\")`\n */"} {"signature":"fun isAgpRunnable ( ) : Boolean","body":"{ val javaVersion = when ( val specVersion = System . getProperty ( \"\" ) ) { \"\" -> else -> specVersion . toInt ( ) } return javaVersion >= }","docstring":"/**\n * AGP 7+ is compiled with Java 8, but requires Java 11+ to run:\n *\n * > EvalIssueException: Android Gradle plugin requires Java 11 to run. You are currently using Java 1.8.\n */"} {"signature":"private fun TypeInfo . isSubtypeOf ( other : TypeInfo , context : CheckerContext ) : Boolean","body":"{ val isDirectSubtype = notNullType . isSubtypeOf ( other . notNullType , context . session ) val counterpart = other . notNullType . getCounterpartRelativelyToPlatform ( context . session ) return isDirectSubtype || counterpart ? . let { notNullType . isSubtypeOf ( it , context . session ) } == true }","docstring":"/**\n * This function de-facto replicates a single-side check from [org.jetbrains.kotlin.types.CastDiagnosticsUtil.isRelated].\n */"} {"signature":"internal fun shouldReportAsPerRules1 ( l : TypeInfo , r : TypeInfo , context : CheckerContext ) : Boolean","body":"{ val oneIsFinal = l . isFinal || r . isFinal return when { oneIsFinal -> areUnrelated ( l , r , context ) else -> false } }","docstring":"/**\n * See [KT-57779](https://youtrack.jetbrains.com/issue/KT-57779) for more information.\n */"} {"signature":"fun convertFile ( file : LighterASTNode , sourceFile : KtSourceFile , linesMapping : KtSourceFileLinesMapping ) : FirFile","body":"{ if ( file . tokenType != KT_FILE ) { throw Exception ( ) } val fileSymbol = FirFileSymbol ( ) var fileAnnotations = mutableListOf < FirAnnotation > ( ) val importList = mutableListOf < FirImport > ( ) val firDeclarationList = mutableListOf < FirDeclaration > ( ) val modifierList = mutableListOf < LighterASTNode > ( ) context . packageFqName = FqName . ROOT var packageDirective : FirPackageDirective ? = null file . forEachChildren { child -> when ( child . tokenType ) { FILE_ANNOTATION_LIST -> { withContainerSymbol ( fileSymbol ) { fileAnnotations += convertAnnotationList ( child ) } } PACKAGE_DIRECTIVE -> { packageDirective = convertPackageDirective ( child ) . also { context . packageFqName = it . packageFqName } } IMPORT_LIST -> importList += convertImportDirectives ( child ) CLASS -> firDeclarationList += convertClass ( child ) FUN -> firDeclarationList += convertFunctionDeclaration ( child ) as FirDeclaration KtNodeTypes . PROPERTY -> firDeclarationList += convertPropertyDeclaration ( child ) TYPEALIAS -> firDeclarationList += convertTypeAlias ( child ) OBJECT_DECLARATION -> firDeclarationList += convertClass ( child ) DESTRUCTURING_DECLARATION -> firDeclarationList += buildErrorTopLevelDestructuringDeclaration ( child . toFirSourceElement ( ) ) SCRIPT -> { } MODIFIER_LIST -> modifierList += child } } modifierList . forEach { firDeclarationList += buildErrorTopLevelDeclarationForDanglingModifierList ( it ) } return buildFile { symbol = fileSymbol source = file . toFirSourceElement ( ) origin = FirDeclarationOrigin . Source moduleData = baseModuleData name = sourceFile . name this . sourceFile = sourceFile this . sourceFileLinesMapping = linesMapping this . packageDirective = packageDirective ? : buildPackageDirective { packageFqName = context . packageFqName } annotations += fileAnnotations imports += importList declarations += firDeclarationList } }","docstring":"/**\n * [org.jetbrains.kotlin.parsing.KotlinParsing.parseFile]\n * [org.jetbrains.kotlin.parsing.KotlinParsing.parsePreamble]\n */"} {"signature":"fun convertBlockExpression ( block : LighterASTNode ) : FirBlock","body":"{ return convertBlockExpressionWithoutBuilding ( block ) . build ( ) }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseBlockExpression\n */"} {"signature":"private fun convertPackageDirective ( packageNode : LighterASTNode ) : FirPackageDirective","body":"{ var packageName : FqName = FqName . ROOT packageNode . forEachChildren { when ( it . tokenType ) { DOT_QUALIFIED_EXPRESSION , REFERENCE_EXPRESSION -> packageName = FqName ( it . getAsStringWithoutBacktick ( ) ) } } return buildPackageDirective { packageFqName = packageName source = packageNode . toFirSourceElement ( ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parsePackageName\n */"} {"signature":"private fun convertImportDirective ( importDirective : LighterASTNode ) : FirImport","body":"{ var importedFqName : FqName ? = null var isAllUnder = false var aliasName : String ? = null var aliasSource : KtSourceElement ? = null importDirective . forEachChildren { when ( it . tokenType ) { REFERENCE_EXPRESSION , DOT_QUALIFIED_EXPRESSION -> { importedFqName = mutableListOf < String > ( ) . apply { collectSegments ( it ) } . joinToString ( \"\" ) . let { FqName ( it ) } } MUL -> isAllUnder = true IMPORT_ALIAS -> { val importAlias = convertImportAlias ( it ) if ( importAlias != null ) { aliasName = importAlias . first aliasSource = importAlias . second } } } } return buildImport { source = importDirective . toFirSourceElement ( ) this . importedFqName = importedFqName this . isAllUnder = isAllUnder this . aliasName = aliasName ? . let { Name . identifier ( it ) } this . aliasSource = aliasSource } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseImportDirective\n */"} {"signature":"private fun convertImportDirectives ( importList : LighterASTNode ) : List < FirImport >","body":"{ return importList . forEachChildrenReturnList { node , container -> when ( node . tokenType ) { IMPORT_DIRECTIVE -> container += convertImportDirective ( node ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseImportDirectives\n */"} {"signature":"private fun convertModifierList ( modifiers : LighterASTNode , isInClass : Boolean = false ) : Modifier","body":"{ val modifier = Modifier ( ) modifiers . forEachChildren { if ( it . tokenType is KtModifierKeywordToken ) { modifier . addModifier ( it , isInClass ) } } return modifier }","docstring":"/**\n * Convert only modifiers\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseModifierList\n */"} {"signature":"private fun convertAnnotationList ( annotations : LighterASTNode ) : List < FirAnnotationCall >","body":"{ return annotations . forEachChildrenReturnList < FirAnnotationCall > { node , list -> when ( node . tokenType ) { ANNOTATION -> list += convertAnnotation ( node ) ANNOTATION_ENTRY -> list += convertAnnotationEntry ( node ) } } }","docstring":"/**\n * Convert only annotations\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseModifierList\n */"} {"signature":"private fun convertTypeModifierList ( modifiers : LighterASTNode ) : Modifier","body":"{ val typeModifier = Modifier ( ) modifiers . forEachChildren { when ( it . tokenType ) { ANNOTATION -> typeModifier . annotations += convertAnnotation ( it ) ANNOTATION_ENTRY -> typeModifier . annotations += convertAnnotationEntry ( it ) is KtModifierKeywordToken -> typeModifier . addModifier ( it ) } } return typeModifier }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeModifierList\n */"} {"signature":"private fun convertTypeArgumentModifierList ( modifiers : LighterASTNode ) : TypeProjectionModifier","body":"{ val typeArgumentModifier = TypeProjectionModifier ( ) modifiers . forEachChildren { when ( it . tokenType ) { ANNOTATION -> typeArgumentModifier . annotations += convertAnnotation ( it ) ANNOTATION_ENTRY -> typeArgumentModifier . annotations += convertAnnotationEntry ( it ) is KtModifierKeywordToken -> typeArgumentModifier . addModifier ( it ) } } return typeArgumentModifier }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeArgumentModifierList\n */"} {"signature":"private fun convertTypeParameterModifiers ( modifiers : LighterASTNode ) : TypeParameterModifier","body":"{ val modifier = TypeParameterModifier ( ) modifiers . forEachChildren { when ( it . tokenType ) { ANNOTATION -> modifier . annotations += convertAnnotation ( it ) ANNOTATION_ENTRY -> modifier . annotations += convertAnnotationEntry ( it ) is KtModifierKeywordToken -> modifier . addModifier ( it ) } } return modifier }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeArgumentModifierList\n */"} {"signature":"fun convertAnnotation ( annotationNode : LighterASTNode ) : List < FirAnnotationCall >","body":"{ var annotationTarget : AnnotationUseSiteTarget ? = null return annotationNode . forEachChildrenReturnList { node , container -> when ( node . tokenType ) { ANNOTATION_TARGET -> annotationTarget = convertAnnotationTarget ( node ) ANNOTATION_ENTRY -> container += convertAnnotationEntry ( node , annotationTarget ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseAnnotationOrList\n */"} {"signature":"private fun convertAnnotationTarget ( annotationUseSiteTarget : LighterASTNode ) : AnnotationUseSiteTarget","body":"{ lateinit var annotationTarget : AnnotationUseSiteTarget annotationUseSiteTarget . forEachChildren { when ( it . tokenType ) { FIELD_KEYWORD -> annotationTarget = FIELD FILE_KEYWORD -> annotationTarget = FILE PROPERTY_KEYWORD -> annotationTarget = AnnotationUseSiteTarget . PROPERTY GET_KEYWORD -> annotationTarget = PROPERTY_GETTER SET_KEYWORD -> annotationTarget = PROPERTY_SETTER RECEIVER_KEYWORD -> annotationTarget = RECEIVER PARAM_KEYWORD -> annotationTarget = CONSTRUCTOR_PARAMETER SETPARAM_KEYWORD -> annotationTarget = SETTER_PARAMETER DELEGATE_KEYWORD -> annotationTarget = PROPERTY_DELEGATE_FIELD } } return annotationTarget }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseAnnotationTarget\n */"} {"signature":"fun convertAnnotationEntry ( unescapedAnnotation : LighterASTNode , defaultAnnotationUseSiteTarget : AnnotationUseSiteTarget ? = null , diagnostic : ConeDiagnostic ? = null , ) : FirAnnotationCall","body":"{ var annotationUseSiteTarget : AnnotationUseSiteTarget ? = null lateinit var constructorCalleePair : Pair < FirTypeRef , List < FirExpression > > unescapedAnnotation . forEachChildren { when ( it . tokenType ) { ANNOTATION_TARGET -> annotationUseSiteTarget = convertAnnotationTarget ( it ) CONSTRUCTOR_CALLEE -> constructorCalleePair = convertConstructorInvocation ( unescapedAnnotation ) } } val qualifier = ( constructorCalleePair . first as? FirUserTypeRef ) ? . qualifier ? . last ( ) val name = qualifier ? . name ? : Name . special ( \"\" ) val theCalleeReference = buildSimpleNamedReference { source = unescapedAnnotation . getChildNodeByType ( CONSTRUCTOR_CALLEE ) ? . getChildNodeByType ( TYPE_REFERENCE ) ? . getChildNodeByType ( USER_TYPE ) ? . getChildNodeByType ( REFERENCE_EXPRESSION ) ? . toFirSourceElement ( ) this . name = name } return if ( diagnostic == null ) { buildAnnotationCall { source = unescapedAnnotation . toFirSourceElement ( ) useSiteTarget = annotationUseSiteTarget ? : defaultAnnotationUseSiteTarget annotationTypeRef = constructorCalleePair . first calleeReference = theCalleeReference extractArgumentsFrom ( constructorCalleePair . second ) typeArguments += qualifier ? . typeArgumentList ? . typeArguments ? : listOf ( ) containingDeclarationSymbol = context . containerSymbol } } else { buildErrorAnnotationCall { source = unescapedAnnotation . toFirSourceElement ( ) useSiteTarget = annotationUseSiteTarget ? : defaultAnnotationUseSiteTarget annotationTypeRef = constructorCalleePair . first this . diagnostic = diagnostic calleeReference = theCalleeReference extractArgumentsFrom ( constructorCalleePair . second ) typeArguments += qualifier ? . typeArgumentList ? . typeArguments ? : listOf ( ) containingDeclarationSymbol = context . containerSymbol } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseAnnotation\n * can be treated as unescapedAnnotation\n */"} {"signature":"private fun convertClass ( classNode : LighterASTNode ) : FirDeclaration","body":"{ var modifiers : Modifier ? = null var classKind : ClassKind = ClassKind . CLASS var identifier : String ? = null val firTypeParameters = mutableListOf < FirTypeParameter > ( ) var primaryConstructor : LighterASTNode ? = null val typeConstraints = mutableListOf < TypeConstraint > ( ) val classAnnotations = mutableListOf < FirAnnotationCall > ( ) var classBody : LighterASTNode ? = null var superTypeList : LighterASTNode ? = null var typeParameterList : LighterASTNode ? = null classNode . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> modifiers = convertModifierList ( it , isInClass = true ) IDENTIFIER -> identifier = it . asText } } val calculatedModifiers = modifiers ? : Modifier ( ) val className = identifier . nameAsSafeName ( if ( calculatedModifiers . isCompanion ( ) ) \"\" else \"\" ) val isLocalWithinParent = classNode . getParent ( ) ? . elementType != CLASS_BODY && isClassLocal ( classNode ) { getParent ( ) } val classIsExpect = calculatedModifiers . hasExpect ( ) || context . containerIsExpect val classIsKotlinAny = identifier . nameAsSafeName ( ) == StandardNames . FqNames . any . shortName ( ) && classNode . getParent ( ) ? . getChildNodeByType ( PACKAGE_DIRECTIVE ) ? . getChildNodeByType ( REFERENCE_EXPRESSION ) ? . getReferencedNameAsName ( ) == StandardNames . BUILT_INS_PACKAGE_NAME return withChildClassName ( className , isExpect = classIsExpect , isLocalWithinParent ) { val classSymbol = FirRegularClassSymbol ( context . currentClassId ) withContainerSymbol ( classSymbol ) { classNode . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { classAnnotations += convertAnnotationList ( it ) } CLASS_KEYWORD -> classKind = ClassKind . CLASS INTERFACE_KEYWORD -> classKind = ClassKind . INTERFACE OBJECT_KEYWORD -> classKind = ClassKind . OBJECT TYPE_PARAMETER_LIST -> typeParameterList = it PRIMARY_CONSTRUCTOR -> primaryConstructor = it SUPER_TYPE_LIST -> superTypeList = it TYPE_CONSTRAINT_LIST -> typeConstraints += convertTypeConstraints ( it ) CLASS_BODY -> classBody = it } } if ( classKind == ClassKind . CLASS ) { classKind = when { calculatedModifiers . isEnum ( ) -> ClassKind . ENUM_CLASS calculatedModifiers . isAnnotation ( ) -> ClassKind . ANNOTATION_CLASS else -> classKind } } val isLocal = context . inLocalContext val status = FirDeclarationStatusImpl ( if ( isLocal ) Visibilities . Local else calculatedModifiers . getVisibility ( publicByDefault = true ) , calculatedModifiers . getModality ( isClassOrObject = true ) ) . apply { isExpect = classIsExpect isActual = calculatedModifiers . hasActual ( ) isInner = calculatedModifiers . isInner ( ) isCompanion = calculatedModifiers . isCompanion ( ) && classKind == ClassKind . OBJECT isData = calculatedModifiers . isDataClass ( ) isInline = calculatedModifiers . isInlineClass ( ) isFun = calculatedModifiers . isFunctionalInterface ( ) isExternal = calculatedModifiers . hasExternal ( ) } typeParameterList ? . let { firTypeParameters += convertTypeParameters ( it , typeConstraints , classSymbol ) } withCapturedTypeParameters ( status . isInner || isLocal , classNode . toFirSourceElement ( ) , firTypeParameters ) { var delegatedFieldsMap : Map < Int , FirFieldSymbol > ? = null buildRegularClass { source = classNode . toFirSourceElement ( ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source name = className this . status = status this . classKind = classKind scopeProvider = baseScopeProvider symbol = classSymbol annotations += classAnnotations typeParameters += firTypeParameters context . appendOuterTypeParameters ( ignoreLastLevel = true , typeParameters ) val selfType = classNode . toDelegatedSelfType ( this ) registerSelfType ( selfType ) val delegationSpecifiers = superTypeList ? . let { convertDelegationSpecifiers ( it ) } var delegatedSuperTypeRef : FirTypeRef ? = delegationSpecifiers ? . superTypeCalls ? . lastOrNull ( ) ? . delegatedSuperTypeRef val delegatedConstructorSource : KtLightSourceElement ? = delegationSpecifiers ? . superTypeCalls ? . lastOrNull ( ) ? . source val superTypeRefs = mutableListOf < FirTypeRef > ( ) delegationSpecifiers ? . let { superTypeRefs += it . superTypesRef } when { calculatedModifiers . isEnum ( ) && ( classKind == ClassKind . ENUM_CLASS ) && delegatedConstructorSource == null -> { delegatedSuperTypeRef = buildResolvedTypeRef { type = ConeClassLikeTypeImpl ( implicitEnumType . type . lookupTag , arrayOf ( selfType . type ) , isNullable = false ) } superTypeRefs += delegatedSuperTypeRef } calculatedModifiers . isAnnotation ( ) && ( classKind == ClassKind . ANNOTATION_CLASS ) -> { superTypeRefs += implicitAnnotationType delegatedSuperTypeRef = implicitAnyType } } if ( superTypeRefs . isEmpty ( ) && ! classIsKotlinAny ) { superTypeRefs += implicitAnyType delegatedSuperTypeRef = implicitAnyType } this . superTypeRefs += superTypeRefs val secondaryConstructors = classBody . getChildNodesByType ( SECONDARY_CONSTRUCTOR ) val classWrapper = ClassWrapper ( calculatedModifiers , classKind , this , hasSecondaryConstructor = secondaryConstructors . isNotEmpty ( ) , hasDefaultConstructor = if ( primaryConstructor != null ) ! primaryConstructor ! ! . hasValueParameters ( ) else secondaryConstructors . isEmpty ( ) || secondaryConstructors . any { ! it . hasValueParameters ( ) } , delegatedSelfTypeRef = selfType , delegatedSuperTypeRef = delegatedSuperTypeRef ? : FirImplicitTypeRefImplWithoutSource , delegatedSuperCalls = delegationSpecifiers ? . superTypeCalls ? : emptyList ( ) ) val primaryConstructorWrapper = convertPrimaryConstructor ( classNode , primaryConstructor , selfType . source , classWrapper , delegatedConstructorSource , containingClassIsExpectClass = status . isExpect , isImplicitlyActual = status . isActual && ( status . isInline || classKind == ClassKind . ANNOTATION_CLASS ) , isKotlinAny = classIsKotlinAny , ) val firPrimaryConstructor = primaryConstructorWrapper ? . firConstructor firPrimaryConstructor ? . let { declarations += it } delegationSpecifiers ? . delegateFieldsMap ? . values ? . mapTo ( declarations ) { it . fir } delegatedFieldsMap = delegationSpecifiers ? . delegateFieldsMap ? . takeIf { it . isNotEmpty ( ) } val properties = mutableListOf < FirProperty > ( ) if ( primaryConstructor != null && firPrimaryConstructor != null ) { properties += primaryConstructorWrapper . valueParameters . filter { it . hasValOrVar ( ) } . map { it . toFirPropertyFromPrimaryConstructor ( baseModuleData , callableIdForName ( it . firValueParameter . name ) , classIsExpect , currentDispatchReceiverType ( ) , context ) } addDeclarations ( properties ) } classBody ? . let { addDeclarations ( convertClassBody ( it , classWrapper ) ) } if ( calculatedModifiers . isDataClass ( ) && firPrimaryConstructor != null ) { val zippedParameters = properties . map { it . source ! ! . lighterASTNode to it } DataClassMembersGenerator ( classNode , this , zippedParameters , context . packageFqName , context . className , createClassTypeRefWithSourceKind = { firPrimaryConstructor . returnTypeRef . copyWithNewSourceKind ( it ) } , createParameterTypeRefWithSourceKind = { property , kind -> property . returnTypeRef . copyWithNewSourceKind ( kind ) } , addValueParameterAnnotations = { valueParam -> valueParam . forEachChildren { if ( it . tokenType == MODIFIER_LIST ) convertAnnotationList ( it ) . filterTo ( annotations ) { it . useSiteTarget . appliesToPrimaryConstructorParameter ( ) } } } , ) . generate ( ) } if ( calculatedModifiers . isEnum ( ) ) { generateValuesFunction ( baseModuleData , context . packageFqName , context . className , classIsExpect ) generateValueOfFunction ( baseModuleData , context . packageFqName , context . className , classIsExpect ) generateEntriesGetter ( baseModuleData , context . packageFqName , context . className , classIsExpect ) } initCompanionObjectSymbolAttr ( ) contextReceivers . addAll ( convertContextReceivers ( classNode ) ) } . also { it . delegateFieldsMap = delegatedFieldsMap } } . also { fillDanglingConstraintsTo ( firTypeParameters , typeConstraints , it ) } } } . also { if ( classNode . getParent ( ) ? . elementType == KtStubElementTypes . CLASS_BODY ) { it . initContainingClassForLocalAttr ( ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseClassOrObject\n */"} {"signature":"fun convertObjectLiteral ( objectLiteral : LighterASTNode ) : FirElement","body":"{ return withChildClassName ( SpecialNames . ANONYMOUS , forceLocalContext = true , isExpect = false ) { var delegatedFieldsMap : Map < Int , FirFieldSymbol > ? = null buildAnonymousObjectExpression { source = objectLiteral . toFirSourceElement ( ) anonymousObject = buildAnonymousObject { val objectDeclaration = objectLiteral . getChildNodesByType ( OBJECT_DECLARATION ) . first ( ) source = objectDeclaration . toFirSourceElement ( ) origin = FirDeclarationOrigin . Source moduleData = baseModuleData classKind = ClassKind . CLASS scopeProvider = baseScopeProvider symbol = FirAnonymousObjectSymbol ( context . packageFqName ) status = FirDeclarationStatusImpl ( Visibilities . Local , Modality . FINAL ) context . appendOuterTypeParameters ( ignoreLastLevel = false , typeParameters ) val delegatedSelfType = objectDeclaration . toDelegatedSelfType ( this ) registerSelfType ( delegatedSelfType ) var modifiers : Modifier ? = null val objectAnnotations = mutableListOf < FirAnnotationCall > ( ) var primaryConstructor : LighterASTNode ? = null val superTypeRefs = mutableListOf < FirTypeRef > ( ) var delegatedSuperTypeRef : FirTypeRef ? = null var classBody : LighterASTNode ? = null var delegatedConstructorSource : KtLightSourceElement ? = null var delegatedSuperCalls : List < DelegatedConstructorWrapper > ? = null var delegateFields : List < FirField > ? = null objectDeclaration . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { modifiers = convertModifierList ( it ) objectAnnotations += convertAnnotationList ( it ) } PRIMARY_CONSTRUCTOR -> primaryConstructor = it SUPER_TYPE_LIST -> convertDelegationSpecifiers ( it ) . let { specifiers -> delegatedSuperTypeRef = specifiers . superTypeCalls . lastOrNull ( ) ? . delegatedSuperTypeRef superTypeRefs += specifiers . superTypesRef delegatedConstructorSource = specifiers . superTypeCalls . lastOrNull ( ) ? . source delegateFields = specifiers . delegateFieldsMap . values . map { it . fir } delegatedFieldsMap = specifiers . delegateFieldsMap . takeIf { it . isNotEmpty ( ) } delegatedSuperCalls = specifiers . superTypeCalls } CLASS_BODY -> classBody = it } } superTypeRefs . ifEmpty { superTypeRefs += implicitAnyType delegatedSuperTypeRef = implicitAnyType } val delegatedSuperType = delegatedSuperTypeRef ? : FirImplicitTypeRefImplWithoutSource annotations += objectAnnotations this . superTypeRefs += superTypeRefs val classWrapper = ClassWrapper ( modifiers ? : Modifier ( ) , ClassKind . OBJECT , this , hasSecondaryConstructor = classBody . getChildNodesByType ( SECONDARY_CONSTRUCTOR ) . isNotEmpty ( ) , hasDefaultConstructor = false , delegatedSelfTypeRef = delegatedSelfType , delegatedSuperTypeRef = delegatedSuperType , delegatedSuperCalls = delegatedSuperCalls ? : emptyList ( ) , ) convertPrimaryConstructor ( objectDeclaration , primaryConstructor , delegatedSelfType . source , classWrapper , delegatedConstructorSource , containingClassIsExpectClass = false ) ? . let { this . declarations += it . firConstructor } delegateFields ? . let { this . declarations += it } classBody ? . let { this . declarations += convertClassBody ( it , classWrapper ) } } . also { it . delegateFieldsMap = delegatedFieldsMap } } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinExpressionParsing.parseObjectLiteral\n * @see org.jetbrains.kotlin.fir.builder.RawFirBuilder.Visitor.visitObjectLiteralExpression\n */"} {"signature":"private fun convertEnumEntry ( enumEntry : LighterASTNode , classWrapper : ClassWrapper ) : FirEnumEntry","body":"{ var modifiers : Modifier ? = null val entryAnnotations = mutableListOf < FirAnnotationCall > ( ) lateinit var identifier : String val enumSuperTypeCallEntry = mutableListOf < FirExpression > ( ) var classBodyNode : LighterASTNode ? = null var superTypeCallEntry : LighterASTNode ? = null enumEntry . getChildNodeByType ( IDENTIFIER ) ? . let { identifier = it . asText } val enumEntryName = identifier . nameAsSafeName ( ) val containingClassIsExpectClass = classWrapper . hasExpect ( ) || context . containerIsExpect return buildEnumEntry { symbol = FirEnumEntrySymbol ( CallableId ( context . currentClassId , enumEntryName ) ) withContainerSymbol ( symbol ) { enumEntry . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { modifiers = convertModifierList ( it ) entryAnnotations += convertAnnotationList ( it ) } INITIALIZER_LIST -> { enumSuperTypeCallEntry += convertInitializerList ( it ) it . getChildNodeByType ( SUPER_TYPE_CALL_ENTRY ) ? . let { superTypeCall -> superTypeCallEntry = superTypeCall } } CLASS_BODY -> classBodyNode = it } } source = enumEntry . toFirSourceElement ( ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = classWrapper . delegatedSelfTypeRef name = enumEntryName status = FirDeclarationStatusImpl ( Visibilities . Public , Modality . FINAL ) . apply { isStatic = true isExpect = containingClassIsExpectClass } if ( classWrapper . hasDefaultConstructor && enumEntry . getChildNodeByType ( INITIALIZER_LIST ) == null && entryAnnotations . isEmpty ( ) && classBodyNode == null ) { return@buildEnumEntry } annotations += entryAnnotations initializer = withChildClassName ( enumEntryName , isExpect = false ) { buildAnonymousObjectExpression { val entrySource = enumEntry . toFirSourceElement ( KtFakeSourceElementKind . EnumInitializer ) source = entrySource anonymousObject = buildAnonymousObject { source = entrySource moduleData = baseModuleData origin = FirDeclarationOrigin . Source classKind = ClassKind . ENUM_ENTRY scopeProvider = baseScopeProvider symbol = FirAnonymousObjectSymbol ( context . packageFqName ) status = FirDeclarationStatusImpl ( Visibilities . Local , Modality . FINAL ) val enumClassWrapper = ClassWrapper ( modifiers ? : Modifier ( ) , ClassKind . ENUM_ENTRY , this , hasSecondaryConstructor = classBodyNode . getChildNodesByType ( SECONDARY_CONSTRUCTOR ) . isNotEmpty ( ) , hasDefaultConstructor = false , delegatedSelfTypeRef = buildResolvedTypeRef { type = ConeClassLikeTypeImpl ( this @ buildAnonymousObject . symbol . toLookupTag ( ) , ConeTypeProjection . EMPTY_ARRAY , isNullable = false ) } . also { registerSelfType ( it ) } , delegatedSuperTypeRef = classWrapper . delegatedSelfTypeRef , delegatedSuperCalls = listOf ( DelegatedConstructorWrapper ( classWrapper . delegatedSelfTypeRef , enumSuperTypeCallEntry , superTypeCallEntry ? . toFirSourceElement ( ) , ) ) ) superTypeRefs += enumClassWrapper . delegatedSuperTypeRef convertPrimaryConstructor ( enumEntry , null , enumEntry . toFirSourceElement ( ) , enumClassWrapper , superTypeCallEntry ? . toFirSourceElement ( ) , isEnumEntry = true , containingClassIsExpectClass = containingClassIsExpectClass ) ? . let { declarations += it . firConstructor } classBodyNode ? . also { withChildClassName ( SpecialNames . ANONYMOUS , forceLocalContext = true , isExpect = false ) { declarations += convertClassBody ( it , enumClassWrapper ) } } } } } } } . also { it . containingClassForStaticMemberAttr = currentDispatchReceiverType ( ) ! ! . lookupTag } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseEnumEntry\n */"} {"signature":"private fun convertInitializerList ( initializerList : LighterASTNode ) : List < FirExpression >","body":"{ val firValueArguments = mutableListOf < FirExpression > ( ) initializerList . forEachChildren { when ( it . tokenType ) { SUPER_TYPE_CALL_ENTRY -> convertConstructorInvocation ( it ) . apply { firValueArguments += second } } } return firValueArguments }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseEnumEntry\n */"} {"signature":"private fun convertClassBody ( classBody : LighterASTNode , classWrapper : ClassWrapper ) : List < FirDeclaration >","body":"{ val modifierLists = mutableListOf < LighterASTNode > ( ) var firDeclarations = classBody . forEachChildrenReturnList { node , container -> @ Suppress ( \"\" ) when ( node . tokenType ) { ENUM_ENTRY -> container += convertEnumEntry ( node , classWrapper ) CLASS -> container += convertClass ( node ) FUN -> container += convertFunctionDeclaration ( node ) as FirDeclaration KtNodeTypes . PROPERTY -> container += convertPropertyDeclaration ( node , classWrapper ) TYPEALIAS -> container += convertTypeAlias ( node ) OBJECT_DECLARATION -> container += convertClass ( node ) CLASS_INITIALIZER -> container += convertAnonymousInitializer ( node , classWrapper ) SECONDARY_CONSTRUCTOR -> container += convertSecondaryConstructor ( node , classWrapper ) MODIFIER_LIST -> modifierLists += node DESTRUCTURING_DECLARATION -> container += buildErrorTopLevelDestructuringDeclaration ( node . toFirSourceElement ( ) ) } } for ( node in modifierLists ) { firDeclarations += buildErrorTopLevelDeclarationForDanglingModifierList ( node ) } return firDeclarations }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseClassBody\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseEnumClassBody\n */"} {"signature":"private fun convertPrimaryConstructor ( classNode : LighterASTNode , primaryConstructor : LighterASTNode ? , selfTypeSource : KtSourceElement ? , classWrapper : ClassWrapper , delegatedConstructorSource : KtLightSourceElement ? , isEnumEntry : Boolean = false , containingClassIsExpectClass : Boolean , isImplicitlyActual : Boolean = false , isKotlinAny : Boolean = false , ) : PrimaryConstructor ?","body":"{ val shouldGenerateImplicitConstructor = ( classWrapper . isEnumEntry ( ) || ! classWrapper . hasSecondaryConstructor ) && ! classWrapper . isInterface ( ) && ( ! containingClassIsExpectClass || classWrapper . classBuilder . classKind == ClassKind . ENUM_ENTRY ) val isErrorConstructor = primaryConstructor == null && ! shouldGenerateImplicitConstructor if ( isErrorConstructor && classWrapper . delegatedSuperCalls . isEmpty ( ) ) { return null } val constructorSymbol = FirConstructorSymbol ( callableIdForClassConstructor ( ) ) withContainerSymbol ( constructorSymbol ) { var modifiersIfPresent : Modifier ? = null val constructorAnnotations = mutableListOf < FirAnnotationCall > ( ) val valueParameters = mutableListOf < ValueParameter > ( ) var hasConstructorKeyword = false primaryConstructor ? . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { modifiersIfPresent = convertModifierList ( it ) constructorAnnotations += convertAnnotationList ( it ) } CONSTRUCTOR_KEYWORD -> hasConstructorKeyword = true VALUE_PARAMETER_LIST -> valueParameters += convertValueParameters ( it , constructorSymbol , ValueParameterDeclaration . PRIMARY_CONSTRUCTOR ) } } val modifiers = modifiersIfPresent ? : Modifier ( ) val defaultVisibility = classWrapper . defaultConstructorVisibility ( ) val firDelegatedCall = runUnless ( containingClassIsExpectClass || isKotlinAny ) { fun createDelegatedConstructorCall ( delegatedConstructorSource : KtLightSourceElement ? , delegatedSuperTypeRef : FirTypeRef , arguments : List < FirExpression > , ) : FirDelegatedConstructorCall { return buildDelegatedConstructorCall { source = delegatedConstructorSource ? : primaryConstructor ? . toFirSourceElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) ? : selfTypeSource ? . fakeElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) constructedTypeRef = delegatedSuperTypeRef . copyWithNewSourceKind ( KtFakeSourceElementKind . ImplicitTypeRef ) isThis = false calleeReference = buildExplicitSuperReference { source = if ( ! isEnumEntry ) { classWrapper . delegatedSuperTypeRef . source ? . fakeElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) ? : this@buildDelegatedConstructorCall . source ? . fakeElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) } else { delegatedConstructorSource ? . lighterASTNode ? . getChildNodeByType ( CONSTRUCTOR_CALLEE ) ? . toFirSourceElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) ? : this@buildDelegatedConstructorCall . source } superTypeRef = this@buildDelegatedConstructorCall . constructedTypeRef } extractArgumentsFrom ( arguments ) } } if ( classWrapper . delegatedSuperCalls . size <= ) { createDelegatedConstructorCall ( delegatedConstructorSource , classWrapper . delegatedSuperTypeRef , classWrapper . delegatedSuperCalls . lastOrNull ( ) ? . arguments ? : emptyList ( ) , ) } else { buildMultiDelegatedConstructorCall { classWrapper . delegatedSuperCalls . mapTo ( delegatedConstructorCalls ) { ( delegatedSuperTypeRef , arguments , source ) -> createDelegatedConstructorCall ( source , delegatedSuperTypeRef , arguments ) } } } } val explicitVisibility = runIf ( primaryConstructor != null ) { modifiers . getVisibility ( ) . takeUnless { it == Visibilities . Unknown } } val status = FirDeclarationStatusImpl ( explicitVisibility ? : defaultVisibility , Modality . FINAL ) . apply { isExpect = modifiers . hasExpect ( ) || context . containerIsExpect isActual = modifiers . hasActual ( ) || isImplicitlyActual isInner = classWrapper . isInner ( ) isFromSealedClass = classWrapper . isSealed ( ) && explicitVisibility !== Visibilities . Private isFromEnumClass = classWrapper . isEnum ( ) } val builder = when { modifiersIfPresent != null && ! hasConstructorKeyword -> createErrorConstructorBuilder ( ConeMissingConstructorKeyword ) isErrorConstructor -> createErrorConstructorBuilder ( ConeNoConstructorError ) else -> FirPrimaryConstructorBuilder ( ) } builder . apply { source = primaryConstructor ? . toFirSourceElement ( ) ? : selfTypeSource ? . fakeElement ( KtFakeSourceElementKind . ImplicitConstructor ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = classWrapper . delegatedSelfTypeRef dispatchReceiverType = classWrapper . obtainDispatchReceiverForConstructor ( ) this . status = status symbol = constructorSymbol annotations += constructorAnnotations typeParameters += constructorTypeParametersFromConstructedClass ( classWrapper . classBuilder . typeParameters ) this . valueParameters += valueParameters . map { it . firValueParameter } delegatedConstructor = firDelegatedCall this . body = null this . contextReceivers . addAll ( convertContextReceivers ( classNode ) ) } return PrimaryConstructor ( builder . build ( ) . apply { containingClassForStaticMemberAttr = currentDispatchReceiverType ( ) ! ! . lookupTag } , valueParameters , ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseClassOrObject\n * primaryConstructor branch\n */"} {"signature":"private fun convertAnonymousInitializer ( anonymousInitializer : LighterASTNode , classWrapper : ClassWrapper ) : FirDeclaration","body":"{ val initializerSymbol = FirAnonymousInitializerSymbol ( ) withContainerSymbol ( initializerSymbol ) { var firBlock : FirBlock ? = null val initializerAnnotations = mutableListOf < FirAnnotationCall > ( ) anonymousInitializer . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> initializerAnnotations += convertAnnotationList ( it ) BLOCK -> withForcedLocalContext { firBlock = convertBlock ( it ) } } } return buildAnonymousInitializer { symbol = initializerSymbol source = anonymousInitializer . toFirSourceElement ( ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source body = firBlock ? : buildEmptyExpressionBlock ( ) containingDeclarationSymbol = classWrapper . classBuilder . ownerRegularOrAnonymousObjectSymbol annotations += initializerAnnotations } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseMemberDeclarationRest\n * at INIT keyword\n */"} {"signature":"private fun convertSecondaryConstructor ( secondaryConstructor : LighterASTNode , classWrapper : ClassWrapper ) : FirConstructor","body":"{ var modifiers : Modifier ? = null val constructorAnnotations = mutableListOf < FirAnnotationCall > ( ) val firValueParameters = mutableListOf < ValueParameter > ( ) var constructorDelegationCall : FirDelegatedConstructorCall ? = null var block : LighterASTNode ? = null val constructorSymbol = FirConstructorSymbol ( callableIdForClassConstructor ( ) ) withContainerSymbol ( constructorSymbol ) { secondaryConstructor . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { modifiers = convertModifierList ( it ) constructorAnnotations += convertAnnotationList ( it ) } VALUE_PARAMETER_LIST -> firValueParameters += convertValueParameters ( it , constructorSymbol , ValueParameterDeclaration . FUNCTION ) CONSTRUCTOR_DELEGATION_CALL -> constructorDelegationCall = convertConstructorDelegationCall ( it , classWrapper ) BLOCK -> block = it } } val delegatedSelfTypeRef = classWrapper . delegatedSelfTypeRef val calculatedModifiers = modifiers ? : Modifier ( ) val explicitVisibility = calculatedModifiers . getVisibility ( ) val status = FirDeclarationStatusImpl ( explicitVisibility , Modality . FINAL ) . apply { isExpect = calculatedModifiers . hasExpect ( ) || context . containerIsExpect isActual = calculatedModifiers . hasActual ( ) isInner = classWrapper . isInner ( ) isFromSealedClass = classWrapper . isSealed ( ) && explicitVisibility !== Visibilities . Private isFromEnumClass = classWrapper . isEnum ( ) } val target = FirFunctionTarget ( labelName = null , isLambda = false ) return buildConstructor { source = secondaryConstructor . toFirSourceElement ( ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = delegatedSelfTypeRef dispatchReceiverType = classWrapper . obtainDispatchReceiverForConstructor ( ) this . status = status symbol = constructorSymbol delegatedConstructor = constructorDelegationCall context . firFunctionTargets += target annotations += constructorAnnotations typeParameters += constructorTypeParametersFromConstructedClass ( classWrapper . classBuilder . typeParameters ) valueParameters += firValueParameters . map { it . firValueParameter } val ( body , contractDescription ) = withForcedLocalContext { convertFunctionBody ( block , null , allowLegacyContractDescription = true ) } this . body = body contractDescription ? . let { this . contractDescription = it } context . firFunctionTargets . removeLast ( ) this . contextReceivers . addAll ( convertContextReceivers ( secondaryConstructor . getParent ( ) ! ! . getParent ( ) ! ! ) ) } . also { it . containingClassForStaticMemberAttr = currentDispatchReceiverType ( ) ! ! . lookupTag target . bind ( it ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseSecondaryConstructor\n */"} {"signature":"private fun convertConstructorDelegationCall ( constructorDelegationCall : LighterASTNode , classWrapper : ClassWrapper ) : FirDelegatedConstructorCall ?","body":"{ var thisKeywordPresent = false val firValueArguments = mutableListOf < FirExpression > ( ) constructorDelegationCall . forEachChildren { when ( it . tokenType ) { CONSTRUCTOR_DELEGATION_REFERENCE -> if ( it . asText == \"\" ) thisKeywordPresent = true VALUE_ARGUMENT_LIST -> firValueArguments += expressionConverter . convertValueArguments ( it ) } } val isImplicit = constructorDelegationCall . textLength == if ( isImplicit && classWrapper . modifiers . hasExternal ( ) ) { return null } val isThis = thisKeywordPresent val delegatedType = when { isThis -> classWrapper . delegatedSelfTypeRef else -> classWrapper . delegatedSuperTypeRef } return buildDelegatedConstructorCall { source = if ( isImplicit ) { constructorDelegationCall . toFirSourceElement ( ) . fakeElement ( KtFakeSourceElementKind . ImplicitConstructor ) } else { constructorDelegationCall . toFirSourceElement ( ) } constructedTypeRef = delegatedType . copyWithNewSourceKind ( KtFakeSourceElementKind . ImplicitTypeRef ) this . isThis = isThis val calleeKind = if ( isImplicit ) KtFakeSourceElementKind . ImplicitConstructor else KtFakeSourceElementKind . DelegatingConstructorCall val calleeSource = constructorDelegationCall . getChildNodeByType ( CONSTRUCTOR_DELEGATION_REFERENCE ) ? . toFirSourceElement ( calleeKind ) ? : this@buildDelegatedConstructorCall . source ? . fakeElement ( calleeKind ) calleeReference = if ( isThis ) { buildExplicitThisReference { this . source = calleeSource } } else { buildExplicitSuperReference { source = calleeSource superTypeRef = this@buildDelegatedConstructorCall . constructedTypeRef } } extractArgumentsFrom ( firValueArguments ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.fir.builder.RawFirBuilder.Visitor.convert(\n * KtConstructorDelegationCall, FirTypeRef, Boolean)\n */"} {"signature":"private fun convertTypeAlias ( typeAlias : LighterASTNode ) : FirDeclaration","body":"{ var modifiers : Modifier ? = null var identifier : String ? = null lateinit var firType : FirTypeRef val aliasAnnotations = mutableListOf < FirAnnotationCall > ( ) typeAlias . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> modifiers = convertModifierList ( it ) IDENTIFIER -> identifier = it . asText } } val calculatedModifiers = modifiers ? : Modifier ( ) val typeAliasName = identifier . nameAsSafeName ( ) val typeAliasIsExpect = calculatedModifiers . hasExpect ( ) || context . containerIsExpect return withChildClassName ( typeAliasName , isExpect = typeAliasIsExpect ) { val typeAliasSymbol = FirTypeAliasSymbol ( context . currentClassId ) withContainerSymbol ( typeAliasSymbol ) { typeAlias . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { aliasAnnotations += convertAnnotationList ( it ) } TYPE_REFERENCE -> firType = convertType ( it ) } } val firTypeParameters = mutableListOf < FirTypeParameter > ( ) typeAlias . forEachChildren { if ( it . tokenType == TYPE_PARAMETER_LIST ) { firTypeParameters += convertTypeParameters ( it , emptyList ( ) , typeAliasSymbol ) } } buildTypeAlias { source = typeAlias . toFirSourceElement ( ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source name = typeAliasName val isLocal = context . inLocalContext status = FirDeclarationStatusImpl ( if ( isLocal ) Visibilities . Local else calculatedModifiers . getVisibility ( publicByDefault = true ) , Modality . FINAL , ) . apply { isExpect = typeAliasIsExpect isActual = calculatedModifiers . hasActual ( ) } symbol = typeAliasSymbol expandedTypeRef = firType annotations += aliasAnnotations typeParameters += firTypeParameters } } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeAlias\n */"} {"signature":"fun convertPropertyDeclaration ( property : LighterASTNode , classWrapper : ClassWrapper ? = null ) : FirDeclaration","body":"{ var modifiers : Modifier ? = null val propertyAnnotations = mutableListOf < FirAnnotationCall > ( ) var identifier : String ? = null val firTypeParameters = mutableListOf < FirTypeParameter > ( ) var isReturnType = false var delegate : LighterASTNode ? = null var isVar = false var receiverType : FirTypeRef ? = null var returnType : FirTypeRef = implicitType val typeConstraints = mutableListOf < TypeConstraint > ( ) val accessors = mutableListOf < LighterASTNode > ( ) var propertyInitializer : FirExpression ? = null var typeParameterList : LighterASTNode ? = null var fieldDeclaration : LighterASTNode ? = null property . getChildNodeByType ( IDENTIFIER ) ? . let { identifier = it . asText } val propertyName = identifier . nameAsSafeName ( ) val parentNode = property . getParent ( ) val isLocal = ! ( parentNode ? . tokenType == KT_FILE || parentNode ? . tokenType == CLASS_BODY ) val propertySymbol = if ( isLocal ) { FirPropertySymbol ( propertyName ) } else { FirPropertySymbol ( callableIdForName ( propertyName ) ) } withContainerSymbol ( propertySymbol , isLocal ) { val propertySource = property . toFirSourceElement ( ) property . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { modifiers = convertModifierList ( it ) propertyAnnotations += convertAnnotationList ( it ) } TYPE_PARAMETER_LIST -> typeParameterList = it COLON -> isReturnType = true TYPE_REFERENCE -> if ( isReturnType ) returnType = convertType ( it ) else receiverType = convertType ( it ) TYPE_CONSTRAINT_LIST -> typeConstraints += convertTypeConstraints ( it ) PROPERTY_DELEGATE -> delegate = it VAR_KEYWORD -> isVar = true PROPERTY_ACCESSOR -> { accessors += it } BACKING_FIELD -> fieldDeclaration = it else -> if ( it . isExpression ( ) ) { context . calleeNamesForLambda += null propertyInitializer = withForcedLocalContext { expressionConverter . getAsFirExpression ( it , \"\" ) } context . calleeNamesForLambda . removeLast ( ) } } } val calculatedModifiers = modifiers ? : Modifier ( ) return buildProperty { source = propertySource moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = returnType name = propertyName this . isVar = isVar receiverParameter = receiverType ? . convertToReceiverParameter ( ) initializer = propertyInitializer val delegateSource = delegate ? . let { ( it . getChildExpression ( ) ? : it ) . toFirSourceElement ( ) } symbol = propertySymbol typeParameterList ? . let { firTypeParameters += convertTypeParameters ( it , typeConstraints , symbol ) } backingField = fieldDeclaration . convertBackingField ( symbol , calculatedModifiers , returnType , isVar , if ( isLocal ) emptyList ( ) else propertyAnnotations . filter { it . useSiteTarget == FIELD || it . useSiteTarget == PROPERTY_DELEGATE_FIELD } , property , ) if ( isLocal ) { this . isLocal = true val delegateBuilder = delegate ? . let { FirWrappedDelegateExpressionBuilder ( ) . apply { source = delegateSource ? . fakeElement ( KtFakeSourceElementKind . WrappedDelegate ) expression = expressionConverter . getAsFirExpression ( it , \"\" ) } } status = FirDeclarationStatusImpl ( Visibilities . Local , Modality . FINAL ) . apply { isLateInit = calculatedModifiers . hasLateinit ( ) } typeParameters += firTypeParameters generateAccessorsByDelegate ( delegateBuilder , baseModuleData , classWrapper ? . classBuilder ? . ownerRegularOrAnonymousObjectSymbol , context = context , isExtension = false ) } else { this . isLocal = false dispatchReceiverType = currentDispatchReceiverType ( ) withCapturedTypeParameters ( true , propertySource , firTypeParameters ) { typeParameters += firTypeParameters val delegateBuilder = delegate ? . let { FirWrappedDelegateExpressionBuilder ( ) . apply { source = delegateSource ? . fakeElement ( KtFakeSourceElementKind . WrappedDelegate ) expression = expressionConverter . getAsFirExpression ( it , \"\" ) } } val propertyVisibility = calculatedModifiers . getVisibility ( ) fun defaultAccessorStatus ( ) = FirDeclarationStatusImpl ( propertyVisibility , null ) . apply { isInline = calculatedModifiers . hasInline ( ) isExternal = calculatedModifiers . hasExternal ( ) } val convertedAccessors = accessors . map { convertGetterOrSetter ( it , returnType , propertyVisibility , symbol , calculatedModifiers , propertyAnnotations ) } this . getter = convertedAccessors . find { it . isGetter } ? : FirDefaultPropertyGetter ( property . toFirSourceElement ( KtFakeSourceElementKind . DefaultAccessor ) , moduleData , FirDeclarationOrigin . Source , returnType . copyWithNewSourceKind ( KtFakeSourceElementKind . DefaultAccessor ) , propertyVisibility , symbol , ) . also { it . status = defaultAccessorStatus ( ) it . replaceAnnotations ( propertyAnnotations . filterUseSiteTarget ( PROPERTY_GETTER ) ) it . initContainingClassAttr ( ) } this . setter = convertedAccessors . find { it . isSetter } ? : if ( isVar ) { FirDefaultPropertySetter ( property . toFirSourceElement ( KtFakeSourceElementKind . DefaultAccessor ) , moduleData , FirDeclarationOrigin . Source , returnType . copyWithNewSourceKind ( KtFakeSourceElementKind . DefaultAccessor ) , propertyVisibility , symbol , parameterAnnotations = propertyAnnotations . filterUseSiteTarget ( SETTER_PARAMETER ) ) . also { it . status = defaultAccessorStatus ( ) it . replaceAnnotations ( propertyAnnotations . filterUseSiteTarget ( PROPERTY_SETTER ) ) it . initContainingClassAttr ( ) } } else null status = FirDeclarationStatusImpl ( propertyVisibility , calculatedModifiers . getModality ( isClassOrObject = false ) ) . apply { isExpect = calculatedModifiers . hasExpect ( ) || context . containerIsExpect isActual = calculatedModifiers . hasActual ( ) isOverride = calculatedModifiers . hasOverride ( ) isConst = calculatedModifiers . isConst ( ) isLateInit = calculatedModifiers . hasLateinit ( ) isExternal = calculatedModifiers . hasExternal ( ) } generateAccessorsByDelegate ( delegateBuilder , baseModuleData , classWrapper ? . classBuilder ? . ownerRegularOrAnonymousObjectSymbol , context , isExtension = receiverType != null , ) } } annotations += when { isLocal -> propertyAnnotations else -> propertyAnnotations . filterStandalonePropertyRelevantAnnotations ( isVar ) } contextReceivers . addAll ( convertContextReceivers ( property ) ) } . also { if ( ! isLocal ) { fillDanglingConstraintsTo ( firTypeParameters , typeConstraints , it ) } } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseProperty\n */"} {"signature":"internal fun convertDestructingDeclaration ( destructingDeclaration : LighterASTNode ) : DestructuringDeclaration","body":"{ val annotations = mutableListOf < FirAnnotationCall > ( ) var isVar = false val entries = mutableListOf < DestructuringEntry > ( ) val source = destructingDeclaration . toFirSourceElement ( ) var firExpression : FirExpression ? = null destructingDeclaration . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> annotations += convertAnnotationList ( it ) VAR_KEYWORD -> isVar = true DESTRUCTURING_DECLARATION_ENTRY -> entries += convertDestructingDeclarationEntry ( it ) PROPERTY_DELEGATE -> { } else -> if ( it . isExpression ( ) ) firExpression = expressionConverter . getAsFirExpression ( it , \"\" ) } } return DestructuringDeclaration ( isVar , entries , firExpression ? : buildErrorExpression ( null , ConeSyntaxDiagnostic ( \"\" ) ) , source , annotations ) }","docstring":"/**\n * @see org.jetbrains.kotlin.fir.builder.RawFirBuilder.Visitor.visitDestructuringDeclaration\n */"} {"signature":"private fun convertDestructingDeclarationEntry ( entry : LighterASTNode ) : DestructuringEntry","body":"{ val annotations = mutableListOf < FirAnnotationCall > ( ) var identifier : String ? = null var firType : FirTypeRef ? = null entry . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> annotations += convertAnnotationList ( it ) IDENTIFIER -> identifier = it . asText TYPE_REFERENCE -> firType = convertType ( it ) } } val name = if ( identifier == \"\" ) { SpecialNames . UNDERSCORE_FOR_UNUSED_VAR } else { identifier . nameAsSafeName ( ) } return DestructuringEntry ( source = entry . toFirSourceElement ( ) , returnTypeRef = firType ? : implicitType , name = name , annotations = annotations , ) }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseMultiDeclarationName\n */"} {"signature":"private fun convertGetterOrSetter ( getterOrSetter : LighterASTNode , propertyTypeRef : FirTypeRef , propertyVisibility : Visibility , propertySymbol : FirPropertySymbol , propertyModifiers : Modifier , propertyAnnotations : List < FirAnnotationCall > , ) : FirPropertyAccessor","body":"{ var modifiers : Modifier ? = null val accessorAnnotations = mutableListOf < FirAnnotationCall > ( ) var isGetter = true var returnType : FirTypeRef ? = null val propertyTypeRefToUse = propertyTypeRef . copyWithNewSourceKind ( KtFakeSourceElementKind . ImplicitTypeRef ) val accessorSymbol = FirPropertyAccessorSymbol ( ) var firValueParameters : FirValueParameter = buildDefaultSetterValueParameter { moduleData = baseModuleData containingFunctionSymbol = accessorSymbol origin = FirDeclarationOrigin . Source returnTypeRef = propertyTypeRefToUse symbol = FirValueParameterSymbol ( StandardNames . DEFAULT_VALUE_PARAMETER ) } var block : LighterASTNode ? = null var expression : LighterASTNode ? = null var outerContractDescription : FirContractDescription ? = null getterOrSetter . forEachChildren { if ( it . asText == \"\" ) isGetter = false when ( it . tokenType ) { SET_KEYWORD -> isGetter = false MODIFIER_LIST -> { modifiers = convertModifierList ( it ) accessorAnnotations += convertAnnotationList ( it ) } TYPE_REFERENCE -> returnType = convertType ( it ) VALUE_PARAMETER_LIST -> firValueParameters = convertSetterParameter ( it , accessorSymbol , propertyTypeRefToUse , propertyAnnotations . filterUseSiteTarget ( SETTER_PARAMETER ) ) CONTRACT_EFFECT_LIST -> outerContractDescription = obtainContractDescription ( it ) BLOCK -> block = it else -> if ( it . isExpression ( ) ) expression = it } } val calculatedModifiers = modifiers ? : Modifier ( ) var accessorVisibility = calculatedModifiers . getVisibility ( ) if ( accessorVisibility == Visibilities . Unknown ) { accessorVisibility = propertyVisibility } val status = FirDeclarationStatusImpl ( accessorVisibility , calculatedModifiers . getModality ( isClassOrObject = false ) ) . apply { isInline = propertyModifiers . hasInline ( ) || calculatedModifiers . hasInline ( ) isExternal = propertyModifiers . hasExternal ( ) || calculatedModifiers . hasExternal ( ) } val sourceElement = getterOrSetter . toFirSourceElement ( ) val accessorAdditionalAnnotations = propertyAnnotations . filterUseSiteTarget ( if ( isGetter ) PROPERTY_GETTER else PROPERTY_SETTER ) if ( block == null && expression == null ) { return FirDefaultPropertyAccessor . createGetterOrSetter ( sourceElement , baseModuleData , FirDeclarationOrigin . Source , propertyTypeRefToUse , accessorVisibility , propertySymbol , isGetter ) . also { accessor -> accessor . replaceAnnotations ( accessorAnnotations + accessorAdditionalAnnotations ) accessor . status = status accessor . initContainingClassAttr ( ) } } val target = FirFunctionTarget ( labelName = null , isLambda = false ) return buildPropertyAccessor { source = sourceElement moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = returnType ? : if ( isGetter ) propertyTypeRefToUse else implicitUnitType symbol = accessorSymbol this . isGetter = isGetter this . status = status context . firFunctionTargets += target annotations += accessorAdditionalAnnotations annotations += accessorAnnotations if ( ! isGetter ) { valueParameters += firValueParameters } val allowLegacyContractDescription = outerContractDescription == null val bodyWithContractDescription = withForcedLocalContext { convertFunctionBody ( block , expression , allowLegacyContractDescription ) } this . body = bodyWithContractDescription . first val contractDescription = outerContractDescription ? : bodyWithContractDescription . second contractDescription ? . let { this . contractDescription = it } context . firFunctionTargets . removeLast ( ) this . propertySymbol = propertySymbol } . also { target . bind ( it ) it . initContainingClassAttr ( ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parsePropertyComponent\n */"} {"signature":"private fun LighterASTNode ? . convertBackingField ( propertySymbol : FirPropertySymbol , propertyModifiers : Modifier , propertyReturnType : FirTypeRef , isVar : Boolean , annotationsFromProperty : List < FirAnnotationCall > , property : LighterASTNode , ) : FirBackingField","body":"{ var modifiers : Modifier ? = null val fieldAnnotations = mutableListOf < FirAnnotationCall > ( ) var returnType : FirTypeRef = implicitType var backingFieldInitializer : FirExpression ? = null this ? . forEachChildren { when { it . tokenType == MODIFIER_LIST -> { modifiers = convertModifierList ( it ) fieldAnnotations += convertAnnotationList ( it ) } it . tokenType == TYPE_REFERENCE -> returnType = convertType ( it ) it . isExpression ( ) -> { backingFieldInitializer = expressionConverter . getAsFirExpression ( it , \"\" ) } } } val calculatedModifiers = modifiers ? : Modifier ( ) var componentVisibility = calculatedModifiers . getVisibility ( ) if ( componentVisibility == Visibilities . Unknown ) { componentVisibility = Visibilities . Private } val status = obtainPropertyComponentStatus ( componentVisibility , calculatedModifiers , propertyModifiers ) val sourceElement = this ? . toFirSourceElement ( ) return if ( this != null ) { buildBackingField { source = sourceElement moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = returnType name = StandardNames . BACKING_FIELD symbol = FirBackingFieldSymbol ( CallableId ( name ) ) this . status = status annotations += fieldAnnotations annotations += annotationsFromProperty this . propertySymbol = propertySymbol this . initializer = backingFieldInitializer this . isVar = isVar this . isVal = ! isVar } } else { FirDefaultPropertyBackingField ( moduleData = baseModuleData , origin = FirDeclarationOrigin . Source , source = property . toFirSourceElement ( KtFakeSourceElementKind . DefaultAccessor ) , annotations = annotationsFromProperty . toMutableList ( ) , returnTypeRef = propertyReturnType . copyWithNewSourceKind ( KtFakeSourceElementKind . DefaultAccessor ) , isVar = isVar , propertySymbol = propertySymbol , status = status , ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parsePropertyComponent\n */"} {"signature":"private fun convertSetterParameter ( setterParameter : LighterASTNode , functionSymbol : FirFunctionSymbol < * > , propertyTypeRef : FirTypeRef , additionalAnnotations : List < FirAnnotation > ) : FirValueParameter","body":"{ var modifiers : Modifier ? = null lateinit var firValueParameter : FirValueParameter setterParameter . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> modifiers = convertModifierList ( it ) VALUE_PARAMETER -> firValueParameter = convertValueParameter ( it , functionSymbol , ValueParameterDeclaration . SETTER ) . firValueParameter } } val calculatedModifiers = modifiers ? : Modifier ( ) return buildValueParameter { source = firValueParameter . source containingFunctionSymbol = functionSymbol moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = if ( firValueParameter . returnTypeRef == implicitType ) propertyTypeRef else firValueParameter . returnTypeRef name = firValueParameter . name symbol = FirValueParameterSymbol ( firValueParameter . name ) defaultValue = firValueParameter . defaultValue isCrossinline = calculatedModifiers . hasCrossinline ( ) || firValueParameter . isCrossinline isNoinline = calculatedModifiers . hasNoinline ( ) || firValueParameter . isNoinline isVararg = calculatedModifiers . hasVararg ( ) || firValueParameter . isVararg annotations += firValueParameter . annotations annotations += additionalAnnotations } }","docstring":"/**\n * this is just a VALUE_PARAMETER_LIST\n *\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parsePropertyComponent\n * @see org.jetbrains.kotlin.fir.builder.RawFirBuilder.Visitor.toFirValueParameter\n */"} {"signature":"fun convertFunctionDeclaration ( functionDeclaration : LighterASTNode ) : FirStatement","body":"{ var modifiers : Modifier ? = null val functionAnnotations = mutableListOf < FirAnnotationCall > ( ) var identifier : String ? = null var valueParametersList : LighterASTNode ? = null var isReturnType = false var receiverType : FirTypeRef ? = null var returnType : FirTypeRef ? = null val typeConstraints = mutableListOf < TypeConstraint > ( ) var block : LighterASTNode ? = null var expression : LighterASTNode ? = null var hasEqToken = false var typeParameterList : LighterASTNode ? = null var outerContractDescription : FirContractDescription ? = null functionDeclaration . getChildNodeByType ( IDENTIFIER ) ? . let { identifier = it . asText } val parentNode = functionDeclaration . getParent ( ) val isLocal = ! ( parentNode ? . tokenType == KT_FILE || parentNode ? . tokenType == CLASS_BODY ) val functionSource = functionDeclaration . toFirSourceElement ( ) val isAnonymousFunction = identifier == null && isLocal val functionName = identifier . nameAsSafeName ( ) val functionSymbol : FirFunctionSymbol < * > = if ( isAnonymousFunction ) { FirAnonymousFunctionSymbol ( ) } else { FirNamedFunctionSymbol ( callableIdForName ( functionName ) ) } withContainerSymbol ( functionSymbol , isLocal ) { val target : FirFunctionTarget functionDeclaration . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> { modifiers = convertModifierList ( it ) functionAnnotations += convertAnnotationList ( it ) } TYPE_PARAMETER_LIST -> typeParameterList = it VALUE_PARAMETER_LIST -> valueParametersList = it COLON -> isReturnType = true TYPE_REFERENCE -> if ( isReturnType ) returnType = convertType ( it ) else receiverType = convertType ( it ) TYPE_CONSTRAINT_LIST -> typeConstraints += convertTypeConstraints ( it ) CONTRACT_EFFECT_LIST -> outerContractDescription = obtainContractDescription ( it ) BLOCK -> block = it EQ -> hasEqToken = true else -> if ( it . isExpression ( ) ) expression = it } } val calculatedModifiers = modifiers ? : Modifier ( ) if ( returnType == null ) { returnType = if ( block != null || ! hasEqToken ) implicitUnitType else implicitType } val functionBuilder = if ( isAnonymousFunction ) { FirAnonymousFunctionBuilder ( ) . apply { source = functionSource receiverParameter = receiverType ? . convertToReceiverParameter ( ) symbol = functionSymbol as FirAnonymousFunctionSymbol isLambda = false hasExplicitParameterList = true label = context . getLastLabel ( functionDeclaration ) val labelName = label ? . name ? : context . calleeNamesForLambda . lastOrNull ( ) ? . identifier target = FirFunctionTarget ( labelName = labelName , isLambda = false ) if ( calculatedModifiers . hasSuspend ( ) ) { status = FirResolvedDeclarationStatusImpl . DEFAULT_STATUS_FOR_SUSPEND_FUNCTION_EXPRESSION } } } else { val labelName = context . getLastLabel ( functionDeclaration ) ? . name ? : runIf ( ! functionName . isSpecial ) { functionName . identifier } target = FirFunctionTarget ( labelName , isLambda = false ) FirSimpleFunctionBuilder ( ) . apply { source = functionSource receiverParameter = receiverType ? . convertToReceiverParameter ( ) name = functionName status = FirDeclarationStatusImpl ( if ( isLocal ) Visibilities . Local else calculatedModifiers . getVisibility ( ) , calculatedModifiers . getModality ( isClassOrObject = false ) ) . apply { isExpect = calculatedModifiers . hasExpect ( ) || context . containerIsExpect isActual = calculatedModifiers . hasActual ( ) isOverride = calculatedModifiers . hasOverride ( ) isOperator = calculatedModifiers . hasOperator ( ) isInfix = calculatedModifiers . hasInfix ( ) isInline = calculatedModifiers . hasInline ( ) isTailRec = calculatedModifiers . hasTailrec ( ) isExternal = calculatedModifiers . hasExternal ( ) isSuspend = calculatedModifiers . hasSuspend ( ) } symbol = functionSymbol as FirNamedFunctionSymbol dispatchReceiverType = runIf ( ! isLocal ) { currentDispatchReceiverType ( ) } contextReceivers . addAll ( convertContextReceivers ( functionDeclaration ) ) } } val firTypeParameters = mutableListOf < FirTypeParameter > ( ) typeParameterList ? . let { firTypeParameters += convertTypeParameters ( it , typeConstraints , functionSymbol ) } val function = functionBuilder . apply { moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = returnType ! ! context . firFunctionTargets += target annotations += functionAnnotations val actualTypeParameters = if ( this is FirSimpleFunctionBuilder ) { typeParameters += firTypeParameters typeParameters } else { listOf ( ) } withCapturedTypeParameters ( true , functionSource , actualTypeParameters ) { valueParametersList ? . let { list -> valueParameters += convertValueParameters ( list , functionSymbol , if ( isAnonymousFunction ) ValueParameterDeclaration . LAMBDA else ValueParameterDeclaration . FUNCTION ) . map { it . firValueParameter } } val allowLegacyContractDescription = outerContractDescription == null val bodyWithContractDescription = withForcedLocalContext { convertFunctionBody ( block , expression , allowLegacyContractDescription ) } this . body = bodyWithContractDescription . first val contractDescription = outerContractDescription ? : bodyWithContractDescription . second contractDescription ? . let { if ( this is FirSimpleFunctionBuilder ) { this . contractDescription = it } else if ( this is FirAnonymousFunctionBuilder ) { this . contractDescription = it } } } context . firFunctionTargets . removeLast ( ) } . build ( ) . also { target . bind ( it ) if ( it is FirSimpleFunction ) { fillDanglingConstraintsTo ( firTypeParameters , typeConstraints , it ) } } return if ( function is FirAnonymousFunction ) { buildAnonymousFunctionExpression { source = functionSource anonymousFunction = function } } else { function } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseFunction\n */"} {"signature":"private fun convertFunctionBody ( blockNode : LighterASTNode ? , expression : LighterASTNode ? , allowLegacyContractDescription : Boolean ) : Pair < FirBlock ? , FirContractDescription ? >","body":"{ return when { blockNode != null -> { val block = convertBlock ( blockNode ) val contractDescription = runIf ( allowLegacyContractDescription ) { val blockSource = block . source val diagnostic = when { blockSource == null || ! isCallTheFirstStatement ( blockSource ) -> ConeContractShouldBeFirstStatement else -> null } processLegacyContractDescription ( block , diagnostic ) } block to contractDescription } expression != null -> FirSingleExpressionBlock ( expressionConverter . getAsFirExpression < FirExpression > ( expression , \"\" ) . toReturn ( ) ) to null else -> null to null } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseFunctionBody\n * @see org.jetbrains.kotlin.fir.builder.RawFirBuilder.Visitor.buildFirBody\n */"} {"signature":"fun convertBlock ( block : LighterASTNode ? ) : FirBlock","body":"{ if ( block == null ) return buildEmptyExpressionBlock ( ) if ( block . tokenType != BLOCK ) { return FirSingleExpressionBlock ( expressionConverter . getAsFirStatement ( block ) ) } return convertBlockExpression ( block ) }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseBlock\n */"} {"signature":"private fun convertConstructorInvocation ( constructorInvocation : LighterASTNode ) : Pair < FirTypeRef , List < FirExpression > >","body":"{ var firTypeRef : FirTypeRef = implicitType val firValueArguments = mutableListOf < FirExpression > ( ) constructorInvocation . forEachChildren { when ( it . tokenType ) { CONSTRUCTOR_CALLEE -> firTypeRef = convertType ( it ) VALUE_ARGUMENT_LIST -> firValueArguments += expressionConverter . convertValueArguments ( it ) } } return Pair ( firTypeRef , firValueArguments ) }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseDelegationSpecifier\n *\n * constructorInvocation\n * : userType valueArguments\n * ;\n */"} {"signature":"private fun convertExplicitDelegation ( explicitDelegation : LighterASTNode , delegateFieldsMap : MutableMap < Int , FirFieldSymbol > , index : Int ) : FirTypeRef","body":"{ lateinit var firTypeRef : FirTypeRef var firExpression : FirExpression ? = null explicitDelegation . forEachChildren { when ( it . tokenType ) { TYPE_REFERENCE -> firTypeRef = convertType ( it ) else -> if ( it . isExpression ( ) ) firExpression = expressionConverter . getAsFirExpression ( it , \"\" ) } } val calculatedFirExpression = firExpression ? : buildErrorExpression ( explicitDelegation . toFirSourceElement ( ) , ConeSyntaxDiagnostic ( \"\" ) ) delegateFieldsMap . put ( index , buildField { source = explicitDelegation . toFirSourceElement ( ) . fakeElement ( KtFakeSourceElementKind . ClassDelegationField ) moduleData = baseModuleData origin = FirDeclarationOrigin . Synthetic . DelegateField name = NameUtils . delegateFieldName ( delegateFieldsMap . size ) returnTypeRef = firTypeRef symbol = FirFieldSymbol ( CallableId ( context . currentClassId , name ) ) isVar = false status = FirDeclarationStatusImpl ( Visibilities . Private , Modality . FINAL ) initializer = calculatedFirExpression dispatchReceiverType = currentDispatchReceiverType ( ) } . symbol ) return firTypeRef }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseDelegationSpecifier\n *\n * explicitDelegation\n * : userType \"by\" element\n * ;\n */"} {"signature":"private fun convertTypeParameters ( typeParameterList : LighterASTNode , typeConstraints : List < TypeConstraint > , containingDeclarationSymbol : FirBasedSymbol < * > ) : List < FirTypeParameter >","body":"{ return typeParameterList . forEachChildrenReturnList { node , container -> when ( node . tokenType ) { TYPE_PARAMETER -> container += convertTypeParameter ( node , typeConstraints , containingDeclarationSymbol ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeParameterList\n */"} {"signature":"private fun convertTypeConstraints ( typeConstraints : LighterASTNode ) : List < TypeConstraint >","body":"{ return typeConstraints . forEachChildrenReturnList { node , container -> when ( node . tokenType ) { TYPE_CONSTRAINT -> container += convertTypeConstraint ( node ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeConstraintList\n */"} {"signature":"private fun convertTypeConstraint ( typeConstraint : LighterASTNode ) : TypeConstraint","body":"{ var identifier : String ? = null var firType : FirTypeRef ? = null var referenceExpression : LighterASTNode ? = null val annotations = mutableListOf < FirAnnotation > ( ) typeConstraint . forEachChildren { when ( it . tokenType ) { ANNOTATION_ENTRY -> { annotations += convertAnnotationEntry ( it , diagnostic = ConeSimpleDiagnostic ( \"\" , DiagnosticKind . AnnotationNotAllowed , ) ) } REFERENCE_EXPRESSION -> { identifier = it . asText referenceExpression = it } TYPE_REFERENCE -> firType = convertType ( it ) } } return TypeConstraint ( annotations , identifier , firType ? : buildErrorTypeRef { } , ( referenceExpression ? : typeConstraint ) . toFirSourceElement ( ) ) }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeConstraint\n */"} {"signature":"private fun convertTypeParameter ( typeParameter : LighterASTNode , typeConstraints : List < TypeConstraint > , containingSymbol : FirBasedSymbol < * > ) : FirTypeParameter","body":"{ var typeParameterModifiers : TypeParameterModifier ? = null var identifier : String ? = null var firType : FirTypeRef ? = null typeParameter . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> typeParameterModifiers = convertTypeParameterModifiers ( it ) IDENTIFIER -> identifier = it . asText TYPE_REFERENCE -> firType = convertType ( it ) } } val calculatedTypeParameterModifiers = typeParameterModifiers ? : TypeParameterModifier ( ) return buildTypeParameter { source = typeParameter . toFirSourceElement ( ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source name = identifier . nameAsSafeName ( ) symbol = FirTypeParameterSymbol ( ) containingDeclarationSymbol = containingSymbol variance = calculatedTypeParameterModifiers . getVariance ( ) isReified = calculatedTypeParameterModifiers . hasReified ( ) annotations += calculatedTypeParameterModifiers . annotations firType ? . let { bounds += it } for ( typeConstraint in typeConstraints ) { if ( typeConstraint . identifier == identifier ) { bounds += typeConstraint . firTypeRef annotations += typeConstraint . annotations } } addDefaultBoundIfNecessary ( ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeParameter\n */"} {"signature":"fun convertType ( type : LighterASTNode ) : FirTypeRef","body":"{ val typeRefSource = type . toFirSourceElement ( ) val allTypeModifiers = mutableListOf < Modifier > ( ) var firType : FirTypeRef ? = null type . forEachChildren { when ( it . tokenType ) { TYPE_REFERENCE -> firType = convertType ( it ) MODIFIER_LIST -> allTypeModifiers += convertTypeModifierList ( it ) USER_TYPE -> firType = convertUserType ( typeRefSource , it ) NULLABLE_TYPE -> firType = convertNullableType ( typeRefSource , it , allTypeModifiers ) FUNCTION_TYPE -> firType = convertFunctionType ( typeRefSource , it , isSuspend = allTypeModifiers . hasSuspend ( ) ) DYNAMIC_TYPE -> firType = buildDynamicTypeRef { source = typeRefSource isMarkedNullable = false } INTERSECTION_TYPE -> firType = convertIntersectionType ( typeRefSource , it , false ) CONTEXT_RECEIVER_LIST , TokenType . ERROR_ELEMENT -> firType = buildErrorTypeRef { source = typeRefSource diagnostic = ConeSyntaxDiagnostic ( \"\" ) } } } val calculatedFirType = firType ? : buildErrorTypeRef { source = typeRefSource diagnostic = ConeSyntaxDiagnostic ( \"\" ) } for ( modifierList in allTypeModifiers ) { calculatedFirType . replaceAnnotations ( calculatedFirType . annotations . smartPlus ( modifierList . annotations ) ) } return calculatedFirType }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeRef\n */"} {"signature":"private fun convertReceiverType ( receiverType : LighterASTNode ) : FirTypeRef","body":"{ receiverType . forEachChildren { when ( it . tokenType ) { TYPE_REFERENCE -> return convertType ( it ) } } throw Exception ( ) }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeRefContents\n */"} {"signature":"private fun convertNullableType ( typeRefSource : KtSourceElement , nullableType : LighterASTNode , allTypeModifiers : MutableList < Modifier > , isNullable : Boolean = true ) : FirTypeRef","body":"{ lateinit var firType : FirTypeRef nullableType . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> allTypeModifiers += convertTypeModifierList ( it ) USER_TYPE -> firType = convertUserType ( typeRefSource , it , isNullable ) FUNCTION_TYPE -> firType = convertFunctionType ( typeRefSource , it , isNullable , isSuspend = allTypeModifiers . hasSuspend ( ) ) NULLABLE_TYPE -> firType = convertNullableType ( typeRefSource , it , allTypeModifiers ) DYNAMIC_TYPE -> firType = buildDynamicTypeRef { source = typeRefSource isMarkedNullable = true } INTERSECTION_TYPE -> firType = convertIntersectionType ( typeRefSource , it , isNullable ) } } return firType }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseNullableTypeSuffix\n */"} {"signature":"private fun convertUserType ( typeRefSource : KtSourceElement , userType : LighterASTNode , isNullable : Boolean = false ) : FirTypeRef","body":"{ var simpleFirUserType : FirUserTypeRef ? = null var identifier : String ? = null var identifierSource : KtSourceElement ? = null val firTypeArguments = mutableListOf < FirTypeProjection > ( ) var typeArgumentsSource : KtSourceElement ? = null userType . forEachChildren { when ( it . tokenType ) { USER_TYPE -> simpleFirUserType = convertUserType ( typeRefSource , it ) as? FirUserTypeRef REFERENCE_EXPRESSION -> { identifierSource = it . toFirSourceElement ( ) identifier = it . asText } TYPE_ARGUMENT_LIST -> { typeArgumentsSource = it . toFirSourceElement ( ) firTypeArguments += convertTypeArguments ( it , allowedUnderscoredTypeArgument = false ) } } } if ( identifier == null ) { return buildErrorTypeRef { source = typeRefSource diagnostic = ConeSyntaxDiagnostic ( \"\" ) simpleFirUserType ? . let { qualifierPart -> if ( qualifierPart . qualifier . isNotEmpty ( ) ) { partiallyResolvedTypeRef = buildUserTypeRef { source = qualifierPart . qualifier . last ( ) . source isMarkedNullable = false this . qualifier . addAll ( qualifierPart . qualifier ) } } } } } val qualifierPart = FirQualifierPartImpl ( identifierSource ! ! , identifier . nameAsSafeName ( ) , FirTypeArgumentListImpl ( typeArgumentsSource ? : typeRefSource ) . apply { typeArguments += firTypeArguments } ) return buildUserTypeRef { source = typeRefSource isMarkedNullable = isNullable qualifier . add ( qualifierPart ) simpleFirUserType ? . qualifier ? . let { this . qualifier . addAll ( , it ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseUserType\n */"} {"signature":"fun convertTypeArguments ( typeArguments : LighterASTNode , allowedUnderscoredTypeArgument : Boolean ) : List < FirTypeProjection >","body":"{ return typeArguments . forEachChildrenReturnList { node , container -> when ( node . tokenType ) { TYPE_PROJECTION -> container += convertTypeProjection ( node , allowedUnderscoredTypeArgument ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseTypeArgumentList\n */"} {"signature":"private fun convertTypeProjection ( typeProjection : LighterASTNode , allowedUnderscoredTypeArgument : Boolean ) : FirTypeProjection","body":"{ var modifiers : TypeProjectionModifier ? = null lateinit var firType : FirTypeRef var isStarProjection = false typeProjection . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> modifiers = convertTypeArgumentModifierList ( it ) TYPE_REFERENCE -> firType = convertType ( it ) MUL -> isStarProjection = true } } return when { isStarProjection -> buildStarProjection { source = typeProjection . toFirSourceElement ( ) } allowedUnderscoredTypeArgument && ( firType as? FirUserTypeRef ) ? . isUnderscored == true -> buildPlaceholderProjection { source = typeProjection . toFirSourceElement ( ) } else -> buildTypeProjectionWithVariance { source = typeProjection . toFirSourceElement ( ) typeRef = firType variance = ( modifiers ? : TypeProjectionModifier ( ) ) . getVariance ( ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.tryParseTypeArgumentList\n */"} {"signature":"private fun convertFunctionType ( typeRefSource : KtSourceElement , functionType : LighterASTNode , isNullable : Boolean = false , isSuspend : Boolean = false ) : FirTypeRef","body":"{ var receiverTypeReference : FirTypeRef ? = null lateinit var returnTypeReference : FirTypeRef val parameters = mutableListOf < FirFunctionTypeParameter > ( ) functionType . forEachChildren { when ( it . tokenType ) { FUNCTION_TYPE_RECEIVER -> receiverTypeReference = convertReceiverType ( it ) VALUE_PARAMETER_LIST -> parameters += convertFunctionTypeParameters ( it ) TYPE_REFERENCE -> returnTypeReference = convertType ( it ) } } return buildFunctionTypeRef { source = typeRefSource isMarkedNullable = isNullable receiverTypeRef = receiverTypeReference returnTypeRef = returnTypeReference this . parameters += parameters this . isSuspend = isSuspend this . contextReceiverTypeRefs . addAll ( functionType . getChildNodeByType ( CONTEXT_RECEIVER_LIST ) ? . getChildNodesByType ( CONTEXT_RECEIVER ) ? . mapNotNull { it . getChildNodeByType ( TYPE_REFERENCE ) ? . let ( :: convertType ) } . orEmpty ( ) ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseFunctionType\n */"} {"signature":"fun convertValueParameters ( valueParameters : LighterASTNode , functionSymbol : FirFunctionSymbol < * > , valueParameterDeclaration : ValueParameterDeclaration , additionalAnnotations : List < FirAnnotation > = emptyList ( ) ) : List < ValueParameter >","body":"{ return valueParameters . forEachChildrenReturnList { node , container -> when ( node . tokenType ) { VALUE_PARAMETER -> container += convertValueParameter ( node , functionSymbol , valueParameterDeclaration , additionalAnnotations ) } } }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseValueParameterList\n */"} {"signature":"fun convertValueParameter ( valueParameter : LighterASTNode , functionSymbol : FirFunctionSymbol < * > ? , valueParameterDeclaration : ValueParameterDeclaration , additionalAnnotations : List < FirAnnotation > = emptyList ( ) ) : ValueParameter","body":"{ var modifiers : Modifier ? = null val valueAnnotations = mutableListOf < FirAnnotationCall > ( ) var isVal = false var isVar = false var identifier : String ? = null var firType : FirTypeRef ? = null var firExpression : FirExpression ? = null var destructuringDeclaration : DestructuringDeclaration ? = null valueParameter . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> modifiers = convertModifierList ( it ) VAL_KEYWORD -> isVal = true VAR_KEYWORD -> isVar = true IDENTIFIER -> identifier = it . asText TYPE_REFERENCE -> { } DESTRUCTURING_DECLARATION -> destructuringDeclaration = convertDestructingDeclaration ( it ) else -> if ( it . isExpression ( ) ) firExpression = expressionConverter . getAsFirExpression ( it , \"\" ) } } val name = convertValueParameterName ( identifier . nameAsSafeName ( ) , valueParameterDeclaration ) { identifier } val valueParameterSymbol = FirValueParameterSymbol ( name ) withContainerSymbol ( valueParameterSymbol , isLocal = valueParameterDeclaration != ValueParameterDeclaration . FUNCTION ) { valueParameter . forEachChildren { when ( it . tokenType ) { MODIFIER_LIST -> valueAnnotations += convertAnnotationList ( it ) TYPE_REFERENCE -> firType = convertType ( it ) } } } val valueParameterSource = valueParameter . toFirSourceElement ( ) return ValueParameter ( valueParameterSymbol = valueParameterSymbol , isVal = isVal , isVar = isVar , modifiers = modifiers ? : Modifier ( ) , valueParameterAnnotations = valueAnnotations , returnTypeRef = firType ? : when { valueParameterDeclaration . shouldExplicitParameterTypeBePresent -> createNoTypeForParameterTypeRef ( valueParameterSource ) else -> implicitType } , source = valueParameterSource , moduleData = baseModuleData , isFromPrimaryConstructor = valueParameterDeclaration == ValueParameterDeclaration . PRIMARY_CONSTRUCTOR , additionalAnnotations = additionalAnnotations , name = name , defaultValue = firExpression , containingFunctionSymbol = functionSymbol , destructuringDeclaration = destructuringDeclaration ) }","docstring":"/**\n * @see org.jetbrains.kotlin.parsing.KotlinParsing.parseValueParameter\n */"} {"signature":"public fun Sink . writeString ( string : String , charset : Charset , startIndex : Int = , endIndex : Int = string . length )","body":"{ checkBounds ( string . length , startIndex , endIndex ) if ( charset == Charsets . UTF_8 ) return writeString ( string , startIndex , endIndex ) val data = string . substring ( startIndex , endIndex ) . toByteArray ( charset ) write ( data , , data . size ) }","docstring":"/**\n * Encodes substring of [string] starting at [startIndex] and ending at [endIndex] using [charset]\n * and writes into this sink.\n *\n * @param string the string to encode into this sink.\n * @param charset the [Charset] to use for encoding.\n * @param startIndex the index of the first character to encode, inclusive, 0 by default.\n * @param endIndex the index of the last character to encode, exclusive, `string.length` by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [string] indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.readWriteStrings\n */"} {"signature":"@ OptIn ( DelicateIoApi :: class ) public fun Sink . asOutputStream ( ) : OutputStream","body":"{ val isClosed : ( ) -> Boolean = when ( this ) { is RealSink -> this :: closed is Buffer -> { { false } } } return object : OutputStream ( ) { override fun write ( byte : Int ) { if ( isClosed ( ) ) throw IOException ( \"\" ) writeToInternalBuffer { it . writeByte ( byte . toByte ( ) ) } } override fun write ( data : ByteArray , offset : Int , byteCount : Int ) { if ( isClosed ( ) ) throw IOException ( \"\" ) writeToInternalBuffer { it . write ( data , offset , offset + byteCount ) } } override fun flush ( ) { if ( ! isClosed ( ) ) { this@asOutputStream . flush ( ) } } override fun close ( ) = this@asOutputStream . close ( ) override fun toString ( ) = \"\" } }","docstring":"/**\n * Returns an output stream that writes to this sink. Closing the stream will also close this sink.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.asStream\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Sink . write ( source : ByteBuffer ) : Int","body":"{ val sizeBefore = buffer . size buffer . transferFrom ( source ) val bytesRead = buffer . size - sizeBefore hintEmit ( ) return bytesRead . toInt ( ) }","docstring":"/**\n * Writes data from the [source] into this sink and returns the number of bytes written.\n *\n * @param source the source to read from.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.readWriteByteBuffer\n */"} {"signature":"public fun Sink . asByteChannel ( ) : WritableByteChannel","body":"{ val isClosed : ( ) -> Boolean = when ( this ) { is RealSink -> this :: closed is Buffer -> { { false } } } return object : WritableByteChannel { override fun close ( ) { this@asByteChannel . close ( ) } override fun isOpen ( ) : Boolean = ! isClosed ( ) override fun write ( source : ByteBuffer ) : Int { check ( ! isClosed ( ) ) { \"\" } return this@asByteChannel . write ( source ) } } }","docstring":"/**\n * Returns [WritableByteChannel] backed by this sink. Closing the channel will also close the sink.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun UIntProgression . first ( ) : UInt","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this . first }","docstring":"/**\n * Returns the first element.\n * \n * @throws NoSuchElementException if the progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun ULongProgression . first ( ) : ULong","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this . first }","docstring":"/**\n * Returns the first element.\n * \n * @throws NoSuchElementException if the progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun UIntProgression . firstOrNull ( ) : UInt ?","body":"{ return if ( isEmpty ( ) ) null else this . first }","docstring":"/**\n * Returns the first element, or `null` if the progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun ULongProgression . firstOrNull ( ) : ULong ?","body":"{ return if ( isEmpty ( ) ) null else this . first }","docstring":"/**\n * Returns the first element, or `null` if the progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun UIntProgression . last ( ) : UInt","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this . last }","docstring":"/**\n * Returns the last element.\n * \n * @throws NoSuchElementException if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun ULongProgression . last ( ) : ULong","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this . last }","docstring":"/**\n * Returns the last element.\n * \n * @throws NoSuchElementException if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun UIntProgression . lastOrNull ( ) : UInt ?","body":"{ return if ( isEmpty ( ) ) null else this . last }","docstring":"/**\n * Returns the last element, or `null` if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun ULongProgression . lastOrNull ( ) : ULong ?","body":"{ return if ( isEmpty ( ) ) null else this . last }","docstring":"/**\n * Returns the last element, or `null` if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun UIntRange . random ( ) : UInt","body":"{ return random ( Random ) }","docstring":"/**\n * Returns a random element from this range.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun ULongRange . random ( ) : ULong","body":"{ return random ( Random ) }","docstring":"/**\n * Returns a random element from this range.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UIntRange . random ( random : Random ) : UInt","body":"{ try { return random . nextUInt ( this ) } catch ( e : IllegalArgumentException ) { throw NoSuchElementException ( e . message ) } }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun ULongRange . random ( random : Random ) : ULong","body":"{ try { return random . nextULong ( this ) } catch ( e : IllegalArgumentException ) { throw NoSuchElementException ( e . message ) } }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class , ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun UIntRange . randomOrNull ( ) : UInt ?","body":"{ return randomOrNull ( Random ) }","docstring":"/**\n * Returns a random element from this range, or `null` if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class , ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun ULongRange . randomOrNull ( ) : ULong ?","body":"{ return randomOrNull ( Random ) }","docstring":"/**\n * Returns a random element from this range, or `null` if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class , ExperimentalUnsignedTypes :: class ) public fun UIntRange . randomOrNull ( random : Random ) : UInt ?","body":"{ if ( isEmpty ( ) ) return null return random . nextUInt ( this ) }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness, or `null` if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class , ExperimentalUnsignedTypes :: class ) public fun ULongRange . randomOrNull ( random : Random ) : ULong ?","body":"{ if ( isEmpty ( ) ) return null return random . nextULong ( this ) }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness, or `null` if this range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline operator fun UIntRange . contains ( element : UInt ? ) : Boolean","body":"{ return element != null && contains ( element ) }","docstring":"/**\n * Returns `true` if this range contains the specified [element].\n * \n * Always returns `false` if the [element] is `null`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline operator fun ULongRange . contains ( element : ULong ? ) : Boolean","body":"{ return element != null && contains ( element ) }","docstring":"/**\n * Returns `true` if this range contains the specified [element].\n * \n * Always returns `false` if the [element] is `null`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public operator fun UIntRange . contains ( value : UByte ) : Boolean","body":"{ return contains ( value . toUInt ( ) ) }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public operator fun ULongRange . contains ( value : UByte ) : Boolean","body":"{ return contains ( value . toULong ( ) ) }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public operator fun ULongRange . contains ( value : UInt ) : Boolean","body":"{ return contains ( value . toULong ( ) ) }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public operator fun UIntRange . contains ( value : ULong ) : Boolean","body":"{ return ( value shr UInt . SIZE_BITS ) == && contains ( value . toUInt ( ) ) }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public operator fun UIntRange . contains ( value : UShort ) : Boolean","body":"{ return contains ( value . toUInt ( ) ) }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public operator fun ULongRange . contains ( value : UShort ) : Boolean","body":"{ return contains ( value . toULong ( ) ) }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun UByte . downTo ( to : UByte ) : UIntProgression","body":"{ return UIntProgression . fromClosedRange ( this . toUInt ( ) , to . toUInt ( ) , - ) }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun UInt . downTo ( to : UInt ) : UIntProgression","body":"{ return UIntProgression . fromClosedRange ( this , to , - ) }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun ULong . downTo ( to : ULong ) : ULongProgression","body":"{ return ULongProgression . fromClosedRange ( this , to , - ) }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun UShort . downTo ( to : UShort ) : UIntProgression","body":"{ return UIntProgression . fromClosedRange ( this . toUInt ( ) , to . toUInt ( ) , - ) }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UIntProgression . reversed ( ) : UIntProgression","body":"{ return UIntProgression . fromClosedRange ( last , first , - step ) }","docstring":"/**\n * Returns a progression that goes over the same range in the opposite direction with the same step.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun ULongProgression . reversed ( ) : ULongProgression","body":"{ return ULongProgression . fromClosedRange ( last , first , - step ) }","docstring":"/**\n * Returns a progression that goes over the same range in the opposite direction with the same step.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun UIntProgression . step ( step : Int ) : UIntProgression","body":"{ checkStepIsPositive ( step > , step ) return UIntProgression . fromClosedRange ( first , last , if ( this . step > ) step else - step ) }","docstring":"/**\n * Returns a progression that goes over the same range with the given step.\n * \n * @sample samples.ranges.Ranges.stepUInt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun ULongProgression . step ( step : Long ) : ULongProgression","body":"{ checkStepIsPositive ( step > , step ) return ULongProgression . fromClosedRange ( first , last , if ( this . step > ) step else - step ) }","docstring":"/**\n * Returns a progression that goes over the same range with the given step.\n * \n * @sample samples.ranges.Ranges.stepULong\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun UByte . until ( to : UByte ) : UIntRange","body":"{ if ( to <= UByte . MIN_VALUE ) return UIntRange . EMPTY return this . toUInt ( ) .. ( to - ) . toUInt ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun UInt . until ( to : UInt ) : UIntRange","body":"{ if ( to <= UInt . MIN_VALUE ) return UIntRange . EMPTY return this .. ( to - ) . toUInt ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun ULong . until ( to : ULong ) : ULongRange","body":"{ if ( to <= ULong . MIN_VALUE ) return ULongRange . EMPTY return this .. ( to - ) . toULong ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public infix fun UShort . until ( to : UShort ) : UIntRange","body":"{ if ( to <= UShort . MIN_VALUE ) return UIntRange . EMPTY return this . toUInt ( ) .. ( to - ) . toUInt ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UInt . coerceAtLeast ( minimumValue : UInt ) : UInt","body":"{ return if ( this < minimumValue ) minimumValue else this }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeastUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun ULong . coerceAtLeast ( minimumValue : ULong ) : ULong","body":"{ return if ( this < minimumValue ) minimumValue else this }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeastUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UByte . coerceAtLeast ( minimumValue : UByte ) : UByte","body":"{ return if ( this < minimumValue ) minimumValue else this }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeastUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UShort . coerceAtLeast ( minimumValue : UShort ) : UShort","body":"{ return if ( this < minimumValue ) minimumValue else this }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeastUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UInt . coerceAtMost ( maximumValue : UInt ) : UInt","body":"{ return if ( this > maximumValue ) maximumValue else this }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMostUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun ULong . coerceAtMost ( maximumValue : ULong ) : ULong","body":"{ return if ( this > maximumValue ) maximumValue else this }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMostUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UByte . coerceAtMost ( maximumValue : UByte ) : UByte","body":"{ return if ( this > maximumValue ) maximumValue else this }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMostUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UShort . coerceAtMost ( maximumValue : UShort ) : UShort","body":"{ return if ( this > maximumValue ) maximumValue else this }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMostUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UInt . coerceIn ( minimumValue : UInt , maximumValue : UInt ) : UInt","body":"{ if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" ) if ( this < minimumValue ) return minimumValue if ( this > maximumValue ) return maximumValue return this }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceInUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun ULong . coerceIn ( minimumValue : ULong , maximumValue : ULong ) : ULong","body":"{ if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" ) if ( this < minimumValue ) return minimumValue if ( this > maximumValue ) return maximumValue return this }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceInUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UByte . coerceIn ( minimumValue : UByte , maximumValue : UByte ) : UByte","body":"{ if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" ) if ( this < minimumValue ) return minimumValue if ( this > maximumValue ) return maximumValue return this }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceInUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UShort . coerceIn ( minimumValue : UShort , maximumValue : UShort ) : UShort","body":"{ if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" ) if ( this < minimumValue ) return minimumValue if ( this > maximumValue ) return maximumValue return this }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceInUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UInt . coerceIn ( range : ClosedRange < UInt > ) : UInt","body":"{ if ( range is ClosedFloatingPointRange ) { return this . coerceIn < UInt > ( range ) } if ( range . isEmpty ( ) ) throw IllegalArgumentException ( \"\" ) return when { this < range . start -> range . start this > range . endInclusive -> range . endInclusive else -> this } }","docstring":"/**\n * Ensures that this value lies in the specified [range].\n * \n * @return this value if it's in the [range], or `range.start` if this value is less than `range.start`, or `range.endInclusive` if this value is greater than `range.endInclusive`.\n * \n * @sample samples.comparisons.ComparableOps.coerceInUnsigned\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun ULong . coerceIn ( range : ClosedRange < ULong > ) : ULong","body":"{ if ( range is ClosedFloatingPointRange ) { return this . coerceIn < ULong > ( range ) } if ( range . isEmpty ( ) ) throw IllegalArgumentException ( \"\" ) return when { this < range . start -> range . start this > range . endInclusive -> range . endInclusive else -> this } }","docstring":"/**\n * Ensures that this value lies in the specified [range].\n * \n * @return this value if it's in the [range], or `range.start` if this value is less than `range.start`, or `range.endInclusive` if this value is greater than `range.endInclusive`.\n * \n * @sample samples.comparisons.ComparableOps.coerceInUnsigned\n */"} {"signature":"private fun createKSerializerParamsForEachGenericArgument ( parentFunction : FunctionDescriptor , serializableClass : ClassDescriptor , actualArgsOffset : Int = ) : Pair < List < TypeParameterDescriptor > , List < ValueParameterDescriptor > >","body":"{ val serializerClass = serializableClass . getClassFromSerializationPackage ( SerialEntityNames . KSERIALIZER_CLASS ) val args = mutableListOf < ValueParameterDescriptor > ( ) val typeArgs = mutableListOf < TypeParameterDescriptor > ( ) var i = serializableClass . declaredTypeParameters . forEach { _ -> val targ = TypeParameterDescriptorImpl . createWithDefaultBound ( parentFunction , Annotations . EMPTY , false , Variance . INVARIANT , Name . identifier ( \"\" ) , i , LockBasedStorageManager . NO_LOCKS ) val pType = KotlinTypeFactory . simpleNotNullType ( TypeAttributes . Empty , serializerClass , listOf ( TypeProjectionImpl ( targ . defaultType ) ) ) args . add ( ValueParameterDescriptorImpl ( containingDeclaration = parentFunction , original = null , index = actualArgsOffset + i , annotations = Annotations . EMPTY , name = Name . identifier ( \"\" ) , outType = pType , declaresDefaultValue = false , isCrossinline = false , isNoinline = false , varargElementType = null , source = parentFunction . source ) ) typeArgs . add ( targ ) i ++ } return typeArgs to args }","docstring":"/**\n * Creates free type parameters T0, T1, ... for given serializable class\n * Returns [T0, T1, ...] and [KSerializer, KSerializer,...]\n */"} {"signature":"private fun FunctionDescriptor . incDecCheckForExpectClass ( receiver : ReceiverParameterDescriptor ) : Boolean","body":"{ val receiverValue = receiver . value if ( receiverValue !is ImplicitClassReceiver ) return false val classDescriptor = receiverValue . classDescriptor if ( ! classDescriptor . isExpect ) return false val potentialActualAliasId = classDescriptor . classId ? : return false val actualReceiverTypeAlias = classDescriptor . module . findClassifierAcrossModuleDependencies ( potentialActualAliasId ) as? TypeAliasDescriptor ? : return false returnType ? . let { returnType -> return returnType . isSubtypeOf ( actualReceiverTypeAlias . expandedType ) } return false }","docstring":"/**\n * See KT-49714\n * Workaround for mismatching types of an implicit dispatch receiver inside an `expect` class\n * and a type resolved from a reference to this class. During compilation all actual type aliases are known,\n * so the explicit return type is `actual`. But the implicit receiver type inside the class remains `expect`\n * because it's received from the default type of the containing class, which is not affected by the `actual` type alias.\n *\n * `actual` classes are not affected, since non-parameterized type constructors with equal fqNames are considered\n * equal, so subtyping check passes in this case despite mismatching expect/actual in the corresponding declaration descriptors.\n */"} {"signature":"fun FirTypeScope . retrieveDirectOverriddenOf ( memberSymbol : FirCallableSymbol < * > ) : List < FirCallableSymbol < * > >","body":"{ return when ( memberSymbol ) { is FirNamedFunctionSymbol -> { processFunctionsByName ( memberSymbol . name ) { } getDirectOverriddenFunctions ( memberSymbol ) } is FirPropertySymbol -> { processPropertiesByName ( memberSymbol . name ) { } getDirectOverriddenProperties ( memberSymbol ) } else -> throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Provides a list of callables which are directly overridden by the given symbol\n *\n * Please be very accurate with using this function.\n * It can be convenient if the only thing you need is to get directly overridden symbols and nothing more,\n * but even in this case please check that you are using a correct scope.\n * E.g. if you want to get overridden symbols of some Foo.bar,\n * the scope in use must be built from the Foo-based type or Foo class itself.\n *\n * If you need to traverse some complex overridden hierarchy,\n * please consider using processDirectOverriddenFunctions(Properties)WithBaseScope instead.\n *\n * @param memberSymbol A callable symbol to find its directly overridden symbols\n * @receiver Must be an owner scope of the callable symbol to work properly\n * @return A list of callable symbols which are directly overridden by the given symbol\n */"} {"signature":"internal fun Configuration . declarable ( visible : Boolean = false , )","body":"{ isCanBeResolved = false isCanBeConsumed = false @ Suppress ( \"\" ) isCanBeDeclared = true isVisible = visible }","docstring":"/**\n * Mark this [Configuration] as one that should be used to declare dependencies in\n * [org.gradle.api.Project.dependencies] block.\n *\n * Declarable Configurations should be extended by [resolvable] and [consumable] Configurations.\n * They must not have attributes.\n *\n * ```\n * isCanBeResolved = false\n * isCanBeConsumed = false\n * isCanBeDeclared = true\n * ```\n */"} {"signature":"internal fun Configuration . consumable ( visible : Boolean = false , )","body":"{ isCanBeResolved = false isCanBeConsumed = true @ Suppress ( \"\" ) isCanBeDeclared = false isVisible = visible }","docstring":"/**\n * Mark this [Configuration] as one that will be consumed by other subprojects.\n *\n * Consumable Configurations must extend a [declarable] Configuration.\n * They should have attributes.\n *\n * ```\n * isCanBeResolved = false\n * isCanBeConsumed = true\n * isCanBeDeclared = false\n * ```\n */"} {"signature":"internal fun Configuration . resolvable ( visible : Boolean = false , )","body":"{ isCanBeResolved = true isCanBeConsumed = false @ Suppress ( \"\" ) isCanBeDeclared = false isVisible = visible }","docstring":"/**\n * Mark this [Configuration] as one that will consume artifacts from other subprojects (also known as 'resolving')\n *\n * Resolvable Configurations should have attributes.\n *\n * ```\n * isCanBeResolved = true\n * isCanBeConsumed = false\n * isCanBeDeclared = false\n * ```\n */"} {"signature":"public fun < T : Any > Publisher < T > . asFlow ( ) : Flow < T >","body":"= PublisherAsFlow ( this )","docstring":"/**\n * Transforms the given reactive [Publisher] into [Flow].\n * Use the [buffer] operator on the resulting flow to specify the size of the back-pressure.\n * In effect, it specifies the value of the subscription's [request][Subscription.request].\n * The [default buffer capacity][Channel.BUFFERED] for a suspending channel is used by default.\n *\n * If any of the resulting flow transformations fails, the subscription is immediately cancelled and all the in-flight\n * elements are discarded.\n *\n * This function is integrated with `ReactorContext` from `kotlinx-coroutines-reactor` module,\n * see its documentation for additional details.\n */"} {"signature":"@ JvmOverloads public fun < T : Any > Flow < T > . asPublisher ( context : CoroutineContext = EmptyCoroutineContext ) : Publisher < T >","body":"= FlowAsPublisher ( this , Dispatchers . Unconfined + context )","docstring":"/**\n * Transforms the given flow into a reactive specification compliant [Publisher].\n *\n * This function is integrated with `ReactorContext` from `kotlinx-coroutines-reactor` module,\n * see its documentation for additional details.\n *\n * An optional [context] can be specified to control the execution context of calls to the [Subscriber] methods.\n * A [CoroutineDispatcher] can be set to confine them to a specific thread; various [ThreadContextElement] can be set to\n * inject additional context into the caller thread. By default, the [Unconfined][Dispatchers.Unconfined] dispatcher\n * is used, so calls are performed from an arbitrary thread.\n */"} {"signature":"public fun markNow ( ) : TimeMark","body":"public fun markNow ( ) : TimeMark","docstring":"/**\n * Marks a point in time on this time source.\n *\n * The returned [TimeMark] instance encapsulates the captured time point and allows querying\n * the duration of time interval [elapsed][TimeMark.elapsedNow] from that point.\n */"} {"signature":"public operator fun minus ( other : ValueTimeMark ) : Duration","body":"= MonotonicTimeSource . differenceBetween ( this , other )","docstring":"/**\n * Returns the duration elapsed between the [other] time mark obtained from the same [TimeSource.Monotonic] time source and `this` time mark.\n *\n * The returned duration can be infinite if the time marks are far away from each other and\n * the result doesn't fit into [Duration] type,\n * or if one time mark is infinitely distant, or if both `this` and [other] time marks\n * lie infinitely distant on the opposite sides of the time scale.\n *\n * Two infinitely distant time marks on the same side of the time scale are considered equal and\n * the duration between them is [Duration.ZERO].\n */"} {"signature":"public operator fun compareTo ( other : ValueTimeMark ) : Int","body":"= ( this - other ) . compareTo ( Duration . ZERO )","docstring":"/**\n * Compares this time mark with the [other] time mark for order.\n *\n * - Returns zero if this time mark represents *the same moment* of time as the [other] time mark.\n * - Returns a negative number if this time mark is *earlier* than the [other] time mark.\n * - Returns a positive number if this time mark is *later* than the [other] time mark.\n */"} {"signature":"public abstract fun elapsedNow ( ) : Duration","body":"public abstract fun elapsedNow ( ) : Duration","docstring":"/**\n * Returns the amount of time passed from this mark measured with the time source from which this mark was taken.\n *\n * Note that the value returned by this function can change on subsequent invocations.\n *\n * @throws IllegalArgumentException an implementation may throw if calculating the elapsed time involves\n * adding a positive infinite duration to an infinitely distant past time mark or\n * a negative infinite duration to an infinitely distant future time mark.\n */"} {"signature":"public operator fun plus ( duration : Duration ) : TimeMark","body":"= AdjustedTimeMark ( this , duration )","docstring":"/**\n * Returns a time mark on the same time source that is ahead of this time mark by the specified [duration].\n *\n * The returned time mark is more _late_ when the [duration] is positive, and more _early_ when the [duration] is negative.\n *\n * If the time mark is adjusted too far in the past or in the future, it may saturate to an infinitely distant time mark.\n * In that case, [elapsedNow] will return an infinite duration elapsed from such infinitely distant mark.\n *\n * @throws IllegalArgumentException an implementation may throw if a positive infinite duration is added to an infinitely distant past time mark or\n * a negative infinite duration is added to an infinitely distant future time mark.\n */"} {"signature":"public open operator fun minus ( duration : Duration ) : TimeMark","body":"= plus ( - duration )","docstring":"/**\n * Returns a time mark on the same time source that is behind this time mark by the specified [duration].\n *\n * The returned time mark is more _early_ when the [duration] is positive, and more _late_ when the [duration] is negative.\n *\n * If the time mark is adjusted too far in the past or in the future, it may saturate to an infinitely distant time mark.\n * In that case, [elapsedNow] will return an infinite duration elapsed from such infinitely distant mark.\n *\n * @throws IllegalArgumentException an implementation may throw if a positive infinite duration is subtracted from an infinitely distant future time mark or\n * a negative infinite duration is subtracted from an infinitely distant past time mark.\n */"} {"signature":"public fun hasPassedNow ( ) : Boolean","body":"= ! elapsedNow ( ) . isNegative ( )","docstring":"/**\n * Returns true if this time mark has passed according to the time source from which this mark was taken.\n *\n * Note that the value returned by this function can change on subsequent invocations.\n * If the time source is monotonic, it can change only from `false` to `true`, namely, when the time mark becomes behind the current point of the time source.\n */"} {"signature":"public fun hasNotPassedNow ( ) : Boolean","body":"= elapsedNow ( ) . isNegative ( )","docstring":"/**\n * Returns false if this time mark has not passed according to the time source from which this mark was taken.\n *\n * Note that the value returned by this function can change on subsequent invocations.\n * If the time source is monotonic, it can change only from `true` to `false`, namely, when the time mark becomes behind the current point of the time source.\n */"} {"signature":"public operator fun minus ( other : ComparableTimeMark ) : Duration","body":"public operator fun minus ( other : ComparableTimeMark ) : Duration","docstring":"/**\n * Returns the duration elapsed between the [other] time mark and `this` time mark.\n *\n * The returned duration can be infinite if the time marks are far away from each other and\n * the result doesn't fit into [Duration] type,\n * or if one time mark is infinitely distant, or if both `this` and [other] time marks\n * lie infinitely distant on the opposite sides of the time scale.\n *\n * Two infinitely distant time marks on the same side of the time scale are considered equal and\n * the duration between them is [Duration.ZERO].\n *\n * Note that the other time mark must be obtained from the same time source as this one.\n *\n * @throws IllegalArgumentException if time marks were obtained from different time sources.\n */"} {"signature":"public override operator fun compareTo ( other : ComparableTimeMark ) : Int","body":"= ( this - other ) . compareTo ( Duration . ZERO )","docstring":"/**\n * Compares this time mark with the [other] time mark for order.\n *\n * - Returns zero if this time mark represents *the same moment* of time as the [other] time mark.\n * - Returns a negative number if this time mark is *earlier* than the [other] time mark.\n * - Returns a positive number if this time mark is *later* than the [other] time mark.\n *\n * Note that the other time mark must be obtained from the same time source as this one.\n *\n * @throws IllegalArgumentException if time marks were obtained from different time sources.\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"override fun equals ( other : Any ? ) : Boolean","docstring":"/**\n * Returns `true` if two time marks from the same time source represent the same moment of time, and `false` otherwise,\n * including the situation when the time marks were obtained from different time sources.\n */"} {"signature":"private fun compressSequencesWithoutLineNumber ( loggedItems : List < SteppingTestLoggedData > ) : List < SteppingTestLoggedData >","body":"{ if ( loggedItems . isEmpty ( ) ) return listOf ( ) val logIterator = loggedItems . iterator ( ) var currentItem = logIterator . next ( ) val result = mutableListOf ( currentItem ) for ( logItem in logIterator ) { if ( currentItem . line != - || currentItem . expectation != logItem . expectation ) { result . add ( logItem ) currentItem = logItem } } return result }","docstring":"/**\n * Compresses sequences of the same location without line number in the log:\n * specifically removes locations without linenumber, that would otherwise\n * print as byte offsets. This avoids overspecifying code generation\n * strategy in debug tests.\n */"} {"signature":"private fun areRuntimeOrCompileConfigurationsAvailable ( ) : Boolean","body":"= GradleVersion . version ( project . gradle . gradleVersion ) <= GradleVersion . version ( \"\" )","docstring":"/**\n * Check if \"compile\" and \"runtime\" configurations are still available in current Gradle version.\n */"} {"signature":"public fun < R > Dataset . map ( transform : ( FloatData ) -> R ) : List < R >","body":"{ return ( until xSize ( ) ) . map { i -> transform ( getX ( i ) ) } }","docstring":"/**\n * Applies the given [transform] function to each element of the dataset and returns a list with results.\n */"} {"signature":"public fun OnHeapDataset . partialToString ( ) : String","body":"= buildStringRepr ( x . partialToString ( ) , y . partialToString ( ) )","docstring":"/**\n * Creates [OnHeapDataset] string representation for part of data.\n */"} {"signature":"public fun OnHeapDataset . fullToString ( ) : String","body":"= buildStringRepr ( x . contentDeepToString ( ) , y . contentToString ( ) )","docstring":"/**\n * Creates [OnHeapDataset] string representation for full of data.\n */"} {"signature":"public fun OnHeapDataset . buildStringRepr ( xString : String , yString : String ) : String","body":"= \"\"","docstring":"/**\n * Builds intermediate [OnHeapDataset] string representation.\n */"} {"signature":"private fun FloatArray . partialToString ( maxSize : Int = , lowPercent : Double = ) : String","body":"{ if ( size <= maxSize ) { return contentToString ( ) } val lowCount = ( lowPercent * maxSize ) . roundToInt ( ) val upStart = size - maxSize - return generateSequence ( , Int :: inc ) . map { when { it < lowCount -> this [ it ] it > lowCount -> this [ upStart + it ] else -> \"\" } } . take ( maxSize + ) . joinToString ( prefix = \"\" , postfix = \"\" , separator = \"\" ) }","docstring":"/**\n * Create String representation of `FloatArray` where only a part of the data is printed to String.\n *\n * @param [maxSize] max number of elements of an array present in its string representation\n * @param [lowPercent] percent of data of [maxSize] to be printed from the beginning of array data.\n * Rest will be obtained from the tail of the array in order matching the order in an array.\n *\n * @return string representation of [FloatArray] in format like\n * `[0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, ..., 9.0, 10.0]`\n */"} {"signature":"private fun Array < FloatArray > . partialToString ( maxSize : Int = , lowPercent : Double = ) : String","body":"{ if ( size <= maxSize ) { return joinToString ( prefix = \"\" , postfix = \"\" , separator = \"\" ) { it . partialToString ( maxSize , lowPercent ) } } val lowCount = ( lowPercent * maxSize ) . roundToInt ( ) val upStart = size - maxSize - return generateSequence ( , Int :: inc ) . map { when { it < lowCount -> this [ it ] . partialToString ( maxSize , lowPercent ) it > lowCount -> this [ upStart + it ] . partialToString ( maxSize , lowPercent ) else -> \"\" } } . take ( maxSize + ) . joinToString ( prefix = \"\" , postfix = \"\" , separator = \"\" ) }","docstring":"/**\n * Create String representation of `Array` where only a part of the data is printed to String.\n *\n * @param [maxSize] max number of elements of an array present in its string representation\n * @param [lowPercent] percent of data of [maxSize] to be printed from the beginning of array data.\n *\n * Rest will be obtained from the tail of the array in order matching the order in an array.\n * @return string representation of [FloatArray] in format like\n * `[[0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, ..., 9.0, 10.0],\n * [11.0, 12.0, 13.0, 14.0, 15.0, 16.0, 17.0, 18.0, ..., 20.0, 21.0],\n * [22.0, 23.0, 24.0, 25.0, 26.0, 27.0, 28.0, 29.0, ..., 31.0, 32.0],\n * [33.0, 34.0, 35.0, 36.0, 37.0, 38.0, 39.0, 40.0, ..., 42.0, 43.0],\n * [44.0, 45.0, 46.0, 47.0, 48.0, 49.0, 50.0, 51.0, ..., 53.0, 54.0],\n * [55.0, 56.0, 57.0, 58.0, 59.0, 60.0, 61.0, 62.0, ..., 64.0, 65.0],\n * [66.0, 67.0, 68.0, 69.0, 70.0, 71.0, 72.0, 73.0, ..., 75.0, 76.0],\n * [77.0, 78.0, 79.0, 80.0, 81.0, 82.0, 83.0, 84.0, ..., 86.0, 87.0],\n * ...,\n * [99.0, 100.0, 101.0, 102.0, 103.0, 104.0, 105.0, 106.0, ..., 108.0, 109.0],\n * [110.0, 111.0, 112.0, 113.0, 114.0, 115.0, 116.0, 117.0, ..., 119.0, 120.0]]`\n */"} {"signature":"fun extractNativeCompilerClasspath ( taskOutput : String , toolName : NativeToolKind ) : List < String >","body":"= extractNativeToolSettings ( taskOutput , toolName , NativeToolSettingsKind . COMPILER_CLASSPATH ) . toList ( )","docstring":"/**\n * Extracts classpath of given task's output\n *\n * @param taskOutput debug level output of the task\n * @param toolName compiler type\n *\n * @return list of dependencies in classpath\n */"} {"signature":"fun extractNativeCompilerCommandLineArguments ( taskOutput : String , toolName : NativeToolKind ) : List < String >","body":"= extractNativeToolSettings ( taskOutput , toolName , NativeToolSettingsKind . COMMAND_LINE_ARGUMENTS ) . toList ( )","docstring":"/**\n * Extracts command line arguments of given task's output\n *\n * @param taskOutput debug level output of the task\n * @param toolName compiler type\n *\n * @return list of command line arguments\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun CharSequence . elementAt ( index : Int ) : Char","body":"{ return get ( index ) }","docstring":"/**\n * Returns a character at the given [index] or throws an [IndexOutOfBoundsException] if the [index] is out of bounds of this char sequence.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public fun CharSequence . toSortedSet ( ) : java . util . SortedSet < Char >","body":"{ return toCollection ( java . util . TreeSet < Char > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun CharSequence . sumOf ( selector : ( Char ) -> java . math . BigDecimal ) : java . math . BigDecimal","body":"{ var sum : java . math . BigDecimal = . toBigDecimal ( ) for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each character in the char sequence.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun CharSequence . sumOf ( selector : ( Char ) -> java . math . BigInteger ) : java . math . BigInteger","body":"{ var sum : java . math . BigInteger = . toBigInteger ( ) for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each character in the char sequence.\n */"} {"signature":"fun setExecutionSourceFrom ( testExecutable : TestExecutable )","body":"fun setExecutionSourceFrom ( testExecutable : TestExecutable )","docstring":"/**\n * Sets this test run to use the specified [testExecutable].\n *\n * This overrides other [executionSource] options.\n */"} {"signature":"fun mobileNetPrediction ( )","body":"{ runImageRecognitionPrediction ( modelType = TFModels . CV . MobileNet ( ) ) }","docstring":"/**\n * This example demonstrates the inference concept on MobileNet model:\n * - Model configuration, model weights and labels are obtained from [TFModelHub].\n * - Weights are loaded from .h5 file, configuration is loaded from .json file.\n * - Model predicts on a few images located in resources.\n * - Special preprocessing (used in MobileNet during training on ImageNet dataset) is applied to the images before prediction.\n */"} {"signature":"fun main ( ) : Unit","body":"= mobileNetPrediction ( )","docstring":"/** */"} {"signature":"override fun testCaseWithInvocation ( invocation : NSInvocation ? ) : XCTestCase","body":"{ error ( \"\"\"\"\"\" . trimIndent ( ) ) }","docstring":"/**\n * This method is invoked by the XCTest when it discovered XCTestCase instance\n * that contains test method.\n *\n * This method should not be called with the current idea and assumptions.\n */"} {"signature":"private fun createRunMethod ( selector : SEL )","body":"{ val result = class_addMethod ( cls = this . `class` ( ) , name = selector , imp = imp_implementationWithBlock ( this :: runner ) , types = \"\" ) check ( result ) { \"\" } }","docstring":"/**\n * Creates and adds method to the metaclass with implementation block\n * that gets an XCTestCase instance as self to be run.\n */"} {"signature":"override fun testInvocations ( ) : List < NSInvocation >","body":"= testMethodsNames . map { val selector = NSSelectorFromString ( it ) createRunMethod ( selector ) this . instanceMethodSignatureForSelector ( selector ) ? . let { signature -> @ Suppress ( \"\" ) val invocation = NSInvocation . invocationWithMethodSignature ( signature as NSMethodSignature ) invocation . setSelector ( selector ) invocation } ? : error ( \"\" ) }","docstring":"/**\n * Creates Test invocations for each test method to make them resolvable by the XCTest machinery.\n *\n * For each kotlin-test's test case make an NSInvocation with an appropriate selector that represents test name:\n * - Create NSSelector from the given test name.\n * - Create implementation method with block for runner method. This method accepts the instance of the XCTestCaseWrapper\n * to run the actual test code.\n * - Create NSInvocation from the selector using NSMethodSignature.\n *\n * Then this NSInvocation should be used to create an instance of XCTestCaseWrapper that implements XCTestCase.\n * When XCTest runs this instance, it invokes this invocation that passes Wrapper's instance to the `runner(...)` method.\n *\n * @see createRunMethod\n * @see runner\n * @see XCTestCaseWrapper.run\n */"} {"signature":"fun sampleFile ( pathFromProjectRoot : String , fqPackageName : String , fillFile : KotlinSampleTestDataFile . ( ) -> Unit )","body":"fun sampleFile ( pathFromProjectRoot : String , fqPackageName : String , fillFile : KotlinSampleTestDataFile . ( ) -> Unit )","docstring":"/**\n * Creates a `.kt` file outside of the source code directory. It should be used as input\n * for the `@sample` KDoc tag.\n *\n * To be picked by Dokka, this file must be included in [TestDokkaSourceSet.samples].\n *\n * @param pathFromProjectRoot path relative to the root of the test project. Must begin\n * with `/` to not confuse it with relative paths. Example: `/samples/collections.kt`\n * @param fqPackageName fully qualified package name to be used in the `package` statement of the file.\n * This parameter must be set because the package name cannot be deduced\n * from the file path, as samples usually reside outside of the source code directory.\n * Example: `org.jetbrains.dokka.sample.collections`\n */"} {"signature":"fun compute ( currentJavaClassSnapshots : List < JavaClassSnapshot > , previousJavaClassSnapshots : List < JavaClassSnapshot > ) : ProgramSymbolSet","body":"{ val currentClasses : Map < ClassId , JavaClassSnapshot > = currentJavaClassSnapshots . associateBy { it . classId } val previousClasses : Map < ClassId , JavaClassSnapshot > = previousJavaClassSnapshots . associateBy { it . classId } val addedClasses = currentClasses . keys - previousClasses . keys val removedClasses = previousClasses . keys - currentClasses . keys val unchangedOrModifiedClasses = currentClasses . keys - addedClasses return ProgramSymbolSet . Collector ( ) . run { addClasses ( addedClasses ) addClasses ( removedClasses ) unchangedOrModifiedClasses . forEach { collectClassChanges ( currentClasses [ it ] ! ! , previousClasses [ it ] ! ! , this ) } getResult ( ) } }","docstring":"/**\n * Computes changes between two lists of [JavaClassSnapshot]s.\n *\n * NOTE: Each list of classes must not contain duplicates (having the same [JvmClassName]/[ClassId]).\n */"} {"signature":"private fun collectClassChanges ( currentClassSnapshot : JavaClassSnapshot , previousClassSnapshot : JavaClassSnapshot , changes : ProgramSymbolSet . Collector )","body":"{ if ( currentClassSnapshot . classAbiHash == previousClassSnapshot . classAbiHash ) return val classId = currentClassSnapshot . classId . also { check ( it == previousClassSnapshot . classId ) } if ( currentClassSnapshot . classMemberLevelSnapshot != null && previousClassSnapshot . classMemberLevelSnapshot != null ) { if ( currentClassSnapshot . classMemberLevelSnapshot . classAbiExcludingMembers . abiHash != previousClassSnapshot . classMemberLevelSnapshot . classAbiExcludingMembers . abiHash ) { changes . addClass ( classId ) } else { collectClassMemberChanges ( classId , currentClassSnapshot . classMemberLevelSnapshot . fieldsAbi , previousClassSnapshot . classMemberLevelSnapshot . fieldsAbi , changes ) collectClassMemberChanges ( classId , currentClassSnapshot . classMemberLevelSnapshot . methodsAbi , previousClassSnapshot . classMemberLevelSnapshot . methodsAbi , changes ) } } else { changes . addClass ( classId ) } }","docstring":"/**\n * Collects changes between two [JavaClassSnapshot]s.\n *\n * The two classes must have the same [ClassId].\n */"} {"signature":"private fun collectClassMemberChanges ( classId : ClassId , currentMemberSnapshots : List < JavaElementSnapshot > , previousMemberSnapshots : List < JavaElementSnapshot > , changes : ProgramSymbolSet . Collector )","body":"{ val currentMemberHashes : Map < Long , JavaElementSnapshot > = currentMemberSnapshots . associateBy { it . abiHash } val previousMemberHashes : Map < Long , JavaElementSnapshot > = previousMemberSnapshots . associateBy { it . abiHash } val addedMembers = currentMemberHashes . keys - previousMemberHashes . keys val removedMembers = previousMemberHashes . keys - currentMemberHashes . keys changes . addClassMembers ( classId , addedMembers . map { currentMemberHashes [ it ] ! ! . name } ) changes . addClassMembers ( classId , removedMembers . map { previousMemberHashes [ it ] ! ! . name } ) if ( addedMembers . isNotEmpty ( ) || removedMembers . isNotEmpty ( ) ) { changes . addClassMember ( classId , SAM_LOOKUP_NAME . asString ( ) ) } }","docstring":"/** Collects changes between two lists of fields/methods within a class. */"} {"signature":"abstract fun < K : Any , V , CONTEXT > createCache ( createValue : ( K , CONTEXT ) -> V ) : FirCache < K , V , CONTEXT >","body":"abstract fun < K : Any , V , CONTEXT > createCache ( createValue : ( K , CONTEXT ) -> V ) : FirCache < K , V , CONTEXT >","docstring":"/**\n * Creates a cache with returns a value by key on demand if it is computed\n * Otherwise computes the value in [createValue] and caches it for future invocations\n *\n * [FirCache.getValue] should not be called inside [createValue]\n *\n * Note, that [createValue] might be called multiple times for the same value,\n * but all threads will always get the same value\n *\n * Where:\n * [CONTEXT] -- type of value which be used to create value by [createValue]\n */"} {"signature":"abstract fun < K : Any , V , CONTEXT > createCache ( initialCapacity : Int , loadFactor : Float , createValue : ( K , CONTEXT ) -> V ) : FirCache < K , V , CONTEXT >","body":"abstract fun < K : Any , V , CONTEXT > createCache ( initialCapacity : Int , loadFactor : Float , createValue : ( K , CONTEXT ) -> V ) : FirCache < K , V , CONTEXT >","docstring":"/**\n * Creates a cache with returns a value by key on demand if it is computed\n * Otherwise computes the value in [createValue] and caches it for future invocations\n *\n * [FirCache.getValue] should not be called inside [createValue]\n *\n * Where:\n * [CONTEXT] -- type of value which be used to create value by [createValue]\n *\n * @param initialCapacity initial capacity for the underlying cache map\n * @param loadFactor loadFactor for the underlying cache map\n */"} {"signature":"abstract fun < K : Any , V , CONTEXT , DATA > createCacheWithPostCompute ( createValue : ( K , CONTEXT ) -> Pair < V , DATA > , postCompute : ( K , V , DATA ) -> Unit ) : FirCache < K , V , CONTEXT >","body":"abstract fun < K : Any , V , CONTEXT , DATA > createCacheWithPostCompute ( createValue : ( K , CONTEXT ) -> Pair < V , DATA > , postCompute : ( K , V , DATA ) -> Unit ) : FirCache < K , V , CONTEXT >","docstring":"/**\n * Creates a cache with returns a caches value on demand if it is computed\n * Otherwise computes the value in two phases:\n * - [createValue] -- creates values and stores value of type [V] to cache and passes [V] & [DATA] to [postCompute]\n * - [postCompute] -- performs some operations on computed value after it placed into map\n *\n * [FirCache.getValue] can be safely called in postCompute from the same thread and correct value computed by [createValue] will be returned\n * [FirCache.getValue] should not be called inside [createValue]\n *\n * Where:\n * [CONTEXT] -- type of value which be used to create value by [createValue]\n * [DATA] -- type of additional data which will be passed from [createValue] to [postCompute]\n */"} {"signature":"fun resolve ( resolveAsInput : Boolean = false ) : Constraint","body":"fun resolve ( resolveAsInput : Boolean = false ) : Constraint","docstring":"/**\n * Resolves all references and other constraints it contains,\n * to turn this constraint into one that represents a type.\n *\n * Should only be run after collecting all constraints,\n * and constraint should not be modified afterwards.\n *\n * When resolving as an input, resulting constraint\n * won't contain properties added to this constraint.\n */"} {"signature":"internal fun checkDescriptor ( descriptor : OptionDescriptor < * , * > )","body":"{ if ( descriptor . multiple || descriptor . delimiter != null ) { failAssertion ( \"\" ) } }","docstring":"/**\n * Check descriptor for this kind of option.\n */"} {"signature":"fun < T : Any , TResult , DefaultType : DefaultRequiredType > AbstractSingleOption < T , TResult , DefaultType > . multiple ( ) : MultipleOption < T , MultipleOptionType . Repeated , DefaultType >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as OptionDescriptor ) { MultipleOption < T , MultipleOptionType . Repeated , DefaultType > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , listOfNotNull ( defaultValue ) , required , true , delimiter , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Allows the option to have several values specified in command line string.\n * Number of values is unlimited.\n */"} {"signature":"fun < T : Any , DefaultType : DefaultRequiredType > MultipleOption < T , MultipleOptionType . Delimited , DefaultType > . multiple ( ) : MultipleOption < T , MultipleOptionType . RepeatedDelimited , DefaultRequiredType >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , List < T > > > ( ) ) . descriptor as OptionDescriptor ) { if ( multiple ) { error ( \"\" ) } MultipleOption < T , MultipleOptionType . RepeatedDelimited , DefaultRequiredType > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , defaultValue ? . toList ( ) ? : listOf ( ) , required , true , delimiter , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Allows the option to have several values specified in command line string.\n * Number of values is unlimited.\n */"} {"signature":"fun < T : Any > SingleNullableOption < T > . default ( value : T ) : SingleOption < T , DefaultRequiredType . Default >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as OptionDescriptor ) { SingleOption < T , DefaultRequiredType . Default > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , value , required , multiple , delimiter , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Specifies the default value for the option, that will be used when no value is provided for it\n * in command line string.\n *\n * @param value the default value.\n */"} {"signature":"fun < T : Any , OptionType : MultipleOptionType > MultipleOption < T , OptionType , DefaultRequiredType . None > . default ( value : Collection < T > ) : MultipleOption < T , OptionType , DefaultRequiredType . Default >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , List < T > > > ( ) ) . descriptor as OptionDescriptor ) { require ( value . isNotEmpty ( ) ) { \"\" } MultipleOption < T , OptionType , DefaultRequiredType . Default > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , value . toList ( ) , required , multiple , delimiter , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Specifies the default value for the option with multiple values, that will be used when no values are provided\n * for it in command line string.\n *\n * @param value the default value, must be a non-empty collection.\n * @throws IllegalArgumentException if provided default value is empty collection.\n */"} {"signature":"fun < T : Any > SingleNullableOption < T > . required ( ) : SingleOption < T , DefaultRequiredType . Required >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as OptionDescriptor ) { SingleOption < T , DefaultRequiredType . Required > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , defaultValue , true , multiple , delimiter , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Requires the option to be always provided in command line.\n */"} {"signature":"fun < T : Any , OptionType : MultipleOptionType > MultipleOption < T , OptionType , DefaultRequiredType . None > . required ( ) : MultipleOption < T , OptionType , DefaultRequiredType . Required >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , List < T > > > ( ) ) . descriptor as OptionDescriptor ) { MultipleOption < T , OptionType , DefaultRequiredType . Required > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , defaultValue ? . toList ( ) ? : listOf ( ) , true , multiple , delimiter , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Requires the option to be always provided in command line.\n */"} {"signature":"fun < T : Any , DefaultRequired : DefaultRequiredType > AbstractSingleOption < T , * , DefaultRequired > . delimiter ( delimiterValue : String ) : MultipleOption < T , MultipleOptionType . Delimited , DefaultRequired >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as OptionDescriptor ) { MultipleOption < T , MultipleOptionType . Delimited , DefaultRequired > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , listOfNotNull ( defaultValue ) , required , multiple , delimiterValue , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Allows the option to have several values joined with [delimiter] specified in command line string.\n * Number of values is unlimited.\n *\n * The value of the argument is an empty list in case if no value was specified in command line string.\n *\n * @param delimiterValue delimiter used to separate string value to option values list.\n */"} {"signature":"fun < T : Any , DefaultRequired : DefaultRequiredType > MultipleOption < T , MultipleOptionType . Repeated , DefaultRequired > . delimiter ( delimiterValue : String ) : MultipleOption < T , MultipleOptionType . RepeatedDelimited , DefaultRequired >","body":"{ val newOption = with ( ( delegate . cast < ParsingValue < T , List < T > > > ( ) ) . descriptor as OptionDescriptor ) { MultipleOption < T , MultipleOptionType . RepeatedDelimited , DefaultRequired > ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , defaultValue ? . toList ( ) ? : listOf ( ) , required , multiple , delimiterValue , deprecatedWarning ) , owner ) } owner . entity = newOption return newOption }","docstring":"/**\n * Allows the option to have several values joined with [delimiter] specified in command line string.\n * Number of values is unlimited.\n *\n * The value of the argument is an empty list in case if no value was specified in command line string.\n *\n * @param delimiterValue delimiter used to separate string value to option values list.\n */"} {"signature":"private fun JsScope . findOwnNameOrDeclare ( ident : String ) : JsName","body":"= when ( this ) { is JsFunctionScope -> declareNameUnsafe ( ident ) else -> declareName ( ident ) }","docstring":"/**\n * Overrides JsFunctionScope declareName as it's mapped to declareFreshName\n */"} {"signature":"override fun hashCode ( ) : Int","body":"= super < AbstractSet > . hashCode ( )","docstring":"/**\n * We provide [equals], so as a matter of style, we should also provide [hashCode].\n * However, the implementation from [AbstractSet] is enough.\n */"} {"signature":"private fun CallableDescriptor . approximateCapturedTypes ( approximator : TypeApproximator ) : CallableDescriptor","body":"{ if ( ! isNewInferenceEnabled ) return this val wrappedSubstitution = object : TypeSubstitution ( ) { override fun get ( key : KotlinType ) : TypeProjection ? = null override fun prepareTopLevelType ( topLevelType : KotlinType , position : Variance ) = when ( position ) { Variance . INVARIANT -> null Variance . OUT_VARIANCE -> approximator . approximateToSuperType ( topLevelType . unwrap ( ) , TypeApproximatorConfiguration . InternalTypesApproximation ) Variance . IN_VARIANCE -> approximator . approximateToSubType ( topLevelType . unwrap ( ) , TypeApproximatorConfiguration . InternalTypesApproximation ) } ? : topLevelType } return substitute ( TypeSubstitutor . create ( wrappedSubstitution ) ) }","docstring":"/**\n * this is bad hack for test like BlackBoxCodegenTestGenerated.Reflection.Properties#testGetPropertiesMutableVsReadonly (see last get call)\n * Main reason for this hack: when we have List<*> we do capturing and transform receiver type to List.\n * So method get has signature get(Int): Capture(*). If we also have smartcast to MutableList, then there is also method get(Int): String.\n * And we should chose get(Int): String.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun print ( message : Any ? )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Int )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Long )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Byte )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Short )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Char )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Boolean )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Float )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : Double )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun print ( message : CharArray )","body":"{ System . out . print ( message ) }","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun println ( message : Any ? )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Int )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Long )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Byte )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Short )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Char )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Boolean )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Float )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : Double )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun println ( message : CharArray )","body":"{ System . out . println ( message ) }","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun println ( )","body":"{ System . out . println ( ) }","docstring":"/** Prints the line separator to the standard output stream. */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun readln ( ) : String","body":"= readlnOrNull ( ) ? : throw ReadAfterEOFException ( \"\" )","docstring":"/**\n * Reads a line of input from the standard input stream and returns it,\n * or throws a [RuntimeException] if EOF has already been reached when [readln] is called.\n *\n * LF or CRLF is treated as the line terminator. Line terminator is not included in the returned string.\n *\n * The input is decoded using the system default Charset. A [CharacterCodingException] is thrown if input is malformed.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun readlnOrNull ( ) : String ?","body":"= readLine ( )","docstring":"/**\n * Reads a line of input from the standard input stream and returns it,\n * or return `null` if EOF has already been reached when [readlnOrNull] is called.\n *\n * LF or CRLF is treated as the line terminator. Line terminator is not included in the returned string.\n *\n * The input is decoded using the system default Charset. A [CharacterCodingException] is thrown if input is malformed.\n */"} {"signature":"public fun readLine ( ) : String ?","body":"= LineReader . readLine ( System . `in` , Charset . defaultCharset ( ) )","docstring":"/**\n * Reads a line of input from the standard input stream.\n *\n * @return the line read or `null` if the input stream is redirected to a file and the end of file has been reached.\n */"} {"signature":"@ Synchronized fun readLine ( inputStream : InputStream , charset : Charset ) : String ?","body":"{ if ( ! :: decoder . isInitialized || decoder . charset ( ) != charset ) updateCharset ( charset ) var nBytes = var nChars = while ( true ) { val readByte = inputStream . read ( ) if ( readByte == - ) { if ( sb . isEmpty ( ) && nBytes == && nChars == ) { return null } else { nChars = decodeEndOfInput ( nBytes , nChars ) break } } else { bytes [ nBytes ++ ] = readByte . toByte ( ) } if ( readByte == '' . code || nBytes == BUFFER_SIZE || ! directEOL ) { byteBuf . limit ( nBytes ) charBuf . position ( nChars ) nChars = decode ( false ) if ( nChars > && chars [ nChars - ] == '' ) { byteBuf . position ( ) break } nBytes = compactBytes ( ) } } if ( nChars > && chars [ nChars - ] == '' ) { nChars -- if ( nChars > && chars [ nChars - ] == '' ) nChars -- } if ( sb . isEmpty ( ) ) return String ( chars , , nChars ) sb . append ( chars , , nChars ) val result = sb . toString ( ) if ( sb . length > BUFFER_SIZE ) trimStringBuilder ( ) sb . setLength ( ) return result }","docstring":"/**\n * Reads line from the specified [inputStream] with the given [charset].\n * The general design:\n * * This function contains only fast path code and all it state is kept in local variables as much as possible.\n * * All the slow-path code is moved to separate functions and the call-sequence bytecode is minimized for it.\n */"} {"signature":"public fun FaceAlignmentModelBase < Bitmap > . detectLandmarks ( imageProxy : ImageProxy ) : List < Landmark >","body":"{ if ( this is CameraXCompatibleModel ) { return doWithRotation ( imageProxy . imageInfo . rotationDegrees ) { detectLandmarks ( imageProxy . toBitmap ( ) ) } } return detectLandmarks ( imageProxy . toBitmap ( applyRotation = true ) ) }","docstring":"/**\n * Detects [Landmark] objects on the given [imageProxy].\n */"} {"signature":"private fun selectSubstitutionClassifierId ( types : List < CirClassOrTypeAliasType > ) : CirEntityId ?","body":"{ val forwardSubstitutionAllowed = typeCommonizer . context . enableForwardTypeAliasSubstitution val backwardsSubstitutionAllowed = typeCommonizer . context . enableBackwardsTypeAliasSubstitution if ( ! forwardSubstitutionAllowed && ! backwardsSubstitutionAllowed ) { return null } val associatedIds = types . singleDistinctValueOrNull { classifiers . associatedIdsResolver . resolveAssociatedIds ( it . classifierId ) } ? : return null val typeSubstitutionCandidates = resolveTypeSubstitutionCandidates ( associatedIds , types ) . onEach { typeSubstitutionCandidate -> assert ( typeSubstitutionCandidate . typeDistance . isZero . not ( ) ) { \"\" } assert ( typeSubstitutionCandidate . typeDistance . isReachable ) { \"\" } } return typeSubstitutionCandidates . minByOrNull { it . typeDistance . penalty } ? . id }","docstring":"/**\n * Will select *the* associated classifier that is\n * - reachable from all [types] on all platforms\n * - Has the lowest penalty score (where penalty score will be the maximum penalty on all platforms)\n *\n * Will return null if\n * - No substitution is allowed\n * - The input [types] do not have a single distinct set of associated ids\n */"} {"signature":"public fun KtAnnotationValue . renderAsSourceCode ( ) : String","body":"= KtAnnotationValueRenderer . render ( this )","docstring":"/**\n * Render annotation value, resulted string is a valid Kotlin source code.\n */"} {"signature":"public fun lastObservedStackTrace ( ) : List < StackTraceElement >","body":"{ var frame : CoroutineStackFrame ? = lastObservedFrame ? : return emptyList ( ) val result = ArrayList < StackTraceElement > ( ) while ( frame != null ) { frame . getStackTraceElement ( ) ? . let { result . add ( it ) } frame = frame . callerFrame } return result }","docstring":"/**\n * Last observed stacktrace of the coroutine captured on its suspension or resumption point.\n * It means that for [running][State.RUNNING] coroutines resulting stacktrace is inaccurate and\n * reflects stacktrace of the resumption point, not the actual current stacktrace.\n */"} {"signature":"fun forKlib ( ) : Iterable < CompiledDependency < KLIB > >","body":"= klibDependencies","docstring":"/** Dependencies needed to compile KLIB. */"} {"signature":"fun forStaticCache ( klib : CompiledDependency < KLIB > , useHeaders : Boolean ) : Iterable < CompiledDependency < * > >","body":"= ( klibDependencies . asSequence ( ) . filter { it . type == FriendLibrary } + klib + if ( useHeaders ) staticCacheHeaderDependencies else staticCacheDependencies ) . asIterable ( )","docstring":"/** Dependencies needed to compile KLIB static cache. */"} {"signature":"fun forOneStageExecutable ( ) : Iterable < CompiledDependency < * > >","body":"= ( klibDependencies . asSequence ( ) + staticCacheDependencies ) . asIterable ( )","docstring":"/** Dependencies needed to compile one-stage executable. */"} {"signature":"fun forTwoStageExecutable ( includedKlib : CompiledDependency < KLIB > , includedKlibStaticCache : CompiledDependency < KLIBStaticCache > ? ) : Iterable < CompiledDependency < * > >","body":"= ( klibDependencies . asSequence ( ) + staticCacheDependencies + listOfNotNull ( includedKlib , includedKlibStaticCache ) ) . asIterable ( )","docstring":"/** Dependencies needed to compile two-stage executable. */"} {"signature":"public fun apply ( input : I ) : O","body":"public fun apply ( input : I ) : O","docstring":"/**\n * Performs preprocessing operation on the input.\n * @param [input] is an input to the operation of type [I].\n * @return an output of the operation of type [O].\n */"} {"signature":"public fun getOutputShape ( inputShape : TensorShape ) : TensorShape","body":"public fun getOutputShape ( inputShape : TensorShape ) : TensorShape","docstring":"/**\n * Returns the output's shape of the operation having input of shape [inputShape].\n * @param [inputShape] is a shape of the input.\n */"} {"signature":"public fun subprojects ( )","body":"public fun subprojects ( )","docstring":"/**\n * Include to the merged report all subprojects of the current project.\n *\n * Kover plugin will be automatically applied in all subprojects.\n */"} {"signature":"public fun subprojects ( filter : Spec < Project > )","body":"public fun subprojects ( filter : Spec < Project > )","docstring":"/**\n * Include to the merged report subprojects of the current project that have passed the filter.\n *\n * Kover plugin will be automatically applied in passed subprojects.\n *\n * **Important!**\n *\n * It is impossible to guarantee exactly at what point in time the filter will be executed, before evaluation the corresponding project or during the evaluation.\n * Therefore, only static values can be read in filters, for example, the name of the project or its path.\n */"} {"signature":"public fun allProjects ( )","body":"public fun allProjects ( )","docstring":"/**\n * Include to the merged report all projects of the build.\n *\n * Kover plugin will be automatically applied in all projects.\n */"} {"signature":"public fun allProjects ( filter : Spec < Project > )","body":"public fun allProjects ( filter : Spec < Project > )","docstring":"/**\n * Include to the merged report all projects of the build that have passed the filter.\n *\n * Kover plugin will be automatically applied in passed subprojects.\n *\n * **Important!**\n *\n * It is impossible to guarantee exactly at what point in time the filter will be executed, before evaluation the corresponding project or during the evaluation.\n * Therefore, only static values can be read in filters, for example, the name of the project or its path.\n */"} {"signature":"public fun projects ( vararg projectNameOrPath : String )","body":"public fun projects ( vararg projectNameOrPath : String )","docstring":"/**\n * Include to the merged report all specified projects.\n * You can specify both the project name and its path (starts with the `:` sign).\n *\n * Kover plugin will be automatically applied in these subprojects.\n */"} {"signature":"public fun sources ( config : Action < KoverMergingVariantSources > )","body":"public fun sources ( config : Action < KoverMergingVariantSources > )","docstring":"/**\n * Limit the classes that will be included in the reports for all included projects.\n *\n * For more information about the settings, see [KoverVariantConfig.sources].\n *\n * This action is executed delayed, just before all tasks are created, at the after evaluate stage.\n * A corresponding project is passed in the argument. Analyzing this project, you can make flexible configurations.\n * ```\n * sources {\n * if (project.name == \"projectName\") {\n * excludedSourceSets.add(\"excluded\")\n * }\n * }\n * ```\n */"} {"signature":"public fun instrumentation ( config : Action < KoverMergingInstrumentation > )","body":"public fun instrumentation ( config : Action < KoverMergingInstrumentation > )","docstring":"/**\n * Instrumentation settings for all included projects.\n *\n * For more information about the settings, see [KoverVariantConfig.instrumentation].\n *\n * This action is executed delayed, just before all tasks are created, at the after evaluate stage.\n * A corresponding project is passed in the argument. Analyzing this project, you can make flexible configurations.\n * ```\n * instrumentation {\n * if (project.name == \"projectName\") {\n * excludedClasses.add(\"foo.bar.*\")\n * }\n * }\n * ```\n */"} {"signature":"public fun createVariant ( variantName : String , config : Action < KoverMergingVariantCreate > )","body":"public fun createVariant ( variantName : String , config : Action < KoverMergingVariantCreate > )","docstring":"/**\n * Create custom report variant with name [variantName] in all included projects.\n *\n * For more information about the settings, see [KoverCurrentProjectVariantsConfig.createVariant].\n *\n * This action is executed delayed, just before all tasks are created, at the after evaluate stage.\n * A corresponding project is passed in the argument. Analyzing this project, you can make flexible configurations.\n * ```\n * createVariant(\"custom\") {\n * if (project.plugins.hasPlugin(\"kotlin\")) {\n * add(\"jvm\")\n * }\n * }\n * ```\n */"} {"signature":"private inline fun FirFile . forEachElementWithContainers ( crossinline saveDeclaration : ( element : FirElement , owners : List < FirBasedSymbol < * > > ) -> Unit )","body":"{ val declarationsCollector = object : FirVisitor < Unit , PersistentList < FirBasedSymbol < * > > > ( ) { override fun visitElement ( element : FirElement , data : PersistentList < FirBasedSymbol < * > > ) { if ( element is FirDeclaration ) { saveDeclaration ( element , data ) } element . acceptChildren ( visitor = this , data = if ( element is FirDeclaration ) data . add ( element . symbol ) else data ) } } accept ( declarationsCollector , persistentListOf ( ) ) }","docstring":"/**\n * Walks over every [FirElement] in [this] file and invokes [saveDeclaration] on it, passing each element and the list of its containing\n * declarations (like file, classes, functions/properties and so on).\n */"} {"signature":"private inline fun FirDeclaration . forEachDirectChildDeclaration ( crossinline action : ( child : FirDeclaration ) -> Unit )","body":"{ this . acceptChildren ( object : FirDefaultVisitorVoid ( ) { override fun visitElement ( element : FirElement ) { } override fun visitFile ( file : FirFile ) { action ( file ) } override fun visitCallableDeclaration ( callableDeclaration : FirCallableDeclaration ) { action ( callableDeclaration ) } override fun visitClassLikeDeclaration ( classLikeDeclaration : FirClassLikeDeclaration ) { action ( classLikeDeclaration ) } } ) }","docstring":"/**\n * Calls [action] on every direct child declaration of [this] declaration.\n */"} {"signature":"fun findPackageParts ( packageFqName : String ) : List < String >","body":"fun findPackageParts ( packageFqName : String ) : List < String >","docstring":"/**\n * @return JVM internal names of package parts existing in the package with the given FQ name.\n *\n * For example, if a file named foo.kt in package org.test is compiled to a library, PackagePartProvider for such library\n * must return the list `[\"org/test/FooKt\"]` for the query `\"org.test\"`\n * (in case the file is not annotated with @JvmName, @JvmPackageName or @JvmMultifileClass).\n */"} {"signature":"fun computePackageSetWithNonClassDeclarations ( ) : Set < String >","body":"fun computePackageSetWithNonClassDeclarations ( ) : Set < String >","docstring":"/**\n * This method is only for sake of optimization\n * @return package names set for which that provider has package parts\n */"} {"signature":"fun mayHaveOptionalAnnotationClasses ( ) : Boolean","body":"fun mayHaveOptionalAnnotationClasses ( ) : Boolean","docstring":"/**\n * Returns `true` if [getAllOptionalAnnotationClasses] may return a non-empty list.\n */"} {"signature":"private fun checkLibrariesInDistribution ( ) : Boolean","body":"{ val presentPlatformLibs = platformLibsDirectory . listFiles { file -> file . isDirectory } . orEmpty ( ) . map { it . name } . toSet ( ) return presentDefs . toPlatformLibNames ( ) . all { it in presentPlatformLibs } }","docstring":"/**\n * Checks that all platform libs for [konanTarget] actually exist in the [distribution].\n */"} {"signature":"private fun checkCaches ( ) : Boolean","body":"{ if ( ! shouldBuildCaches ) { return true } val cacheDirectory = CacheBuilder . getRootCacheDirectory ( project . konanHome , konanTarget , true , konanCacheKind ) return presentDefs . toPlatformLibNames ( ) . all { cacheDirectory . resolve ( CacheBuilder . getCacheFileName ( it , konanCacheKind ) ) . listFilesOrEmpty ( ) . isNotEmpty ( ) } }","docstring":"/**\n * Check that caches for all platform libs for [konanTarget] actually exist in the cache directory.\n */"} {"signature":"fun isGenerated ( path : File ) : Boolean","body":"= generated . contains ( path )","docstring":"/**\n * Are platform libraries in the given directory (e.g. /klib/platform/ios_x64) generated.\n */"} {"signature":"fun setGenerated ( path : File )","body":"{ generated . add ( path ) }","docstring":"/**\n * Register that platform libraries in the given directory are generated.\n */"} {"signature":"fun isCached ( path : File , kind : NativeCacheKind ) : Boolean","body":"= kind == NativeCacheKind . NONE || cached ( kind ) . contains ( path )","docstring":"/**\n * Are platform libraries in the given directory (e.g. /klib/platform/ios_x64) cached with the given cache kind.\n */"} {"signature":"fun setCached ( path : File , kind : NativeCacheKind )","body":"{ if ( kind != NativeCacheKind . NONE ) { cached ( kind ) . add ( path ) } }","docstring":"/**\n * Register that platform libraries in the give directory are cached with the given cache kind.\n */"} {"signature":"internal fun Project . mavenPublishing ( configure : MavenPublishingSettings . ( ) -> Unit )","body":"= extensions . configure ( configure )","docstring":"/** Configure the [KayrayBuildProperties] extension. */"} {"signature":"@ Suppress ( \"\" ) internal fun File . patchSettingsFile ( description : String , koverVersion : String , snapshotRepos : List < String > , overrideKotlinVersion : String ? )","body":"{ val language = if ( name . endsWith ( \"\" ) ) ScriptLanguage . KTS else ScriptLanguage . GROOVY val originLines = readLines ( ) bufferedWriter ( ) . use { writer -> var firstStatement = true originLines . forEach { line -> if ( firstStatement && line . isNotBlank ( ) ) { val isPluginManagement = line . trimStart ( ) . startsWith ( \"\" ) writer . appendLine ( \"\" ) val pluginManagementWriter = FormattedWriter { l -> writer . append ( l ) } pluginManagementWriter . writePluginManagement ( language , koverVersion , snapshotRepos , overrideKotlinVersion ) if ( ! isPluginManagement ) { writer . appendLine ( \"\" ) } firstStatement = false } else { writer . appendLine ( line ) } } if ( originLines . isEmpty ( ) ) { val pluginManagementWriter = FormattedWriter { l -> writer . append ( l ) } pluginManagementWriter . call ( \"\" ) { pluginManagementWriter . writePluginManagement ( language , koverVersion , snapshotRepos , overrideKotlinVersion ) } } val pluginManagementWriter = FormattedWriter { l -> writer . append ( l ) } pluginManagementWriter . writeDependencyManagement ( language , snapshotRepos ) } }","docstring":"/**\n * Override Kover version and add local repository to find artifact for current build.\n */"} {"signature":"internal fun File . patchKoverDependency ( koverVersion : String )","body":"{ val originLines = readLines ( ) bufferedWriter ( ) . use { writer -> originLines . forEach { line -> val lineToWrite = if ( line . contains ( \"\" ) ) { line . replace ( \"\" , \"\" ) } else { line } writer . appendLine ( lineToWrite ) } } }","docstring":"/**\n * Override Kover version\n */"} {"signature":"fun String . invariantNewlines ( ) : String","body":"= lines ( ) . joinToString ( \"\" )","docstring":"/** Replace all newlines with `\\n`, so the String can be used in assertions cross-platform */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Throwable . stackTraceToString ( ) : String","body":"@ SinceKotlin ( \"\" ) public expect fun Throwable . stackTraceToString ( ) : String","docstring":"/**\n * Returns the detailed description of this throwable with its stack trace.\n *\n * The detailed description includes:\n * - the short description (see [Throwable.toString]) of this throwable;\n * - the complete stack trace;\n * - detailed descriptions of the exceptions that were [suppressed][suppressedExceptions] in order to deliver this exception;\n * - the detailed description of each throwable in the [Throwable.cause] chain.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public expect fun Throwable . printStackTrace ( ) : Unit","body":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public expect fun Throwable . printStackTrace ( ) : Unit","docstring":"/**\n * Prints the [detailed description][Throwable.stackTraceToString] of this throwable to the standard output or standard error output.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public expect fun Throwable . addSuppressed ( exception : Throwable )","body":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public expect fun Throwable . addSuppressed ( exception : Throwable )","docstring":"/**\n * When supported by the platform, adds the specified exception to the list of exceptions that were\n * suppressed in order to deliver this exception.\n */"} {"signature":"inline fun < reified IN , reified BUF , reified OUT > aggregatorOf ( noinline zero : ( ) -> BUF , noinline reduce : ( b : BUF , a : IN ) -> BUF , noinline merge : ( b1 : BUF , b2 : BUF ) -> BUF , noinline finish : ( reduction : BUF ) -> OUT , bufferEncoder : Encoder < BUF > = encoder ( ) , outputEncoder : Encoder < OUT > = encoder ( ) , ) : Aggregator < IN , BUF , OUT >","body":"= Aggregator ( zero , reduce , merge , finish , bufferEncoder , outputEncoder )","docstring":"/** Creates an [Aggregator] in functional manner.\n *\n * @param zero A zero value for this aggregation. Should satisfy the property that any b + zero = b.\n * @param reduce Combine two values to produce a new value. For performance, the function may modify `b` and\n * return it instead of constructing new object for b.\n * @param merge Merge two intermediate values.\n * @param finish Transform the output of the reduction.\n * @param bufferEncoder Optional. Specifies the `Encoder` for the intermediate value type.\n * @param outputEncoder Optional. Specifies the `Encoder` for the final output value type.\n * */"} {"signature":"inline fun < reified IN , reified OUT , reified AGG : Aggregator < IN , * , OUT > > udaf ( agg : AGG , nondeterministic : Boolean = false , ) : NamedUserDefinedFunction1 < IN , OUT >","body":"= udaf ( name = agg :: class . simpleName ? : error ( \"\" ) , agg = agg , nondeterministic = nondeterministic , )","docstring":"/**\n * Obtains a [NamedUserDefinedFunction1] that wraps the given [agg] so that it may be used with Data Frames.\n * @see functions.udaf\n *\n * @param name Optional. Tries to obtain name from the class of [agg] if not supplied.\n * Use [udafUnnamed] if no name is wanted.\n * @param agg the given [Aggregator] to convert into a UDAF. Can also be created using [aggregatorOf].\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [NamedUserDefinedFunction1] that can be used as an aggregating expression\n *\n * @see udaf for a named variant.\n */"} {"signature":"inline fun < reified IN , reified OUT , reified AGG : Aggregator < IN , * , OUT > > udaf ( name : String , agg : AGG , nondeterministic : Boolean = false , ) : NamedUserDefinedFunction1 < IN , OUT >","body":"= udafUnnamed ( agg = agg , nondeterministic = nondeterministic ) . withName ( name )","docstring":"/**\n * Obtains a [NamedUserDefinedFunction1] that wraps the given [agg] so that it may be used with Data Frames.\n * @see functions.udaf\n *\n * @param name Optional. Tries to obtain name from the class of [agg] if not supplied.\n * Use [udafUnnamed] if no name is wanted.\n * @param agg the given [Aggregator] to convert into a UDAF. Can also be created using [aggregatorOf].\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [NamedUserDefinedFunction1] that can be used as an aggregating expression\n *\n * @see udaf for a named variant.\n */"} {"signature":"inline fun < reified IN , reified OUT , reified AGG : Aggregator < IN , * , OUT > > udafUnnamed ( agg : AGG , nondeterministic : Boolean = false , ) : UserDefinedFunction1 < IN , OUT >","body":"{ IN :: class . checkForValidType ( \"\" ) return UserDefinedFunction1 ( udf = functions . udaf ( agg , encoder < IN > ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < OUT > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < OUT > ( ) , ) }","docstring":"/**\n * Obtains a [UserDefinedFunction1] that wraps the given [agg] so that it may be used with Data Frames.\n * @see functions.udaf\n *\n * @param agg the given [Aggregator] to convert into a UDAF. Can also be created using [aggregatorOf].\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [UserDefinedFunction1] that can be used as an aggregating expression\n *\n * @see udaf for a named variant.\n */"} {"signature":"inline fun < reified IN , reified BUF , reified OUT > udaf ( noinline zero : ( ) -> BUF , noinline reduce : ( b : BUF , a : IN ) -> BUF , noinline merge : ( b1 : BUF , b2 : BUF ) -> BUF , noinline finish : ( reduction : BUF ) -> OUT , bufferEncoder : Encoder < BUF > = encoder ( ) , outputEncoder : Encoder < OUT > = encoder ( ) , nondeterministic : Boolean = false , ) : UserDefinedFunction1 < IN , OUT >","body":"= udafUnnamed ( aggregatorOf ( zero = zero , reduce = reduce , merge = merge , finish = finish , bufferEncoder = bufferEncoder , outputEncoder = outputEncoder , ) , nondeterministic = nondeterministic , )","docstring":"/**\n * Obtains a [UserDefinedFunction1] created from an [Aggregator] created by the given arguments\n * so that it may be used with Data Frames.\n * @see functions.udaf\n * @see aggregatorOf\n *\n * @param zero A zero value for this aggregation. Should satisfy the property that any b + zero = b.\n * @param reduce Combine two values to produce a new value. For performance, the function may modify `b` and\n * return it instead of constructing new object for b.\n * @param merge Merge two intermediate values.\n * @param finish Transform the output of the reduction.\n * @param bufferEncoder Optional. Specifies the `Encoder` for the intermediate value type.\n * @param outputEncoder Optional. Specifies the `Encoder` for the final output value type.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [UserDefinedFunction1] that can be used as an aggregating expression\n *\n * @see udaf for a named variant.\n */"} {"signature":"inline fun < reified IN , reified BUF , reified OUT > udaf ( name : String , noinline zero : ( ) -> BUF , noinline reduce : ( b : BUF , a : IN ) -> BUF , noinline merge : ( b1 : BUF , b2 : BUF ) -> BUF , noinline finish : ( reduction : BUF ) -> OUT , bufferEncoder : Encoder < BUF > = encoder ( ) , outputEncoder : Encoder < OUT > = encoder ( ) , nondeterministic : Boolean = false , ) : NamedUserDefinedFunction1 < IN , OUT >","body":"= udaf ( name = name , agg = aggregatorOf ( zero = zero , reduce = reduce , merge = merge , finish = finish , bufferEncoder = bufferEncoder , outputEncoder = outputEncoder , ) , nondeterministic = nondeterministic , )","docstring":"/**\n * Obtains a [NamedUserDefinedFunction1] that wraps the given [agg] so that it may be used with Data Frames.\n * so that it may be used with Data Frames.\n * @see functions.udaf\n * @see aggregatorOf\n *\n * @param name Optional. Name for the UDAF.\n * @param zero A zero value for this aggregation. Should satisfy the property that any b + zero = b.\n * @param reduce Combine two values to produce a new value. For performance, the function may modify `b` and\n * return it instead of constructing new object for b.\n * @param merge Merge two intermediate values.\n * @param finish Transform the output of the reduction.\n * @param bufferEncoder Optional. Specifies the `Encoder` for the intermediate value type.\n * @param outputEncoder Optional. Specifies the `Encoder` for the final output value type.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [UserDefinedFunction1] that can be used as an aggregating expression\n *\n * @see udafUnnamed for an unnamed variant.\n */"} {"signature":"inline fun < reified T1 , reified R > UDFRegistration . register ( name : String , agg : Aggregator < T1 , * , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunction1 < T1 , R >","body":"= register ( udaf ( name , agg , nondeterministic ) )","docstring":"/**\n * Registers [agg] as a UDAF for SQL. Returns the UDAF as [NamedUserDefinedFunction].\n * Obtains a [NamedUserDefinedFunction1] that wraps the given [agg] so that it may be used with Data Frames.\n * @see UDFRegistration.register\n * @see functions.udaf\n *\n * @param agg the given [Aggregator] to convert into a UDAF. Can also be created using [aggregatorOf].\n * @param name Optional. Tries to obtain name from the class of [agg] if not supplied.\n * Use [udafUnnamed] if no name is wanted.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [NamedUserDefinedFunction1] that can be used as an aggregating expression\n */"} {"signature":"inline fun < reified T1 , reified R > UDFRegistration . register ( agg : Aggregator < T1 , * , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunction1 < T1 , R >","body":"= register ( udaf ( agg , nondeterministic ) )","docstring":"/**\n * Registers [agg] as a UDAF for SQL. Returns the UDAF as [NamedUserDefinedFunction].\n * Obtains a [NamedUserDefinedFunction1] that wraps the given [agg] so that it may be used with Data Frames.\n * @see UDFRegistration.register\n * @see functions.udaf\n *\n * @param agg the given [Aggregator] to convert into a UDAF. Can also be created using [aggregatorOf].\n * @param name Optional. Tries to obtain name from the class of [agg] if not supplied.\n * Use [udafUnnamed] if no name is wanted.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [NamedUserDefinedFunction1] that can be used as an aggregating expression\n */"} {"signature":"inline fun < reified IN , reified BUF , reified OUT > UDFRegistration . register ( name : String , noinline zero : ( ) -> BUF , noinline reduce : ( b : BUF , a : IN ) -> BUF , noinline merge : ( b1 : BUF , b2 : BUF ) -> BUF , noinline finish : ( reduction : BUF ) -> OUT , bufferEncoder : Encoder < BUF > = encoder ( ) , outputEncoder : Encoder < OUT > = encoder ( ) , nondeterministic : Boolean = false , ) : NamedUserDefinedFunction1 < IN , OUT >","body":"= register ( udaf ( name , zero , reduce , merge , finish , bufferEncoder , outputEncoder , nondeterministic ) )","docstring":"/**\n * Registers a UDAF for SQL based on the given arguments. Returns the UDAF as [NamedUserDefinedFunction].\n * Obtains a [NamedUserDefinedFunction1] that wraps the given [agg] so that it may be used with Data Frames.\n * @see UDFRegistration.register\n * @see functions.udaf\n *\n * @param name Optional. Name for the UDAF.\n * @param zero A zero value for this aggregation. Should satisfy the property that any b + zero = b.\n * @param reduce Combine two values to produce a new value. For performance, the function may modify `b` and\n * return it instead of constructing new object for b.\n * @param merge Merge two intermediate values.\n * @param finish Transform the output of the reduction.\n * @param bufferEncoder Optional. Specifies the `Encoder` for the intermediate value type.\n * @param outputEncoder Optional. Specifies the `Encoder` for the final output value type.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n *\n * @return a [NamedUserDefinedFunction1] that can be used as an aggregating expression.\n */"} {"signature":"@ Test fun testCleanupWithDynamicNonIncremental ( @ TempDir baseSourcesDir : File , @ TempDir outputDir : File , @ TempDir incrementalCacheDir : File , @ TempDir projectBaseDirFirstRun : File , @ TempDir projectBaseDirSecondRun : File )","body":"{ val sourcesDir = baseSourcesDir . resolve ( \"\" ) . also { base -> base . mkdir ( ) listOf ( \"\" , \"\" , \"\" ) . map { TEST_DATA_DIR . resolve ( it ) . copyTo ( base . resolve ( it ) ) } } val options = KaptOptions . Builder ( ) . apply { projectBaseDir = projectBaseDirFirstRun javaSourceRoots . add ( sourcesDir ) sourcesOutputDir = outputDir classesOutputDir = outputDir stubsOutputDir = outputDir incrementalDataOutputDir = outputDir incrementalCache = incrementalCacheDir } . build ( ) val logger = WriterBackedKaptLogger ( isVerbose = true ) KaptContext ( options , true , logger ) . use { it . doAnnotationProcessing ( options . collectJavaSourceFiles ( SourcesToReprocess . FullRebuild ) , listOf ( DynamicProcessor ( RuntimeProcType . NON_INCREMENTAL ) . toDynamic ( ) ) ) } val optionsForSecondRun = KaptOptions . Builder ( ) . apply { projectBaseDir = projectBaseDirSecondRun javaSourceRoots . add ( sourcesDir ) sourcesOutputDir = outputDir classesOutputDir = outputDir stubsOutputDir = outputDir incrementalDataOutputDir = outputDir incrementalCache = incrementalCacheDir changedFiles . add ( sourcesDir . resolve ( \"\" ) ) flags . add ( KaptFlag . INCREMENTAL_APT ) } . build ( ) KaptContext ( optionsForSecondRun , true , logger ) . use { assertEquals ( SourcesToReprocess . FullRebuild , it . sourcesToReprocess ) assertEquals ( listOf ( outputDir ) , outputDir . walkTopDown ( ) . toList ( ) ) it . doAnnotationProcessing ( optionsForSecondRun . collectJavaSourceFiles ( it . sourcesToReprocess ) , listOf ( DynamicProcessor ( RuntimeProcType . NON_INCREMENTAL ) . toDynamic ( ) ) ) } assertTrue ( outputDir . resolve ( \"\" ) . exists ( ) ) }","docstring":"/** Regression test for KT-31322. */"} {"signature":"private fun findInheritableSimpleNames ( typeElement : KtTypeElement ) : List < String >","body":"{ return when ( typeElement ) { is KtUserType -> { val referenceName = typeElement . referencedName ? : return emptyList ( ) buildList { add ( referenceName ) val ktFile = typeElement . containingKtFile if ( ! ktFile . isCompiled ) { addIfNotNull ( getImportedSimpleNameByImportAlias ( typeElement . containingKtFile , referenceName ) ) } } } is KtNullableType -> typeElement . innerType ? . let ( :: findInheritableSimpleNames ) ? : emptyList ( ) else -> emptyList ( ) } }","docstring":"/**\n * This is a simplified version of `KtTypeElement.index()` from the IDE. If we need to move more indexing code to Standalone, we should\n * consider moving more code from the IDE to the Analysis API.\n *\n * @see KotlinStaticDeclarationIndex.inheritableTypeAliasesByAliasedName\n */"} {"signature":"fun throwExceptionIfCompilationFailed ( exitCode : ExitCode , executionStrategy : KotlinCompilerExecutionStrategy )","body":"{ when ( exitCode ) { ExitCode . COMPILATION_ERROR -> throw CompilationErrorException ( \"\" ) ExitCode . INTERNAL_ERROR -> throw FailedCompilationException ( \"\" ) ExitCode . SCRIPT_EXECUTION_ERROR -> throw FailedCompilationException ( \"\" ) ExitCode . OOM_ERROR -> throw OOMErrorException ( executionStrategy ) ExitCode . OK -> Unit else -> throw IllegalStateException ( \"\" ) } }","docstring":"/** Throws [FailedCompilationException] if compilation completed with [exitCode] != [ExitCode.OK]. */"} {"signature":"internal fun wrapAndRethrowCompilationException ( executionStrategy : KotlinCompilerExecutionStrategy , e : Throwable ) : Nothing","body":"{ if ( e is OutOfMemoryError || e . hasOOMCause ( ) ) { throw OOMErrorException ( executionStrategy ) } else if ( e is RemoteException ) { throw DaemonCrashedException ( e ) } else { throw e } }","docstring":"/**\n * Wraps an exception occurred during compiler execution.\n * Covers the case when compiler invocation failed before returning any [ExitCode].\n * Always throws some kind of exception.\n */"} {"signature":"@ ExperimentalSerializationApi public fun decodeNotNullMark ( ) : Boolean","body":"@ ExperimentalSerializationApi public fun decodeNotNullMark ( ) : Boolean","docstring":"/**\n * Returns `true` if the current value in decoder is not null, false otherwise.\n * This method is usually used to decode potentially nullable data:\n * ```\n * // Could be String? deserialize() method\n * public fun deserialize(decoder: Decoder): String? {\n * if (decoder.decodeNotNullMark()) {\n * return decoder.decodeString()\n * } else {\n * return decoder.decodeNull()\n * }\n * }\n * ```\n */"} {"signature":"@ ExperimentalSerializationApi public fun decodeNull ( ) : Nothing ?","body":"@ ExperimentalSerializationApi public fun decodeNull ( ) : Nothing ?","docstring":"/**\n * Decodes the `null` value and returns it.\n *\n * It is expected that `decodeNotNullMark` was called\n * prior to `decodeNull` invocation and the case when it returned `true` was handled.\n */"} {"signature":"public fun decodeBoolean ( ) : Boolean","body":"public fun decodeBoolean ( ) : Boolean","docstring":"/**\n * Decodes a boolean value.\n * Corresponding kind is [PrimitiveKind.BOOLEAN].\n */"} {"signature":"public fun decodeByte ( ) : Byte","body":"public fun decodeByte ( ) : Byte","docstring":"/**\n * Decodes a single byte value.\n * Corresponding kind is [PrimitiveKind.BYTE].\n */"} {"signature":"public fun decodeShort ( ) : Short","body":"public fun decodeShort ( ) : Short","docstring":"/**\n * Decodes a 16-bit short value.\n * Corresponding kind is [PrimitiveKind.SHORT].\n */"} {"signature":"public fun decodeChar ( ) : Char","body":"public fun decodeChar ( ) : Char","docstring":"/**\n * Decodes a 16-bit unicode character value.\n * Corresponding kind is [PrimitiveKind.CHAR].\n */"} {"signature":"public fun decodeInt ( ) : Int","body":"public fun decodeInt ( ) : Int","docstring":"/**\n * Decodes a 32-bit integer value.\n * Corresponding kind is [PrimitiveKind.INT].\n */"} {"signature":"public fun decodeLong ( ) : Long","body":"public fun decodeLong ( ) : Long","docstring":"/**\n * Decodes a 64-bit integer value.\n * Corresponding kind is [PrimitiveKind.LONG].\n */"} {"signature":"public fun decodeFloat ( ) : Float","body":"public fun decodeFloat ( ) : Float","docstring":"/**\n * Decodes a 32-bit IEEE 754 floating point value.\n * Corresponding kind is [PrimitiveKind.FLOAT].\n */"} {"signature":"public fun decodeDouble ( ) : Double","body":"public fun decodeDouble ( ) : Double","docstring":"/**\n * Decodes a 64-bit IEEE 754 floating point value.\n * Corresponding kind is [PrimitiveKind.DOUBLE].\n */"} {"signature":"public fun decodeString ( ) : String","body":"public fun decodeString ( ) : String","docstring":"/**\n * Decodes a string value.\n * Corresponding kind is [PrimitiveKind.STRING].\n */"} {"signature":"public fun decodeEnum ( enumDescriptor : SerialDescriptor ) : Int","body":"public fun decodeEnum ( enumDescriptor : SerialDescriptor ) : Int","docstring":"/**\n * Decodes a enum value and returns its index in [enumDescriptor] elements collection.\n * Corresponding kind is [SerialKind.ENUM].\n *\n * E.g. for the enum `enum class Letters { A, B, C, D }` and\n * underlying input \"C\", [decodeEnum] method should return `2` as a result.\n *\n * This method does not imply any restrictions on the input format,\n * the format is free to store the enum by its name, index, ordinal or any other enum representation.\n */"} {"signature":"public fun decodeInline ( descriptor : SerialDescriptor ) : Decoder","body":"public fun decodeInline ( descriptor : SerialDescriptor ) : Decoder","docstring":"/**\n * Returns [Decoder] for decoding an underlying type of a value class in an inline manner.\n * [descriptor] describes a target value class.\n *\n * Namely, for the `@Serializable @JvmInline value class MyInt(val my: Int)`, the following sequence is used:\n * ```\n * thisDecoder.decodeInline(MyInt.serializer().descriptor).decodeInt()\n * ```\n *\n * Current decoder may return any other instance of [Decoder] class, depending on the provided [descriptor].\n * For example, when this function is called on `Json` decoder with\n * `UInt.serializer().descriptor`, the returned decoder is able to decode unsigned integers.\n *\n * Note that this function returns [Decoder] instead of the [CompositeDecoder]\n * because value classes always have the single property.\n *\n * Calling [Decoder.beginStructure] on returned instance leads to an unspecified behavior and, in general, is prohibited.\n */"} {"signature":"public fun beginStructure ( descriptor : SerialDescriptor ) : CompositeDecoder","body":"public fun beginStructure ( descriptor : SerialDescriptor ) : CompositeDecoder","docstring":"/**\n * Decodes the beginning of the nested structure in a serialized form\n * and returns [CompositeDecoder] responsible for decoding this very structure.\n *\n * Typically, classes, collections and maps are represented as a nested structure in a serialized form.\n * E.g. the following JSON\n * ```\n * {\n * \"a\": 2,\n * \"b\": { \"nested\": \"c\" }\n * \"c\": [1, 2, 3],\n * \"d\": null\n * }\n * ```\n * has three nested structures: the very beginning of the data, \"b\" value and \"c\" value.\n */"} {"signature":"public fun < T : Any ? > decodeSerializableValue ( deserializer : DeserializationStrategy < T > ) : T","body":"= deserializer . deserialize ( this )","docstring":"/**\n * Decodes the value of type [T] by delegating the decoding process to the given [deserializer].\n * For example, `decodeInt` call us equivalent to delegating integer decoding to [Int.serializer][Int.Companion.serializer]:\n * `decodeSerializableValue(IntSerializer)`\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T : Any > decodeNullableSerializableValue ( deserializer : DeserializationStrategy < T ? > ) : T ?","body":"= decodeIfNullable ( deserializer ) { decodeSerializableValue ( deserializer ) }","docstring":"/**\n * Decodes the nullable value of type [T] by delegating the decoding process to the given [deserializer].\n */"} {"signature":"public fun endStructure ( descriptor : SerialDescriptor )","body":"public fun endStructure ( descriptor : SerialDescriptor )","docstring":"/**\n * Denotes the end of the structure associated with current decoder.\n * For example, composite decoder of JSON format will expect (and parse)\n * a closing bracket in the underlying input.\n */"} {"signature":"@ ExperimentalSerializationApi public fun decodeSequentially ( ) : Boolean","body":"= false","docstring":"/**\n * Checks whether the current decoder supports strictly ordered decoding of the data\n * without calling to [decodeElementIndex].\n * If the method returns `true`, the caller might skip [decodeElementIndex] calls\n * and start invoking `decode*Element` directly, incrementing the index of the element one by one.\n * This method can be called by serializers (either generated or user-defined) as a performance optimization,\n * but there is no guarantee that the method will be ever called. Practically, it means that implementations\n * that may benefit from sequential decoding should also support a regular [decodeElementIndex]-based decoding as well.\n *\n * Example of usage:\n * ```\n * class MyPair(i: Int, d: Double)\n *\n * object MyPairSerializer : KSerializer {\n * // ... other methods omitted\n *\n * fun deserialize(decoder: Decoder): MyPair {\n * val composite = decoder.beginStructure(descriptor)\n * if (composite.decodeSequentially()) {\n * val i = composite.decodeIntElement(descriptor, index = 0) // Mind the sequential indexing\n * val d = composite.decodeIntElement(descriptor, index = 1)\n * composite.endStructure(descriptor)\n * return MyPair(i, d)\n * } else {\n * // Fallback to `decodeElementIndex` loop, refer to its documentation for details\n * }\n * }\n * }\n * ```\n * This example is a rough equivalent of what serialization plugin generates for serializable pair class.\n *\n * Sequential decoding is a performance optimization for formats with strictly ordered schema,\n * usually binary ones. Regular formats such as JSON or ProtoBuf cannot use this optimization,\n * because e.g. in the latter example, the same data can be represented both as\n * `{\"i\": 1, \"d\": 1.0}`\"` and `{\"d\": 1.0, \"i\": 1}` (thus, unordered).\n */"} {"signature":"public fun decodeElementIndex ( descriptor : SerialDescriptor ) : Int","body":"public fun decodeElementIndex ( descriptor : SerialDescriptor ) : Int","docstring":"/**\n * Decodes the index of the next element to be decoded.\n * Index represents a position of the current element in the serial descriptor element that can be found\n * with [SerialDescriptor.getElementIndex].\n *\n * If this method returns non-negative index, the caller should call one of the `decode*Element` methods\n * with a resulting index.\n * Apart from positive values, this method can return [DECODE_DONE] to indicate that no more elements\n * are left or [UNKNOWN_NAME] to indicate that symbol with an unknown name was encountered.\n *\n * Example of usage:\n * ```\n * class MyPair(i: Int, d: Double)\n *\n * object MyPairSerializer : KSerializer {\n * // ... other methods omitted\n *\n * fun deserialize(decoder: Decoder): MyPair {\n * val composite = decoder.beginStructure(descriptor)\n * var i: Int? = null\n * var d: Double? = null\n * while (true) {\n * when (val index = composite.decodeElementIndex(descriptor)) {\n * 0 -> i = composite.decodeIntElement(descriptor, 0)\n * 1 -> d = composite.decodeDoubleElement(descriptor, 1)\n * DECODE_DONE -> break // Input is over\n * else -> error(\"Unexpected index: $index)\n * }\n * }\n * composite.endStructure(descriptor)\n * require(i != null && d != null)\n * return MyPair(i, d)\n * }\n * }\n * ```\n * This example is a rough equivalent of what serialization plugin generates for serializable pair class.\n *\n * The need in such a loop comes from unstructured nature of most serialization formats.\n * For example, JSON for the following input `{\"d\": 2.0, \"i\": 1}`, will first read `d` key with index `1`\n * and only after `i` with the index `0`.\n *\n * A potential implementation of this method for JSON format can be the following:\n * ```\n * fun decodeElementIndex(descriptor: SerialDescriptor): Int {\n * // Ignore arrays\n * val nextKey: String? = myStringJsonParser.nextKey()\n * if (nextKey == null) return DECODE_DONE\n * return descriptor.getElementIndex(nextKey) // getElementIndex can return UNKNOWN_NAME\n * }\n * ```\n *\n * If [decodeSequentially] returns `true`, the caller might skip calling this method.\n */"} {"signature":"public fun decodeCollectionSize ( descriptor : SerialDescriptor ) : Int","body":"= - ","docstring":"/**\n * Method to decode collection size that may be called before the collection decoding.\n * Collection type includes [Collection], [Map] and [Array] (including primitive arrays).\n * Method can return `-1` if the size is not known in advance, though for [sequential decoding][decodeSequentially]\n * knowing precise size is a mandatory requirement.\n */"} {"signature":"public fun decodeBooleanElement ( descriptor : SerialDescriptor , index : Int ) : Boolean","body":"public fun decodeBooleanElement ( descriptor : SerialDescriptor , index : Int ) : Boolean","docstring":"/**\n * Decodes a boolean value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.BOOLEAN] kind.\n */"} {"signature":"public fun decodeByteElement ( descriptor : SerialDescriptor , index : Int ) : Byte","body":"public fun decodeByteElement ( descriptor : SerialDescriptor , index : Int ) : Byte","docstring":"/**\n * Decodes a single byte value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.BYTE] kind.\n */"} {"signature":"public fun decodeCharElement ( descriptor : SerialDescriptor , index : Int ) : Char","body":"public fun decodeCharElement ( descriptor : SerialDescriptor , index : Int ) : Char","docstring":"/**\n * Decodes a 16-bit unicode character value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.CHAR] kind.\n */"} {"signature":"public fun decodeShortElement ( descriptor : SerialDescriptor , index : Int ) : Short","body":"public fun decodeShortElement ( descriptor : SerialDescriptor , index : Int ) : Short","docstring":"/**\n * Decodes a 16-bit short value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.SHORT] kind.\n */"} {"signature":"public fun decodeIntElement ( descriptor : SerialDescriptor , index : Int ) : Int","body":"public fun decodeIntElement ( descriptor : SerialDescriptor , index : Int ) : Int","docstring":"/**\n * Decodes a 32-bit integer value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.INT] kind.\n */"} {"signature":"public fun decodeLongElement ( descriptor : SerialDescriptor , index : Int ) : Long","body":"public fun decodeLongElement ( descriptor : SerialDescriptor , index : Int ) : Long","docstring":"/**\n * Decodes a 64-bit integer value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.LONG] kind.\n */"} {"signature":"public fun decodeFloatElement ( descriptor : SerialDescriptor , index : Int ) : Float","body":"public fun decodeFloatElement ( descriptor : SerialDescriptor , index : Int ) : Float","docstring":"/**\n * Decodes a 32-bit IEEE 754 floating point value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.FLOAT] kind.\n */"} {"signature":"public fun decodeDoubleElement ( descriptor : SerialDescriptor , index : Int ) : Double","body":"public fun decodeDoubleElement ( descriptor : SerialDescriptor , index : Int ) : Double","docstring":"/**\n * Decodes a 64-bit IEEE 754 floating point value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.DOUBLE] kind.\n */"} {"signature":"public fun decodeStringElement ( descriptor : SerialDescriptor , index : Int ) : String","body":"public fun decodeStringElement ( descriptor : SerialDescriptor , index : Int ) : String","docstring":"/**\n * Decodes a string value from the underlying input.\n * The resulting value is associated with the [descriptor] element at the given [index].\n * The element at the given index should have [PrimitiveKind.STRING] kind.\n */"} {"signature":"public fun decodeInlineElement ( descriptor : SerialDescriptor , index : Int ) : Decoder","body":"public fun decodeInlineElement ( descriptor : SerialDescriptor , index : Int ) : Decoder","docstring":"/**\n * Returns [Decoder] for decoding an underlying type of a value class in an inline manner.\n * Serializable value class is described by the [child descriptor][SerialDescriptor.getElementDescriptor]\n * of given [descriptor] at [index].\n *\n * Namely, for the `@Serializable @JvmInline value class MyInt(val my: Int)`,\n * and `@Serializable class MyData(val myInt: MyInt)` the following sequence is used:\n * ```\n * thisDecoder.decodeInlineElement(MyData.serializer().descriptor, 0).decodeInt()\n * ```\n *\n * This method provides an opportunity for the optimization to avoid boxing of a carried value\n * and its invocation should be equivalent to the following:\n * ```\n * thisDecoder.decodeSerializableElement(MyData.serializer.descriptor, 0, MyInt.serializer())\n * ```\n *\n * Current decoder may return any other instance of [Decoder] class, depending on the provided descriptor.\n * For example, when this function is called on `Json` decoder with descriptor that has\n * `UInt.serializer().descriptor` at the given [index], the returned decoder is able\n * to decode unsigned integers.\n *\n * Note that this function returns [Decoder] instead of the [CompositeDecoder]\n * because value classes always have the single property.\n * Calling [Decoder.beginStructure] on returned instance leads to an unspecified behavior and, in general, is prohibited.\n *\n * @see Decoder.decodeInline\n * @see SerialDescriptor.getElementDescriptor\n */"} {"signature":"public fun < T : Any ? > decodeSerializableElement ( descriptor : SerialDescriptor , index : Int , deserializer : DeserializationStrategy < T > , previousValue : T ? = null ) : T","body":"public fun < T : Any ? > decodeSerializableElement ( descriptor : SerialDescriptor , index : Int , deserializer : DeserializationStrategy < T > , previousValue : T ? = null ) : T","docstring":"/**\n * Decodes value of the type [T] with the given [deserializer].\n *\n * Implementations of [CompositeDecoder] may use their format-specific deserializers\n * for particular data types, e.g. handle [ByteArray] specifically if format is binary.\n *\n * If value at given [index] was already decoded with previous [decodeSerializableElement] call with the same index,\n * [previousValue] would contain a previously decoded value.\n * This parameter can be used to aggregate multiple values of the given property to the only one.\n * Implementation can safely ignore it and return a new value, effectively using 'the last one wins' strategy,\n * or apply format-specific aggregating strategies, e.g. appending scattered Protobuf lists to a single one.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T : Any > decodeNullableSerializableElement ( descriptor : SerialDescriptor , index : Int , deserializer : DeserializationStrategy < T ? > , previousValue : T ? = null ) : T ?","body":"@ ExperimentalSerializationApi public fun < T : Any > decodeNullableSerializableElement ( descriptor : SerialDescriptor , index : Int , deserializer : DeserializationStrategy < T ? > , previousValue : T ? = null ) : T ?","docstring":"/**\n * Decodes nullable value of the type [T] with the given [deserializer].\n *\n * If value at given [index] was already decoded with previous [decodeSerializableElement] call with the same index,\n * [previousValue] would contain a previously decoded value.\n * This parameter can be used to aggregate multiple values of the given property to the only one.\n * Implementation can safely ignore it and return a new value, efficiently using 'the last one wins' strategy,\n * or apply format-specific aggregating strategies, e.g. appending scattered Protobuf lists to a single one.\n */"} {"signature":"public inline fun < T > Decoder . decodeStructure ( descriptor : SerialDescriptor , crossinline block : CompositeDecoder . ( ) -> T ) : T","body":"{ val composite = beginStructure ( descriptor ) val result = composite . block ( ) composite . endStructure ( descriptor ) return result }","docstring":"/**\n * Begins a structure, decodes it using the given [block], ends it and returns decoded element.\n */"} {"signature":"fun x ( )","body":"{ }","docstring":"/**\n * [kotlin.collections.listOf]\n */"} {"signature":"private fun isReceiverAncestor ( descriptor : DeclarationDescriptor ) : Boolean","body":"{ if ( descriptor !is ReceiverParameterDescriptor ) return false if ( containingDescriptor !is ClassDescriptor && containingDescriptor !is ConstructorDescriptor ) return false val containingClass = getParentOfType ( containingDescriptor , ClassDescriptor :: class . java , false ) ? : return false val currentClass = descriptor . containingDeclaration as? ClassDescriptor ? : return false for ( outerDeclaration in generateSequence ( containingClass ) { it . containingDeclaration as? ClassDescriptor } ) { if ( outerDeclaration == currentClass ) return true } return false }","docstring":"/**\n * We shouldn't capture current `this` or outer `this`. Assuming `C` is current translating class,\n * we have `descriptor == A::this` in the following cases:\n * * `A == C`\n * * `C` in inner class of `A`\n * * `A <: C`\n * * among outer classes of `C` there is `T` such that `A <: T`\n *\n * If fact, the latter case is the generalization of all previous cases, assuming that `is inner class of` and `<:` relations\n * are reflective. All this cases allow to refer to `this` directly or via sequence of `outer` fields.\n *\n * Note that the continuous sequence of inner classes may be interrupted by non-class descriptor. This means that\n * the last class of the sequence if a local class. We stop there, since this means that the next class in the sequence\n * is referred by closure variable rather than by dedicated `$outer` field.\n *\n * The nested classes are out of scope, since nested class can't refer to outer's class `this`, thus frontend will\n * never generate ReceiverParameterDescriptor for this case.\n */"} {"signature":"private fun isSingletonReceiver ( descriptor : DeclarationDescriptor ) : Boolean","body":"{ if ( descriptor !is ReceiverParameterDescriptor ) return false val container = descriptor . containingDeclaration if ( ! DescriptorUtils . isObject ( container ) ) return false if ( containingDescriptor !is ClassDescriptor ) { val containingClass = getParentOfType ( containingDescriptor , ClassDescriptor :: class . java , false ) if ( containingClass == container ) return false } return true }","docstring":"/**\n * Test for the case like this:\n *\n * ```\n * object A {\n * var x: Int\n *\n * class B {\n * fun foo() {\n * { x }\n * }\n * }\n * }\n * ```\n *\n * We don't want to capture `A::this`, since we always can refer A by its FQN\n */"} {"signature":"public fun isApplicable ( customTag : CustomTagWrapper ) : Boolean","body":"public fun isApplicable ( customTag : CustomTagWrapper ) : Boolean","docstring":"/**\n * Whether this content provider supports given [CustomTagWrapper].\n *\n * Tags can be filtered out either by name or by nested [DocTag] type\n */"} {"signature":"public fun DocumentableContentBuilder . contentForDescription ( sourceSet : DokkaSourceSet , customTag : CustomTagWrapper )","body":"{ }","docstring":"/**\n * Full blown content description, most likely to be on a separate page\n * dedicated to just one element (i.e one class/function), so any\n * amount of detail should be fine.\n */"} {"signature":"public fun DocumentableContentBuilder . contentForBrief ( sourceSet : DokkaSourceSet , customTag : CustomTagWrapper )","body":"{ }","docstring":"/**\n * Brief comment section, usually displayed as a summary/preview.\n *\n * For instance, when listing all functions of a class on one page,\n * it'll be too much to display complete documentation for each function.\n * Instead, a small brief is shown for each one (i.e the first paragraph\n * or some other important information) - the user can go to the dedicated\n * page for more details if they find the brief interesting.\n *\n * Tag-wise, it would make sense to include `Since Kotlin`, since it's\n * important information for the users of stdlib. It would make little\n * sense to include `@usesMathjax` here, as this information seems\n * to be more specific and detailed than is needed for a brief.\n */"} {"signature":"public fun < T > symbol ( column : ColumnReference < T > , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Symbol >","body":"{ return addNonPositionalMapping < T , Symbol > ( SHAPE , column . name ( ) , LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the symbol aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the symbol.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > symbol ( column : KProperty < T > , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Symbol >","body":"{ return addNonPositionalMapping < T , Symbol > ( SHAPE , column . name , LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the symbol aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the symbol.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun symbol ( column : String , parameters : LetsPlotNonPositionalMappingParametersCategorical < Any ? , Symbol > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , Symbol >","body":"{ return addNonPositionalMapping ( SHAPE , column , LetsPlotNonPositionalMappingParametersCategorical < Any ? , Symbol > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the symbol aesthetic to a data column by [String].\n *\n * @param column the data column to map to the symbol.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > symbol ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Symbol >","body":"{ return addNonPositionalMapping ( SHAPE , values . toList ( ) , name , LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the symbol aesthetic to iterable of values.\n *\n * @param values the iterable containing the categorical values.\n * @param name optional name for this aesthetic mapping.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > symbol ( values : DataColumn < T > , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Symbol >","body":"{ return addNonPositionalMapping ( SHAPE , values , LetsPlotNonPositionalMappingParametersCategorical < T , Symbol > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the symbol aesthetic to a data column.\n *\n * @param values the data column to map to the symbol.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public abstract fun < T : InferenceModel < * > , U > loadModel ( modelType : ModelType < T , U > , loadingMode : LoadingMode = LoadingMode . SKIP_LOADING_IF_EXISTS ) : T","body":"public abstract fun < T : InferenceModel < * > , U > loadModel ( modelType : ModelType < T , U > , loadingMode : LoadingMode = LoadingMode . SKIP_LOADING_IF_EXISTS ) : T","docstring":"/**\n * Loads model configuration without weights.\n *\n * @param [modelType] This unique identifier defines the way to the S3 bucket with the model and its weights and the local directory for the model and its weights.\n * @param [loadingMode] Strategy of existing model use-case handling.\n * @return Raw model without weights. Needs in compilation and weights loading before usage.\n */"} {"signature":"public fun < T : InferenceModel < * > , U > loadPretrainedModel ( modelType : ModelType < T , U > , loadingMode : LoadingMode = LoadingMode . SKIP_LOADING_IF_EXISTS ) : U","body":"{ return modelType . pretrainedModel ( this ) }","docstring":"/**\n * Loads pretrained model of [modelType] from the ModelHub in [loadingMode].\n *\n * @param [modelType] This unique identifier defines the way to the S3 bucket with the model and its weights and the local directory for the model and its weights.\n * @param [loadingMode] Strategy of existing model use-case handling.\n * @return Pretrained model.\n */"} {"signature":"public operator fun < T : InferenceModel < * > , U > get ( modelType : ModelType < T , U > ) : U","body":"{ return loadPretrainedModel ( modelType = modelType ) }","docstring":"/**\n * This operator equivalent to [loadPretrainedModel].\n */"} {"signature":"public fun cleanupTestCoroutines ( )","body":"public fun cleanupTestCoroutines ( )","docstring":"/**\n * Call after the test completes to ensure that there were no uncaught exceptions.\n *\n * The first exception in uncaughtExceptions is rethrown. All other exceptions are\n * printed using [Throwable.printStackTrace].\n *\n * @throws Throwable the first uncaught exception, if there are any uncaught exceptions.\n */"} {"signature":"public fun Source . asNSInputStream ( ) : NSInputStream","body":"= SourceNSInputStream ( this )","docstring":"/**\n * Returns an input stream that reads from this source. Closing the stream will also close this source.\n *\n * The stream supports both polling and run-loop scheduling, please check\n * [Apple's documentation](https://developer.apple.com/library/archive/documentation/Cocoa/Conceptual/Streams/Articles/PollingVersusRunloop.html)\n * for information about stream events handling.\n *\n * The stream does not implement initializers\n * ([NSInputStream.initWithURL](https://developer.apple.com/documentation/foundation/nsinputstream/1417891-initwithurl),\n * [NSInputStream.initWithData](https://developer.apple.com/documentation/foundation/nsinputstream/1412470-initwithdata),\n * [NSInputStream.initWithFileAtPath](https://developer.apple.com/documentation/foundation/nsinputstream/1408976-initwithfileatpath)),\n * their use will result in a runtime error.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesApple.asStream\n */"} {"signature":"protected fun computeOutputShape ( inputShape : Shape ) : Shape","body":"{ val shapes = ( kernelSize . indices ) . map { convTransposeOutputLength ( inputShape . size ( it + ) , kernelSize [ it ] , padding , outputPadding ? . get ( * ( it + ) ) , outputPadding ? . get ( * ( it + ) + ) , strides [ it + ] , dilations [ it + ] ) } return Shape . make ( inputShape . size ( ) , * ( shapes + filters . toLong ( ) ) . toLongArray ( ) ) }","docstring":"/**\n * Computes the output shape of the layer given the input shape.\n */"} {"signature":"internal fun IntArray . withStandardPadding ( padding : ConvPadding , kernelSize : IntArray , dilations : IntArray ) : IntArray","body":"{ val withStandardPadding = kernelSize . indices . flatMap { dim -> convTransposePadding ( padding , this [ * dim ] , this [ * dim + ] , kernelSize [ dim ] , dilations [ dim + ] ) } return intArrayOf ( , , * ( withStandardPadding . toIntArray ( ) ) , , ) }","docstring":"/**\n * Combines explicitly provided padding value with the standard padding from the provided padding method.\n * This is needed since [org.tensorflow.op.NnOps.conv2dBackpropInput] function does not support specifying\n * both padding method and explicit output padding at the same time.\n */"} {"signature":"internal fun buildOptions ( dilations : IntArray , outputPadding : IntArray ? ) : Array < Conv2dBackpropInput . Options >","body":"{ val options = mutableListOf ( Conv2dBackpropInput . dilations ( dilations . toLongList ( ) ) ) if ( outputPadding != null ) { options . add ( Conv2dBackpropInput . explicitPaddings ( outputPadding . toLongList ( ) ) ) } return options . map { it . dataFormat ( \"\" ) } . toTypedArray ( ) }","docstring":"/**\n * Builds options to pass dilations and output padding to the [org.tensorflow.op.NnOps.conv2dBackpropInput].\n */"} {"signature":"internal fun Ops . shapeWithDynamicBatchSize ( tensorShape : TensorShape , input : Operand < Float > ) : Operand < Int >","body":"{ val batchSize = squeeze ( slice ( shape ( input ) , constant ( intArrayOf ( ) ) , constant ( intArrayOf ( ) ) ) ) val otherDims = tensorShape . dims ( ) . toList ( ) . drop ( ) . map { constant ( it . toInt ( ) ) } return stack ( listOf ( batchSize ) + otherDims ) }","docstring":"/**\n * Creates an integer vector with the contents of [tensorShape], except for the first dimension (batch size):\n * batch size from the [input] is used instead.\n * This is needed as [org.tensorflow.op.NnOps.conv2dBackpropInput] and [org.tensorflow.op.NnOps.conv3dBackpropInput]\n * need to have an exact shape provided, including batch size.\n * Typically, when the layer is built, batch size is not known and [tensorShape] contains a \"-1\" instead.\n * This why here a first value of the [input] shape is used, which is going to be known at runtime.\n * See also [https://github.com/tensorflow/tensorflow/issues/833](https://github.com/tensorflow/tensorflow/issues/833)\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) fun getCell ( id : Int ) : CodeCell","body":"@ Throws ( IndexOutOfBoundsException :: class ) fun getCell ( id : Int ) : CodeCell","docstring":"/**\n * Mapping allowing to get cell by execution number\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) fun getResult ( id : Int ) : Any ?","body":"@ Throws ( IndexOutOfBoundsException :: class ) fun getResult ( id : Int ) : Any ?","docstring":"/**\n * Mapping allowing to get result by execution number\n */"} {"signature":"fun getAllDisplays ( ) : List < DisplayResultWithCell >","body":"fun getAllDisplays ( ) : List < DisplayResultWithCell >","docstring":"/**\n * Information about all display data objects\n */"} {"signature":"fun getDisplaysById ( id : String ? ) : List < DisplayResultWithCell >","body":"fun getDisplaysById ( id : String ? ) : List < DisplayResultWithCell >","docstring":"/**\n * Information about displays with the given [id]\n */"} {"signature":"fun history ( before : Int ) : CodeCell ?","body":"fun history ( before : Int ) : CodeCell ?","docstring":"/**\n * Get cell by relative offset: 0 for current cell,\n * 1 for previous cell, and so on\n *\n * @param before Relative offset\n * @return Cell from history\n */"} {"signature":"fun changeColorScheme ( newScheme : ColorScheme )","body":"fun changeColorScheme ( newScheme : ColorScheme )","docstring":"/**\n * Change color scheme and run callbacks. Works correctly only in Kotlin Notebook plugin\n */"} {"signature":"fun renderHtmlAsIFrame ( data : HtmlData ) : MimeTypedResult","body":"fun renderHtmlAsIFrame ( data : HtmlData ) : MimeTypedResult","docstring":"/**\n * Renders HTML as iframe that fixes scrolling and color scheme issues in Kotlin Notebook plugin\n */"} {"signature":"public fun toRawFloatArray ( image : BufferedImage , colorMode : ColorMode ? = null ) : FloatArray","body":"{ return imageToFloatArray ( image , colorMode ) }","docstring":"/**\n * Converts [image] to [FloatArray] without normalization.\n *\n * @param [image] image to convert\n * @param [colorMode] color mode to convert the image to. `null` value keeps the original color mode.\n * @return [FloatArray] with pixel values in the `[0, 255]` range\n * */"} {"signature":"public fun toRawFloatArray ( inputStream : InputStream , colorMode : ColorMode ? = null ) : FloatArray","body":"{ return toRawFloatArray ( toBufferedImage ( inputStream ) , colorMode ) }","docstring":"/**\n * Reads the image from [inputStream] and converts it to [FloatArray] without normalization.\n *\n * @param [inputStream] source of the image to convert\n * @param [colorMode] color mode to convert the image to. `null` value keeps the original color mode.\n * @return [FloatArray] with pixel values in `[0, 255]` range\n * */"} {"signature":"public fun toRawFloatArray ( imageFile : File , colorMode : ColorMode ? = null ) : FloatArray","body":"{ return imageFile . inputStream ( ) . use { toRawFloatArray ( it , colorMode ) } }","docstring":"/**\n * Reads the image from [imageFile] and converts it to [FloatArray] without normalization.\n *\n * @param [imageFile] source of the image to convert\n * @param [colorMode] color mode to convert the image to. `null` value keeps the original color mode.\n * @return [FloatArray] with pixel values in the `[0, 255]` range\n * */"} {"signature":"public fun toNormalizedFloatArray ( image : BufferedImage , colorMode : ColorMode ? = null ) : FloatArray","body":"{ return toRawFloatArray ( image , colorMode ) . also { normalize ( it ) } }","docstring":"/**\n * Converts [image] to [FloatArray] and scales the values, so they would fit into the `[0, 1)` range.\n *\n * @param [image] image to convert\n * @param [colorMode] color mode to convert the image to. `null` value keeps the original color mode.\n * @return [FloatArray] with pixel values in the `[0, 1)` range\n * */"} {"signature":"public fun toNormalizedFloatArray ( inputStream : InputStream , colorMode : ColorMode ? = null ) : FloatArray","body":"{ return toNormalizedFloatArray ( toBufferedImage ( inputStream ) , colorMode ) }","docstring":"/**\n * Reads the image from [inputStream], converts it to [FloatArray] and scales the values,\n * so they would fit into the `[0, 1)` range.\n *\n * @param [inputStream] source of the image to convert\n * @param [colorMode] color mode to convert the image to. `null` value keeps the original color mode.\n * @return [FloatArray] with pixel values in the `[0, 1)` range\n * */"} {"signature":"public fun toNormalizedFloatArray ( imageFile : File , colorMode : ColorMode ? = null ) : FloatArray","body":"{ return imageFile . inputStream ( ) . use { toNormalizedFloatArray ( it , colorMode ) } }","docstring":"/**\n * Reads the image from [imageFile], converts it to [FloatArray] and scales the values,\n * so they would fit into the `[0, 1)` range.\n *\n * @param [imageFile] source of the image to convert\n * @param [colorMode] color mode to convert the image to. `null` value keeps the original color mode.\n * @return [FloatArray] with pixel values in the `[0, 1)` range\n * */"} {"signature":"@ Throws ( IOException :: class ) public fun toBufferedImage ( inputStream : InputStream ) : BufferedImage","body":"{ ImageIO . setUseCache ( false ) return ImageIO . read ( inputStream ) }","docstring":"/**\n * Returns [BufferedImage] extracted from [inputStream].\n *\n * @param [inputStream] source of the image\n */"} {"signature":"@ Throws ( IOException :: class ) public fun toBufferedImage ( file : File ) : BufferedImage","body":"{ return file . inputStream ( ) . use { inputStream -> toBufferedImage ( inputStream ) } }","docstring":"/**\n * Returns [BufferedImage] extracted from [file].\n *\n * @param [file] source of the image\n */"} {"signature":"public fun swapRandB ( image : FloatArray )","body":"{ for ( i in image . indices step ) { val tmp = image [ i ] image [ i ] = image [ i + ] image [ i + ] = tmp } }","docstring":"/**\n * Given a float array representing an image, swaps red and green channels in it.\n *\n * @param [image] image to swap channels in\n */"} {"signature":"public fun imageTo3DFloatArray ( image : BufferedImage , colorMode : ColorMode = ColorMode . BGR ) : Array < Array < FloatArray > >","body":"{ val pixels = ( image . raster . dataBuffer as DataBufferByte ) . data val width = image . width val height = image . height val hasAlphaChannel = image . alphaRaster != null val lastDimensions = if ( hasAlphaChannel ) else val result = Array ( height ) { Array ( width ) { FloatArray ( lastDimensions ) } } if ( hasAlphaChannel ) { val pixelLength = var pixel = var row = var col = while ( pixel < pixels . size ) { result [ row ] [ col ] [ ] = ( pixels [ pixel ] . toInt ( ) and shl ) . toFloat ( ) result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and ) . toFloat ( ) if ( colorMode == ColorMode . RGB ) { result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) } else { result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) } col ++ if ( col == width ) { col = row ++ } pixel += pixelLength } } else { val pixelLength = var pixel = var row = var col = while ( pixel < pixels . size ) { result [ row ] [ col ] [ ] = ( pixels [ pixel ] . toInt ( ) and ) . toFloat ( ) if ( colorMode == ColorMode . RGB ) { result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) } else { result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) result [ row ] [ col ] [ ] = ( pixels [ pixel + ] . toInt ( ) and shl ) . toFloat ( ) } col ++ if ( col == width ) { col = row ++ } pixel += pixelLength } } return result }","docstring":"/**\n * Converts [image] with [colorMode] to the 3D array.\n *\n * @param [image] image to convert\n * @param [colorMode] color mode used in the target array\n * @return a 3D array with the image in a format `height x width x channels`\n * */"} {"signature":"public fun floatArrayToBufferedImage ( inputArray : FloatArray , outputShape : TensorShape , arrayColorMode : ColorMode , isNormalized : Boolean ) : BufferedImage","body":"{ return floatArrayToBufferedImage ( inputArray , outputShape [ ] . toInt ( ) , outputShape [ ] . toInt ( ) , arrayColorMode , isNormalized ) }","docstring":"/**\n * Converts [inputArray] of type [FloatArray] to [BufferedImage] with [outputShape] provided.\n *\n * The output [BufferedImage] will have the same ColorMode as [arrayColorMode] of an input tensor.\n *\n * If [isNormalized] is true, then [inputArray] values considered to be in [0..1) interval\n * and will be rescaled to [0..255) interval. Values that are outside this range are clamped\n * to avoid artifacts on the image.\n *\n * If an array requires custom processing, one can use method variation that accepts [ArrayTransform].\n *\n * @param [inputArray] float array to convert.\n * @param [outputShape] shape of the output image.\n * @param [arrayColorMode] [ColorMode] of an [inputArray].\n * @param [isNormalized] [Boolean] that indicates [inputArray] should be rescaled to [0..255) interval.\n * @return [BufferedImage] result image.\n * */"} {"signature":"public fun floatArrayToBufferedImage ( inputArray : FloatArray , width : Int , height : Int , arrayColorMode : ColorMode , isNormalized : Boolean ) : BufferedImage","body":"{ return floatArrayToBufferedImage ( inputArray , width , height , arrayColorMode ) { if ( isNormalized ) denormalizeInplace ( it , scale = ) for ( ( i , value ) in it . withIndex ( ) ) { if ( value < ) it [ i ] = if ( value > ) it [ i ] = } it } }","docstring":"/**\n * Converts [inputArray] of type [FloatArray] to [BufferedImage] with [width] and [height] provided.\n *\n * The output [BufferedImage] will have the same ColorMode as [arrayColorMode] of an input tensor.\n *\n * If [isNormalized] is true, then [inputArray] values considered to be in [0..1) interval\n * and will be rescaled to [0..255) interval. Values that are outside this range are clamped\n * to avoid artifacts on the image.\n *\n * If an array requires custom processing, one can use method variation that accepts [ArrayTransform].\n *\n * @param [inputArray] float array to convert.\n * @param [width] width of the output image.\n * @param [height] height of the output image.\n * @param [arrayColorMode] [ColorMode] of an [inputArray].\n * @param [isNormalized] [Boolean] that indicates [inputArray] should be rescaled to [0..255) interval.\n * @return [BufferedImage] result image.\n * */"} {"signature":"public fun floatArrayToBufferedImage ( inputArray : FloatArray , width : Int , height : Int , arrayColorMode : ColorMode , arrayTransform : ArrayTransform ? = null ) : BufferedImage","body":"{ val dataCopy = arrayTransform ? . invoke ( inputArray . copyOf ( ) ) ? : inputArray . copyOf ( ) require ( width * height * arrayColorMode . channels == dataCopy . size ) { \"\" } if ( arrayColorMode == ColorMode . BGR ) { swapRandB ( dataCopy ) } val output = BufferedImage ( width , height , arrayColorMode . imageType ( ) ) output . raster . setPixels ( , , output . width , output . height , dataCopy ) return output }","docstring":"/**\n * Converts [inputArray] of type [FloatArray] to [BufferedImage] with [width] and [height] provided.\n * If a custom [arrayTransform] is needed, lambda or ArrayTransform can be provided.\n *\n * The output [BufferedImage] will have the same ColorMode as [arrayColorMode] of an input tensor.\n *\n * If an [arrayTransform] is given, then [arrayColorMode] is interpreted as a color mode of an array after transform.\n *\n * [inputArray] is explicitly copied before applying [arrayTransform].\n *\n * @see ArrayTransform\n *\n * @param [inputArray] float array to convert.\n * @param [width] shape of the output image.\n * @param [height] height of the output image.\n * @param [arrayColorMode] [ColorMode] of an [inputArray].\n * @param [arrayTransform] [ArrayTransform] implementation.\n * Thanks to Kotlin SAM convention it can be supplied as [(FloatArray) -> FloatArray] lambda.\n * @return [BufferedImage] result image.\n * */"} {"signature":"public fun ColorMode . imageType ( ) : Int","body":"{ return when ( this ) { ColorMode . RGB -> BufferedImage . TYPE_INT_RGB ColorMode . BGR -> BufferedImage . TYPE_3BYTE_BGR ColorMode . GRAYSCALE -> BufferedImage . TYPE_BYTE_GRAY } }","docstring":"/**\n * Returns an integer representing a type of [BufferedImage] corresponding to this color mode.\n */"} {"signature":"internal fun < T > projectStoredProperty ( initializer : Project . ( ) -> T ) : ReadOnlyProperty < Project , T >","body":"= StoredLazyProperty ( storage = { storedPropertyStorage } , initializer = initializer )","docstring":"/**\n * ### Generic mechanism of attaching 'data' to [Project]\n * #### e.g. attaching a simple property to a [Project]\n * ```kotlin\n * class Foo(val projectName: String)\n *\n * val Project.myFoo by projectStoredProperty {\n * Foo(project.name)\n * }\n * ```\n *\n * _Usage in Project 'a'_\n *\n * ```kotlin\n * class MyPlugin : Plugin {\n * fun apply(project: Project) {\n * // prints 'Foo(\"a\")'\n * println(project.myFoo)\n * }\n * }\n * ```\n * _Usage in Project 'b'_\n *\n * ```kotlin\n * class MyPlugin : Plugin {\n * fun apply(project: Project) {\n * // prints 'Foo(\"b\")'\n * println(project.myFoo)\n * }\n * }\n * ```\n *\n * ### Note:\n * The key used for storing the property to the [Project] is the instance of the returned [ReadOnlyProperty],\n * *not* the type, or any String based key\n *\n */"} {"signature":"internal fun < R : HasMutableExtras , T > extrasStoredProperty ( initializer : R . ( ) -> T ) : ReadOnlyProperty < R , T >","body":"= StoredLazyProperty ( storage = { storedPropertyStorage } , initializer = initializer )","docstring":"/**\n * Same as [projectStoredProperty], but will allow storing the property on any object implementing [HasMutableExtras]\n */"} {"signature":"fun dumpLibrary ( library : KotlinLibrary , testMode : Boolean )","body":"{ val moduleMetadata = loadModuleMetadata ( library ) . let { originalModuleMetadata -> if ( testMode ) preprocessMetadataForTests ( originalModuleMetadata ) else originalModuleMetadata } val signatureComputer = prepareSignatureComputer ( library , moduleMetadata ) KlibKotlinp ( Settings ( isVerbose = true , sortDeclarations = testMode ) , signatureComputer ) . renderModule ( moduleMetadata , printer ) }","docstring":"/**\n * @param testMode if `true` then a special pre-processing is performed towards the metadata before rendering:\n * - empty package fragments are removed\n * - package fragments with the same package FQN are merged\n * - classes are sorted in alphabetical order\n */"} {"signature":"private fun KtFile . facadeIsPossible ( ) : Boolean","body":"= when { isCompiled && ! name . endsWith ( \"\" ) -> false isScript ( ) -> false canHaveAdditionalFilesInFacade ( ) -> true else -> hasTopLevelCallables ( ) }","docstring":"/**\n * lightweight applicability check\n */"} {"signature":"fun open ( ) : CompositeMetadataArtifactContent","body":"fun open ( ) : CompositeMetadataArtifactContent","docstring":"/**\n * Provides access to the actual content provided by this artifact.\n * Note: [CompositeMetadataArtifactContent] is [Closeable] and might actively open Files on access.\n * A [Closeable.close] call is required.\n *\n * Alternatively use the [read] function instead.\n */"} {"signature":"fun exists ( ) : Boolean","body":"fun exists ( ) : Boolean","docstring":"/**\n * Checks if physical files are present on disk\n */"} {"signature":"internal inline fun < T > CompositeMetadataArtifact . read ( action : ( artifactContent : CompositeMetadataArtifactContent ) -> T ) : T","body":"{ return open ( ) . use ( action ) }","docstring":"/**\n * Safe shortcut function for opening and reading the content of this artifact.\n * The [CompositeMetadataArtifactContent] will be closed after the [action] executed.\n */"} {"signature":"fun copyTo ( file : File ) : Boolean","body":"fun copyTo ( file : File ) : Boolean","docstring":"/**\n * Copies the content of this [Binary] directly into the given [file].\n * The [file] will be overwritten when it already exists.\n * Parent directories will be created if necessary.\n */"} {"signature":"fun copyIntoDirectory ( directory : File )","body":"= copyTo ( directory . resolve ( relativeFile ) )","docstring":"/**\n * Copies the content of this [Binary] into the [directory] appending the [relativeFile] to it.\n * @see copyTo\n */"} {"signature":"fun MultifileClass ( representativeFile : KtFile ? , descriptor : PackageFragmentDescriptor ) : JvmDeclarationOrigin","body":"= JvmDeclarationOrigin ( MULTIFILE_CLASS , representativeFile , descriptor )","docstring":"/**\n * @param representativeFile one of the files representing this multifile class (will be used for diagnostics)\n */"} {"signature":"public fun < T : Comparable < T > > checkInRange ( aes : Aes , value : T , range : ClosedRange < T > ) : Unit","body":"= require ( value in range ) { \"\" }","docstring":"/**\n * Checks if a given value for an aesthetic (aes) lies within a specified range.\n * Throws an exception if the value is outside the range.\n *\n * @param T The type of the value which should be comparable.\n * @param aes The aesthetic whose value is being checked.\n * @param value The actual value of the aesthetic.\n * @param range The permissible range for the aesthetics's value.\n *\n * @throws IllegalArgumentException If the provided aesthetic value is not within the specified range.\n */"} {"signature":"public fun checkRequiredAes ( requiredAes : Set < Aes > , layerContext : LayerContextInterface , plotContext : PlotContext ? )","body":"{ val layerAssignedAes : Set < Aes > = with ( layerContext . bindingCollector ) { mappings . keys + settings . keys } val plotAssignedAes : Set < Aes > ? = plotContext ? . bindingCollector ? . run { mappings . keys + settings . keys } val assignedAes : Set < Aes > = layerAssignedAes + ( plotAssignedAes ? : setOf ( ) ) requiredAes . forEach { require ( it in assignedAes ) { \"\" } } }","docstring":"/**\n * Ensures that all required aesthetics are assigned either in the layer or plot context.\n * If any of the required aesthetics are not found, an exception is thrown.\n *\n * @param requiredAes A set of aesthetics that need to be assigned.\n * @param layerContext The context of the layer where the aesthetics could be assigned.\n * @param plotContext The context of the plot where the aesthetics could be assigned (optional).\n *\n * @throws IllegalArgumentException If any of the required aesthetics is not assigned in either the layer or the plot context.\n */"} {"signature":"override fun getName ( ) : String ?","body":"{ val tagName : PsiElement ? = findChildByType ( KDocTokens . TAG_NAME ) if ( tagName != null ) { return tagName . text . substring ( ) } return null }","docstring":"/**\n * Returns the name of this tag, not including the leading @ character.\n *\n * @return tag name or null if this tag represents the default section of a doc comment\n * or the code has a syntax error.\n */"} {"signature":"open fun getSubjectName ( ) : String ?","body":"= getSubjectLink ( ) ? . getLinkText ( )","docstring":"/**\n * Returns the name of the entity documented by this tag (for example, the name of the parameter\n * for the @param tag), or null if this tag does not document any specific entity.\n */"} {"signature":"open fun getContent ( ) : String","body":"{ val builder = StringBuilder ( ) val codeBlockBuilder = StringBuilder ( ) var targetBuilder = builder var contentStarted = false var afterAsterisk = false var indentedCodeBlock = false fun isCodeBlock ( ) = targetBuilder == codeBlockBuilder fun startCodeBlock ( ) { targetBuilder = codeBlockBuilder } fun flushCodeBlock ( ) { if ( isCodeBlock ( ) ) { builder . append ( trimCommonIndent ( codeBlockBuilder , indentedCodeBlock ) ) codeBlockBuilder . setLength ( ) targetBuilder = builder } } var children = childrenAfterTagName ( ) if ( hasSubject ( children ) ) { children = children . drop ( ) } for ( node in children ) { val type = node . elementType if ( type == KDocTokens . CODE_BLOCK_TEXT ) { if ( ! isCodeBlock ( ) ) indentedCodeBlock = indentedCodeBlock || node . text . startsWith ( indentationWhiteSpaces ) || node . text . startsWith ( \"\" ) startCodeBlock ( ) } else if ( KDocTokens . CONTENT_TOKENS . contains ( type ) ) { flushCodeBlock ( ) indentedCodeBlock = false } if ( KDocTokens . CONTENT_TOKENS . contains ( type ) ) { val isPlainContent = afterAsterisk && ! isCodeBlock ( ) val trimLeadingSpaces = ! ( contentStarted || indentedCodeBlock ) || isPlainContent targetBuilder . append ( if ( trimLeadingSpaces ) node . text . trimStart ( ) else node . text ) contentStarted = true afterAsterisk = false } if ( type == KDocTokens . LEADING_ASTERISK ) { afterAsterisk = true } if ( type == TokenType . WHITE_SPACE && contentStarted ) { targetBuilder . append ( \"\" . repeat ( StringUtil . countNewLines ( node . text ) ) ) } if ( type == KDocElementTypes . KDOC_TAG ) { break } } flushCodeBlock ( ) return builder . toString ( ) . trimEnd ( '' , '' ) }","docstring":"/**\n * Returns the content of this tag (all text following the tag name and the subject if present,\n * with leading asterisks removed).\n */"} {"signature":"abstract fun replaceType ( newType : TypeRefWithNullability ) : Field","body":"abstract fun replaceType ( newType : TypeRefWithNullability ) : Field","docstring":"/**\n * Returns a copy of this field with its [typeRef] set to [newType] (if it's possible).\n */"} {"signature":"abstract fun copy ( ) : Field","body":"abstract fun copy ( ) : Field","docstring":"/**\n * Returns a copy of this field.\n */"} {"signature":"public fun < T : Any > create ( any : T ) : StableRef < T >","body":"= StableRef < T > ( createStablePointer ( any ) )","docstring":"/**\n * Creates a handle for given object.\n */"} {"signature":"public fun asCPointer ( ) : COpaquePointer","body":"= this . stablePtr","docstring":"/**\n * Converts the handle to C pointer.\n * @see [asStableRef]\n */"} {"signature":"public fun dispose ( )","body":"{ disposeStablePointer ( this . stablePtr ) }","docstring":"/**\n * Disposes the handle. It must not be used after that.\n */"} {"signature":"@ Suppress ( \"\" ) public fun get ( ) : T","body":"= derefStablePointer ( this . stablePtr ) as T","docstring":"/**\n * Returns the object this handle was [created][StableRef.create] for.\n */"} {"signature":"@ ExperimentalForeignApi public inline fun < reified T : Any > CPointer < * > . asStableRef ( ) : StableRef < T >","body":"= StableRef < T > ( this ) . also { it . get ( ) }","docstring":"/**\n * Converts to [StableRef] this opaque pointer produced by [StableRef.asCPointer].\n */"} {"signature":"@ JsName ( \"\" ) internal fun setAdapter ( adapter : dynamic )","body":"= kotlin . test . setAdapter ( adapter )","docstring":"/**\n * Overrides current framework adapter with a provided instance of [FrameworkAdapter]. Use in order to support custom test frameworks.\n *\n * Also some string arguments are supported. Use \"qunit\" to set the adapter to [QUnit](https://qunitjs.com/), \"mocha\" for\n * [Mocha](https://mochajs.org/), \"jest\" for [Jest](https://facebook.github.io/jest/),\n * \"jasmine\" for [Jasmine](https://github.com/jasmine/jasmine), and \"auto\" to detect one of those frameworks automatically.\n *\n * If this function is not called, the test framework will be detected automatically (as if \"auto\" was passed).\n *\n */"} {"signature":"public suspend fun CompletableSource . await ( ) : Unit","body":"= suspendCancellableCoroutine { cont -> subscribe ( object : CompletableObserver { override fun onSubscribe ( d : Disposable ) { cont . disposeOnCancellation ( d ) } override fun onComplete ( ) { cont . resume ( Unit ) } override fun onError ( e : Throwable ) { cont . resumeWithException ( e ) } } ) }","docstring":"/**\n * Awaits for completion of this completable without blocking the thread.\n * Returns `Unit`, or throws the corresponding exception if this completable produces an error.\n *\n * This suspending function is cancellable. If the [Job] of the invoking coroutine is cancelled while this\n * suspending function is suspended, this function immediately resumes with [CancellationException] and disposes of its\n * subscription.\n */"} {"signature":"public suspend fun < T > MaybeSource < T > . awaitSingleOrNull ( ) : T ?","body":"= suspendCancellableCoroutine { cont -> subscribe ( object : MaybeObserver < T > { override fun onSubscribe ( d : Disposable ) { cont . disposeOnCancellation ( d ) } override fun onComplete ( ) { cont . resume ( null ) } override fun onSuccess ( t : T & Any ) { cont . resume ( t ) } override fun onError ( error : Throwable ) { cont . resumeWithException ( error ) } } ) }","docstring":"/**\n * Awaits for completion of the [MaybeSource] without blocking the thread.\n * Returns the resulting value, or `null` if no value is produced, or throws the corresponding exception if this\n * [MaybeSource] produces an error.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while this suspending function is waiting, this\n * function immediately resumes with [CancellationException] and disposes of its subscription.\n */"} {"signature":"public suspend fun < T > MaybeSource < T > . awaitSingle ( ) : T","body":"= awaitSingleOrNull ( ) ? : throw NoSuchElementException ( )","docstring":"/**\n * Awaits for completion of the [MaybeSource] without blocking the thread.\n * Returns the resulting value, or throws if either no value is produced or this [MaybeSource] produces an error.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while this suspending function is waiting, this\n * function immediately resumes with [CancellationException] and disposes of its subscription.\n *\n * @throws NoSuchElementException if no elements were produced by this [MaybeSource].\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun < T > MaybeSource < T > . await ( ) : T ?","body":"= awaitSingleOrNull ( )","docstring":"/**\n * Awaits for completion of the maybe without blocking a thread.\n * Returns the resulting value, null if no value was produced or throws the corresponding exception if this\n * maybe had produced error.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while this suspending function is waiting, this function\n * immediately resumes with [CancellationException].\n *\n * ### Deprecation\n *\n * Deprecated in favor of [awaitSingleOrNull] in order to reflect that `null` can be returned to denote the absence of\n * a value, as opposed to throwing in such case.\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun < T > MaybeSource < T > . awaitOrDefault ( default : T ) : T","body":"= awaitSingleOrNull ( ) ? : default","docstring":"/**\n * Awaits for completion of the maybe without blocking a thread.\n * Returns the resulting value, [default] if no value was produced or throws the corresponding exception if this\n * maybe had produced error.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while this suspending function is waiting, this function\n * immediately resumes with [CancellationException].\n *\n * ### Deprecation\n *\n * Deprecated in favor of [awaitSingleOrNull] for naming consistency (see the deprecation of [MaybeSource.await] for\n * details).\n * @suppress\n */"} {"signature":"public suspend fun < T > SingleSource < T > . await ( ) : T","body":"= suspendCancellableCoroutine { cont -> subscribe ( object : SingleObserver < T > { override fun onSubscribe ( d : Disposable ) { cont . disposeOnCancellation ( d ) } override fun onSuccess ( t : T & Any ) { cont . resume ( t ) } override fun onError ( error : Throwable ) { cont . resumeWithException ( error ) } } ) }","docstring":"/**\n * Awaits for completion of the single value response without blocking the thread.\n * Returns the resulting value, or throws the corresponding exception if this response produces an error.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while the suspending function is waiting, this\n * function immediately disposes of its subscription and resumes with [CancellationException].\n */"} {"signature":"public suspend fun < T > ObservableSource < T > . awaitFirst ( ) : T","body":"= awaitOne ( Mode . FIRST )","docstring":"/**\n * Awaits the first value from the given [Observable] without blocking the thread and returns the resulting value, or,\n * if the observable has produced an error, throws the corresponding exception.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while the suspending function is waiting, this\n * function immediately disposes of its subscription and resumes with [CancellationException].\n *\n * @throws NoSuchElementException if the observable does not emit any value\n */"} {"signature":"public suspend fun < T > ObservableSource < T > . awaitFirstOrDefault ( default : T ) : T","body":"= awaitOne ( Mode . FIRST_OR_DEFAULT , default )","docstring":"/**\n * Awaits the first value from the given [Observable], or returns the [default] value if none is emitted, without\n * blocking the thread, and returns the resulting value, or, if this observable has produced an error, throws the\n * corresponding exception.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while the suspending function is waiting, this\n * function immediately disposes of its subscription and resumes with [CancellationException].\n */"} {"signature":"public suspend fun < T > ObservableSource < T > . awaitFirstOrNull ( ) : T ?","body":"= awaitOne ( Mode . FIRST_OR_DEFAULT )","docstring":"/**\n * Awaits the first value from the given [Observable], or returns `null` if none is emitted, without blocking the\n * thread, and returns the resulting value, or, if this observable has produced an error, throws the corresponding\n * exception.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while the suspending function is waiting, this\n * function immediately disposes of its subscription and resumes with [CancellationException].\n */"} {"signature":"public suspend fun < T > ObservableSource < T > . awaitFirstOrElse ( defaultValue : ( ) -> T ) : T","body":"= awaitOne ( Mode . FIRST_OR_DEFAULT ) ? : defaultValue ( )","docstring":"/**\n * Awaits the first value from the given [Observable], or calls [defaultValue] to get a value if none is emitted,\n * without blocking the thread, and returns the resulting value, or, if this observable has produced an error, throws\n * the corresponding exception.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while the suspending function is waiting, this\n * function immediately disposes of its subscription and resumes with [CancellationException].\n */"} {"signature":"public suspend fun < T > ObservableSource < T > . awaitLast ( ) : T","body":"= awaitOne ( Mode . LAST )","docstring":"/**\n * Awaits the last value from the given [Observable] without blocking the thread and\n * returns the resulting value, or, if this observable has produced an error, throws the corresponding exception.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while the suspending function is waiting, this\n * function immediately disposes of its subscription and resumes with [CancellationException].\n *\n * @throws NoSuchElementException if the observable does not emit any value\n */"} {"signature":"public suspend fun < T > ObservableSource < T > . awaitSingle ( ) : T","body":"= awaitOne ( Mode . SINGLE )","docstring":"/**\n * Awaits the single value from the given observable without blocking the thread and returns the resulting value, or,\n * if this observable has produced an error, throws the corresponding exception.\n *\n * This suspending function is cancellable.\n * If the [Job] of the current coroutine is cancelled while the suspending function is waiting, this\n * function immediately disposes of its subscription and resumes with [CancellationException].\n *\n * @throws NoSuchElementException if the observable does not emit any value\n * @throws IllegalArgumentException if the observable emits more than one value\n */"} {"signature":"fun getTagIfSubject ( ) : KDocTag ?","body":"{ val tag = getStrictParentOfType < KDocTag > ( ) return if ( tag != null && tag . getSubjectLink ( ) == this ) tag else null }","docstring":"/**\n * If this link is the subject of a tag, returns the tag. Otherwise, returns null.\n */"} {"signature":"private fun modifiedLenet5 ( ) : Sequential","body":"= Sequential . of ( Input ( IMAGE_SIZE , IMAGE_SIZE , NUM_CHANNELS , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , activation = Activations . Elu , kernelInitializer = kernelInitializer , biasInitializer = biasInitializer , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , activation = Activations . Elu , kernelInitializer = kernelInitializer , biasInitializer = biasInitializer , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , name = \"\" ) , Flatten ( name = \"\" ) , Dense ( outputSize = , activation = Activations . Relu , kernelInitializer = kernelInitializer , biasInitializer = biasInitializer , name = \"\" ) , Dense ( outputSize = , activation = Activations . Relu , kernelInitializer = kernelInitializer , biasInitializer = biasInitializer , name = \"\" ) , Dense ( outputSize = NUMBER_OF_CLASSES , activation = Activations . Linear , kernelInitializer = kernelInitializer , biasInitializer = biasInitializer , name = \"\" ) )","docstring":"/**\n * See [lenet5]. This just has Relu replaced for ELU on earlier layers for save/load test.\n */"} {"signature":"fun eluLenetOnMnistWithIntermediateSave ( )","body":"{ val ( train , test ) = mnist ( ) SaveTrainedModelHelper ( ) . trainAndSave ( train , test , modifiedLenet5 ( ) , MODEL_SAVE_PATH , ) Sequential . loadDefaultModelConfiguration ( File ( MODEL_SAVE_PATH ) ) . use { it . compile ( optimizer = SGD ( learningRate = ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeights ( File ( MODEL_SAVE_PATH ) ) val accuracy = it . evaluate ( test ) . metrics [ Metrics . ACCURACY ] ? : println ( \"\" ) } }","docstring":"/**\n * This examples demonstrates running Save and Load for prediction on [mnist] dataset.\n */"} {"signature":"fun lenetClassicWithGPUMemoryConfig ( )","body":"{ val layersActivation = Activations . Tanh val classifierActivation = Activations . Linear val model = Sequential . of ( Input ( IMAGE_SIZE , IMAGE_SIZE , NUM_CHANNELS , ) , Conv2D ( filters = , kernelSize = , strides = , activation = layersActivation , kernelInitializer = GlorotNormal ( SEED ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , ) , AvgPool2D ( poolSize = , strides = , padding = ConvPadding . VALID , ) , Conv2D ( filters = , kernelSize = , strides = , activation = layersActivation , kernelInitializer = GlorotNormal ( SEED ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , ) , AvgPool2D ( poolSize = , strides = , padding = ConvPadding . VALID , ) , Flatten ( ) , Dense ( outputSize = , activation = layersActivation , kernelInitializer = GlorotNormal ( SEED ) , biasInitializer = Constant ( ) , ) , Dense ( outputSize = , activation = Activations . Tanh , kernelInitializer = GlorotNormal ( SEED ) , biasInitializer = Constant ( ) , ) , Dense ( outputSize = NUMBER_OF_CLASSES , activation = classifierActivation , kernelInitializer = GlorotNormal ( SEED ) , biasInitializer = Constant ( ) , ) , gpuConfiguration = GpuConfiguration ( allowGrowth = true ) ) val ( train , test ) = mnist ( ) model . use { it . compile ( optimizer = Adam ( clipGradient = ClipGradientByValue ( ) ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example shows how to do image classification from scratch using [lenet5Classic], without leveraging pre-trained weights or a pre-made model.\n * We demonstrate the workflow on the Mnist classification dataset.\n *\n * It could be run only with enabled tensorflow GPU dependencies\n *\n * It includes:\n * - dataset loading from S3\n * - model compilation\n * - model summary\n * - model training\n * - model evaluation\n */"} {"signature":"fun main ( ) : Unit","body":"= lenetClassicWithGPUMemoryConfig ( )","docstring":"/** */"} {"signature":"@ Test fun testDumpOnTimeout ( )","body":"{ val oldErr = System . err val baos = ByteArrayOutputStream ( ) try { System . setErr ( PrintStream ( baos , true ) ) DebugProbes . withDebugProbes { try { runTest ( timeout = . milliseconds ) { uniquelyNamedFunction ( ) } throw IllegalStateException ( \"\" ) } catch ( e : UncompletedCoroutinesError ) { } } baos . toString ( ) . let { assertTrue ( it . contains ( \"\" ) , \"\" ) } } finally { System . setErr ( oldErr ) } }","docstring":"/**\n * Tests that the dump on timeout contains the correct stacktrace.\n */"} {"signature":"fun testAnonymousObjectTypeMetadataKlibWithOldCLIKey ( )","body":"= doTestAnonymousObjectTypeMetadata ( listOf ( \"\" ) ) { output -> output . lines ( ) . filterNot { \"\" in it } . joinToString ( \"\" ) }","docstring":"/**\n * This test does exactly the same as [testAnonymousObjectTypeMetadataKlib] but using the old (now deprecated)\n * CLI argument `-Xexpect-actual-linker` instead of its successor `-Xmetadata-klib`.\n *\n * The test is needed only to check that the old CLI argument still works as needed.\n */"} {"signature":"fun createFreeFakeLambdaDescriptor ( descriptor : FunctionDescriptor , typeApproximator : TypeApproximator ? ) : FunctionDescriptor","body":"{ return createFreeDescriptor ( descriptor , typeApproximator ) }","docstring":"/**\n * Given a function descriptor, creates another function descriptor with type parameters copied from outer context(s).\n * This is needed because once we're serializing this to a proto, there's no place to store information about external type parameters.\n */"} {"signature":"fun createFreeFakeLocalPropertyDescriptor ( descriptor : LocalVariableDescriptor , typeApproximator : TypeApproximator ? ) : PropertyDescriptor","body":"{ val property = PropertyDescriptorImpl . create ( descriptor . containingDeclaration , descriptor . annotations , Modality . FINAL , descriptor . visibility , descriptor . isVar , descriptor . name , CallableMemberDescriptor . Kind . DECLARATION , descriptor . source , false , descriptor . isConst , false , false , false , descriptor . isDelegated ) property . setType ( descriptor . type , descriptor . typeParameters , descriptor . dispatchReceiverParameter , descriptor . extensionReceiverParameter , descriptor . contextReceiverParameters ) property . initialize ( descriptor . getter ? . run { PropertyGetterDescriptorImpl ( property , annotations , modality , visibility , true , isExternal , isInline , kind , null , source ) . apply { initialize ( this @ run . returnType ) } } , descriptor . setter ? . run { PropertySetterDescriptorImpl ( property , annotations , modality , visibility , true , isExternal , isInline , kind , null , source ) . apply { initialize ( this @ run . valueParameters . single ( ) ) } } ) return createFreeDescriptor ( property , typeApproximator ) }","docstring":"/**\n * Given a local delegated variable descriptor, creates a descriptor of a property that should be observed\n * when using reflection on that local variable at runtime.\n * Only members used by [DescriptorSerializer.propertyProto] are implemented correctly in this property descriptor.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . encodeToStream ( serializer : SerializationStrategy < T > , value : T , stream : OutputStream )","body":"{ val writer = JsonToJavaStreamWriter ( stream ) try { encodeByWriter ( this , writer , serializer , value ) } finally { writer . release ( ) } }","docstring":"/**\n * Serializes the [value] with [serializer] into a [stream] using JSON format and UTF-8 encoding.\n *\n * @throws [SerializationException] if the given value cannot be serialized to JSON.\n * @throws [IOException] If an I/O error occurs and stream cannot be written to.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . encodeToStream ( value : T , stream : OutputStream ) : Unit","body":"= encodeToStream ( serializersModule . serializer ( ) , value , stream )","docstring":"/**\n * Serializes given [value] to [stream] using UTF-8 encoding and serializer retrieved from the reified type parameter.\n *\n * @throws [SerializationException] if the given value cannot be serialized to JSON.\n * @throws [IOException] If an I/O error occurs and stream cannot be written to.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . decodeFromStream ( deserializer : DeserializationStrategy < T > , stream : InputStream ) : T","body":"{ val reader = JavaStreamSerialReader ( stream ) try { return decodeByReader ( this , deserializer , reader ) } finally { reader . release ( ) } }","docstring":"/**\n * Deserializes JSON from [stream] using UTF-8 encoding to a value of type [T] using [deserializer].\n *\n * Note that this functions expects that exactly one object would be present in the stream\n * and throws an exception if there are any dangling bytes after an object.\n *\n * @throws [SerializationException] if the given JSON input cannot be deserialized to the value of type [T].\n * @throws [IllegalArgumentException] if the decoded input cannot be represented as a valid instance of type [T]\n * @throws [IOException] If an I/O error occurs and stream cannot be read from.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . decodeFromStream ( stream : InputStream ) : T","body":"= decodeFromStream ( serializersModule . serializer ( ) , stream )","docstring":"/**\n * Deserializes the contents of given [stream] to the value of type [T] using UTF-8 encoding and\n * deserializer retrieved from the reified type parameter.\n *\n * Note that this functions expects that exactly one object would be present in the stream\n * and throws an exception if there are any dangling bytes after an object.\n *\n * @throws [SerializationException] if the given JSON input cannot be deserialized to the value of type [T].\n * @throws [IllegalArgumentException] if the decoded input cannot be represented as a valid instance of type [T]\n * @throws [IOException] If an I/O error occurs and stream cannot be read from.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . decodeToSequence ( stream : InputStream , deserializer : DeserializationStrategy < T > , format : DecodeSequenceMode = DecodeSequenceMode . AUTO_DETECT ) : Sequence < T >","body":"{ return decodeToSequenceByReader ( this , JavaStreamSerialReader ( stream ) , deserializer , format ) }","docstring":"/**\n * Transforms the given [stream] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and [deserializer].\n * Unlike [decodeFromStream], [stream] is allowed to have more than one element, separated as [format] declares.\n *\n * Elements must all be of type [T].\n * Elements are parsed lazily when resulting [Sequence] is evaluated.\n * Resulting sequence is tied to the stream and can be evaluated only once.\n *\n * **Resource caution:** this method neither closes the [stream] when the parsing is finished nor provides a method to close it manually.\n * It is a caller responsibility to hold a reference to a stream and close it. Moreover, because stream is parsed lazily,\n * closing it before returned sequence is evaluated completely will result in [IOException] from decoder.\n *\n * @throws [SerializationException] if the given JSON input cannot be deserialized to the value of type [T].\n * @throws [IllegalArgumentException] if the decoded input cannot be represented as a valid instance of type [T]\n * @throws [IOException] If an I/O error occurs and stream cannot be read from.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . decodeToSequence ( stream : InputStream , format : DecodeSequenceMode = DecodeSequenceMode . AUTO_DETECT ) : Sequence < T >","body":"= decodeToSequence ( stream , serializersModule . serializer ( ) , format )","docstring":"/**\n * Transforms the given [stream] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and deserializer retrieved from the reified type parameter.\n * Unlike [decodeFromStream], [stream] is allowed to have more than one element, separated as [format] declares.\n *\n * Elements must all be of type [T].\n * Elements are parsed lazily when resulting [Sequence] is evaluated.\n * Resulting sequence is tied to the stream and constrained to be evaluated only once.\n *\n * **Resource caution:** this method does not close [stream] when the parsing is finished neither provides method to close it manually.\n * It is a caller responsibility to hold a reference to a stream and close it. Moreover, because stream is parsed lazily,\n * closing it before returned sequence is evaluated fully would result in [IOException] from decoder.\n *\n * @throws [SerializationException] if the given JSON input cannot be deserialized to the value of type [T].\n * @throws [IllegalArgumentException] if the decoded input cannot be represented as a valid instance of type [T]\n * @throws [IOException] If an I/O error occurs and stream cannot be read from.\n */"} {"signature":"private fun mustNotBeWrittenToStubs ( flags : Int ) : Boolean","body":"{ return Flags . MEMBER_KIND . get ( flags ) == MemberKind . FAKE_OVERRIDE }","docstring":"/**\n * @see org.jetbrains.kotlin.analysis.decompiler.psi.text.mustNotBeWrittenToDecompiledText\n */"} {"signature":"fun thisIsAFunction ( )","body":"{ }","docstring":"/**\n * This function will not do anything\n */"} {"signature":"public inline fun buildJsonObject ( builderAction : JsonObjectBuilder . ( ) -> Unit ) : JsonObject","body":"{ contract { callsInPlace ( builderAction , InvocationKind . EXACTLY_ONCE ) } val builder = JsonObjectBuilder ( ) builder . builderAction ( ) return builder . build ( ) }","docstring":"/**\n * Builds [JsonObject] with the given [builderAction] builder.\n * Example of usage:\n * ```\n * val json = buildJsonObject {\n * put(\"booleanKey\", true)\n * putJsonArray(\"arrayKey\") {\n * for (i in 1..10) add(i)\n * }\n * putJsonObject(\"objectKey\") {\n * put(\"stringKey\", \"stringValue\")\n * }\n * }\n * ```\n */"} {"signature":"public inline fun buildJsonArray ( builderAction : JsonArrayBuilder . ( ) -> Unit ) : JsonArray","body":"{ contract { callsInPlace ( builderAction , InvocationKind . EXACTLY_ONCE ) } val builder = JsonArrayBuilder ( ) builder . builderAction ( ) return builder . build ( ) }","docstring":"/**\n * Builds [JsonArray] with the given [builderAction] builder.\n * Example of usage:\n * ```\n * val json = buildJsonArray {\n * add(true)\n * addJsonArray {\n * for (i in 1..10) add(i)\n * }\n * addJsonObject {\n * put(\"stringKey\", \"stringValue\")\n * }\n * }\n * ```\n */"} {"signature":"public fun put ( key : String , element : JsonElement ) : JsonElement ?","body":"= content . put ( key , element )","docstring":"/**\n * Add the given JSON [element] to a resulting JSON object using the given [key].\n *\n * Returns the previous value associated with [key], or `null` if the key was not present.\n */"} {"signature":"public fun JsonObjectBuilder . putJsonObject ( key : String , builderAction : JsonObjectBuilder . ( ) -> Unit ) : JsonElement ?","body":"= put ( key , buildJsonObject ( builderAction ) )","docstring":"/**\n * Add the [JSON object][JsonObject] produced by the [builderAction] function to a resulting JSON object using the given [key].\n *\n * Returns the previous value associated with [key], or `null` if the key was not present.\n */"} {"signature":"public fun JsonObjectBuilder . putJsonArray ( key : String , builderAction : JsonArrayBuilder . ( ) -> Unit ) : JsonElement ?","body":"= put ( key , buildJsonArray ( builderAction ) )","docstring":"/**\n * Add the [JSON array][JsonArray] produced by the [builderAction] function to a resulting JSON object using the given [key].\n *\n * Returns the previous value associated with [key], or `null` if the key was not present.\n */"} {"signature":"public fun JsonObjectBuilder . put ( key : String , value : Boolean ? ) : JsonElement ?","body":"= put ( key , JsonPrimitive ( value ) )","docstring":"/**\n * Add the given boolean [value] to a resulting JSON object using the given [key].\n *\n * Returns the previous value associated with [key], or `null` if the key was not present.\n */"} {"signature":"public fun JsonObjectBuilder . put ( key : String , value : Number ? ) : JsonElement ?","body":"= put ( key , JsonPrimitive ( value ) )","docstring":"/**\n * Add the given numeric [value] to a resulting JSON object using the given [key].\n *\n * Returns the previous value associated with [key], or `null` if the key was not present.\n */"} {"signature":"public fun JsonObjectBuilder . put ( key : String , value : String ? ) : JsonElement ?","body":"= put ( key , JsonPrimitive ( value ) )","docstring":"/**\n * Add the given string [value] to a resulting JSON object using the given [key].\n *\n * Returns the previous value associated with [key], or `null` if the key was not present.\n */"} {"signature":"@ ExperimentalSerializationApi @ Suppress ( \"\" ) public fun JsonObjectBuilder . put ( key : String , value : Nothing ? ) : JsonElement ?","body":"= put ( key , JsonNull )","docstring":"/**\n * Add `null` to a resulting JSON object using the given [key].\n *\n * Returns the previous value associated with [key], or `null` if the key was not present.\n */"} {"signature":"public fun add ( element : JsonElement ) : Boolean","body":"{ content += element return true }","docstring":"/**\n * Adds the given JSON [element] to a resulting JSON array.\n *\n * Always returns `true` similarly to [ArrayList] specification.\n */"} {"signature":"@ ExperimentalSerializationApi public fun addAll ( elements : Collection < JsonElement > ) : Boolean","body":"= content . addAll ( elements )","docstring":"/**\n * Adds the given JSON [elements] to a resulting JSON array.\n *\n * @return `true` if the list was changed as the result of the operation.\n */"} {"signature":"public fun JsonArrayBuilder . add ( value : Boolean ? ) : Boolean","body":"= add ( JsonPrimitive ( value ) )","docstring":"/**\n * Adds the given boolean [value] to a resulting JSON array.\n *\n * Always returns `true` similarly to [ArrayList] specification.\n */"} {"signature":"public fun JsonArrayBuilder . add ( value : Number ? ) : Boolean","body":"= add ( JsonPrimitive ( value ) )","docstring":"/**\n * Adds the given numeric [value] to a resulting JSON array.\n *\n * Always returns `true` similarly to [ArrayList] specification.\n */"} {"signature":"public fun JsonArrayBuilder . add ( value : String ? ) : Boolean","body":"= add ( JsonPrimitive ( value ) )","docstring":"/**\n * Adds the given string [value] to a resulting JSON array.\n *\n * Always returns `true` similarly to [ArrayList] specification.\n */"} {"signature":"@ ExperimentalSerializationApi @ Suppress ( \"\" ) public fun JsonArrayBuilder . add ( value : Nothing ? ) : Boolean","body":"= add ( JsonNull )","docstring":"/**\n * Adds `null` to a resulting JSON array.\n *\n * Always returns `true` similarly to [ArrayList] specification.\n */"} {"signature":"public fun JsonArrayBuilder . addJsonObject ( builderAction : JsonObjectBuilder . ( ) -> Unit ) : Boolean","body":"= add ( buildJsonObject ( builderAction ) )","docstring":"/**\n * Adds the [JSON object][JsonObject] produced by the [builderAction] function to a resulting JSON array.\n *\n * Always returns `true` similarly to [ArrayList] specification.\n */"} {"signature":"public fun JsonArrayBuilder . addJsonArray ( builderAction : JsonArrayBuilder . ( ) -> Unit ) : Boolean","body":"= add ( buildJsonArray ( builderAction ) )","docstring":"/**\n * Adds the [JSON array][JsonArray] produced by the [builderAction] function to a resulting JSON array.\n *\n * Always returns `true` similarly to [ArrayList] specification.\n */"} {"signature":"@ JvmName ( \"\" ) @ ExperimentalSerializationApi public fun JsonArrayBuilder . addAll ( values : Collection < String ? > ) : Boolean","body":"= addAll ( values . map ( :: JsonPrimitive ) )","docstring":"/**\n * Adds the given string [values] to a resulting JSON array.\n *\n * @return `true` if the list was changed as the result of the operation.\n */"} {"signature":"@ JvmName ( \"\" ) @ ExperimentalSerializationApi public fun JsonArrayBuilder . addAll ( values : Collection < Boolean ? > ) : Boolean","body":"= addAll ( values . map ( :: JsonPrimitive ) )","docstring":"/**\n * Adds the given boolean [values] to a resulting JSON array.\n *\n * @return `true` if the list was changed as the result of the operation.\n */"} {"signature":"@ JvmName ( \"\" ) @ ExperimentalSerializationApi public fun JsonArrayBuilder . addAll ( values : Collection < Number ? > ) : Boolean","body":"= addAll ( values . map ( :: JsonPrimitive ) )","docstring":"/**\n * Adds the given numeric [values] to a resulting JSON array.\n *\n * @return `true` if the list was changed as the result of the operation.\n */"} {"signature":"internal fun String . toBooleanStrictOrNull ( ) : Boolean ?","body":"= when { this . equals ( \"\" , ignoreCase = true ) -> true this . equals ( \"\" , ignoreCase = true ) -> false else -> null }","docstring":"/**\n * Returns `true` if the contents of this string is equal to the word \"true\", ignoring case, `false` if content equals \"false\",\n * and returns `null` otherwise.\n */"} {"signature":"public fun < T > width ( column : ColumnReference < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping < T , Double > ( SIZE , column . name ( ) , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the size.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > width ( column : KProperty < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping < T , Double > ( SIZE , column . name , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the size.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun width ( column : String , parameters : LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , Double >","body":"{ return addNonPositionalMapping ( SIZE , column , LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the size.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > width ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( SIZE , values . toList ( ) , name , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `width` aesthetic to iterable of discrete values.\n *\n * @param values the iterable containing the discrete values.\n * @param name optional name for this aesthetic mapping.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > width ( values : DataColumn < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( SIZE , values , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column.\n *\n * @param values the data column to map to the size.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public inline fun < T , R > Flow < T > . transform ( @ BuilderInference crossinline transform : suspend FlowCollector < R > . ( value : T ) -> Unit ) : Flow < R >","body":"= flow { collect { value -> return@collect transform ( value ) } }","docstring":"/**\n * Applies [transform] function to each value of the given flow.\n *\n * The receiver of the `transform` is [FlowCollector] and thus `transform` is a\n * flexible function that may transform emitted element, skip it or emit it multiple times.\n *\n * This operator generalizes [filter] and [map] operators and\n * can be used as a building block for other operators, for example:\n *\n * ```\n * fun Flow.skipOddAndDuplicateEven(): Flow = transform { value ->\n * if (value % 2 == 0) { // Emit only even values, but twice\n * emit(value)\n * emit(value)\n * } // Do nothing if odd\n * }\n * ```\n */"} {"signature":"public fun < T > Flow < T > . onStart ( action : suspend FlowCollector < T > . ( ) -> Unit ) : Flow < T >","body":"= unsafeFlow { val safeCollector = SafeCollector < T > ( this , currentCoroutineContext ( ) ) try { safeCollector . action ( ) } finally { safeCollector . releaseIntercepted ( ) } collect ( this ) }","docstring":"/**\n * Returns a flow that invokes the given [action] **before** this flow starts to be collected.\n *\n * The [action] is called before the upstream flow is started, so if it is used with a [SharedFlow]\n * there is **no guarantee** that emissions from the upstream flow that happen inside or immediately\n * after this `onStart` action will be collected\n * (see [onSubscription] for an alternative operator on shared flows).\n *\n * The receiver of the [action] is [FlowCollector], so `onStart` can emit additional elements.\n * For example:\n *\n * ```\n * flowOf(\"a\", \"b\", \"c\")\n * .onStart { emit(\"Begin\") }\n * .collect { println(it) } // prints Begin, a, b, c\n * ```\n */"} {"signature":"public fun < T > Flow < T > . onCompletion ( action : suspend FlowCollector < T > . ( cause : Throwable ? ) -> Unit ) : Flow < T >","body":"= unsafeFlow { try { collect ( this ) } catch ( e : Throwable ) { ThrowingCollector ( e ) . invokeSafely ( action , e ) throw e } val sc = SafeCollector ( this , currentCoroutineContext ( ) ) try { sc . action ( null ) } finally { sc . releaseIntercepted ( ) } }","docstring":"/**\n * Returns a flow that invokes the given [action] **after** the flow is completed or cancelled, passing\n * the cancellation exception or failure as cause parameter of [action].\n *\n * Conceptually, `onCompletion` is similar to wrapping the flow collection into a `finally` block,\n * for example the following imperative snippet:\n *\n * ```\n * try {\n * myFlow.collect { value ->\n * println(value)\n * }\n * } finally {\n * println(\"Done\")\n * }\n * ```\n *\n * can be replaced with a declarative one using `onCompletion`:\n *\n * ```\n * myFlow\n * .onEach { println(it) }\n * .onCompletion { println(\"Done\") }\n * .collect()\n * ```\n *\n * Unlike [catch], this operator reports exception that occur both upstream and downstream\n * and observe exceptions that are thrown to cancel the flow. Exception is empty if and only if\n * the flow had fully completed successfully. Conceptually, the following code:\n *\n * ```\n * myFlow.collect { value ->\n * println(value)\n * }\n * println(\"Completed successfully\")\n * ```\n *\n * can be replaced with:\n *\n * ```\n * myFlow\n * .onEach { println(it) }\n * .onCompletion { if (it == null) println(\"Completed successfully\") }\n * .collect()\n * ```\n *\n * The receiver of the [action] is [FlowCollector] and this operator can be used to emit additional\n * elements at the end **if it completed successfully**. For example:\n *\n * ```\n * flowOf(\"a\", \"b\", \"c\")\n * .onCompletion { emit(\"Done\") }\n * .collect { println(it) } // prints a, b, c, Done\n * ```\n *\n * In case of failure or cancellation, any attempt to emit additional elements throws the corresponding exception.\n * Use [catch] if you need to suppress failure and replace it with emission of elements.\n */"} {"signature":"public fun < T > Flow < T > . onEmpty ( action : suspend FlowCollector < T > . ( ) -> Unit ) : Flow < T >","body":"= unsafeFlow { var isEmpty = true collect { isEmpty = false emit ( it ) } if ( isEmpty ) { val collector = SafeCollector ( this , currentCoroutineContext ( ) ) try { collector . action ( ) } finally { collector . releaseIntercepted ( ) } } }","docstring":"/**\n * Invokes the given [action] when this flow completes without emitting any elements.\n * The receiver of the [action] is [FlowCollector], so `onEmpty` can emit additional elements.\n * For example:\n *\n * ```\n * emptyFlow().onEmpty {\n * emit(1)\n * emit(2)\n * }.collect { println(it) } // prints 1, 2\n * ```\n */"} {"signature":"internal fun KtDeclaration . resolveToDescriptorIfAny ( resolutionFacade : ResolutionFacade , bodyResolveMode : BodyResolveMode = BodyResolveMode . PARTIAL ) : DeclarationDescriptor ?","body":"{ val context = safeAnalyze ( resolutionFacade , bodyResolveMode ) return if ( this is KtParameter && hasValOrVar ( ) ) { context . get ( BindingContext . PRIMARY_CONSTRUCTOR_PARAMETER , this ) ? : context . get ( BindingContext . DECLARATION_TO_DESCRIPTOR , this ) } else { context . get ( BindingContext . DECLARATION_TO_DESCRIPTOR , this ) } }","docstring":"/**\n * This function first uses declaration resolvers to resolve this declaration and/or additional declarations (e.g. its parent),\n * and then takes the relevant descriptor from binding context.\n * The exact set of declarations to resolve depends on bodyResolveMode\n */"} {"signature":"@ JvmName ( \"\" ) public fun LinAlg . inv ( mat : MultiArray < Float , D2 > ) : NDArray < Float , D2 >","body":"= this . linAlgEx . invF ( mat )","docstring":"/**\n * Returns inverse float matrix\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number > LinAlg . inv ( mat : MultiArray < T , D2 > ) : NDArray < Double , D2 >","body":"= this . linAlgEx . inv ( mat )","docstring":"/**\n * Returns inverse of a double matrix from numeric matrix\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Complex > LinAlg . inv ( mat : MultiArray < T , D2 > ) : NDArray < T , D2 >","body":"= this . linAlgEx . invC ( mat )","docstring":"/**\n * Returns inverse complex matrix\n */"} {"signature":"@ WasmNoOpCast @ ExcludedFromCodegen public fun < T : JsAny > JsAny . unsafeCast ( ) : T","body":"= implementedAsIntrinsic","docstring":"/**\n * Cast JsAny to other Js type without runtime check\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > List < T > . component1 ( ) : T","body":"{ return get ( ) }","docstring":"/**\n * Returns 1st *element* from the list.\n * \n * Throws an [IndexOutOfBoundsException] if the size of this list is less than 1.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > List < T > . component2 ( ) : T","body":"{ return get ( ) }","docstring":"/**\n * Returns 2nd *element* from the list.\n * \n * Throws an [IndexOutOfBoundsException] if the size of this list is less than 2.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > List < T > . component3 ( ) : T","body":"{ return get ( ) }","docstring":"/**\n * Returns 3rd *element* from the list.\n * \n * Throws an [IndexOutOfBoundsException] if the size of this list is less than 3.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > List < T > . component4 ( ) : T","body":"{ return get ( ) }","docstring":"/**\n * Returns 4th *element* from the list.\n * \n * Throws an [IndexOutOfBoundsException] if the size of this list is less than 4.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > List < T > . component5 ( ) : T","body":"{ return get ( ) }","docstring":"/**\n * Returns 5th *element* from the list.\n * \n * Throws an [IndexOutOfBoundsException] if the size of this list is less than 5.\n */"} {"signature":"public operator fun < @ kotlin . internal . OnlyInputTypes T > Iterable < T > . contains ( element : T ) : Boolean","body":"{ if ( this is Collection ) return contains ( element ) return indexOf ( element ) >= }","docstring":"/**\n * Returns `true` if [element] is found in the collection.\n */"} {"signature":"public fun < T > Iterable < T > . elementAt ( index : Int ) : T","body":"{ if ( this is List ) return get ( index ) return elementAtOrElse ( index ) { throw IndexOutOfBoundsException ( \"\" ) } }","docstring":"/**\n * Returns an element at the given [index] or throws an [IndexOutOfBoundsException] if the [index] is out of bounds of this collection.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > List < T > . elementAt ( index : Int ) : T","body":"{ return get ( index ) }","docstring":"/**\n * Returns an element at the given [index] or throws an [IndexOutOfBoundsException] if the [index] is out of bounds of this list.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public fun < T > Iterable < T > . elementAtOrElse ( index : Int , defaultValue : ( Int ) -> T ) : T","body":"{ contract { callsInPlace ( defaultValue , InvocationKind . AT_MOST_ONCE ) } if ( this is List ) return this . getOrElse ( index , defaultValue ) if ( index < ) return defaultValue ( index ) val iterator = iterator ( ) var count = while ( iterator . hasNext ( ) ) { val element = iterator . next ( ) if ( index == count ++ ) return element } return defaultValue ( index ) }","docstring":"/**\n * Returns an element at the given [index] or the result of calling the [defaultValue] function if the [index] is out of bounds of this collection.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrElse\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > List < T > . elementAtOrElse ( index : Int , defaultValue : ( Int ) -> T ) : T","body":"{ contract { callsInPlace ( defaultValue , InvocationKind . AT_MOST_ONCE ) } return if ( index in ..< size ) get ( index ) else defaultValue ( index ) }","docstring":"/**\n * Returns an element at the given [index] or the result of calling the [defaultValue] function if the [index] is out of bounds of this list.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrElse\n */"} {"signature":"public fun < T > Iterable < T > . elementAtOrNull ( index : Int ) : T ?","body":"{ if ( this is List ) return this . getOrNull ( index ) if ( index < ) return null val iterator = iterator ( ) var count = while ( iterator . hasNext ( ) ) { val element = iterator . next ( ) if ( index == count ++ ) return element } return null }","docstring":"/**\n * Returns an element at the given [index] or `null` if the [index] is out of bounds of this collection.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrNull\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > List < T > . elementAtOrNull ( index : Int ) : T ?","body":"{ return this . getOrNull ( index ) }","docstring":"/**\n * Returns an element at the given [index] or `null` if the [index] is out of bounds of this list.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrNull\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . find ( predicate : ( T ) -> Boolean ) : T ?","body":"{ return firstOrNull ( predicate ) }","docstring":"/**\n * Returns the first element matching the given [predicate], or `null` if no such element was found.\n * \n * @sample samples.collections.Collections.Elements.find\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . findLast ( predicate : ( T ) -> Boolean ) : T ?","body":"{ return lastOrNull ( predicate ) }","docstring":"/**\n * Returns the last element matching the given [predicate], or `null` if no such element was found.\n * \n * @sample samples.collections.Collections.Elements.find\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > List < T > . findLast ( predicate : ( T ) -> Boolean ) : T ?","body":"{ return lastOrNull ( predicate ) }","docstring":"/**\n * Returns the last element matching the given [predicate], or `null` if no such element was found.\n * \n * @sample samples.collections.Collections.Elements.find\n */"} {"signature":"public fun < T > Iterable < T > . first ( ) : T","body":"{ when ( this ) { is List -> return this . first ( ) else -> { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( \"\" ) return iterator . next ( ) } } }","docstring":"/**\n * Returns the first element.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"public fun < T > List < T > . first ( ) : T","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this [ ] }","docstring":"/**\n * Returns the first element.\n * \n * @throws NoSuchElementException if the list is empty.\n */"} {"signature":"public inline fun < T > Iterable < T > . first ( predicate : ( T ) -> Boolean ) : T","body":"{ for ( element in this ) if ( predicate ( element ) ) return element throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the first element matching the given [predicate].\n * @throws [NoSuchElementException] if no such element is found.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R : Any > Iterable < T > . firstNotNullOf ( transform : ( T ) -> R ? ) : R","body":"{ return firstNotNullOfOrNull ( transform ) ? : throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the first non-null value produced by [transform] function being applied to elements of this collection in iteration order,\n * or throws [NoSuchElementException] if no non-null value was produced.\n * \n * @sample samples.collections.Collections.Transformations.firstNotNullOf\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R : Any > Iterable < T > . firstNotNullOfOrNull ( transform : ( T ) -> R ? ) : R ?","body":"{ for ( element in this ) { val result = transform ( element ) if ( result != null ) { return result } } return null }","docstring":"/**\n * Returns the first non-null value produced by [transform] function being applied to elements of this collection in iteration order,\n * or `null` if no non-null value was produced.\n * \n * @sample samples.collections.Collections.Transformations.firstNotNullOf\n */"} {"signature":"public fun < T > Iterable < T > . firstOrNull ( ) : T ?","body":"{ when ( this ) { is List -> { if ( isEmpty ( ) ) return null else return this [ ] } else -> { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null return iterator . next ( ) } } }","docstring":"/**\n * Returns the first element, or `null` if the collection is empty.\n */"} {"signature":"public fun < T > List < T > . firstOrNull ( ) : T ?","body":"{ return if ( isEmpty ( ) ) null else this [ ] }","docstring":"/**\n * Returns the first element, or `null` if the list is empty.\n */"} {"signature":"public inline fun < T > Iterable < T > . firstOrNull ( predicate : ( T ) -> Boolean ) : T ?","body":"{ for ( element in this ) if ( predicate ( element ) ) return element return null }","docstring":"/**\n * Returns the first element matching the given [predicate], or `null` if element was not found.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > List < T > . getOrElse ( index : Int , defaultValue : ( Int ) -> T ) : T","body":"{ contract { callsInPlace ( defaultValue , InvocationKind . AT_MOST_ONCE ) } return if ( index in ..< size ) get ( index ) else defaultValue ( index ) }","docstring":"/**\n * Returns an element at the given [index] or the result of calling the [defaultValue] function if the [index] is out of bounds of this list.\n */"} {"signature":"public fun < T > List < T > . getOrNull ( index : Int ) : T ?","body":"{ return if ( index in ..< size ) get ( index ) else null }","docstring":"/**\n * Returns an element at the given [index] or `null` if the [index] is out of bounds of this list.\n * \n * @sample samples.collections.Collections.Elements.getOrNull\n */"} {"signature":"public fun < @ kotlin . internal . OnlyInputTypes T > Iterable < T > . indexOf ( element : T ) : Int","body":"{ if ( this is List ) return this . indexOf ( element ) var index = for ( item in this ) { checkIndexOverflow ( index ) if ( element == item ) return index index ++ } return - }","docstring":"/**\n * Returns first index of [element], or -1 if the collection does not contain element.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < @ kotlin . internal . OnlyInputTypes T > List < T > . indexOf ( element : T ) : Int","body":"{ return indexOf ( element ) }","docstring":"/**\n * Returns first index of [element], or -1 if the list does not contain element.\n */"} {"signature":"public inline fun < T > Iterable < T > . indexOfFirst ( predicate : ( T ) -> Boolean ) : Int","body":"{ var index = for ( item in this ) { checkIndexOverflow ( index ) if ( predicate ( item ) ) return index index ++ } return - }","docstring":"/**\n * Returns index of the first element matching the given [predicate], or -1 if the collection does not contain such element.\n */"} {"signature":"public inline fun < T > List < T > . indexOfFirst ( predicate : ( T ) -> Boolean ) : Int","body":"{ var index = for ( item in this ) { if ( predicate ( item ) ) return index index ++ } return - }","docstring":"/**\n * Returns index of the first element matching the given [predicate], or -1 if the list does not contain such element.\n */"} {"signature":"public inline fun < T > Iterable < T > . indexOfLast ( predicate : ( T ) -> Boolean ) : Int","body":"{ var lastIndex = - var index = for ( item in this ) { checkIndexOverflow ( index ) if ( predicate ( item ) ) lastIndex = index index ++ } return lastIndex }","docstring":"/**\n * Returns index of the last element matching the given [predicate], or -1 if the collection does not contain such element.\n */"} {"signature":"public inline fun < T > List < T > . indexOfLast ( predicate : ( T ) -> Boolean ) : Int","body":"{ val iterator = this . listIterator ( size ) while ( iterator . hasPrevious ( ) ) { if ( predicate ( iterator . previous ( ) ) ) { return iterator . nextIndex ( ) } } return - }","docstring":"/**\n * Returns index of the last element matching the given [predicate], or -1 if the list does not contain such element.\n */"} {"signature":"public fun < T > Iterable < T > . last ( ) : T","body":"{ when ( this ) { is List -> return this . last ( ) else -> { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( \"\" ) var last = iterator . next ( ) while ( iterator . hasNext ( ) ) last = iterator . next ( ) return last } } }","docstring":"/**\n * Returns the last element.\n * \n * @throws NoSuchElementException if the collection is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public fun < T > List < T > . last ( ) : T","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this [ lastIndex ] }","docstring":"/**\n * Returns the last element.\n * \n * @throws NoSuchElementException if the list is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public inline fun < T > Iterable < T > . last ( predicate : ( T ) -> Boolean ) : T","body":"{ var last : T ? = null var found = false for ( element in this ) { if ( predicate ( element ) ) { last = element found = true } } if ( ! found ) throw NoSuchElementException ( \"\" ) @ Suppress ( \"\" ) return last as T }","docstring":"/**\n * Returns the last element matching the given [predicate].\n * \n * @throws NoSuchElementException if no such element is found.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public inline fun < T > List < T > . last ( predicate : ( T ) -> Boolean ) : T","body":"{ val iterator = this . listIterator ( size ) while ( iterator . hasPrevious ( ) ) { val element = iterator . previous ( ) if ( predicate ( element ) ) return element } throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the last element matching the given [predicate].\n * \n * @throws NoSuchElementException if no such element is found.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public fun < @ kotlin . internal . OnlyInputTypes T > Iterable < T > . lastIndexOf ( element : T ) : Int","body":"{ if ( this is List ) return this . lastIndexOf ( element ) var lastIndex = - var index = for ( item in this ) { checkIndexOverflow ( index ) if ( element == item ) lastIndex = index index ++ } return lastIndex }","docstring":"/**\n * Returns last index of [element], or -1 if the collection does not contain element.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < @ kotlin . internal . OnlyInputTypes T > List < T > . lastIndexOf ( element : T ) : Int","body":"{ return lastIndexOf ( element ) }","docstring":"/**\n * Returns last index of [element], or -1 if the list does not contain element.\n */"} {"signature":"public fun < T > Iterable < T > . lastOrNull ( ) : T ?","body":"{ when ( this ) { is List -> return if ( isEmpty ( ) ) null else this [ size - ] else -> { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var last = iterator . next ( ) while ( iterator . hasNext ( ) ) last = iterator . next ( ) return last } } }","docstring":"/**\n * Returns the last element, or `null` if the collection is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public fun < T > List < T > . lastOrNull ( ) : T ?","body":"{ return if ( isEmpty ( ) ) null else this [ size - ] }","docstring":"/**\n * Returns the last element, or `null` if the list is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public inline fun < T > Iterable < T > . lastOrNull ( predicate : ( T ) -> Boolean ) : T ?","body":"{ var last : T ? = null for ( element in this ) { if ( predicate ( element ) ) { last = element } } return last }","docstring":"/**\n * Returns the last element matching the given [predicate], or `null` if no such element was found.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public inline fun < T > List < T > . lastOrNull ( predicate : ( T ) -> Boolean ) : T ?","body":"{ val iterator = this . listIterator ( size ) while ( iterator . hasPrevious ( ) ) { val element = iterator . previous ( ) if ( predicate ( element ) ) return element } return null }","docstring":"/**\n * Returns the last element matching the given [predicate], or `null` if no such element was found.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Collection < T > . random ( ) : T","body":"{ return random ( Random ) }","docstring":"/**\n * Returns a random element from this collection.\n * \n * @throws NoSuchElementException if this collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Collection < T > . random ( random : Random ) : T","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return elementAt ( random . nextInt ( size ) ) }","docstring":"/**\n * Returns a random element from this collection using the specified source of randomness.\n * \n * @throws NoSuchElementException if this collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Collection < T > . randomOrNull ( ) : T ?","body":"{ return randomOrNull ( Random ) }","docstring":"/**\n * Returns a random element from this collection, or `null` if this collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Collection < T > . randomOrNull ( random : Random ) : T ?","body":"{ if ( isEmpty ( ) ) return null return elementAt ( random . nextInt ( size ) ) }","docstring":"/**\n * Returns a random element from this collection using the specified source of randomness, or `null` if this collection is empty.\n */"} {"signature":"public fun < T > Iterable < T > . single ( ) : T","body":"{ when ( this ) { is List -> return this . single ( ) else -> { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( \"\" ) val single = iterator . next ( ) if ( iterator . hasNext ( ) ) throw IllegalArgumentException ( \"\" ) return single } } }","docstring":"/**\n * Returns the single element, or throws an exception if the collection is empty or has more than one element.\n */"} {"signature":"public fun < T > List < T > . single ( ) : T","body":"{ return when ( size ) { -> throw NoSuchElementException ( \"\" ) -> this [ ] else -> throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Returns the single element, or throws an exception if the list is empty or has more than one element.\n */"} {"signature":"public inline fun < T > Iterable < T > . single ( predicate : ( T ) -> Boolean ) : T","body":"{ var single : T ? = null var found = false for ( element in this ) { if ( predicate ( element ) ) { if ( found ) throw IllegalArgumentException ( \"\" ) single = element found = true } } if ( ! found ) throw NoSuchElementException ( \"\" ) @ Suppress ( \"\" ) return single as T }","docstring":"/**\n * Returns the single element matching the given [predicate], or throws exception if there is no or more than one matching element.\n */"} {"signature":"public fun < T > Iterable < T > . singleOrNull ( ) : T ?","body":"{ when ( this ) { is List -> return if ( size == ) this [ ] else null else -> { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null val single = iterator . next ( ) if ( iterator . hasNext ( ) ) return null return single } } }","docstring":"/**\n * Returns single element, or `null` if the collection is empty or has more than one element.\n */"} {"signature":"public fun < T > List < T > . singleOrNull ( ) : T ?","body":"{ return if ( size == ) this [ ] else null }","docstring":"/**\n * Returns single element, or `null` if the list is empty or has more than one element.\n */"} {"signature":"public inline fun < T > Iterable < T > . singleOrNull ( predicate : ( T ) -> Boolean ) : T ?","body":"{ var single : T ? = null var found = false for ( element in this ) { if ( predicate ( element ) ) { if ( found ) return null single = element found = true } } if ( ! found ) return null return single }","docstring":"/**\n * Returns the single element matching the given [predicate], or `null` if element was not found or more than one element was found.\n */"} {"signature":"public fun < T > Iterable < T > . drop ( n : Int ) : List < T >","body":"{ require ( n >= ) { \"\" } if ( n == ) return toList ( ) val list : ArrayList < T > if ( this is Collection < * > ) { val resultSize = size - n if ( resultSize <= ) return emptyList ( ) if ( resultSize == ) return listOf ( last ( ) ) list = ArrayList < T > ( resultSize ) if ( this is List < T > ) { if ( this is RandomAccess ) { for ( index in n until size ) list . add ( this [ index ] ) } else { for ( item in listIterator ( n ) ) list . add ( item ) } return list } } else { list = ArrayList < T > ( ) } var count = for ( item in this ) { if ( count >= n ) list . add ( item ) else ++ count } return list . optimizeReadOnlyList ( ) }","docstring":"/**\n * Returns a list containing all elements except first [n] elements.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.collections.Collections.Transformations.drop\n */"} {"signature":"public fun < T > List < T > . dropLast ( n : Int ) : List < T >","body":"{ require ( n >= ) { \"\" } return take ( ( size - n ) . coerceAtLeast ( ) ) }","docstring":"/**\n * Returns a list containing all elements except last [n] elements.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.collections.Collections.Transformations.drop\n */"} {"signature":"public inline fun < T > List < T > . dropLastWhile ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ if ( ! isEmpty ( ) ) { val iterator = listIterator ( size ) while ( iterator . hasPrevious ( ) ) { if ( ! predicate ( iterator . previous ( ) ) ) { return take ( iterator . nextIndex ( ) + ) } } } return emptyList ( ) }","docstring":"/**\n * Returns a list containing all elements except last elements that satisfy the given [predicate].\n * \n * @sample samples.collections.Collections.Transformations.drop\n */"} {"signature":"public inline fun < T > Iterable < T > . dropWhile ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ var yielding = false val list = ArrayList < T > ( ) for ( item in this ) if ( yielding ) list . add ( item ) else if ( ! predicate ( item ) ) { list . add ( item ) yielding = true } return list }","docstring":"/**\n * Returns a list containing all elements except first elements that satisfy the given [predicate].\n * \n * @sample samples.collections.Collections.Transformations.drop\n */"} {"signature":"public inline fun < T > Iterable < T > . filter ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ return filterTo ( ArrayList < T > ( ) , predicate ) }","docstring":"/**\n * Returns a list containing only elements matching the given [predicate].\n * \n * @sample samples.collections.Collections.Filtering.filter\n */"} {"signature":"public inline fun < T > Iterable < T > . filterIndexed ( predicate : ( index : Int , T ) -> Boolean ) : List < T >","body":"{ return filterIndexedTo ( ArrayList < T > ( ) , predicate ) }","docstring":"/**\n * Returns a list containing only elements matching the given [predicate].\n * @param [predicate] function that takes the index of an element and the element itself\n * and returns the result of predicate evaluation on the element.\n * \n * @sample samples.collections.Collections.Filtering.filterIndexed\n */"} {"signature":"public inline fun < T , C : MutableCollection < in T > > Iterable < T > . filterIndexedTo ( destination : C , predicate : ( index : Int , T ) -> Boolean ) : C","body":"{ forEachIndexed { index , element -> if ( predicate ( index , element ) ) destination . add ( element ) } return destination }","docstring":"/**\n * Appends all elements matching the given [predicate] to the given [destination].\n * @param [predicate] function that takes the index of an element and the element itself\n * and returns the result of predicate evaluation on the element.\n * \n * @sample samples.collections.Collections.Filtering.filterIndexedTo\n */"} {"signature":"public inline fun < reified R > Iterable < * > . filterIsInstance ( ) : List < @ kotlin . internal . NoInfer R >","body":"{ return filterIsInstanceTo ( ArrayList < R > ( ) ) }","docstring":"/**\n * Returns a list containing all elements that are instances of specified type parameter R.\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstance\n */"} {"signature":"public inline fun < reified R , C : MutableCollection < in R > > Iterable < * > . filterIsInstanceTo ( destination : C ) : C","body":"{ for ( element in this ) if ( element is R ) destination . add ( element ) return destination }","docstring":"/**\n * Appends all elements that are instances of specified type parameter R to the given [destination].\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstanceTo\n */"} {"signature":"public inline fun < T > Iterable < T > . filterNot ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ return filterNotTo ( ArrayList < T > ( ) , predicate ) }","docstring":"/**\n * Returns a list containing all elements not matching the given [predicate].\n * \n * @sample samples.collections.Collections.Filtering.filter\n */"} {"signature":"public fun < T : Any > Iterable < T ? > . filterNotNull ( ) : List < T >","body":"{ return filterNotNullTo ( ArrayList < T > ( ) ) }","docstring":"/**\n * Returns a list containing all elements that are not `null`.\n * \n * @sample samples.collections.Collections.Filtering.filterNotNull\n */"} {"signature":"public fun < C : MutableCollection < in T > , T : Any > Iterable < T ? > . filterNotNullTo ( destination : C ) : C","body":"{ for ( element in this ) if ( element != null ) destination . add ( element ) return destination }","docstring":"/**\n * Appends all elements that are not `null` to the given [destination].\n * \n * @sample samples.collections.Collections.Filtering.filterNotNullTo\n */"} {"signature":"public inline fun < T , C : MutableCollection < in T > > Iterable < T > . filterNotTo ( destination : C , predicate : ( T ) -> Boolean ) : C","body":"{ for ( element in this ) if ( ! predicate ( element ) ) destination . add ( element ) return destination }","docstring":"/**\n * Appends all elements not matching the given [predicate] to the given [destination].\n * \n * @sample samples.collections.Collections.Filtering.filterTo\n */"} {"signature":"public inline fun < T , C : MutableCollection < in T > > Iterable < T > . filterTo ( destination : C , predicate : ( T ) -> Boolean ) : C","body":"{ for ( element in this ) if ( predicate ( element ) ) destination . add ( element ) return destination }","docstring":"/**\n * Appends all elements matching the given [predicate] to the given [destination].\n * \n * @sample samples.collections.Collections.Filtering.filterTo\n */"} {"signature":"public fun < T > List < T > . slice ( indices : IntRange ) : List < T >","body":"{ if ( indices . isEmpty ( ) ) return listOf ( ) return this . subList ( indices . start , indices . endInclusive + ) . toList ( ) }","docstring":"/**\n * Returns a list containing elements at indices in the specified [indices] range.\n */"} {"signature":"public fun < T > List < T > . slice ( indices : Iterable < Int > ) : List < T >","body":"{ val size = indices . collectionSizeOrDefault ( ) if ( size == ) return emptyList ( ) val list = ArrayList < T > ( size ) for ( index in indices ) { list . add ( get ( index ) ) } return list }","docstring":"/**\n * Returns a list containing elements at specified [indices].\n */"} {"signature":"public fun < T > Iterable < T > . take ( n : Int ) : List < T >","body":"{ require ( n >= ) { \"\" } if ( n == ) return emptyList ( ) if ( this is Collection < T > ) { if ( n >= size ) return toList ( ) if ( n == ) return listOf ( first ( ) ) } var count = val list = ArrayList < T > ( n ) for ( item in this ) { list . add ( item ) if ( ++ count == n ) break } return list . optimizeReadOnlyList ( ) }","docstring":"/**\n * Returns a list containing first [n] elements.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.collections.Collections.Transformations.take\n */"} {"signature":"public fun < T > List < T > . takeLast ( n : Int ) : List < T >","body":"{ require ( n >= ) { \"\" } if ( n == ) return emptyList ( ) val size = size if ( n >= size ) return toList ( ) if ( n == ) return listOf ( last ( ) ) val list = ArrayList < T > ( n ) if ( this is RandomAccess ) { for ( index in size - n until size ) list . add ( this [ index ] ) } else { for ( item in listIterator ( size - n ) ) list . add ( item ) } return list }","docstring":"/**\n * Returns a list containing last [n] elements.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.collections.Collections.Transformations.take\n */"} {"signature":"public inline fun < T > List < T > . takeLastWhile ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) val iterator = listIterator ( size ) while ( iterator . hasPrevious ( ) ) { if ( ! predicate ( iterator . previous ( ) ) ) { iterator . next ( ) val expectedSize = size - iterator . nextIndex ( ) if ( expectedSize == ) return emptyList ( ) return ArrayList < T > ( expectedSize ) . apply { while ( iterator . hasNext ( ) ) add ( iterator . next ( ) ) } } } return toList ( ) }","docstring":"/**\n * Returns a list containing last elements satisfying the given [predicate].\n * \n * @sample samples.collections.Collections.Transformations.take\n */"} {"signature":"public inline fun < T > Iterable < T > . takeWhile ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ val list = ArrayList < T > ( ) for ( item in this ) { if ( ! predicate ( item ) ) break list . add ( item ) } return list }","docstring":"/**\n * Returns a list containing first elements satisfying the given [predicate].\n * \n * @sample samples.collections.Collections.Transformations.take\n */"} {"signature":"public expect fun < T > MutableList < T > . reverse ( ) : Unit","body":"public expect fun < T > MutableList < T > . reverse ( ) : Unit","docstring":"/**\n * Reverses elements in the list in-place.\n */"} {"signature":"public fun < T > Iterable < T > . reversed ( ) : List < T >","body":"{ if ( this is Collection && size <= ) return toList ( ) val list = toMutableList ( ) list . reverse ( ) return list }","docstring":"/**\n * Returns a list with elements in reversed order.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > MutableList < T > . shuffle ( random : Random ) : Unit","body":"{ for ( i in lastIndex downTo ) { val j = random . nextInt ( i + ) this [ j ] = this . set ( i , this [ j ] ) } }","docstring":"/**\n * Randomly shuffles elements in this list in-place using the specified [random] instance as the source of randomness.\n * \n * See: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#The_modern_algorithm\n */"} {"signature":"public inline fun < T , R : Comparable < R > > MutableList < T > . sortBy ( crossinline selector : ( T ) -> R ? ) : Unit","body":"{ if ( size > ) sortWith ( compareBy ( selector ) ) }","docstring":"/**\n * Sorts elements in the list in-place according to natural sort order of the value returned by specified [selector] function.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"public inline fun < T , R : Comparable < R > > MutableList < T > . sortByDescending ( crossinline selector : ( T ) -> R ? ) : Unit","body":"{ if ( size > ) sortWith ( compareByDescending ( selector ) ) }","docstring":"/**\n * Sorts elements in the list in-place descending according to natural sort order of the value returned by specified [selector] function.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"public fun < T : Comparable < T > > MutableList < T > . sortDescending ( ) : Unit","body":"{ sortWith ( reverseOrder ( ) ) }","docstring":"/**\n * Sorts elements in the list in-place descending according to their natural sort order.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"public fun < T : Comparable < T > > Iterable < T > . sorted ( ) : List < T >","body":"{ if ( this is Collection ) { if ( size <= ) return this . toList ( ) @ Suppress ( \"\" ) return ( toTypedArray < Comparable < T > > ( ) as Array < T > ) . apply { sort ( ) } . asList ( ) } return toMutableList ( ) . apply { sort ( ) } }","docstring":"/**\n * Returns a list of all elements sorted according to their natural sort order.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"public inline fun < T , R : Comparable < R > > Iterable < T > . sortedBy ( crossinline selector : ( T ) -> R ? ) : List < T >","body":"{ return sortedWith ( compareBy ( selector ) ) }","docstring":"/**\n * Returns a list of all elements sorted according to natural sort order of the value returned by specified [selector] function.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @sample samples.collections.Collections.Sorting.sortedBy\n */"} {"signature":"public inline fun < T , R : Comparable < R > > Iterable < T > . sortedByDescending ( crossinline selector : ( T ) -> R ? ) : List < T >","body":"{ return sortedWith ( compareByDescending ( selector ) ) }","docstring":"/**\n * Returns a list of all elements sorted descending according to natural sort order of the value returned by specified [selector] function.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"public fun < T : Comparable < T > > Iterable < T > . sortedDescending ( ) : List < T >","body":"{ return sortedWith ( reverseOrder ( ) ) }","docstring":"/**\n * Returns a list of all elements sorted descending according to their natural sort order.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"public fun < T > Iterable < T > . sortedWith ( comparator : Comparator < in T > ) : List < T >","body":"{ if ( this is Collection ) { if ( size <= ) return this . toList ( ) @ Suppress ( \"\" ) return ( toTypedArray < Any ? > ( ) as Array < T > ) . apply { sortWith ( comparator ) } . asList ( ) } return toMutableList ( ) . apply { sortWith ( comparator ) } }","docstring":"/**\n * Returns a list of all elements sorted according to the specified [comparator].\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"public fun Collection < Boolean > . toBooleanArray ( ) : BooleanArray","body":"{ val result = BooleanArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Boolean containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < Byte > . toByteArray ( ) : ByteArray","body":"{ val result = ByteArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Byte containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < Char > . toCharArray ( ) : CharArray","body":"{ val result = CharArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Char containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < Double > . toDoubleArray ( ) : DoubleArray","body":"{ val result = DoubleArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Double containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < Float > . toFloatArray ( ) : FloatArray","body":"{ val result = FloatArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Float containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < Int > . toIntArray ( ) : IntArray","body":"{ val result = IntArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Int containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < Long > . toLongArray ( ) : LongArray","body":"{ val result = LongArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Long containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < Short > . toShortArray ( ) : ShortArray","body":"{ val result = ShortArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of Short containing all of the elements of this collection.\n */"} {"signature":"public inline fun < T , K , V > Iterable < T > . associate ( transform : ( T ) -> Pair < K , V > ) : Map < K , V >","body":"{ val capacity = mapCapacity ( collectionSizeOrDefault ( ) ) . coerceAtLeast ( ) return associateTo ( LinkedHashMap < K , V > ( capacity ) , transform ) }","docstring":"/**\n * Returns a [Map] containing key-value pairs provided by [transform] function\n * applied to elements of the given collection.\n * \n * If any of two pairs would have the same key the last one gets added to the map.\n * \n * The returned map preserves the entry iteration order of the original collection.\n * \n * @sample samples.collections.Collections.Transformations.associate\n */"} {"signature":"public inline fun < T , K > Iterable < T > . associateBy ( keySelector : ( T ) -> K ) : Map < K , T >","body":"{ val capacity = mapCapacity ( collectionSizeOrDefault ( ) ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap < K , T > ( capacity ) , keySelector ) }","docstring":"/**\n * Returns a [Map] containing the elements from the given collection indexed by the key\n * returned from [keySelector] function applied to each element.\n * \n * If any two elements would have the same key returned by [keySelector] the last one gets added to the map.\n * \n * The returned map preserves the entry iteration order of the original collection.\n * \n * @sample samples.collections.Collections.Transformations.associateBy\n */"} {"signature":"public inline fun < T , K , V > Iterable < T > . associateBy ( keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : Map < K , V >","body":"{ val capacity = mapCapacity ( collectionSizeOrDefault ( ) ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap < K , V > ( capacity ) , keySelector , valueTransform ) }","docstring":"/**\n * Returns a [Map] containing the values provided by [valueTransform] and indexed by [keySelector] functions applied to elements of the given collection.\n * \n * If any two elements would have the same key returned by [keySelector] the last one gets added to the map.\n * \n * The returned map preserves the entry iteration order of the original collection.\n * \n * @sample samples.collections.Collections.Transformations.associateByWithValueTransform\n */"} {"signature":"public inline fun < T , K , M : MutableMap < in K , in T > > Iterable < T > . associateByTo ( destination : M , keySelector : ( T ) -> K ) : M","body":"{ for ( element in this ) { destination . put ( keySelector ( element ) , element ) } return destination }","docstring":"/**\n * Populates and returns the [destination] mutable map with key-value pairs,\n * where key is provided by the [keySelector] function applied to each element of the given collection\n * and value is the element itself.\n * \n * If any two elements would have the same key returned by [keySelector] the last one gets added to the map.\n * \n * @sample samples.collections.Collections.Transformations.associateByTo\n */"} {"signature":"public inline fun < T , K , V , M : MutableMap < in K , in V > > Iterable < T > . associateByTo ( destination : M , keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : M","body":"{ for ( element in this ) { destination . put ( keySelector ( element ) , valueTransform ( element ) ) } return destination }","docstring":"/**\n * Populates and returns the [destination] mutable map with key-value pairs,\n * where key is provided by the [keySelector] function and\n * and value is provided by the [valueTransform] function applied to elements of the given collection.\n * \n * If any two elements would have the same key returned by [keySelector] the last one gets added to the map.\n * \n * @sample samples.collections.Collections.Transformations.associateByToWithValueTransform\n */"} {"signature":"public inline fun < T , K , V , M : MutableMap < in K , in V > > Iterable < T > . associateTo ( destination : M , transform : ( T ) -> Pair < K , V > ) : M","body":"{ for ( element in this ) { destination += transform ( element ) } return destination }","docstring":"/**\n * Populates and returns the [destination] mutable map with key-value pairs\n * provided by [transform] function applied to each element of the given collection.\n * \n * If any of two pairs would have the same key the last one gets added to the map.\n * \n * @sample samples.collections.Collections.Transformations.associateTo\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < K , V > Iterable < K > . associateWith ( valueSelector : ( K ) -> V ) : Map < K , V >","body":"{ val result = LinkedHashMap < K , V > ( mapCapacity ( collectionSizeOrDefault ( ) ) . coerceAtLeast ( ) ) return associateWithTo ( result , valueSelector ) }","docstring":"/**\n * Returns a [Map] where keys are elements from the given collection and values are\n * produced by the [valueSelector] function applied to each element.\n * \n * If any two elements are equal, the last one gets added to the map.\n * \n * The returned map preserves the entry iteration order of the original collection.\n * \n * @sample samples.collections.Collections.Transformations.associateWith\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < K , V , M : MutableMap < in K , in V > > Iterable < K > . associateWithTo ( destination : M , valueSelector : ( K ) -> V ) : M","body":"{ for ( element in this ) { destination . put ( element , valueSelector ( element ) ) } return destination }","docstring":"/**\n * Populates and returns the [destination] mutable map with key-value pairs for each element of the given collection,\n * where key is the element itself and value is provided by the [valueSelector] function applied to that key.\n * \n * If any two elements are equal, the last one overwrites the former value in the map.\n * \n * @sample samples.collections.Collections.Transformations.associateWithTo\n */"} {"signature":"public fun < T , C : MutableCollection < in T > > Iterable < T > . toCollection ( destination : C ) : C","body":"{ for ( item in this ) { destination . add ( item ) } return destination }","docstring":"/**\n * Appends all elements to the given [destination] collection.\n */"} {"signature":"public fun < T > Iterable < T > . toHashSet ( ) : HashSet < T >","body":"{ return toCollection ( HashSet < T > ( mapCapacity ( collectionSizeOrDefault ( ) ) ) ) }","docstring":"/**\n * Returns a new [HashSet] of all elements.\n */"} {"signature":"public fun < T > Iterable < T > . toList ( ) : List < T >","body":"{ if ( this is Collection ) { return when ( size ) { -> emptyList ( ) -> listOf ( if ( this is List ) get ( ) else iterator ( ) . next ( ) ) else -> this . toMutableList ( ) } } return this . toMutableList ( ) . optimizeReadOnlyList ( ) }","docstring":"/**\n * Returns a [List] containing all elements.\n */"} {"signature":"public fun < T > Iterable < T > . toMutableList ( ) : MutableList < T >","body":"{ if ( this is Collection < T > ) return this . toMutableList ( ) return toCollection ( ArrayList < T > ( ) ) }","docstring":"/**\n * Returns a new [MutableList] filled with all elements of this collection.\n */"} {"signature":"public fun < T > Collection < T > . toMutableList ( ) : MutableList < T >","body":"{ return ArrayList ( this ) }","docstring":"/**\n * Returns a new [MutableList] filled with all elements of this collection.\n */"} {"signature":"public fun < T > Iterable < T > . toSet ( ) : Set < T >","body":"{ if ( this is Collection ) { return when ( size ) { -> emptySet ( ) -> setOf ( if ( this is List ) this [ ] else iterator ( ) . next ( ) ) else -> toCollection ( LinkedHashSet < T > ( mapCapacity ( size ) ) ) } } return toCollection ( LinkedHashSet < T > ( ) ) . optimizeReadOnlySet ( ) }","docstring":"/**\n * Returns a [Set] of all elements.\n * \n * The returned set preserves the element iteration order of the original collection.\n */"} {"signature":"public inline fun < T , R > Iterable < T > . flatMap ( transform : ( T ) -> Iterable < R > ) : List < R >","body":"{ return flatMapTo ( ArrayList < R > ( ) , transform ) }","docstring":"/**\n * Returns a single list of all elements yielded from results of [transform] function being invoked on each element of original collection.\n * \n * @sample samples.collections.Collections.Transformations.flatMap\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public inline fun < T , R > Iterable < T > . flatMap ( transform : ( T ) -> Sequence < R > ) : List < R >","body":"{ return flatMapTo ( ArrayList < R > ( ) , transform ) }","docstring":"/**\n * Returns a single list of all elements yielded from results of [transform] function being invoked on each element of original collection.\n * \n * @sample samples.collections.Collections.Transformations.flatMap\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R > Iterable < T > . flatMapIndexed ( transform : ( index : Int , T ) -> Iterable < R > ) : List < R >","body":"{ return flatMapIndexedTo ( ArrayList < R > ( ) , transform ) }","docstring":"/**\n * Returns a single list of all elements yielded from results of [transform] function being invoked on each element\n * and its index in the original collection.\n * \n * @sample samples.collections.Collections.Transformations.flatMapIndexed\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R > Iterable < T > . flatMapIndexed ( transform : ( index : Int , T ) -> Sequence < R > ) : List < R >","body":"{ return flatMapIndexedTo ( ArrayList < R > ( ) , transform ) }","docstring":"/**\n * Returns a single list of all elements yielded from results of [transform] function being invoked on each element\n * and its index in the original collection.\n * \n * @sample samples.collections.Collections.Transformations.flatMapIndexed\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R , C : MutableCollection < in R > > Iterable < T > . flatMapIndexedTo ( destination : C , transform : ( index : Int , T ) -> Iterable < R > ) : C","body":"{ var index = for ( element in this ) { val list = transform ( checkIndexOverflow ( index ++ ) , element ) destination . addAll ( list ) } return destination }","docstring":"/**\n * Appends all elements yielded from results of [transform] function being invoked on each element\n * and its index in the original collection, to the given [destination].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R , C : MutableCollection < in R > > Iterable < T > . flatMapIndexedTo ( destination : C , transform : ( index : Int , T ) -> Sequence < R > ) : C","body":"{ var index = for ( element in this ) { val list = transform ( checkIndexOverflow ( index ++ ) , element ) destination . addAll ( list ) } return destination }","docstring":"/**\n * Appends all elements yielded from results of [transform] function being invoked on each element\n * and its index in the original collection, to the given [destination].\n */"} {"signature":"public inline fun < T , R , C : MutableCollection < in R > > Iterable < T > . flatMapTo ( destination : C , transform : ( T ) -> Iterable < R > ) : C","body":"{ for ( element in this ) { val list = transform ( element ) destination . addAll ( list ) } return destination }","docstring":"/**\n * Appends all elements yielded from results of [transform] function being invoked on each element of original collection, to the given [destination].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public inline fun < T , R , C : MutableCollection < in R > > Iterable < T > . flatMapTo ( destination : C , transform : ( T ) -> Sequence < R > ) : C","body":"{ for ( element in this ) { val list = transform ( element ) destination . addAll ( list ) } return destination }","docstring":"/**\n * Appends all elements yielded from results of [transform] function being invoked on each element of original collection, to the given [destination].\n */"} {"signature":"public inline fun < T , K > Iterable < T > . groupBy ( keySelector : ( T ) -> K ) : Map < K , List < T > >","body":"{ return groupByTo ( LinkedHashMap < K , MutableList < T > > ( ) , keySelector ) }","docstring":"/**\n * Groups elements of the original collection by the key returned by the given [keySelector] function\n * applied to each element and returns a map where each group key is associated with a list of corresponding elements.\n * \n * The returned map preserves the entry iteration order of the keys produced from the original collection.\n * \n * @sample samples.collections.Collections.Transformations.groupBy\n */"} {"signature":"public inline fun < T , K , V > Iterable < T > . groupBy ( keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : Map < K , List < V > >","body":"{ return groupByTo ( LinkedHashMap < K , MutableList < V > > ( ) , keySelector , valueTransform ) }","docstring":"/**\n * Groups values returned by the [valueTransform] function applied to each element of the original collection\n * by the key returned by the given [keySelector] function applied to the element\n * and returns a map where each group key is associated with a list of corresponding values.\n * \n * The returned map preserves the entry iteration order of the keys produced from the original collection.\n * \n * @sample samples.collections.Collections.Transformations.groupByKeysAndValues\n */"} {"signature":"public inline fun < T , K , M : MutableMap < in K , MutableList < T > > > Iterable < T > . groupByTo ( destination : M , keySelector : ( T ) -> K ) : M","body":"{ for ( element in this ) { val key = keySelector ( element ) val list = destination . getOrPut ( key ) { ArrayList < T > ( ) } list . add ( element ) } return destination }","docstring":"/**\n * Groups elements of the original collection by the key returned by the given [keySelector] function\n * applied to each element and puts to the [destination] map each group key associated with a list of corresponding elements.\n * \n * @return The [destination] map.\n * \n * @sample samples.collections.Collections.Transformations.groupBy\n */"} {"signature":"public inline fun < T , K , V , M : MutableMap < in K , MutableList < V > > > Iterable < T > . groupByTo ( destination : M , keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : M","body":"{ for ( element in this ) { val key = keySelector ( element ) val list = destination . getOrPut ( key ) { ArrayList < V > ( ) } list . add ( valueTransform ( element ) ) } return destination }","docstring":"/**\n * Groups values returned by the [valueTransform] function applied to each element of the original collection\n * by the key returned by the given [keySelector] function applied to the element\n * and puts to the [destination] map each group key associated with a list of corresponding values.\n * \n * @return The [destination] map.\n * \n * @sample samples.collections.Collections.Transformations.groupByKeysAndValues\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K > Iterable < T > . groupingBy ( crossinline keySelector : ( T ) -> K ) : Grouping < T , K >","body":"{ return object : Grouping < T , K > { override fun sourceIterator ( ) : Iterator < T > = this@groupingBy . iterator ( ) override fun keyOf ( element : T ) : K = keySelector ( element ) } }","docstring":"/**\n * Creates a [Grouping] source from a collection to be used later with one of group-and-fold operations\n * using the specified [keySelector] function to extract a key from each element.\n * \n * @sample samples.collections.Grouping.groupingByEachCount\n */"} {"signature":"public inline fun < T , R > Iterable < T > . map ( transform : ( T ) -> R ) : List < R >","body":"{ return mapTo ( ArrayList < R > ( collectionSizeOrDefault ( ) ) , transform ) }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to each element in the original collection.\n * \n * @sample samples.collections.Collections.Transformations.map\n */"} {"signature":"public inline fun < T , R > Iterable < T > . mapIndexed ( transform : ( index : Int , T ) -> R ) : List < R >","body":"{ return mapIndexedTo ( ArrayList < R > ( collectionSizeOrDefault ( ) ) , transform ) }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to each element and its index in the original collection.\n * @param [transform] function that takes the index of an element and the element itself\n * and returns the result of the transform applied to the element.\n */"} {"signature":"public inline fun < T , R : Any > Iterable < T > . mapIndexedNotNull ( transform : ( index : Int , T ) -> R ? ) : List < R >","body":"{ return mapIndexedNotNullTo ( ArrayList < R > ( ) , transform ) }","docstring":"/**\n * Returns a list containing only the non-null results of applying the given [transform] function\n * to each element and its index in the original collection.\n * @param [transform] function that takes the index of an element and the element itself\n * and returns the result of the transform applied to the element.\n */"} {"signature":"public inline fun < T , R : Any , C : MutableCollection < in R > > Iterable < T > . mapIndexedNotNullTo ( destination : C , transform : ( index : Int , T ) -> R ? ) : C","body":"{ forEachIndexed { index , element -> transform ( index , element ) ? . let { destination . add ( it ) } } return destination }","docstring":"/**\n * Applies the given [transform] function to each element and its index in the original collection\n * and appends only the non-null results to the given [destination].\n * @param [transform] function that takes the index of an element and the element itself\n * and returns the result of the transform applied to the element.\n */"} {"signature":"public inline fun < T , R , C : MutableCollection < in R > > Iterable < T > . mapIndexedTo ( destination : C , transform : ( index : Int , T ) -> R ) : C","body":"{ var index = for ( item in this ) destination . add ( transform ( checkIndexOverflow ( index ++ ) , item ) ) return destination }","docstring":"/**\n * Applies the given [transform] function to each element and its index in the original collection\n * and appends the results to the given [destination].\n * @param [transform] function that takes the index of an element and the element itself\n * and returns the result of the transform applied to the element.\n */"} {"signature":"public inline fun < T , R : Any > Iterable < T > . mapNotNull ( transform : ( T ) -> R ? ) : List < R >","body":"{ return mapNotNullTo ( ArrayList < R > ( ) , transform ) }","docstring":"/**\n * Returns a list containing only the non-null results of applying the given [transform] function\n * to each element in the original collection.\n * \n * @sample samples.collections.Collections.Transformations.mapNotNull\n */"} {"signature":"public inline fun < T , R : Any , C : MutableCollection < in R > > Iterable < T > . mapNotNullTo ( destination : C , transform : ( T ) -> R ? ) : C","body":"{ forEach { element -> transform ( element ) ? . let { destination . add ( it ) } } return destination }","docstring":"/**\n * Applies the given [transform] function to each element in the original collection\n * and appends only the non-null results to the given [destination].\n */"} {"signature":"public inline fun < T , R , C : MutableCollection < in R > > Iterable < T > . mapTo ( destination : C , transform : ( T ) -> R ) : C","body":"{ for ( item in this ) destination . add ( transform ( item ) ) return destination }","docstring":"/**\n * Applies the given [transform] function to each element of the original collection\n * and appends the results to the given [destination].\n */"} {"signature":"public fun < T > Iterable < T > . withIndex ( ) : Iterable < IndexedValue < T > >","body":"{ return IndexingIterable { iterator ( ) } }","docstring":"/**\n * Returns a lazy [Iterable] that wraps each element of the original collection\n * into an [IndexedValue] containing the index of that element and the element itself.\n */"} {"signature":"public fun < T > Iterable < T > . distinct ( ) : List < T >","body":"{ return this . toMutableSet ( ) . toList ( ) }","docstring":"/**\n * Returns a list containing only distinct elements from the given collection.\n * \n * Among equal elements of the given collection, only the first one will be present in the resulting list.\n * The elements in the resulting list are in the same order as they were in the source collection.\n * \n * @sample samples.collections.Collections.Transformations.distinctAndDistinctBy\n */"} {"signature":"public inline fun < T , K > Iterable < T > . distinctBy ( selector : ( T ) -> K ) : List < T >","body":"{ val set = HashSet < K > ( ) val list = ArrayList < T > ( ) for ( e in this ) { val key = selector ( e ) if ( set . add ( key ) ) list . add ( e ) } return list }","docstring":"/**\n * Returns a list containing only elements from the given collection\n * having distinct keys returned by the given [selector] function.\n * \n * Among elements of the given collection with equal keys, only the first one will be present in the resulting list.\n * The elements in the resulting list are in the same order as they were in the source collection.\n * \n * @sample samples.collections.Collections.Transformations.distinctAndDistinctBy\n */"} {"signature":"public infix fun < T > Iterable < T > . intersect ( other : Iterable < T > ) : Set < T >","body":"{ val set = this . toMutableSet ( ) set . retainAll ( other ) return set }","docstring":"/**\n * Returns a set containing all elements that are contained by both this collection and the specified collection.\n * \n * The returned set preserves the element iteration order of the original collection.\n * \n * To get a set containing all elements that are contained at least in one of these collections use [union].\n */"} {"signature":"public infix fun < T > Iterable < T > . subtract ( other : Iterable < T > ) : Set < T >","body":"{ val set = this . toMutableSet ( ) set . removeAll ( other ) return set }","docstring":"/**\n * Returns a set containing all elements that are contained by this collection and not contained by the specified collection.\n * \n * The returned set preserves the element iteration order of the original collection.\n */"} {"signature":"public fun < T > Iterable < T > . toMutableSet ( ) : MutableSet < T >","body":"{ return when ( this ) { is Collection < T > -> LinkedHashSet ( this ) else -> toCollection ( LinkedHashSet < T > ( ) ) } }","docstring":"/**\n * Returns a new [MutableSet] containing all distinct elements from the given collection.\n * \n * The returned set preserves the element iteration order of the original collection.\n */"} {"signature":"public infix fun < T > Iterable < T > . union ( other : Iterable < T > ) : Set < T >","body":"{ val set = this . toMutableSet ( ) set . addAll ( other ) return set }","docstring":"/**\n * Returns a set containing all distinct elements from both collections.\n * \n * The returned set preserves the element iteration order of the original collection.\n * Those elements of the [other] collection that are unique are iterated in the end\n * in the order of the [other] collection.\n * \n * To get a set containing all elements that are contained in both collections use [intersect].\n */"} {"signature":"public inline fun < T > Iterable < T > . all ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ if ( this is Collection && isEmpty ( ) ) return true for ( element in this ) if ( ! predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if all elements match the given [predicate].\n * \n * Note that if the collection contains no elements, the function returns `true`\n * because there are no elements in it that _do not_ match the predicate.\n * See a more detailed explanation of this logic concept in [\"Vacuous truth\"](https://en.wikipedia.org/wiki/Vacuous_truth) article.\n * \n * @sample samples.collections.Collections.Aggregates.all\n */"} {"signature":"public fun < T > Iterable < T > . any ( ) : Boolean","body":"{ if ( this is Collection ) return ! isEmpty ( ) return iterator ( ) . hasNext ( ) }","docstring":"/**\n * Returns `true` if collection has at least one element.\n * \n * @sample samples.collections.Collections.Aggregates.any\n */"} {"signature":"public inline fun < T > Iterable < T > . any ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ if ( this is Collection && isEmpty ( ) ) return false for ( element in this ) if ( predicate ( element ) ) return true return false }","docstring":"/**\n * Returns `true` if at least one element matches the given [predicate].\n * \n * @sample samples.collections.Collections.Aggregates.anyWithPredicate\n */"} {"signature":"public fun < T > Iterable < T > . count ( ) : Int","body":"{ if ( this is Collection ) return size var count = for ( element in this ) checkCountOverflow ( ++ count ) return count }","docstring":"/**\n * Returns the number of elements in this collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Collection < T > . count ( ) : Int","body":"{ return size }","docstring":"/**\n * Returns the number of elements in this collection.\n */"} {"signature":"public inline fun < T > Iterable < T > . count ( predicate : ( T ) -> Boolean ) : Int","body":"{ if ( this is Collection && isEmpty ( ) ) return var count = for ( element in this ) if ( predicate ( element ) ) checkCountOverflow ( ++ count ) return count }","docstring":"/**\n * Returns the number of elements matching the given [predicate].\n */"} {"signature":"public inline fun < T , R > Iterable < T > . fold ( initial : R , operation : ( acc : R , T ) -> R ) : R","body":"{ var accumulator = initial for ( element in this ) accumulator = operation ( accumulator , element ) return accumulator }","docstring":"/**\n * Accumulates value starting with [initial] value and applying [operation] from left to right\n * to current accumulator value and each element.\n * \n * Returns the specified [initial] value if the collection is empty.\n * \n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n */"} {"signature":"public inline fun < T , R > Iterable < T > . foldIndexed ( initial : R , operation : ( index : Int , acc : R , T ) -> R ) : R","body":"{ var index = var accumulator = initial for ( element in this ) accumulator = operation ( checkIndexOverflow ( index ++ ) , accumulator , element ) return accumulator }","docstring":"/**\n * Accumulates value starting with [initial] value and applying [operation] from left to right\n * to current accumulator value and each element with its index in the original collection.\n * \n * Returns the specified [initial] value if the collection is empty.\n * \n * @param [operation] function that takes the index of an element, current accumulator value\n * and the element itself, and calculates the next accumulator value.\n */"} {"signature":"public inline fun < T , R > List < T > . foldRight ( initial : R , operation : ( T , acc : R ) -> R ) : R","body":"{ var accumulator = initial if ( ! isEmpty ( ) ) { val iterator = listIterator ( size ) while ( iterator . hasPrevious ( ) ) { accumulator = operation ( iterator . previous ( ) , accumulator ) } } return accumulator }","docstring":"/**\n * Accumulates value starting with [initial] value and applying [operation] from right to left\n * to each element and current accumulator value.\n * \n * Returns the specified [initial] value if the list is empty.\n * \n * @param [operation] function that takes an element and current accumulator value, and calculates the next accumulator value.\n */"} {"signature":"public inline fun < T , R > List < T > . foldRightIndexed ( initial : R , operation : ( index : Int , T , acc : R ) -> R ) : R","body":"{ var accumulator = initial if ( ! isEmpty ( ) ) { val iterator = listIterator ( size ) while ( iterator . hasPrevious ( ) ) { val index = iterator . previousIndex ( ) accumulator = operation ( index , iterator . previous ( ) , accumulator ) } } return accumulator }","docstring":"/**\n * Accumulates value starting with [initial] value and applying [operation] from right to left\n * to each element with its index in the original list and current accumulator value.\n * \n * Returns the specified [initial] value if the list is empty.\n * \n * @param [operation] function that takes the index of an element, the element itself\n * and current accumulator value, and calculates the next accumulator value.\n */"} {"signature":"@ kotlin . internal . HidesMembers public inline fun < T > Iterable < T > . forEach ( action : ( T ) -> Unit ) : Unit","body":"{ for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each element.\n */"} {"signature":"public inline fun < T > Iterable < T > . forEachIndexed ( action : ( index : Int , T ) -> Unit ) : Unit","body":"{ var index = for ( item in this ) action ( checkIndexOverflow ( index ++ ) , item ) }","docstring":"/**\n * Performs the given [action] on each element, providing sequential index with the element.\n * @param [action] function that takes the index of an element and the element itself\n * and performs the action on the element.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Iterable < Double > . max ( ) : Double","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) max = maxOf ( max , e ) } return max }","docstring":"/**\n * Returns the largest element.\n * \n * If any of elements is `NaN` returns `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Iterable < Float > . max ( ) : Float","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) max = maxOf ( max , e ) } return max }","docstring":"/**\n * Returns the largest element.\n * \n * If any of elements is `NaN` returns `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T : Comparable < T > > Iterable < T > . max ( ) : T","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( max < e ) max = e } return max }","docstring":"/**\n * Returns the largest element.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public inline fun < T , R : Comparable < R > > Iterable < T > . maxBy ( selector : ( T ) -> R ) : T","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var maxElem = iterator . next ( ) if ( ! iterator . hasNext ( ) ) return maxElem var maxValue = selector ( maxElem ) do { val e = iterator . next ( ) val v = selector ( e ) if ( maxValue < v ) { maxElem = e maxValue = v } } while ( iterator . hasNext ( ) ) return maxElem }","docstring":"/**\n * Returns the first element yielding the largest value of the given function.\n * \n * @throws NoSuchElementException if the collection is empty.\n * \n * @sample samples.collections.Collections.Aggregates.maxBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R : Comparable < R > > Iterable < T > . maxByOrNull ( selector : ( T ) -> R ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var maxElem = iterator . next ( ) if ( ! iterator . hasNext ( ) ) return maxElem var maxValue = selector ( maxElem ) do { val e = iterator . next ( ) val v = selector ( e ) if ( maxValue < v ) { maxElem = e maxValue = v } } while ( iterator . hasNext ( ) ) return maxElem }","docstring":"/**\n * Returns the first element yielding the largest value of the given function or `null` if there are no elements.\n * \n * @sample samples.collections.Collections.Aggregates.maxByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . maxOf ( selector : ( T ) -> Double ) : Double","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each element in the collection.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . maxOf ( selector : ( T ) -> Float ) : Float","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each element in the collection.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Iterable < T > . maxOf ( selector : ( T ) -> R ) : R","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( maxValue < v ) { maxValue = v } } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each element in the collection.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . maxOfOrNull ( selector : ( T ) -> Double ) : Double ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each element in the collection or `null` if there are no elements.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . maxOfOrNull ( selector : ( T ) -> Float ) : Float ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each element in the collection or `null` if there are no elements.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Iterable < T > . maxOfOrNull ( selector : ( T ) -> R ) : R ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( maxValue < v ) { maxValue = v } } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each element in the collection or `null` if there are no elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Iterable < T > . maxOfWith ( comparator : Comparator < in R > , selector : ( T ) -> R ) : R","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( comparator . compare ( maxValue , v ) < ) { maxValue = v } } return maxValue }","docstring":"/**\n * Returns the largest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each element in the collection.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Iterable < T > . maxOfWithOrNull ( comparator : Comparator < in R > , selector : ( T ) -> R ) : R ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var maxValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( comparator . compare ( maxValue , v ) < ) { maxValue = v } } return maxValue }","docstring":"/**\n * Returns the largest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each element in the collection or `null` if there are no elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Iterable < Double > . maxOrNull ( ) : Double ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) max = maxOf ( max , e ) } return max }","docstring":"/**\n * Returns the largest element or `null` if there are no elements.\n * \n * If any of elements is `NaN` returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Iterable < Float > . maxOrNull ( ) : Float ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) max = maxOf ( max , e ) } return max }","docstring":"/**\n * Returns the largest element or `null` if there are no elements.\n * \n * If any of elements is `NaN` returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T : Comparable < T > > Iterable < T > . maxOrNull ( ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( max < e ) max = e } return max }","docstring":"/**\n * Returns the largest element or `null` if there are no elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T > Iterable < T > . maxWith ( comparator : Comparator < in T > ) : T","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( comparator . compare ( max , e ) < ) max = e } return max }","docstring":"/**\n * Returns the first element having the largest value according to the provided [comparator].\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Iterable < T > . maxWithOrNull ( comparator : Comparator < in T > ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var max = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( comparator . compare ( max , e ) < ) max = e } return max }","docstring":"/**\n * Returns the first element having the largest value according to the provided [comparator] or `null` if there are no elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Iterable < Double > . min ( ) : Double","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) min = minOf ( min , e ) } return min }","docstring":"/**\n * Returns the smallest element.\n * \n * If any of elements is `NaN` returns `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Iterable < Float > . min ( ) : Float","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) min = minOf ( min , e ) } return min }","docstring":"/**\n * Returns the smallest element.\n * \n * If any of elements is `NaN` returns `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T : Comparable < T > > Iterable < T > . min ( ) : T","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( min > e ) min = e } return min }","docstring":"/**\n * Returns the smallest element.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public inline fun < T , R : Comparable < R > > Iterable < T > . minBy ( selector : ( T ) -> R ) : T","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var minElem = iterator . next ( ) if ( ! iterator . hasNext ( ) ) return minElem var minValue = selector ( minElem ) do { val e = iterator . next ( ) val v = selector ( e ) if ( minValue > v ) { minElem = e minValue = v } } while ( iterator . hasNext ( ) ) return minElem }","docstring":"/**\n * Returns the first element yielding the smallest value of the given function.\n * \n * @throws NoSuchElementException if the collection is empty.\n * \n * @sample samples.collections.Collections.Aggregates.minBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R : Comparable < R > > Iterable < T > . minByOrNull ( selector : ( T ) -> R ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var minElem = iterator . next ( ) if ( ! iterator . hasNext ( ) ) return minElem var minValue = selector ( minElem ) do { val e = iterator . next ( ) val v = selector ( e ) if ( minValue > v ) { minElem = e minValue = v } } while ( iterator . hasNext ( ) ) return minElem }","docstring":"/**\n * Returns the first element yielding the smallest value of the given function or `null` if there are no elements.\n * \n * @sample samples.collections.Collections.Aggregates.minByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . minOf ( selector : ( T ) -> Double ) : Double","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each element in the collection.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . minOf ( selector : ( T ) -> Float ) : Float","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each element in the collection.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Iterable < T > . minOf ( selector : ( T ) -> R ) : R","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( minValue > v ) { minValue = v } } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each element in the collection.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . minOfOrNull ( selector : ( T ) -> Double ) : Double ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each element in the collection or `null` if there are no elements.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . minOfOrNull ( selector : ( T ) -> Float ) : Float ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each element in the collection or `null` if there are no elements.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Iterable < T > . minOfOrNull ( selector : ( T ) -> R ) : R ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( minValue > v ) { minValue = v } } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each element in the collection or `null` if there are no elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Iterable < T > . minOfWith ( comparator : Comparator < in R > , selector : ( T ) -> R ) : R","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( comparator . compare ( minValue , v ) > ) { minValue = v } } return minValue }","docstring":"/**\n * Returns the smallest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each element in the collection.\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Iterable < T > . minOfWithOrNull ( comparator : Comparator < in R > , selector : ( T ) -> R ) : R ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var minValue = selector ( iterator . next ( ) ) while ( iterator . hasNext ( ) ) { val v = selector ( iterator . next ( ) ) if ( comparator . compare ( minValue , v ) > ) { minValue = v } } return minValue }","docstring":"/**\n * Returns the smallest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each element in the collection or `null` if there are no elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Iterable < Double > . minOrNull ( ) : Double ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) min = minOf ( min , e ) } return min }","docstring":"/**\n * Returns the smallest element or `null` if there are no elements.\n * \n * If any of elements is `NaN` returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Iterable < Float > . minOrNull ( ) : Float ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) min = minOf ( min , e ) } return min }","docstring":"/**\n * Returns the smallest element or `null` if there are no elements.\n * \n * If any of elements is `NaN` returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T : Comparable < T > > Iterable < T > . minOrNull ( ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( min > e ) min = e } return min }","docstring":"/**\n * Returns the smallest element or `null` if there are no elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T > Iterable < T > . minWith ( comparator : Comparator < in T > ) : T","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( ) var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( comparator . compare ( min , e ) > ) min = e } return min }","docstring":"/**\n * Returns the first element having the smallest value according to the provided [comparator].\n * \n * @throws NoSuchElementException if the collection is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Iterable < T > . minWithOrNull ( comparator : Comparator < in T > ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var min = iterator . next ( ) while ( iterator . hasNext ( ) ) { val e = iterator . next ( ) if ( comparator . compare ( min , e ) > ) min = e } return min }","docstring":"/**\n * Returns the first element having the smallest value according to the provided [comparator] or `null` if there are no elements.\n */"} {"signature":"public fun < T > Iterable < T > . none ( ) : Boolean","body":"{ if ( this is Collection ) return isEmpty ( ) return ! iterator ( ) . hasNext ( ) }","docstring":"/**\n * Returns `true` if the collection has no elements.\n * \n * @sample samples.collections.Collections.Aggregates.none\n */"} {"signature":"public inline fun < T > Iterable < T > . none ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ if ( this is Collection && isEmpty ( ) ) return true for ( element in this ) if ( predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if no elements match the given [predicate].\n * \n * @sample samples.collections.Collections.Aggregates.noneWithPredicate\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , C : Iterable < T > > C . onEach ( action : ( T ) -> Unit ) : C","body":"{ return apply { for ( element in this ) action ( element ) } }","docstring":"/**\n * Performs the given [action] on each element and returns the collection itself afterwards.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , C : Iterable < T > > C . onEachIndexed ( action : ( index : Int , T ) -> Unit ) : C","body":"{ return apply { forEachIndexed ( action ) } }","docstring":"/**\n * Performs the given [action] on each element, providing sequential index with the element,\n * and returns the collection itself afterwards.\n * @param [action] function that takes the index of an element and the element itself\n * and performs the action on the element.\n */"} {"signature":"public inline fun < S , T : S > Iterable < T > . reduce ( operation : ( acc : S , T ) -> S ) : S","body":"{ val iterator = this . iterator ( ) if ( ! iterator . hasNext ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator : S = iterator . next ( ) while ( iterator . hasNext ( ) ) { accumulator = operation ( accumulator , iterator . next ( ) ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first element and applying [operation] from left to right\n * to current accumulator value and each element.\n * \n * Throws an exception if this collection is empty. If the collection can be empty in an expected way,\n * please use [reduceOrNull] instead. It returns `null` when its receiver is empty.\n * \n * @param [operation] function that takes current accumulator value and an element,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduce\n */"} {"signature":"public inline fun < S , T : S > Iterable < T > . reduceIndexed ( operation : ( index : Int , acc : S , T ) -> S ) : S","body":"{ val iterator = this . iterator ( ) if ( ! iterator . hasNext ( ) ) throw UnsupportedOperationException ( \"\" ) var index = var accumulator : S = iterator . next ( ) while ( iterator . hasNext ( ) ) { accumulator = operation ( checkIndexOverflow ( index ++ ) , accumulator , iterator . next ( ) ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first element and applying [operation] from left to right\n * to current accumulator value and each element with its index in the original collection.\n * \n * Throws an exception if this collection is empty. If the collection can be empty in an expected way,\n * please use [reduceIndexedOrNull] instead. It returns `null` when its receiver is empty.\n * \n * @param [operation] function that takes the index of an element, current accumulator value and the element itself,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > Iterable < T > . reduceIndexedOrNull ( operation : ( index : Int , acc : S , T ) -> S ) : S ?","body":"{ val iterator = this . iterator ( ) if ( ! iterator . hasNext ( ) ) return null var index = var accumulator : S = iterator . next ( ) while ( iterator . hasNext ( ) ) { accumulator = operation ( checkIndexOverflow ( index ++ ) , accumulator , iterator . next ( ) ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first element and applying [operation] from left to right\n * to current accumulator value and each element with its index in the original collection.\n * \n * Returns `null` if the collection is empty.\n * \n * @param [operation] function that takes the index of an element, current accumulator value and the element itself,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > Iterable < T > . reduceOrNull ( operation : ( acc : S , T ) -> S ) : S ?","body":"{ val iterator = this . iterator ( ) if ( ! iterator . hasNext ( ) ) return null var accumulator : S = iterator . next ( ) while ( iterator . hasNext ( ) ) { accumulator = operation ( accumulator , iterator . next ( ) ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first element and applying [operation] from left to right\n * to current accumulator value and each element.\n * \n * Returns `null` if the collection is empty.\n * \n * @param [operation] function that takes current accumulator value and an element,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceOrNull\n */"} {"signature":"public inline fun < S , T : S > List < T > . reduceRight ( operation : ( T , acc : S ) -> S ) : S","body":"{ val iterator = listIterator ( size ) if ( ! iterator . hasPrevious ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator : S = iterator . previous ( ) while ( iterator . hasPrevious ( ) ) { accumulator = operation ( iterator . previous ( ) , accumulator ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the last element and applying [operation] from right to left\n * to each element and current accumulator value.\n * \n * Throws an exception if this list is empty. If the list can be empty in an expected way,\n * please use [reduceRightOrNull] instead. It returns `null` when its receiver is empty.\n * \n * @param [operation] function that takes an element and current accumulator value,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceRight\n */"} {"signature":"public inline fun < S , T : S > List < T > . reduceRightIndexed ( operation : ( index : Int , T , acc : S ) -> S ) : S","body":"{ val iterator = listIterator ( size ) if ( ! iterator . hasPrevious ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator : S = iterator . previous ( ) while ( iterator . hasPrevious ( ) ) { val index = iterator . previousIndex ( ) accumulator = operation ( index , iterator . previous ( ) , accumulator ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the last element and applying [operation] from right to left\n * to each element with its index in the original list and current accumulator value.\n * \n * Throws an exception if this list is empty. If the list can be empty in an expected way,\n * please use [reduceRightIndexedOrNull] instead. It returns `null` when its receiver is empty.\n * \n * @param [operation] function that takes the index of an element, the element itself and current accumulator value,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceRight\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > List < T > . reduceRightIndexedOrNull ( operation : ( index : Int , T , acc : S ) -> S ) : S ?","body":"{ val iterator = listIterator ( size ) if ( ! iterator . hasPrevious ( ) ) return null var accumulator : S = iterator . previous ( ) while ( iterator . hasPrevious ( ) ) { val index = iterator . previousIndex ( ) accumulator = operation ( index , iterator . previous ( ) , accumulator ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the last element and applying [operation] from right to left\n * to each element with its index in the original list and current accumulator value.\n * \n * Returns `null` if the list is empty.\n * \n * @param [operation] function that takes the index of an element, the element itself and current accumulator value,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceRightOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > List < T > . reduceRightOrNull ( operation : ( T , acc : S ) -> S ) : S ?","body":"{ val iterator = listIterator ( size ) if ( ! iterator . hasPrevious ( ) ) return null var accumulator : S = iterator . previous ( ) while ( iterator . hasPrevious ( ) ) { accumulator = operation ( iterator . previous ( ) , accumulator ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the last element and applying [operation] from right to left\n * to each element and current accumulator value.\n * \n * Returns `null` if the list is empty.\n * \n * @param [operation] function that takes an element and current accumulator value,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceRightOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R > Iterable < T > . runningFold ( initial : R , operation : ( acc : R , T ) -> R ) : List < R >","body":"{ val estimatedSize = collectionSizeOrDefault ( ) if ( estimatedSize == ) return listOf ( initial ) val result = ArrayList < R > ( estimatedSize + ) . apply { add ( initial ) } var accumulator = initial for ( element in this ) { accumulator = operation ( accumulator , element ) result . add ( accumulator ) } return result }","docstring":"/**\n * Returns a list containing successive accumulation values generated by applying [operation] from left to right\n * to each element and current accumulator value that starts with [initial] value.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting list.\n * \n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningFold\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R > Iterable < T > . runningFoldIndexed ( initial : R , operation : ( index : Int , acc : R , T ) -> R ) : List < R >","body":"{ val estimatedSize = collectionSizeOrDefault ( ) if ( estimatedSize == ) return listOf ( initial ) val result = ArrayList < R > ( estimatedSize + ) . apply { add ( initial ) } var index = var accumulator = initial for ( element in this ) { accumulator = operation ( index ++ , accumulator , element ) result . add ( accumulator ) } return result }","docstring":"/**\n * Returns a list containing successive accumulation values generated by applying [operation] from left to right\n * to each element, its index in the original collection and current accumulator value that starts with [initial] value.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting list.\n * \n * @param [operation] function that takes the index of an element, current accumulator value\n * and the element itself, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningFold\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > Iterable < T > . runningReduce ( operation : ( acc : S , T ) -> S ) : List < S >","body":"{ val iterator = this . iterator ( ) if ( ! iterator . hasNext ( ) ) return emptyList ( ) var accumulator : S = iterator . next ( ) val result = ArrayList < S > ( collectionSizeOrDefault ( ) ) . apply { add ( accumulator ) } while ( iterator . hasNext ( ) ) { accumulator = operation ( accumulator , iterator . next ( ) ) result . add ( accumulator ) } return result }","docstring":"/**\n * Returns a list containing successive accumulation values generated by applying [operation] from left to right\n * to each element and current accumulator value that starts with the first element of this collection.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting list.\n * \n * @param [operation] function that takes current accumulator value and the element, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningReduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > Iterable < T > . runningReduceIndexed ( operation : ( index : Int , acc : S , T ) -> S ) : List < S >","body":"{ val iterator = this . iterator ( ) if ( ! iterator . hasNext ( ) ) return emptyList ( ) var accumulator : S = iterator . next ( ) val result = ArrayList < S > ( collectionSizeOrDefault ( ) ) . apply { add ( accumulator ) } var index = while ( iterator . hasNext ( ) ) { accumulator = operation ( index ++ , accumulator , iterator . next ( ) ) result . add ( accumulator ) } return result }","docstring":"/**\n * Returns a list containing successive accumulation values generated by applying [operation] from left to right\n * to each element, its index in the original collection and current accumulator value that starts with the first element of this collection.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting list.\n * \n * @param [operation] function that takes the index of an element, current accumulator value\n * and the element itself, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningReduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R > Iterable < T > . scan ( initial : R , operation : ( acc : R , T ) -> R ) : List < R >","body":"{ return runningFold ( initial , operation ) }","docstring":"/**\n * Returns a list containing successive accumulation values generated by applying [operation] from left to right\n * to each element and current accumulator value that starts with [initial] value.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting list.\n * \n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.scan\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R > Iterable < T > . scanIndexed ( initial : R , operation : ( index : Int , acc : R , T ) -> R ) : List < R >","body":"{ return runningFoldIndexed ( initial , operation ) }","docstring":"/**\n * Returns a list containing successive accumulation values generated by applying [operation] from left to right\n * to each element, its index in the original collection and current accumulator value that starts with [initial] value.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting list.\n * \n * @param [operation] function that takes the index of an element, current accumulator value\n * and the element itself, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.scan\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public inline fun < T > Iterable < T > . sumBy ( selector : ( T ) -> Int ) : Int","body":"{ var sum : Int = for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the collection.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public inline fun < T > Iterable < T > . sumByDouble ( selector : ( T ) -> Double ) : Double","body":"{ var sum : Double = for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . sumOf ( selector : ( T ) -> Double ) : Double","body":"{ var sum : Double = . toDouble ( ) for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . sumOf ( selector : ( T ) -> Int ) : Int","body":"{ var sum : Int = . toInt ( ) for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . sumOf ( selector : ( T ) -> Long ) : Long","body":"{ var sum : Long = . toLong ( ) for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . sumOf ( selector : ( T ) -> UInt ) : UInt","body":"{ var sum : UInt = . toUInt ( ) for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . sumOf ( selector : ( T ) -> ULong ) : ULong","body":"{ var sum : ULong = . toULong ( ) for ( element in this ) { sum += selector ( element ) } return sum }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the collection.\n */"} {"signature":"public fun < T : Any > Iterable < T ? > . requireNoNulls ( ) : Iterable < T >","body":"{ for ( element in this ) { if ( element == null ) { throw IllegalArgumentException ( \"\" ) } } @ Suppress ( \"\" ) return this as Iterable < T > }","docstring":"/**\n * Returns an original collection containing all the non-`null` elements, throwing an [IllegalArgumentException] if there are any `null` elements.\n */"} {"signature":"public fun < T : Any > List < T ? > . requireNoNulls ( ) : List < T >","body":"{ for ( element in this ) { if ( element == null ) { throw IllegalArgumentException ( \"\" ) } } @ Suppress ( \"\" ) return this as List < T > }","docstring":"/**\n * Returns an original collection containing all the non-`null` elements, throwing an [IllegalArgumentException] if there are any `null` elements.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Iterable < T > . chunked ( size : Int ) : List < List < T > >","body":"{ return windowed ( size , size , partialWindows = true ) }","docstring":"/**\n * Splits this collection into a list of lists each not exceeding the given [size].\n * \n * The last list in the resulting list may have fewer elements than the given [size].\n * \n * @param size the number of elements to take in each list, must be positive and can be greater than the number of elements in this collection.\n * \n * @sample samples.collections.Collections.Transformations.chunked\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Iterable < T > . chunked ( size : Int , transform : ( List < T > ) -> R ) : List < R >","body":"{ return windowed ( size , size , partialWindows = true , transform = transform ) }","docstring":"/**\n * Splits this collection into several lists each not exceeding the given [size]\n * and applies the given [transform] function to an each.\n * \n * @return list of results of the [transform] applied to an each list.\n * \n * Note that the list passed to the [transform] function is ephemeral and is valid only inside that function.\n * You should not store it or allow it to escape in some way, unless you made a snapshot of it.\n * The last list may have fewer elements than the given [size].\n * \n * @param size the number of elements to take in each list, must be positive and can be greater than the number of elements in this collection.\n * \n * @sample samples.text.Strings.chunkedTransform\n */"} {"signature":"public operator fun < T > Iterable < T > . minus ( element : T ) : List < T >","body":"{ val result = ArrayList < T > ( collectionSizeOrDefault ( ) ) var removed = false return this . filterTo ( result ) { if ( ! removed && it == element ) { removed = true ; false } else true } }","docstring":"/**\n * Returns a list containing all elements of the original collection without the first occurrence of the given [element].\n */"} {"signature":"public operator fun < T > Iterable < T > . minus ( elements : Array < out T > ) : List < T >","body":"{ if ( elements . isEmpty ( ) ) return this . toList ( ) return this . filterNot { it in elements } }","docstring":"/**\n * Returns a list containing all elements of the original collection except the elements contained in the given [elements] array.\n */"} {"signature":"public operator fun < T > Iterable < T > . minus ( elements : Iterable < T > ) : List < T >","body":"{ val other = elements . convertToListIfNotCollection ( ) if ( other . isEmpty ( ) ) return this . toList ( ) return this . filterNot { it in other } }","docstring":"/**\n * Returns a list containing all elements of the original collection except the elements contained in the given [elements] collection.\n */"} {"signature":"public operator fun < T > Iterable < T > . minus ( elements : Sequence < T > ) : List < T >","body":"{ val other = elements . toList ( ) if ( other . isEmpty ( ) ) return this . toList ( ) return this . filterNot { it in other } }","docstring":"/**\n * Returns a list containing all elements of the original collection except the elements contained in the given [elements] sequence.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . minusElement ( element : T ) : List < T >","body":"{ return minus ( element ) }","docstring":"/**\n * Returns a list containing all elements of the original collection without the first occurrence of the given [element].\n */"} {"signature":"public inline fun < T > Iterable < T > . partition ( predicate : ( T ) -> Boolean ) : Pair < List < T > , List < T > >","body":"{ val first = ArrayList < T > ( ) val second = ArrayList < T > ( ) for ( element in this ) { if ( predicate ( element ) ) { first . add ( element ) } else { second . add ( element ) } } return Pair ( first , second ) }","docstring":"/**\n * Splits the original collection into pair of lists,\n * where *first* list contains elements for which [predicate] yielded `true`,\n * while *second* list contains elements for which [predicate] yielded `false`.\n * \n * @sample samples.collections.Iterables.Operations.partition\n */"} {"signature":"public operator fun < T > Iterable < T > . plus ( element : T ) : List < T >","body":"{ if ( this is Collection ) return this . plus ( element ) val result = ArrayList < T > ( ) result . addAll ( this ) result . add ( element ) return result }","docstring":"/**\n * Returns a list containing all elements of the original collection and then the given [element].\n */"} {"signature":"public operator fun < T > Collection < T > . plus ( element : T ) : List < T >","body":"{ val result = ArrayList < T > ( size + ) result . addAll ( this ) result . add ( element ) return result }","docstring":"/**\n * Returns a list containing all elements of the original collection and then the given [element].\n */"} {"signature":"public operator fun < T > Iterable < T > . plus ( elements : Array < out T > ) : List < T >","body":"{ if ( this is Collection ) return this . plus ( elements ) val result = ArrayList < T > ( ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a list containing all elements of the original collection and then all elements of the given [elements] array.\n */"} {"signature":"public operator fun < T > Collection < T > . plus ( elements : Array < out T > ) : List < T >","body":"{ val result = ArrayList < T > ( this . size + elements . size ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a list containing all elements of the original collection and then all elements of the given [elements] array.\n */"} {"signature":"public operator fun < T > Iterable < T > . plus ( elements : Iterable < T > ) : List < T >","body":"{ if ( this is Collection ) return this . plus ( elements ) val result = ArrayList < T > ( ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a list containing all elements of the original collection and then all elements of the given [elements] collection.\n */"} {"signature":"public operator fun < T > Collection < T > . plus ( elements : Iterable < T > ) : List < T >","body":"{ if ( elements is Collection ) { val result = ArrayList < T > ( this . size + elements . size ) result . addAll ( this ) result . addAll ( elements ) return result } else { val result = ArrayList < T > ( this ) result . addAll ( elements ) return result } }","docstring":"/**\n * Returns a list containing all elements of the original collection and then all elements of the given [elements] collection.\n */"} {"signature":"public operator fun < T > Iterable < T > . plus ( elements : Sequence < T > ) : List < T >","body":"{ val result = ArrayList < T > ( ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a list containing all elements of the original collection and then all elements of the given [elements] sequence.\n */"} {"signature":"public operator fun < T > Collection < T > . plus ( elements : Sequence < T > ) : List < T >","body":"{ val result = ArrayList < T > ( this . size + ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a list containing all elements of the original collection and then all elements of the given [elements] sequence.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . plusElement ( element : T ) : List < T >","body":"{ return plus ( element ) }","docstring":"/**\n * Returns a list containing all elements of the original collection and then the given [element].\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Collection < T > . plusElement ( element : T ) : List < T >","body":"{ return plus ( element ) }","docstring":"/**\n * Returns a list containing all elements of the original collection and then the given [element].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Iterable < T > . windowed ( size : Int , step : Int = , partialWindows : Boolean = false ) : List < List < T > >","body":"{ checkWindowSizeStep ( size , step ) if ( this is RandomAccess && this is List ) { val thisSize = this . size val resultCapacity = thisSize / step + if ( thisSize % step == ) else val result = ArrayList < List < T > > ( resultCapacity ) var index = while ( index in until thisSize ) { val windowSize = size . coerceAtMost ( thisSize - index ) if ( windowSize < size && ! partialWindows ) break result . add ( List ( windowSize ) { this [ it + index ] } ) index += step } return result } val result = ArrayList < List < T > > ( ) windowedIterator ( iterator ( ) , size , step , partialWindows , reuseBuffer = false ) . forEach { result . add ( it ) } return result }","docstring":"/**\n * Returns a list of snapshots of the window of the given [size]\n * sliding along this collection with the given [step], where each\n * snapshot is a list.\n * \n * Several last lists may have fewer elements than the given [size].\n * \n * Both [size] and [step] must be positive and can be greater than the number of elements in this collection.\n * @param size the number of elements to take in each window\n * @param step the number of elements to move the window forward by on an each step, by default 1\n * @param partialWindows controls whether or not to keep partial windows in the end if any,\n * by default `false` which means partial windows won't be preserved\n * \n * @sample samples.collections.Sequences.Transformations.takeWindows\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Iterable < T > . windowed ( size : Int , step : Int = , partialWindows : Boolean = false , transform : ( List < T > ) -> R ) : List < R >","body":"{ checkWindowSizeStep ( size , step ) if ( this is RandomAccess && this is List ) { val thisSize = this . size val resultCapacity = thisSize / step + if ( thisSize % step == ) else val result = ArrayList < R > ( resultCapacity ) val window = MovingSubList ( this ) var index = while ( index in until thisSize ) { val windowSize = size . coerceAtMost ( thisSize - index ) if ( ! partialWindows && windowSize < size ) break window . move ( index , index + windowSize ) result . add ( transform ( window ) ) index += step } return result } val result = ArrayList < R > ( ) windowedIterator ( iterator ( ) , size , step , partialWindows , reuseBuffer = true ) . forEach { result . add ( transform ( it ) ) } return result }","docstring":"/**\n * Returns a list of results of applying the given [transform] function to\n * an each list representing a view over the window of the given [size]\n * sliding along this collection with the given [step].\n * \n * Note that the list passed to the [transform] function is ephemeral and is valid only inside that function.\n * You should not store it or allow it to escape in some way, unless you made a snapshot of it.\n * Several last lists may have fewer elements than the given [size].\n * \n * Both [size] and [step] must be positive and can be greater than the number of elements in this collection.\n * @param size the number of elements to take in each window\n * @param step the number of elements to move the window forward by on an each step, by default 1\n * @param partialWindows controls whether or not to keep partial windows in the end if any,\n * by default `false` which means partial windows won't be preserved\n * \n * @sample samples.collections.Sequences.Transformations.averageWindows\n */"} {"signature":"public infix fun < T , R > Iterable < T > . zip ( other : Array < out R > ) : List < Pair < T , R > >","body":"{ return zip ( other ) { t1 , t2 -> t1 to t2 } }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` collection and the [other] array with the same index.\n * The returned list has length of the shortest collection.\n * \n * @sample samples.collections.Iterables.Operations.zipIterable\n */"} {"signature":"public inline fun < T , R , V > Iterable < T > . zip ( other : Array < out R > , transform : ( a : T , b : R ) -> V ) : List < V >","body":"{ val arraySize = other . size val list = ArrayList < V > ( minOf ( collectionSizeOrDefault ( ) , arraySize ) ) var i = for ( element in this ) { if ( i >= arraySize ) break list . add ( transform ( element , other [ i ++ ] ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` collection and the [other] array with the same index\n * using the provided [transform] function applied to each pair of elements.\n * The returned list has length of the shortest collection.\n * \n * @sample samples.collections.Iterables.Operations.zipIterableWithTransform\n */"} {"signature":"public infix fun < T , R > Iterable < T > . zip ( other : Iterable < R > ) : List < Pair < T , R > >","body":"{ return zip ( other ) { t1 , t2 -> t1 to t2 } }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` collection and [other] collection with the same index.\n * The returned list has length of the shortest collection.\n * \n * @sample samples.collections.Iterables.Operations.zipIterable\n */"} {"signature":"public inline fun < T , R , V > Iterable < T > . zip ( other : Iterable < R > , transform : ( a : T , b : R ) -> V ) : List < V >","body":"{ val first = iterator ( ) val second = other . iterator ( ) val list = ArrayList < V > ( minOf ( collectionSizeOrDefault ( ) , other . collectionSizeOrDefault ( ) ) ) while ( first . hasNext ( ) && second . hasNext ( ) ) { list . add ( transform ( first . next ( ) , second . next ( ) ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` collection and the [other] collection with the same index\n * using the provided [transform] function applied to each pair of elements.\n * The returned list has length of the shortest collection.\n * \n * @sample samples.collections.Iterables.Operations.zipIterableWithTransform\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Iterable < T > . zipWithNext ( ) : List < Pair < T , T > >","body":"{ return zipWithNext { a , b -> a to b } }","docstring":"/**\n * Returns a list of pairs of each two adjacent elements in this collection.\n * \n * The returned list is empty if this collection contains less than two elements.\n * \n * @sample samples.collections.Collections.Transformations.zipWithNext\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R > Iterable < T > . zipWithNext ( transform : ( a : T , b : T ) -> R ) : List < R >","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return emptyList ( ) val result = mutableListOf < R > ( ) var current = iterator . next ( ) while ( iterator . hasNext ( ) ) { val next = iterator . next ( ) result . add ( transform ( current , next ) ) current = next } return result }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to an each pair of two adjacent elements in this collection.\n * \n * The returned list is empty if this collection contains less than two elements.\n * \n * @sample samples.collections.Collections.Transformations.zipWithNextToFindDeltas\n */"} {"signature":"public fun < T , A : Appendable > Iterable < T > . joinTo ( buffer : A , separator : CharSequence = \"\" , prefix : CharSequence = \"\" , postfix : CharSequence = \"\" , limit : Int = - , truncated : CharSequence = \"\" , transform : ( ( T ) -> CharSequence ) ? = null ) : A","body":"{ buffer . append ( prefix ) var count = for ( element in this ) { if ( ++ count > ) buffer . append ( separator ) if ( limit < || count <= limit ) { buffer . appendElement ( element , transform ) } else break } if ( limit >= && count > limit ) buffer . append ( truncated ) buffer . append ( postfix ) return buffer }","docstring":"/**\n * Appends the string from all the elements separated using [separator] and using the given [prefix] and [postfix] if supplied.\n * \n * If the collection could be huge, you can specify a non-negative value of [limit], in which case only the first [limit]\n * elements will be appended, followed by the [truncated] string (which defaults to \"...\").\n * \n * @sample samples.collections.Collections.Transformations.joinTo\n */"} {"signature":"public fun < T > Iterable < T > . joinToString ( separator : CharSequence = \"\" , prefix : CharSequence = \"\" , postfix : CharSequence = \"\" , limit : Int = - , truncated : CharSequence = \"\" , transform : ( ( T ) -> CharSequence ) ? = null ) : String","body":"{ return joinTo ( StringBuilder ( ) , separator , prefix , postfix , limit , truncated , transform ) . toString ( ) }","docstring":"/**\n * Creates a string from all the elements separated using [separator] and using the given [prefix] and [postfix] if supplied.\n * \n * If the collection could be huge, you can specify a non-negative value of [limit], in which case only the first [limit]\n * elements will be appended, followed by the [truncated] string (which defaults to \"...\").\n * \n * @sample samples.collections.Collections.Transformations.joinToString\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Iterable < T > . asIterable ( ) : Iterable < T >","body":"{ return this }","docstring":"/**\n * Returns this collection as an [Iterable].\n */"} {"signature":"public fun < T > Iterable < T > . asSequence ( ) : Sequence < T >","body":"{ return Sequence { this . iterator ( ) } }","docstring":"/**\n * Creates a [Sequence] instance that wraps the original collection returning its elements when being iterated.\n * \n * @sample samples.collections.Sequences.Building.sequenceFromCollection\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Byte > . average ( ) : Double","body":"{ var sum : Double = var count : Int = for ( element in this ) { sum += element checkCountOverflow ( ++ count ) } return if ( count == ) Double . NaN else sum / count }","docstring":"/**\n * Returns an average value of elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Short > . average ( ) : Double","body":"{ var sum : Double = var count : Int = for ( element in this ) { sum += element checkCountOverflow ( ++ count ) } return if ( count == ) Double . NaN else sum / count }","docstring":"/**\n * Returns an average value of elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Int > . average ( ) : Double","body":"{ var sum : Double = var count : Int = for ( element in this ) { sum += element checkCountOverflow ( ++ count ) } return if ( count == ) Double . NaN else sum / count }","docstring":"/**\n * Returns an average value of elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Long > . average ( ) : Double","body":"{ var sum : Double = var count : Int = for ( element in this ) { sum += element checkCountOverflow ( ++ count ) } return if ( count == ) Double . NaN else sum / count }","docstring":"/**\n * Returns an average value of elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Float > . average ( ) : Double","body":"{ var sum : Double = var count : Int = for ( element in this ) { sum += element checkCountOverflow ( ++ count ) } return if ( count == ) Double . NaN else sum / count }","docstring":"/**\n * Returns an average value of elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Double > . average ( ) : Double","body":"{ var sum : Double = var count : Int = for ( element in this ) { sum += element checkCountOverflow ( ++ count ) } return if ( count == ) Double . NaN else sum / count }","docstring":"/**\n * Returns an average value of elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Byte > . sum ( ) : Int","body":"{ var sum : Int = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Short > . sum ( ) : Int","body":"{ var sum : Int = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Int > . sum ( ) : Int","body":"{ var sum : Int = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Long > . sum ( ) : Long","body":"{ var sum : Long = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Float > . sum ( ) : Float","body":"{ var sum : Float = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Iterable < Double > . sum ( ) : Double","body":"{ var sum : Double = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"internal open suspend fun sendBroadcast ( element : E ) : Boolean","body":"= suspendCancellableCoroutine { cont -> check ( onUndeliveredElement == null ) { \"\" } sendImpl ( element = element , waiter = SendBroadcast ( cont ) , onRendezvousOrBuffered = { cont . resume ( true ) } , onSuspend = { _ , _ -> } , onClosed = { cont . resume ( false ) } ) }","docstring":"/**\n * This is a special `send(e)` implementation that returns `true` if the element\n * has been successfully sent, and `false` if the channel is closed.\n *\n * In case of coroutine cancellation, the element may be undelivered --\n * the [onUndeliveredElement] feature is unsupported in this implementation.\n *\n */"} {"signature":"private inline fun < R > sendImpl ( element : E , waiter : Any ? , onRendezvousOrBuffered : ( ) -> R , onSuspend : ( segm : ChannelSegment < E > , i : Int ) -> R , onClosed : ( ) -> R , onNoWaiterSuspend : ( segm : ChannelSegment < E > , i : Int , element : E , s : Long ) -> R = { _ , _ , _ , _ -> error ( \"\" ) } ) : R","body":"{ var segment = sendSegment . value while ( true ) { val sendersAndCloseStatusCur = sendersAndCloseStatus . getAndIncrement ( ) val s = sendersAndCloseStatusCur . sendersCounter val closed = sendersAndCloseStatusCur . isClosedForSend0 val id = s / SEGMENT_SIZE val i = ( s % SEGMENT_SIZE ) . toInt ( ) if ( segment . id != id ) { segment = findSegmentSend ( id , segment ) ? : if ( closed ) { return onClosed ( ) } else { continue } } when ( updateCellSend ( segment , i , element , s , waiter , closed ) ) { RESULT_RENDEZVOUS -> { segment . cleanPrev ( ) return onRendezvousOrBuffered ( ) } RESULT_BUFFERED -> { return onRendezvousOrBuffered ( ) } RESULT_SUSPEND -> { if ( closed ) { segment . onSlotCleaned ( ) return onClosed ( ) } ( waiter as? Waiter ) ? . prepareSenderForSuspension ( segment , i ) return onSuspend ( segment , i ) } RESULT_CLOSED -> { if ( s < receiversCounter ) segment . cleanPrev ( ) return onClosed ( ) } RESULT_FAILED -> { segment . cleanPrev ( ) continue } RESULT_SUSPEND_NO_WAITER -> { return onNoWaiterSuspend ( segment , i , element , s ) } } } }","docstring":"/**\n * Abstract send implementation.\n */"} {"signature":"private fun updateCellSendSlow ( segment : ChannelSegment < E > , index : Int , element : E , s : Long , waiter : Any ? , closed : Boolean ) : Int","body":"{ while ( true ) { val state = segment . getState ( index ) when { state === null -> { if ( bufferOrRendezvousSend ( s ) && ! closed ) { if ( segment . casState ( index , null , BUFFERED ) ) { return RESULT_BUFFERED } } else { when { closed -> if ( segment . casState ( index , null , INTERRUPTED_SEND ) ) { segment . onCancelledRequest ( index , false ) return RESULT_CLOSED } waiter == null -> return RESULT_SUSPEND_NO_WAITER else -> if ( segment . casState ( index , null , waiter ) ) return RESULT_SUSPEND } } } state === IN_BUFFER -> { if ( segment . casState ( index , state , BUFFERED ) ) { return RESULT_BUFFERED } } state === INTERRUPTED_RCV -> { segment . cleanElement ( index ) return RESULT_FAILED } state === POISONED -> { segment . cleanElement ( index ) return RESULT_FAILED } state === CHANNEL_CLOSED -> { segment . cleanElement ( index ) completeCloseOrCancel ( ) return RESULT_CLOSED } else -> { assert { state is Waiter || state is WaiterEB } segment . cleanElement ( index ) val receiver = if ( state is WaiterEB ) state . waiter else state return if ( receiver . tryResumeReceiver ( element ) ) { segment . setState ( index , DONE_RCV ) onReceiveDequeued ( ) RESULT_RENDEZVOUS } else { if ( segment . getAndSetState ( index , INTERRUPTED_RCV ) !== INTERRUPTED_RCV ) { segment . onCancelledRequest ( index , true ) } RESULT_FAILED } } } } }","docstring":"/**\n * Updates the working cell of an abstract send operation.\n */"} {"signature":"@ JsName ( \"\" ) private fun shouldSendSuspend ( curSendersAndCloseStatus : Long ) : Boolean","body":"{ if ( curSendersAndCloseStatus . isClosedForSend0 ) return false return ! bufferOrRendezvousSend ( curSendersAndCloseStatus . sendersCounter ) }","docstring":"/**\n * Checks whether a [send] invocation is bound to suspend if it is called\n * with the specified [sendersAndCloseStatus], [receivers], and [bufferEnd]\n * values. When this channel is already closed, the function returns `false`.\n *\n * Specifically, [send] suspends if the channel is not unlimited,\n * the number of receivers is greater than then index of the working cell of the\n * potential [send] invocation, and the buffer does not cover this cell\n * in case of buffered channel.\n * When the channel is already closed, [send] does not suspend.\n */"} {"signature":"private fun bufferOrRendezvousSend ( curSenders : Long ) : Boolean","body":"= curSenders < bufferEndCounter || curSenders < receiversCounter + capacity","docstring":"/**\n * Returns `true` when the specified [send] should place\n * its element to the working cell without suspension.\n */"} {"signature":"internal open fun shouldSendSuspend ( ) : Boolean","body":"= shouldSendSuspend ( sendersAndCloseStatus . value )","docstring":"/**\n * Checks whether a [send] invocation is bound to suspend if it is called\n * with the current counter and close status values. See [shouldSendSuspend] for details.\n *\n * Note that this implementation is _false positive_ in case of rendezvous channels,\n * so it can return `false` when a [send] invocation is bound to suspend. Specifically,\n * the counter of `receive()` operations may indicate that there is a waiting receiver,\n * while it has already been cancelled, so the potential rendezvous is bound to fail.\n */"} {"signature":"@ Suppress ( \"\" ) private fun Any . tryResumeReceiver ( element : E ) : Boolean","body":"= when ( this ) { is SelectInstance < * > -> { trySelect ( this @ BufferedChannel , element ) } is ReceiveCatching < * > -> { this as ReceiveCatching < E > cont . tryResume0 ( success ( element ) , onUndeliveredElement ? . bindCancellationFun ( element , cont . context ) ) } is BufferedChannel < * > . BufferedChannelIterator -> { this as BufferedChannel < E > . BufferedChannelIterator tryResumeHasNext ( element ) } is CancellableContinuation < * > -> { this as CancellableContinuation < E > tryResume0 ( element , onUndeliveredElement ? . bindCancellationFun ( element , context ) ) } else -> error ( \"\" ) }","docstring":"/**\n * Tries to resume this receiver with the specified [element] as a result.\n * Returns `true` on success and `false` otherwise.\n */"} {"signature":"protected open fun onReceiveEnqueued ( )","body":"{ }","docstring":"/**\n * This function is invoked when a receiver is added as a waiter in this channel.\n */"} {"signature":"protected open fun onReceiveDequeued ( )","body":"{ }","docstring":"/**\n * This function is invoked when a waiting receiver is no longer stored in this channel;\n * independently on whether it is caused by rendezvous, cancellation, or channel closing.\n */"} {"signature":"protected fun dropFirstElementUntilTheSpecifiedCellIsInTheBuffer ( globalCellIndex : Long )","body":"{ assert { isConflatedDropOldest } var segment = receiveSegment . value while ( true ) { val r = this . receivers . value if ( globalCellIndex < max ( r + capacity , bufferEndCounter ) ) return if ( ! this . receivers . compareAndSet ( r , r + ) ) continue val id = r / SEGMENT_SIZE val i = ( r % SEGMENT_SIZE ) . toInt ( ) if ( segment . id != id ) { segment = findSegmentReceive ( id , segment ) ? : continue } val updCellResult = updateCellReceive ( segment , i , r , null ) when { updCellResult === FAILED -> { if ( r < sendersCounter ) segment . cleanPrev ( ) } else -> { segment . cleanPrev ( ) @ Suppress ( \"\" ) onUndeliveredElement ? . callUndeliveredElementCatchingException ( updCellResult as E ) ? . let { throw it } } } } }","docstring":"/**\n * Extracts the first element from this channel until the cell with the specified\n * index is moved to the logical buffer. This is a key procedure for the _conflated_\n * channel implementation, see [ConflatedBufferedChannel] with the [BufferOverflow.DROP_OLDEST]\n * strategy on buffer overflowing.\n */"} {"signature":"private inline fun < R > receiveImpl ( waiter : Any ? , onElementRetrieved : ( element : E ) -> R , onSuspend : ( segm : ChannelSegment < E > , i : Int , r : Long ) -> R , onClosed : ( ) -> R , onNoWaiterSuspend : ( segm : ChannelSegment < E > , i : Int , r : Long ) -> R = { _ , _ , _ -> error ( \"\" ) } ) : R","body":"{ var segment = receiveSegment . value while ( true ) { if ( isClosedForReceive ) return onClosed ( ) val r = this . receivers . getAndIncrement ( ) val id = r / SEGMENT_SIZE val i = ( r % SEGMENT_SIZE ) . toInt ( ) if ( segment . id != id ) { segment = findSegmentReceive ( id , segment ) ? : continue } val updCellResult = updateCellReceive ( segment , i , r , waiter ) return when { updCellResult === SUSPEND -> { ( waiter as? Waiter ) ? . prepareReceiverForSuspension ( segment , i ) onSuspend ( segment , i , r ) } updCellResult === FAILED -> { if ( r < sendersCounter ) segment . cleanPrev ( ) continue } updCellResult === SUSPEND_NO_WAITER -> { onNoWaiterSuspend ( segment , i , r ) } else -> { segment . cleanPrev ( ) @ Suppress ( \"\" ) onElementRetrieved ( updCellResult as E ) } } } }","docstring":"/**\n * Abstract receive implementation.\n */"} {"signature":"private fun incCompletedExpandBufferAttempts ( nAttempts : Long = )","body":"{ completedExpandBuffersAndPauseFlag . addAndGet ( nAttempts ) . also { if ( it . ebPauseExpandBuffers ) { @ Suppress ( \"\" ) while ( completedExpandBuffersAndPauseFlag . value . ebPauseExpandBuffers ) { } } } }","docstring":"/**\n * Increments the counter of completed [expandBuffer] invocations.\n * To guarantee starvation-freedom for [waitExpandBufferCompletion],\n * which waits until the counters of started and completed [expandBuffer] calls\n * coincide and become greater or equal to the specified value,\n * [waitExpandBufferCompletion] may set a flag that pauses further progress.\n */"} {"signature":"internal fun waitExpandBufferCompletion ( globalIndex : Long )","body":"{ if ( isRendezvousOrUnlimited ) return @ Suppress ( \"\" ) while ( bufferEndCounter <= globalIndex ) { } repeat ( EXPAND_BUFFER_COMPLETION_WAIT_ITERATIONS ) { val b = bufferEndCounter val ebCompleted = completedExpandBuffersAndPauseFlag . value . ebCompletedCounter if ( b == ebCompleted && b == bufferEndCounter ) return } completedExpandBuffersAndPauseFlag . update { constructEBCompletedAndPauseFlag ( it . ebCompletedCounter , true ) } while ( true ) { val b = bufferEndCounter val ebCompletedAndBit = completedExpandBuffersAndPauseFlag . value val ebCompleted = ebCompletedAndBit . ebCompletedCounter val pauseExpandBuffers = ebCompletedAndBit . ebPauseExpandBuffers if ( b == ebCompleted && b == bufferEndCounter ) { completedExpandBuffersAndPauseFlag . update { constructEBCompletedAndPauseFlag ( it . ebCompletedCounter , false ) } return } if ( ! pauseExpandBuffers ) { completedExpandBuffersAndPauseFlag . compareAndSet ( ebCompletedAndBit , constructEBCompletedAndPauseFlag ( ebCompleted , true ) ) } } }","docstring":"/**\n * Waits in a spin-loop until the [expandBuffer] call that\n * should process the [globalIndex]-th cell is completed.\n * Essentially, it waits until the numbers of started ([bufferEnd])\n * and completed ([completedExpandBuffersAndPauseFlag]) [expandBuffer]\n * attempts coincide and become equal or greater than [globalIndex].\n * To avoid starvation, this function may set a flag\n * that pauses further progress.\n */"} {"signature":"protected open fun onClosedIdempotent ( )","body":"{ }","docstring":"/**\n * Invoked when channel is closed as the last action of [close] invocation.\n * This method should be idempotent and can be called multiple times.\n */"} {"signature":"protected open fun closeOrCancelImpl ( cause : Throwable ? , cancel : Boolean ) : Boolean","body":"{ if ( cancel ) markCancellationStarted ( ) val closedByThisOperation = _closeCause . compareAndSet ( NO_CLOSE_CAUSE , cause ) if ( cancel ) markCancelled ( ) else markClosed ( ) completeCloseOrCancel ( ) return closedByThisOperation . also { onClosedIdempotent ( ) if ( it ) invokeCloseHandler ( ) } }","docstring":"/**\n * This is a common implementation for [close] and [cancel]. It first tries\n * to install the specified cause; the invocation that successfully installs\n * the cause returns `true` as a results of this function, while all further\n * [close] and [cancel] calls return `false`.\n *\n * After the closing/cancellation cause is installed, the channel should be marked\n * as closed or cancelled, which bounds further `send(e)`-s to fails.\n *\n * Then, [completeCloseOrCancel] is called, which cancels waiting `receive()`\n * requests ([cancelSuspendedReceiveRequests]) and removes unprocessed elements\n * ([removeUnprocessedElements]) in case this channel is cancelled.\n *\n * Finally, if this [closeOrCancelImpl] has installed the cause, therefore,\n * has closed the channel, [closeHandler] and [onClosedIdempotent] should be invoked.\n */"} {"signature":"private fun invokeCloseHandler ( )","body":"{ val closeHandler = closeHandler . getAndUpdate { if ( it === null ) { CLOSE_HANDLER_CLOSED } else { CLOSE_HANDLER_INVOKED } } ? : return @ Suppress ( \"\" ) closeHandler as ( cause : Throwable ? ) -> Unit closeHandler ( closeCause ) }","docstring":"/**\n * Invokes the installed close handler,\n * updating the [closeHandler] state correspondingly.\n */"} {"signature":"private fun markClosed ( ) : Unit","body":"= sendersAndCloseStatus . update { cur -> when ( cur . sendersCloseStatus ) { CLOSE_STATUS_ACTIVE -> constructSendersAndCloseStatus ( cur . sendersCounter , CLOSE_STATUS_CLOSED ) CLOSE_STATUS_CANCELLATION_STARTED -> constructSendersAndCloseStatus ( cur . sendersCounter , CLOSE_STATUS_CANCELLED ) else -> return } }","docstring":"/**\n * Marks this channel as closed.\n * In case [cancelImpl] has already been invoked,\n * and this channel is marked with [CLOSE_STATUS_CANCELLATION_STARTED],\n * this function marks the channel as cancelled.\n *\n * All operation that notice this channel in the closed state,\n * must help to complete the closing via [completeCloseOrCancel].\n */"} {"signature":"private fun markCancelled ( ) : Unit","body":"= sendersAndCloseStatus . update { cur -> constructSendersAndCloseStatus ( cur . sendersCounter , CLOSE_STATUS_CANCELLED ) }","docstring":"/**\n * Marks this channel as cancelled.\n *\n * All operation that notice this channel in the cancelled state,\n * must help to complete the cancellation via [completeCloseOrCancel].\n */"} {"signature":"private fun markCancellationStarted ( ) : Unit","body":"= sendersAndCloseStatus . update { cur -> if ( cur . sendersCloseStatus == CLOSE_STATUS_ACTIVE ) constructSendersAndCloseStatus ( cur . sendersCounter , CLOSE_STATUS_CANCELLATION_STARTED ) else return }","docstring":"/**\n * When the cancellation procedure starts, it is critical\n * to mark the closing status correspondingly. Thus, other\n * operations, which may help to complete the cancellation,\n * always correctly update the status to `CANCELLED`.\n */"} {"signature":"private fun completeCloseOrCancel ( )","body":"{ isClosedForSend }","docstring":"/**\n * Completes the started [close] or [cancel] procedure.\n */"} {"signature":"private fun completeClose ( sendersCur : Long ) : ChannelSegment < E >","body":"{ val lastSegment = closeLinkedList ( ) if ( isConflatedDropOldest ) { val lastBufferedCellGlobalIndex = markAllEmptyCellsAsClosed ( lastSegment ) if ( lastBufferedCellGlobalIndex != - ) dropFirstElementUntilTheSpecifiedCellIsInTheBuffer ( lastBufferedCellGlobalIndex ) } cancelSuspendedReceiveRequests ( lastSegment , sendersCur ) return lastSegment }","docstring":"/**\n * Completes the channel closing procedure.\n */"} {"signature":"private fun completeCancel ( sendersCur : Long )","body":"{ val lastSegment = completeClose ( sendersCur ) removeUnprocessedElements ( lastSegment ) }","docstring":"/**\n * Completes the channel cancellation procedure.\n */"} {"signature":"private fun closeLinkedList ( ) : ChannelSegment < E >","body":"{ var lastSegment = bufferEndSegment . value sendSegment . value . let { if ( it . id > lastSegment . id ) lastSegment = it } receiveSegment . value . let { if ( it . id > lastSegment . id ) lastSegment = it } return lastSegment . close ( ) }","docstring":"/**\n * Closes the underlying linked list of segments for further segment addition.\n */"} {"signature":"private fun markAllEmptyCellsAsClosed ( lastSegment : ChannelSegment < E > ) : Long","body":"{ var segment = lastSegment while ( true ) { for ( index in SEGMENT_SIZE - downTo ) { val globalIndex = segment . id * SEGMENT_SIZE + index if ( globalIndex < receiversCounter ) return - cell_update @ while ( true ) { val state = segment . getState ( index ) when { state === null || state === IN_BUFFER -> { if ( segment . casState ( index , state , CHANNEL_CLOSED ) ) { segment . onSlotCleaned ( ) break@cell_update } } state === BUFFERED -> return globalIndex else -> break@cell_update } } } segment = segment . prev ? : return - } }","docstring":"/**\n * This function marks all empty cells, in the `null` and [IN_BUFFER] state,\n * as closed. Notably, it processes the cells from right to left, and finishes\n * immediately when the processing cell is already covered by `receive()` or\n * contains a buffered elements ([BUFFERED] state).\n *\n * This function returns the global index of the last buffered element,\n * or `-1` if this channel does not contain buffered elements.\n */"} {"signature":"private fun removeUnprocessedElements ( lastSegment : ChannelSegment < E > )","body":"{ val onUndeliveredElement = onUndeliveredElement var undeliveredElementException : UndeliveredElementException ? = null var suspendedSenders = InlineList < Waiter > ( ) var segment = lastSegment process_segments @ while ( true ) { for ( index in SEGMENT_SIZE - downTo ) { val globalIndex = segment . id * SEGMENT_SIZE + index update_cell @ while ( true ) { val state = segment . getState ( index ) when { state === DONE_RCV -> break@process_segments state === BUFFERED -> { if ( globalIndex < receiversCounter ) break@process_segments if ( segment . casState ( index , state , CHANNEL_CLOSED ) ) { if ( onUndeliveredElement != null ) { val element = segment . getElement ( index ) undeliveredElementException = onUndeliveredElement . callUndeliveredElementCatchingException ( element , undeliveredElementException ) } segment . cleanElement ( index ) segment . onSlotCleaned ( ) break@update_cell } } state === IN_BUFFER || state === null -> { if ( segment . casState ( index , state , CHANNEL_CLOSED ) ) { segment . onSlotCleaned ( ) break@update_cell } } state is Waiter || state is WaiterEB -> { if ( globalIndex < receiversCounter ) break@process_segments val sender : Waiter = if ( state is WaiterEB ) state . waiter else state as Waiter if ( segment . casState ( index , state , CHANNEL_CLOSED ) ) { if ( onUndeliveredElement != null ) { val element = segment . getElement ( index ) undeliveredElementException = onUndeliveredElement . callUndeliveredElementCatchingException ( element , undeliveredElementException ) } suspendedSenders += sender segment . cleanElement ( index ) segment . onSlotCleaned ( ) break@update_cell } } state === RESUMING_BY_EB || state === RESUMING_BY_RCV -> break@process_segments state === RESUMING_BY_EB -> continue@update_cell else -> break@update_cell } } } segment = segment . prev ? : break } suspendedSenders . forEachReversed { it . resumeSenderOnCancelledChannel ( ) } undeliveredElementException ? . let { throw it } }","docstring":"/**\n * Cancels suspended `send(e)` requests and removes buffered elements\n * starting from the last cell in the specified [lastSegment] (it must\n * be the physical tail of the underlying linked list) and updating\n * the cells in reverse order.\n */"} {"signature":"private fun cancelSuspendedReceiveRequests ( lastSegment : ChannelSegment < E > , sendersCounter : Long )","body":"{ var suspendedReceivers = InlineList < Waiter > ( ) var segment : ChannelSegment < E > ? = lastSegment process_segments @ while ( segment != null ) { for ( index in SEGMENT_SIZE - downTo ) { if ( segment . id * SEGMENT_SIZE + index < sendersCounter ) break@process_segments cell_update @ while ( true ) { val state = segment . getState ( index ) when { state === null || state === IN_BUFFER -> { if ( segment . casState ( index , state , CHANNEL_CLOSED ) ) { segment . onSlotCleaned ( ) break@cell_update } } state is WaiterEB -> { if ( segment . casState ( index , state , CHANNEL_CLOSED ) ) { suspendedReceivers += state . waiter segment . onCancelledRequest ( index = index , receiver = true ) break@cell_update } } state is Waiter -> { if ( segment . casState ( index , state , CHANNEL_CLOSED ) ) { suspendedReceivers += state segment . onCancelledRequest ( index = index , receiver = true ) break@cell_update } } else -> break@cell_update } } } segment = segment . prev } suspendedReceivers . forEachReversed { it . resumeReceiverOnClosedChannel ( ) } }","docstring":"/**\n * Cancels suspended `receive` requests from the end to the beginning,\n * also moving empty cells to the `CHANNEL_CLOSED` state.\n */"} {"signature":"private fun Waiter . resumeReceiverOnClosedChannel ( )","body":"= resumeWaiterOnClosedChannel ( receiver = true )","docstring":"/**\n * Resumes this receiver because this channel is closed.\n * This function does not take any effect if the operation has already been resumed or cancelled.\n */"} {"signature":"private fun Waiter . resumeSenderOnCancelledChannel ( )","body":"= resumeWaiterOnClosedChannel ( receiver = false )","docstring":"/**\n * Resumes this sender because this channel is cancelled.\n * This function does not take any effect if the operation has already been resumed or cancelled.\n */"} {"signature":"internal fun hasElements ( ) : Boolean","body":"{ while ( true ) { var segment = receiveSegment . value val r = receiversCounter val s = sendersCounter if ( s <= r ) return false val id = r / SEGMENT_SIZE if ( segment . id != id ) { segment = findSegmentReceive ( id , segment ) ? : if ( receiveSegment . value . id < id ) return false else continue } segment . cleanPrev ( ) val i = ( r % SEGMENT_SIZE ) . toInt ( ) if ( isCellNonEmpty ( segment , i , r ) ) return true receivers . compareAndSet ( r , r + ) } }","docstring":"/**\n * Checks whether this channel contains elements to retrieve.\n * Unfortunately, simply comparing the counters is insufficient,\n * as some cells can be in the `INTERRUPTED` state due to cancellation.\n * This function tries to find the first \"alive\" element,\n * updating the `receivers` counter to skip empty cells.\n *\n * The implementation is similar to `receive()`.\n */"} {"signature":"private fun isCellNonEmpty ( segment : ChannelSegment < E > , index : Int , globalIndex : Long ) : Boolean","body":"{ while ( true ) { val state = segment . getState ( index ) when { state === null || state === IN_BUFFER -> { if ( segment . casState ( index , state , POISONED ) ) { expandBuffer ( ) return false } } state === BUFFERED -> return true state === INTERRUPTED_SEND -> return false state === CHANNEL_CLOSED -> return false state === DONE_RCV -> return false state === POISONED -> return false state === RESUMING_BY_EB -> return true state === RESUMING_BY_RCV -> return false else -> return globalIndex == receiversCounter } } }","docstring":"/**\n * Checks whether this cell contains a buffered element or a waiting sender,\n * returning `true` in this case. Otherwise, if this cell is empty\n * (due to waiter cancellation, cell poisoning, or channel closing),\n * this function returns `false`.\n *\n * Notably, this function must be called only if the cell is covered by a sender.\n */"} {"signature":"private fun findSegmentSend ( id : Long , startFrom : ChannelSegment < E > ) : ChannelSegment < E > ?","body":"{ return sendSegment . findSegmentAndMoveForward ( id , startFrom , createSegmentFunction ( ) ) . let { if ( it . isClosed ) { completeCloseOrCancel ( ) if ( startFrom . id * SEGMENT_SIZE < receiversCounter ) startFrom . cleanPrev ( ) null } else { val segment = it . segment if ( segment . id > id ) { updateSendersCounterIfLower ( segment . id * SEGMENT_SIZE ) if ( segment . id * SEGMENT_SIZE < receiversCounter ) segment . cleanPrev ( ) null } else { assert { segment . id == id } segment } } } }","docstring":"/**\n * Finds the segment with the specified [id] starting by the [startFrom]\n * segment and following the [ChannelSegment.next] references. In case\n * the required segment has not been created yet, this function attempts\n * to add it to the underlying linked list. Finally, it updates [sendSegment]\n * to the found segment if its [ChannelSegment.id] is greater than the one\n * of the already stored segment.\n *\n * In case the requested segment is already removed, or if it should be allocated\n * but the linked list structure is closed for new segments addition, this function\n * returns `null`. The implementation also efficiently skips a sequence of removed\n * segments, updating the counter value in [sendersAndCloseStatus] correspondingly.\n */"} {"signature":"private fun findSegmentReceive ( id : Long , startFrom : ChannelSegment < E > ) : ChannelSegment < E > ?","body":"= receiveSegment . findSegmentAndMoveForward ( id , startFrom , createSegmentFunction ( ) ) . let { if ( it . isClosed ) { completeCloseOrCancel ( ) if ( startFrom . id * SEGMENT_SIZE < sendersCounter ) startFrom . cleanPrev ( ) null } else { val segment = it . segment if ( ! isRendezvousOrUnlimited && id <= bufferEndCounter / SEGMENT_SIZE ) { bufferEndSegment . moveForward ( segment ) } if ( segment . id > id ) { updateReceiversCounterIfLower ( segment . id * SEGMENT_SIZE ) if ( segment . id * SEGMENT_SIZE < sendersCounter ) segment . cleanPrev ( ) null } else { assert { segment . id == id } segment } } }","docstring":"/**\n * Finds the segment with the specified [id] starting by the [startFrom]\n * segment and following the [ChannelSegment.next] references. In case\n * the required segment has not been created yet, this function attempts\n * to add it to the underlying linked list. Finally, it updates [receiveSegment]\n * to the found segment if its [ChannelSegment.id] is greater than the one\n * of the already stored segment.\n *\n * In case the requested segment is already removed, or if it should be allocated\n * but the linked list structure is closed for new segments addition, this function\n * returns `null`. The implementation also efficiently skips a sequence of removed\n * segments, updating the [receivers] counter correspondingly.\n */"} {"signature":"private fun findSegmentBufferEnd ( id : Long , startFrom : ChannelSegment < E > , currentBufferEndCounter : Long ) : ChannelSegment < E > ?","body":"= bufferEndSegment . findSegmentAndMoveForward ( id , startFrom , createSegmentFunction ( ) ) . let { if ( it . isClosed ) { completeCloseOrCancel ( ) moveSegmentBufferEndToSpecifiedOrLast ( id , startFrom ) incCompletedExpandBufferAttempts ( ) null } else { val segment = it . segment if ( segment . id > id ) { if ( bufferEnd . compareAndSet ( currentBufferEndCounter + , segment . id * SEGMENT_SIZE ) ) { incCompletedExpandBufferAttempts ( segment . id * SEGMENT_SIZE - currentBufferEndCounter ) } else { incCompletedExpandBufferAttempts ( ) } null } else { assert { segment . id == id } segment } } }","docstring":"/**\n * Importantly, when this function does not find the requested segment,\n * it always updates the number of completed `expandBuffer()` attempts.\n */"} {"signature":"private fun moveSegmentBufferEndToSpecifiedOrLast ( id : Long , startFrom : ChannelSegment < E > )","body":"{ var segment : ChannelSegment < E > = startFrom while ( segment . id < id ) { segment = segment . next ? : break } while ( true ) { while ( segment . isRemoved ) { segment = segment . next ? : break } if ( bufferEndSegment . moveForward ( segment ) ) return } }","docstring":"/**\n * Updates [bufferEndSegment] to the one with the specified [id] or\n * to the last existing segment, if the required segment is not yet created.\n *\n * Unlike [findSegmentBufferEnd], this function does not allocate new segments.\n */"} {"signature":"private fun updateSendersCounterIfLower ( value : Long ) : Unit","body":"= sendersAndCloseStatus . loop { cur -> val curCounter = cur . sendersCounter if ( curCounter >= value ) return val update = constructSendersAndCloseStatus ( curCounter , cur . sendersCloseStatus ) if ( sendersAndCloseStatus . compareAndSet ( cur , update ) ) return }","docstring":"/**\n * Updates the `senders` counter if its value\n * is lower that the specified one.\n *\n * Senders use this function to efficiently skip\n * a sequence of cancelled receivers.\n */"} {"signature":"private fun updateReceiversCounterIfLower ( value : Long ) : Unit","body":"= receivers . loop { cur -> if ( cur >= value ) return if ( receivers . compareAndSet ( cur , value ) ) return }","docstring":"/**\n * Updates the `receivers` counter if its value\n * is lower that the specified one.\n *\n * Receivers use this function to efficiently skip\n * a sequence of cancelled senders.\n */"} {"signature":"fun onCancelledRequest ( index : Int , receiver : Boolean )","body":"{ if ( receiver ) channel . waitExpandBufferCompletion ( id * SEGMENT_SIZE + index ) onSlotCleaned ( ) }","docstring":"/**\n * Invokes `onSlotCleaned()` preceded by a `waitExpandBufferCompletion(..)` call\n * in case the cancelled request is receiver.\n */"} {"signature":"private fun < T > CancellableContinuation < T > . tryResume0 ( value : T , onCancellation : ( ( cause : Throwable ) -> Unit ) ? = null ) : Boolean","body":"= tryResume ( value , null , onCancellation ) . let { token -> if ( token != null ) { completeResume ( token ) true } else false }","docstring":"/**\n * Tries to resume this continuation with the specified\n * value. Returns `true` on success and `false` on failure.\n */"} {"signature":"public fun wrapUnsafe ( array : ByteArray ) : ByteString","body":"= ByteString . wrap ( array )","docstring":"/**\n * Creates a new byte string by wrapping [array] without copying it.\n * Make sure that the wrapped array won't be modified during the lifespan of the returned byte string.\n *\n * @param array the array to wrap into the byte string.\n */"} {"signature":"public inline fun withByteArrayUnsafe ( byteString : ByteString , block : ( ByteArray ) -> Unit )","body":"{ block ( byteString . getBackingArrayReference ( ) ) }","docstring":"/**\n * Applies [block] to a reference to the underlying array.\n *\n * This method invokes [block] on a reference to the underlying array, not to its copy.\n * Consider using [ByteString.toByteArray] if it's impossible to guarantee that the array won't be modified.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendLine ( value : Byte ) : StringBuilder","body":"= append ( value ) . appendLine ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line feed character (`\\n`). */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendLine ( value : Short ) : StringBuilder","body":"= append ( value ) . appendLine ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line feed character (`\\n`). */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendLine ( value : Int ) : StringBuilder","body":"= append ( value ) . appendLine ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line feed character (`\\n`). */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendLine ( value : Long ) : StringBuilder","body":"= append ( value ) . appendLine ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line feed character (`\\n`). */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendLine ( value : Float ) : StringBuilder","body":"= append ( value ) . appendLine ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line feed character (`\\n`). */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendLine ( value : Double ) : StringBuilder","body":"= append ( value ) . appendLine ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line feed character (`\\n`). */"} {"signature":"protected open fun isDeclaredFunctionAvailable ( function : SimpleFunctionDescriptor ) : Boolean","body":"= true","docstring":"/**\n * Can be overridden to filter specific declared functions. Not called on non-declared functions.\n */"} {"signature":"protected open fun computeNonDeclaredFunctions ( name : Name , functions : MutableList < SimpleFunctionDescriptor > )","body":"{ }","docstring":"/**\n * This function has the next contract:\n *\n * * It can only add to the end of the [functions] list and shall not modify it otherwise (e.g. remove from it).\n * * Before the call, [functions] should already contain all declared functions with the [name] name.\n */"} {"signature":"protected open fun computeNonDeclaredProperties ( name : Name , descriptors : MutableList < PropertyDescriptor > )","body":"{ }","docstring":"/**\n * This function has the next contract:\n *\n * * It can only add to the end of the [descriptors] list and shall not modify it otherwise (e.g. remove from it).\n * * Before the call, [descriptors] should already contain all declared properties with the [name] name.\n */"} {"signature":"private inline fun < T : DeclarationDescriptor > computeNonDeclaredDescriptors ( name : Name , declaredDescriptors : List < T > , computeNonDeclared : ( Name , MutableList < T > ) -> Unit ) : List < T >","body":"{ val declaredDescriptorsWithSameName = declaredDescriptors . filterTo ( mutableListOf ( ) ) { it . name == name } val nonDeclaredPropertiesStartIndex = declaredDescriptorsWithSameName . size computeNonDeclared ( name , declaredDescriptorsWithSameName ) return declaredDescriptorsWithSameName . subList ( nonDeclaredPropertiesStartIndex , declaredDescriptorsWithSameName . size ) }","docstring":"/**\n * We have to collect non-declared properties in such non-pretty way because we don't want to change the contract of the\n * [computeNonDeclaredProperties] and [computeNonDeclaredFunctions] methods, because we do not want any performance penalties.\n *\n * [computeNonDeclared] may only add elements to the end of [MutableList], otherwise this function would not work properly.\n */"} {"signature":"internal fun FirClassSymbol < * > . isSerializableEnum ( session : FirSession ) : Boolean","body":"{ return classKind . isEnumClass && hasSerializableOrMetaAnnotation ( session ) }","docstring":"/**\n * Check that class is enum and marked by `Serializable` or meta-serializable annotation.\n */"} {"signature":"public inline fun < reified @ PureReifiable T > emptyArray ( ) : Array < T >","body":"= @ Suppress ( \"\" ) ( arrayOfNulls < T > ( ) as Array < T > )","docstring":"/**\n * Returns an empty array of the specified type [T].\n */"} {"signature":"override fun tryToMatch ( startIndex : Int , testString : CharSequence , matchResult : MatchResultImpl ) : Int","body":"{ matchResult . setConsumed ( groupIndex , startIndex ) children . forEach { if ( it . findBack ( , startIndex , testString , matchResult ) >= ) { matchResult . setConsumed ( groupIndex , - ) return next . matches ( startIndex , testString , matchResult ) } } return - }","docstring":"/** Returns startIndex+shift, the next position to match */"} {"signature":"override fun tryToMatch ( startIndex : Int , testString : CharSequence , matchResult : MatchResultImpl ) : Int","body":"{ matchResult . setConsumed ( groupIndex , startIndex ) children . forEach { val shift = it . findBack ( , startIndex , testString , matchResult ) if ( shift >= ) { return - } } return next . matches ( startIndex , testString , matchResult ) }","docstring":"/** Returns startIndex+shift, the next position to match */"} {"signature":"internal fun parseKotlinVersion ( fullVersionString : String ) : KotlinVersion ?","body":"{ val versionParts = fullVersionString . split ( \"\" , \"\" , limit = ) . takeIf { parts -> parts . size >= && parts . subList ( , ) . all { it . isNumeric ( ) } } ? : return null return KotlinVersion ( major = versionParts [ ] . toInt ( ) , minor = versionParts [ ] . toInt ( ) , patch = versionParts [ ] . toInt ( ) ) }","docstring":"/**\n * Accepts a full version string that contains the major, minor\n * and patch versions divided by dots, such as \"1.7.10\".\n *\n * Does NOT parse and store custom suffixes, so `1.8.20-RC2`\n * or `1.8.20-dev-42` will be viewed as `1.8.20`.\n */"} {"signature":"public fun < T : Number , D : Dimension > exp ( a : MultiArray < T , D > ) : NDArray < Double , D >","body":"public fun < T : Number , D : Dimension > exp ( a : MultiArray < T , D > ) : NDArray < Double , D >","docstring":"/**\n * Returns a ndarray of Double from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"public fun < D : Dimension > expF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"public fun < D : Dimension > expF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","docstring":"/**\n * Returns a ndarray of Float from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"public fun < D : Dimension > expCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","body":"public fun < D : Dimension > expCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","docstring":"/**\n * Returns a ndarray of [ComplexFloat] from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"public fun < D : Dimension > expCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","body":"public fun < D : Dimension > expCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","docstring":"/**\n * Returns a ndarray of [ComplexDouble] from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"public fun < T : Number , D : Dimension > log ( a : MultiArray < T , D > ) : NDArray < Double , D >","body":"public fun < T : Number , D : Dimension > log ( a : MultiArray < T , D > ) : NDArray < Double , D >","docstring":"/**\n * Returns a ndarray of Double from the given ndarray to each element of which a log function has been applied.\n */"} {"signature":"public fun < D : Dimension > logF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"public fun < D : Dimension > logF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","docstring":"/**\n * Returns a ndarray of Float from the given ndarray to each element of which a log function has been applied.\n */"} {"signature":"public fun < D : Dimension > logCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","body":"public fun < D : Dimension > logCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","docstring":"/**\n * Returns a ndarray of [ComplexFloat] from the given ndarray to each element of which a log function has been applied.\n */"} {"signature":"public fun < D : Dimension > logCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","body":"public fun < D : Dimension > logCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","docstring":"/**\n * Returns a ndarray of [ComplexDouble] from the given ndarray to each element of which a log function has been applied.\n */"} {"signature":"public fun < T : Number , D : Dimension > sin ( a : MultiArray < T , D > ) : NDArray < Double , D >","body":"public fun < T : Number , D : Dimension > sin ( a : MultiArray < T , D > ) : NDArray < Double , D >","docstring":"/**\n * Returns an ndarray of Double from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"public fun < D : Dimension > sinF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"public fun < D : Dimension > sinF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","docstring":"/**\n * Returns an ndarray of Float from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"public fun < D : Dimension > sinCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","body":"public fun < D : Dimension > sinCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","docstring":"/**\n * Returns an ndarray of [ComplexFloat] from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"public fun < D : Dimension > sinCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","body":"public fun < D : Dimension > sinCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","docstring":"/**\n * Returns an ndarray of [ComplexDouble] from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"public fun < T : Number , D : Dimension > cos ( a : MultiArray < T , D > ) : NDArray < Double , D >","body":"public fun < T : Number , D : Dimension > cos ( a : MultiArray < T , D > ) : NDArray < Double , D >","docstring":"/**\n * Returns a ndarray of Double from the given ndarray to each element of which a cos function has been applied.\n */"} {"signature":"public fun < D : Dimension > cosF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"public fun < D : Dimension > cosF ( a : MultiArray < Float , D > ) : NDArray < Float , D >","docstring":"/**\n * Returns a ndarray of Float from the given ndarray to each element of which a cos function has been applied.\n */"} {"signature":"public fun < D : Dimension > cosCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","body":"public fun < D : Dimension > cosCF ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","docstring":"/**\n * Returns a ndarray of [ComplexFloat] from the given ndarray to each element of which a cos function has been applied.\n */"} {"signature":"public fun < D : Dimension > cosCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","body":"public fun < D : Dimension > cosCD ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","docstring":"/**\n * Returns a ndarray of [ComplexDouble] from the given ndarray to each element of which a cos function has been applied.\n */"} {"signature":"fun registerAddedOrChangedFile ( outputFile : Path )","body":"fun registerAddedOrChangedFile ( outputFile : Path )","docstring":"/**\n * This method should be called before creating a new file or changing an existing file.\n */"} {"signature":"fun deleteFile ( outputFile : Path )","body":"fun deleteFile ( outputFile : Path )","docstring":"/**\n * This method should be used to perform a file removal.\n */"} {"signature":"fun markAsSuccessful ( )","body":"fun markAsSuccessful ( )","docstring":"/**\n * Marks the transaction as successful, so it should not revert changes if it is able to perform revert.\n */"} {"signature":"private fun revertChanges ( )","body":"{ reporter . debug { \"\" } reporter . measure ( GradleBuildTime . RESTORE_OUTPUT_FROM_BACKUP ) { for ( ( originPath , relocatedPath ) in fileRelocationRegistry ) { if ( relocatedPath == null ) { if ( Files . exists ( originPath ) ) { Files . delete ( originPath ) } continue } Files . move ( relocatedPath , originPath , StandardCopyOption . REPLACE_EXISTING ) } } }","docstring":"/**\n * Reverts all the file changes registered in this transaction.\n * If the value for a key is null, then it's the file that was created during the transaction, so the file will be just removed.\n */"} {"signature":"private fun cleanupStash ( )","body":"{ reporter . debug { \"\" } reporter . measure ( GradleBuildTime . CLEAN_BACKUP_STASH ) { Files . walk ( stashDir ) . use { it . sorted ( Comparator . reverseOrder ( ) ) . forEach ( Files :: delete ) } } }","docstring":"/**\n * Deletes the [stashDir].\n */"} {"signature":"fun Project . objCExportHeaderGeneratorTest ( taskName : String , testDisplayNameTag : String ? = null , configure : Test . ( ) -> Unit = { } , )","body":"= nativeTest ( taskName = taskName , tag = null , requirePlatformLibs = false , ) { run { val testDependencyKlibs = configurations . maybeCreate ( \"\" ) . also { configuration -> configuration . attributes { attribute ( Usage . USAGE_ATTRIBUTE , objects . named ( KotlinUsages . KOTLIN_API ) ) attribute ( Category . CATEGORY_ATTRIBUTE , objects . named ( Category . LIBRARY ) ) attribute ( KotlinPlatformType . attribute , KotlinPlatformType . native ) attribute ( KotlinNativeTarget . konanTargetAttribute , HostManager . host . name ) } dependencies { configuration ( project ( \"\" ) ) configuration ( project ( \"\" ) ) } } val testDependencyKlibsClasspath = testDependencyKlibs . incoming . files . elements . map { elements -> elements . joinToString ( File . pathSeparator ) { location -> location . asFile . absolutePath } } doFirst { systemProperty ( \"\" , testDependencyKlibsClasspath . get ( ) ) } inputs . files ( testDependencyKlibs ) . withPathSensitivity ( PathSensitivity . RELATIVE ) } useJUnitPlatform ( ) enableJunit5ExtensionsAutodetection ( ) systemProperty ( \"\" , project . providers . gradleProperty ( \"\" ) . isPresent ) if ( testDisplayNameTag != null ) { systemProperty ( \"\" , testDisplayNameTag ) } configure ( ) }","docstring":"/**\n * Wrapper for [nativeTest] which helps to apply defaults expected by\n * projects under ':native:objcexport-header-generator:*'\n */"} {"signature":"internal suspend fun < R > flowScope ( @ BuilderInference block : suspend CoroutineScope . ( ) -> R ) : R","body":"= suspendCoroutineUninterceptedOrReturn { uCont -> val coroutine = FlowCoroutine ( uCont . context , uCont ) coroutine . startUndispatchedOrReturn ( coroutine , block ) }","docstring":"/**\n * Creates a [CoroutineScope] and calls the specified suspend block with this scope.\n * This builder is similar to [coroutineScope] with the only exception that it *ties* lifecycle of children\n * and itself regarding the cancellation, thus being cancelled when one of the children becomes cancelled.\n *\n * For example:\n * ```\n * flowScope {\n * launch {\n * throw CancellationException()\n * }\n * } // <- CE will be rethrown here\n * ```\n */"} {"signature":"internal fun < R > scopedFlow ( @ BuilderInference block : suspend CoroutineScope . ( FlowCollector < R > ) -> Unit ) : Flow < R >","body":"= flow { flowScope { block ( this @ flow ) } }","docstring":"/**\n * Creates a flow that also provides a [CoroutineScope] for each collector\n * Shorthand for:\n * ```\n * flow {\n * flowScope {\n * ...\n * }\n * }\n * ```\n * with additional constraint on cancellation.\n * To cancel child without cancelling itself, `cancel(ChildCancelledException())` should be used.\n */"} {"signature":"@ DelicateSymbolTableApi fun forEachDeclarationSymbol ( block : ( IrSymbol ) -> Unit )","body":"{ table . forEachDeclarationSymbol ( block ) scriptSlice . forEachSymbol { block ( it ) } classSlice . forEachSymbol { block ( it ) } constructorSlice . forEachSymbol { block ( it ) } enumEntrySlice . forEachSymbol { block ( it ) } fieldSlice . forEachSymbol { block ( it ) } functionSlice . forEachSymbol { block ( it ) } propertySlice . forEachSymbol { block ( it ) } typeAliasSlice . forEachSymbol { block ( it ) } globalTypeParameterSlice . forEachSymbol { block ( it ) } }","docstring":"/**\n * This function is quite messy and doesn't have good contract of what exactly is traversed.\n * Basic idea is it traverse symbols which can be reasonable referered from other module\n *\n * Be careful when using it, and avoid it, except really need.\n */"} {"signature":"fun < K , V > Map < K , V > . shouldContainAll ( vararg expected : Pair < K , V > ) : Unit","body":"= shouldContainAll ( expected . toMap ( ) )","docstring":"/** @see io.kotest.matchers.maps.shouldContainAll */"} {"signature":"fun < K , V > Map < K , V > . shouldContainExactly ( vararg expected : Pair < K , V > ) : Unit","body":"= shouldContainExactly ( expected . toMap ( ) )","docstring":"/** @see io.kotest.matchers.maps.shouldContainExactly */"} {"signature":"fun < T > Sequence < T > . shouldBeSingleton ( match : ( T ) -> Unit )","body":"{ toList ( ) . shouldBeSingleton ( match ) }","docstring":"/** Verify the sequence contains a single element, matching [match]. */"} {"signature":"public fun < T > y ( column : ColumnReference < T > , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y , column . name ( ) , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `y` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the y-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > y ( column : KProperty < T > , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y , column . name , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `y` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the y-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun y ( column : String , parameters : LetsPlotPositionalMappingParametersContinuous < Any ? > . ( ) -> Unit = { } ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping < Any ? > ( Y , column , LetsPlotPositionalMappingParametersContinuous < Any ? > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `y` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the y-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > y ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y , values . toList ( ) , name , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `y` aesthetic to iterable of values.\n *\n * @param values the iterable containing the y-coordinate values.\n * @param name optional name for this aesthetic mapping.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > y ( values : DataColumn < T > , parameters : LetsPlotPositionalMappingParametersContinuous < T > . ( ) -> Unit = { } ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y , values , LetsPlotPositionalMappingParametersContinuous < T > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `y` aesthetic to a data column.\n *\n * @param values the data column to map to the y-coordinate.\n * @param parameters additional mapping parameters.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun y ( parameters : AxisParametersWithSetter . ( ) -> Unit = { } )","body":"{ y . apply ( parameters ) }","docstring":"/**\n * Applies configurations to y-axis parameters.\n *\n * @param parameters the configurations to apply to the y-axis parameters.\n */"} {"signature":"@ OptIn ( ExperimentalMaterialApi :: class ) @ Composable fun JetsnackScaffold ( modifier : Modifier = Modifier , scaffoldState : ScaffoldState = rememberScaffoldState ( ) , topBar : @ Composable ( ( ) -> Unit ) = { } , bottomBar : @ Composable ( ( ) -> Unit ) = { } , snackbarHost : @ Composable ( SnackbarHostState ) -> Unit = { SnackbarHost ( it ) } , floatingActionButton : @ Composable ( ( ) -> Unit ) = { } , floatingActionButtonPosition : FabPosition = FabPosition . End , isFloatingActionButtonDocked : Boolean = false , drawerContent : @ Composable ( ColumnScope . ( ) -> Unit ) ? = null , drawerShape : Shape = MaterialTheme . shapes . large , drawerElevation : Dp = DrawerDefaults . Elevation , drawerBackgroundColor : Color = JetsnackTheme . colors . uiBackground , drawerContentColor : Color = JetsnackTheme . colors . textSecondary , drawerScrimColor : Color = JetsnackTheme . colors . uiBorder , backgroundColor : Color = JetsnackTheme . colors . uiBackground , contentColor : Color = JetsnackTheme . colors . textSecondary , content : @ Composable ( PaddingValues ) -> Unit )","body":"{ Scaffold ( modifier = modifier , scaffoldState = scaffoldState , topBar = topBar , bottomBar = bottomBar , snackbarHost = snackbarHost , floatingActionButton = floatingActionButton , floatingActionButtonPosition = floatingActionButtonPosition , isFloatingActionButtonDocked = isFloatingActionButtonDocked , drawerContent = drawerContent , drawerShape = drawerShape , drawerElevation = drawerElevation , drawerBackgroundColor = drawerBackgroundColor , drawerContentColor = drawerContentColor , drawerScrimColor = drawerScrimColor , backgroundColor = backgroundColor , contentColor = contentColor , content = content ) }","docstring":"/**\n * Wrap Material [androidx.compose.material.Scaffold] and set [JetsnackTheme] colors.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalEncodingApi public fun InputStream . decodingWith ( base64 : Base64 ) : InputStream","body":"{ return DecodeInputStream ( this , base64 ) }","docstring":"/**\n * Returns an input stream that decodes symbols from this input stream using the specified [base64] encoding.\n *\n * Reading from the returned input stream leads to reading some symbols from the underlying input stream.\n * The symbols are decoded using the specified [base64] encoding and the resulting bytes are returned.\n * Symbols are decoded in 4-symbol blocks.\n *\n * The symbols for decoding are not required to be padded.\n * However, if there is a padding character present, the correct amount of padding character(s) must be present.\n * The padding character `'='` is interpreted as the end of the symbol stream. Subsequent symbols are not read even if\n * the end of the underlying input stream is not reached.\n *\n * The returned input stream should be closed in a timely manner. We suggest you try the [use] function,\n * which closes the resource after a given block of code is executed.\n * The close operation discards leftover bytes.\n * Closing the returned input stream will close the underlying input stream.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalEncodingApi public fun OutputStream . encodingWith ( base64 : Base64 ) : OutputStream","body":"{ return EncodeOutputStream ( this , base64 ) }","docstring":"/**\n * Returns an output stream that encodes bytes using the specified [base64] encoding\n * and writes the result to this output stream.\n *\n * The byte data written to the returned output stream is encoded using the specified [base64] encoding\n * and the resulting symbols are written to the underlying output stream.\n * Bytes are encoded in 3-byte blocks.\n *\n * The returned output stream should be closed in a timely manner. We suggest you try the [use] function,\n * which closes the resource after a given block of code is executed.\n * The close operation writes properly padded leftover symbols to the underlying output stream.\n * Closing the returned output stream will close the underlying output stream.\n */"} {"signature":"private fun SimpleFunctionDescriptor . shouldBeVisibleAsOverrideOfBuiltInWithErasedValueParameters ( ) : Boolean","body":"{ if ( ! name . sameAsBuiltinMethodWithErasedValueParameters ) return false val candidatesToOverride = getFunctionsFromSupertypes ( name ) . mapNotNull { BuiltinMethodsWithSpecialGenericSignature . getOverriddenBuiltinFunctionWithErasedValueParametersInJava ( it ) } return candidatesToOverride . any { candidate -> hasSameJvmDescriptorButDoesNotOverride ( candidate ) } }","docstring":"/**\n * Checks if function is a valid override of JDK analogue of built-in method with erased value parameters (e.g. Map.containsKey(k: K))\n *\n * Examples:\n * - boolean containsKey(Object key) -> true\n * - boolean containsKey(K key) -> false // Wrong JDK method override, while it's a valid Kotlin built-in override\n */"} {"signature":"private fun KtSourceElement . isSourceForCompoundAccess ( fir : FirElement ) : Boolean","body":"{ val psi = psi val parentPsi = psi ? . parent if ( kind !is KtFakeSourceElementKind . DesugaredAugmentedAssign && kind !is KtFakeSourceElementKind . DesugaredIncrementOrDecrement ) { return false } return when { psi is KtBinaryExpression || psi is KtUnaryExpression -> fir . isWriteInCompoundCall ( ) parentPsi is KtBinaryExpression && psi == parentPsi . left -> fir . isReadInCompoundCall ( ) parentPsi is KtUnaryExpression && psi == parentPsi . baseExpression -> fir . isReadInCompoundCall ( ) else -> false } }","docstring":"/**\n * FIR represents compound assignment and inc/dec operations as multiple smaller instructions. Here we choose the write operation as the\n * resolved FirElement for binary and unary expressions. For example, the `FirVariableAssignment` or the call to `set` or `plusAssign`\n * function, etc. This is because the write FirElement can be used to retrieve all other information related to this compound operation.\n\n * On the other hand, if the PSI is the left operand of an assignment or the base expression of a unary expression, we take the read FIR\n * element so the user of the Analysis API is able to retrieve such read calls reliably.\n */"} {"signature":"private fun FirElement . getFallbackCompoundCalleeName ( ) : Name ?","body":"{ val psi = source . psi as? KtOperationExpression ? : return null val operationReference = psi . operationReference return operationReference . getAssignmentOperationName ( ) ? : operationReference . getReferencedNameAsName ( ) }","docstring":"/**\n * If the callee reference is not a [FirResolvedNamedReference], we can get the compound callee name from the source instead. For\n * example, if the callee reference is a [FirErrorNamedReference] with an unresolved name `plusAssign`, the operation element type from\n * the source will be `KtTokens.PLUSEQ`, which can be transformed to `plusAssign`.\n */"} {"signature":"fun applyHierarchyTemplate ( template : KotlinHierarchyTemplate )","body":"fun applyHierarchyTemplate ( template : KotlinHierarchyTemplate )","docstring":"/**\n * Applies a given [template] to the project.\n *\n * *Examples:*\n *\n * - Manually apply the default hierarchy\n * (See `KotlinMultiplatformExtension.applyDefaultHierarchyTemplate`):\n * ```kotlin\n * kotlin {\n * applyHierarchyTemplate(KotlinHierarchyTemplate.default)\n * iosX64()\n * iosArm64()\n * iosSimulatorArm64()\n * linuxX64()\n * // ...\n * }\n * ```\n */"} {"signature":"@ ExperimentalKotlinGradlePluginApi fun applyHierarchyTemplate ( template : KotlinHierarchyTemplate , extension : KotlinHierarchyBuilder . Root . ( ) -> Unit )","body":"@ ExperimentalKotlinGradlePluginApi fun applyHierarchyTemplate ( template : KotlinHierarchyTemplate , extension : KotlinHierarchyBuilder . Root . ( ) -> Unit )","docstring":"/**\n * Similar to [applyHierarchyTemplate], but allows extension of the provided template.\n *\n * *Examples:*\n *\n * - Add custom groups (Experimental) to additionally share code between Linux and Apple (unixLike):\n *\n * ```kotlin\n * kotlin {\n * applyHierarchyTemplate(KotlinHierarchyTemplate.default) {\n * group(\"native\") { // <- we can re-declare already existing groups and connect children to it!\n * group(\"unixLike\") {\n * withLinux()\n * withApple()\n * }\n * }\n * }\n * }\n * ```\n */"} {"signature":"@ ExperimentalKotlinGradlePluginApi fun applyHierarchyTemplate ( template : KotlinHierarchyBuilder . Root . ( ) -> Unit )","body":"@ ExperimentalKotlinGradlePluginApi fun applyHierarchyTemplate ( template : KotlinHierarchyBuilder . Root . ( ) -> Unit )","docstring":"/**\n * Allows creating a fully custom hierarchy (no defaults applied).\n *\n * **Note: ** Using the custom hierarchy requires setting the edges to 'commonMain' and 'commonTest' SourceSets by\n * using the `common` group.\n *\n * *Examples:*\n *\n * - Share code between iOS and JVM targets:\n * ```kotlin\n * applyHierarchyTemplate {\n * common {\n * withJvm()\n * group(\"ios\") {\n * withIos()\n * }\n * }\n * }\n * ```\n *\n * This configuration creates two [KotlinSourceSetTree] using the 'common' and 'ios' groups,\n * applied on the \"test\" and \"main\" compilations.\n * When the following targets are specified:\n * - jvm()\n * - iosX64()\n * - iosArm64()\n * ```\n * \"main\" \"test\"\n * commonMain commonTest\n * | |\n * | |\n * +----------+----------+ +----------+----------+\n * | | | |\n * iosMain jvmMain iosTest jvmTest\n * | |\n * +----+-----+ +----+-----+\n * | | | |\n * iosX64Main iosArm64Main iosX64Test iosArm64Test\n * ```\n *\n * - Create a 'diamond structure'\n * ```kotlin\n * applyHierarchyTemplate {\n * common {\n * group(\"ios\") {\n * withIos()\n * }\n *\n * group(\"frontend\") {\n * withJvm()\n * group(\"ios\") // <- ! We can again reference the 'ios' group\n * }\n *\n * group(\"apple\") {\n * withMacos()\n * group(\"ios\") // <- ! We can again reference the 'ios' group\n * }\n * }\n * }\n * ```\n *\n * In this case, the _group_ \"ios\" can be created with 'group(\"ios\")' and later referenced with the same construction to build\n * the tree.\n * Apply the descriptor from the example to the following targets:\n * - iosX64()\n * - iosArm64()\n * - macosX64()\n * - jvm()\n *\n * To create the following 'main' KotlinSourceSetTree:\n *\n * ```\n * commonMain\n * |\n * +------------+----------+\n * | |\n * frontendMain appleMain\n * | |\n * +---------+------------+-----------+----------+\n * | | |\n * jvmMain iosMain macosX64Main\n * |\n * |\n * +----+----+\n * | |\n * iosX64Main iosArm64Main\n * ```\n */"} {"signature":"public fun ClassName . isLocalClassName ( ) : Boolean","body":"= this . startsWith ( \"\" )","docstring":"/**\n * Checks whether a class name [this] represents a local class or an anonymous object.\n *\n * A class name represents a local class or an anonymous object if it starts with '.' (dot).\n */"} {"signature":"@ ExperimentalMainFunctionArgumentsDsl fun passAsArgumentToMainFunction ( jsExpression : String )","body":"@ ExperimentalMainFunctionArgumentsDsl fun passAsArgumentToMainFunction ( jsExpression : String )","docstring":"/**\n * The function accepts [jsExpression] and puts this expression as the \"args: Array\" argument in place of main-function call\n */"} {"signature":"@ Test fun `launch in EvaluateBuildscript` ( )","body":"{ val project = buildProject ( ) project . startKotlinPluginLifecycle ( ) var executed = false project . launch { executed = true } assertTrue ( executed , \"\" ) }","docstring":"/**\n * Launching in 'EvaluateBuildscript' will execute the launched code right away!\n * This code will showcase that launching before any 'afterEvaluate' listeners have been invoked is possible.\n * However, the launched coroutines can be executed right away.\n */"} {"signature":"@ Test fun `launchInStage AfterEvaluate` ( )","body":"{ val project = buildProject ( ) project . startKotlinPluginLifecycle ( ) var executed = false project . launchInStage ( AfterEvaluateBuildscript ) { executed = true } assertFalse ( executed , \"\" ) project . evaluate ( ) assertTrue ( executed , \"\" ) }","docstring":"/**\n * Launching in code 'AfterEvaluateBuildscript' Stage:\n * This sample shows how code can be deferred into a 'afterEvaluate' based Stage.\n * Using [launchInStage]: This code will only be executed once the stage will be reached.\n */"} {"signature":"@ Test fun `launchInStage FinaliseDsl` ( )","body":"{ val project = buildProject ( ) project . startKotlinPluginLifecycle ( ) project . launchInStage ( FinaliseDsl ) { assertEquals ( FinaliseDsl , project . kotlinPluginLifecycle . stage ) } project . evaluate ( ) }","docstring":"/**\n * Similar to [launchInStage AfterEvaluate], but shows launching in a later stage ([FinaliseDsl]).\n * Showcases that [launchInStage] will only execute the code once the respective Stage was reached.\n */"} {"signature":"@ Test fun `await FinaliseDsl Stage in coroutine` ( )","body":"{ val project = buildProject ( ) project . startKotlinPluginLifecycle ( ) project . launch { assertEquals ( KotlinPluginLifecycle . Stage . EvaluateBuildscript , project . kotlinPluginLifecycle . stage ) FinaliseDsl . await ( ) assertEquals ( KotlinPluginLifecycle . Stage . FinaliseDsl , project . kotlinPluginLifecycle . stage ) } project . evaluate ( ) }","docstring":"/**\n * Shows how a stage like [FinaliseDsl] can be awaited using [await]:\n * A coroutine using [await] will suspend the execution until this [KotlinPluginLifecycle.Stage] was reached.\n * Note: The semantics is 'the stage was reached' **not** 'the stage was completed'\n */"} {"signature":"@ Test fun `exception thrown in buildscript evaluation - inside coroutine` ( )","body":"{ val project = buildProjectWithMPP ( ) val executed = mutableListOf < String > ( ) assertFailsWith < TestException > { project . launch { executed . add ( \"\" ) } project . launch { executed . add ( \"\" ) throw TestException ( ) } project . launch { executed . add ( \"\" ) } } assertEquals ( listOf ( \"\" , \"\" ) , executed ) run { assertNotNull ( project . future { KotlinPluginLifecycle . Stage . EvaluateBuildscript . await ( ) } . getOrThrow ( ) ) assertFailsWith < IllegalLifecycleException > { project . future { KotlinPluginLifecycle . Stage . AfterEvaluateBuildscript . await ( ) } . getOrThrow ( ) } } }","docstring":"/**\n * Showcase of error handling when there was an error thrown within the build.gradle.kts file (or in any plugin.apply())\n * Example would be:\n *\n * build.gradle.kts\n * ```kotlin\n * kotlin {\n * sourceSets.getByName(\"nonExistentSourceSet\") // <- throws UnknownDomainObjectException\n * }\n * ```\n */"} {"signature":"@ Test fun `exception thrown in buildscript evaluation - inside user buildscript` ( )","body":"{ val project = buildProjectWithMPP ( ) val executed = mutableListOf < String > ( ) project . launchInStage ( AfterEvaluateBuildscript ) { executed . add ( \"\" ) } project . launchInStage ( ReadyForExecution ) { executed . add ( \"\" ) } project . tasks . whenObjectAdded { throw TestException ( ) } assertFails { project . evaluate ( ) } run { assertEquals ( EvaluateBuildscript , project . kotlinPluginLifecycle . stage ) assertEquals ( emptyList ( ) , executed ) val result = project . configurationResult . getOrThrow ( ) assertIsInstance < ProjectConfigurationResult . Failure > ( result ) project . future { project . configurationResult . await ( ) } . getOrThrow ( ) } }","docstring":"/**\n * Demonstrates how coroutines will behave if any exception is thrown within the buildscript of the user.\n * Such an exception would be:\n * ```kotlin\n * kotlin {\n * sourceSets.getByName(\"notExistingSourceSet\") // <- throws UnknownDomainObjectException\n * }\n * ``\n *\n * In this case, all coroutines scheduled for later execution *will not be executed*\n */"} {"signature":"@ Test fun `exception thrown in buildscript evaluation - coroutines waiting for configurationResult` ( )","body":"{ val project = buildProjectWithMPP ( ) val executed = mutableListOf < String > ( ) project . launch { project . configurationResult . await ( ) executed . add ( \"\" ) } project . launch { FinaliseDsl . await ( ) project . configurationResult . await ( ) executed . add ( \"\" ) } project . launchInStage ( AfterEvaluateBuildscript ) { executed . add ( \"\" ) } project . tasks . whenObjectAdded { throw TestException ( ) } assertFails { project . evaluate ( ) } assertEquals ( EvaluateBuildscript , project . kotlinPluginLifecycle . stage ) assertEquals ( listOf ( \"\" ) , executed ) }","docstring":"/**\n * Showcases how coroutines will behave if there is an exception thrown within the buildscript of the user.\n * In particular this sample shows how calls to `project.configurationResult` will be handled!\n *\n * In short: All coroutines that already suspended, waiting for the configurationResult will be unsuspended.\n * Like in [exception thrown in buildscript evaluation - inside user buildscript]:\n * Coroutines that ware waiting for later 'Stages' will not be executed (as their requirements are unmet)\n */"} {"signature":"@ Test fun `exception thrown in AfterEvaluateBuildscript` ( )","body":"{ val project = buildProjectWithMPP ( ) val executed = mutableListOf < String > ( ) project . launchInStage ( AfterEvaluateBuildscript ) { executed . add ( \"\" ) } project . launchInStage ( AfterEvaluateBuildscript ) { executed . add ( \"\" ) throw TestException ( ) } project . launchInStage ( AfterEvaluateBuildscript ) { executed . add ( \"\" ) } project . launchInStage ( ReadyForExecution ) { executed . add ( \"\" ) } assertFails { project . evaluate ( ) } run { assertEquals ( AfterEvaluateBuildscript , project . kotlinPluginLifecycle . stage ) assertEquals ( listOf ( \"\" , \"\" ) , executed ) assertIsInstance < ProjectConfigurationResult . Failure > ( project . configurationResult . getOrThrow ( ) ) } run { assertNotNull ( project . future { KotlinPluginLifecycle . Stage . EvaluateBuildscript . await ( ) } . getOrThrow ( ) ) assertNotNull ( project . future { KotlinPluginLifecycle . Stage . AfterEvaluateBuildscript . await ( ) } . getOrThrow ( ) ) assertFailsWith < IllegalLifecycleException > { project . future { KotlinPluginLifecycle . Stage . ReadyForExecution . await ( ) } . getOrThrow ( ) } } }","docstring":"/**\n * Sample showcases how an exception thrown within a stage like [AfterEvaluateBuildscript] is handled:\n * All coroutines scheduled after the throwing coroutine will not be executed!\n * Coroutines already waiting for the projects configuration result will be unsuspended.\n *\n * Coroutines launched *after* the failure state has reached will be launched w/o suspensions.\n */"} {"signature":"@ Test fun `awaiting Project configurationResult` ( )","body":"{ val project = buildProjectWithMPP ( ) project . launch { assertEquals ( EvaluateBuildscript , project . kotlinPluginLifecycle . stage ) val result = project . configurationResult . await ( ) assertIsInstance < ProjectConfigurationResult . Success > ( result ) assertEquals ( ReadyForExecution , project . kotlinPluginLifecycle . stage ) } project . evaluate ( ) }","docstring":"/**\n * Sample showcasing how one can wait for the finished project configurationResult when no exception is reached.\n * Just simply awaiting the future is enough here!\n * In happy case the stage will be [ReadyForExecution]\n */"} {"signature":"@ Test fun `awaiting Project configurationResult - with error thrown in FinaliseDsl` ( )","body":"{ val project = buildProjectWithMPP ( ) val executed = mutableListOf < String > ( ) project . launch { executed . add ( \"\" ) val result = project . configurationResult . await ( ) assertIsInstance < ProjectConfigurationResult . Failure > ( result ) executed . add ( \"\" ) } project . launchInStage ( FinaliseDsl ) { executed . add ( \"\" ) val result = project . configurationResult . await ( ) assertIsInstance < ProjectConfigurationResult . Failure > ( result ) executed . add ( \"\" ) } project . launchInStage ( FinaliseDsl ) { executed . add ( \"\" ) throw TestException ( ) } project . launchInStage ( FinaliseDsl ) { executed . add ( \"\" ) } assertFails { project . evaluate ( ) } assertEquals ( listOf ( \"\" , \"\" , \"\" , \"\" , \"\" ) , executed ) }","docstring":"/**\n * Showcases how coroutines will be treated if there are waiting for [configurationResult], but\n * an exception is thrown in a intermediate [KotlinPluginLifecycle.Stage]\n *\n * Coroutines that already suspended, waiting for the result will be unsuspended.\n * Coroutines that are in the queue when the exception is thrown will not be executed anymore.\n */"} {"signature":"internal fun IrExpression . insertSpecialCast ( expression : FirExpression , valueType : ConeKotlinType , expectedType : ConeKotlinType , ) : IrExpression","body":"{ if ( this is IrTypeOperatorCall ) { return this } if ( this is IrContainerExpression ) { insertImplicitCasts ( coerceLastExpressionToUnit = type . isUnit ( ) ) } val expandedValueType = valueType . fullyExpandedType ( session ) val expandedExpectedType = expectedType . fullyExpandedType ( session ) return when { expandedExpectedType . isUnit -> { coerceToUnitIfNeeded ( this , irBuiltIns ) } expandedValueType is ConeDynamicType -> { if ( expandedExpectedType !is ConeDynamicType && ! expandedExpectedType . isNullableAny ) { implicitCast ( this , expandedExpectedType . toIrType ( c , ConversionTypeOrigin . DEFAULT ) ) } else { this } } typeCanBeEnhancedOrFlexibleNullable ( expandedValueType , session ) && ! expandedExpectedType . acceptsNullValues ( ) -> { insertImplicitNotNullCastIfNeeded ( expression ) } else -> this } }","docstring":"/**\n * This functions processes the following casts:\n * - coercion to Unit\n * - nullability casts based on nullability annotations\n * - casts for dynamic types\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Suppress ( \"\" ) public fun < R > SelectBuilder < R > . onTimeout ( timeMillis : Long , block : suspend ( ) -> R ) : Unit","body":"= OnTimeout ( timeMillis ) . selectClause . invoke ( block )","docstring":"/**\n * Clause that selects the given [block] after a specified timeout passes.\n * If timeout is negative or zero, [block] is selected immediately.\n *\n * **Note: This is an experimental api.** It may be replaced with light-weight timer/timeout channels in the future.\n *\n * @param timeMillis timeout time in milliseconds.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun < R > SelectBuilder < R > . onTimeout ( timeout : Duration , block : suspend ( ) -> R ) : Unit","body":"= onTimeout ( timeout . toDelayMillis ( ) , block )","docstring":"/**\n * Clause that selects the given [block] after the specified [timeout] passes.\n * If timeout is negative or zero, [block] is selected immediately.\n *\n * **Note: This is an experimental api.** It may be replaced with light-weight timer/timeout channels in the future.\n */"} {"signature":"private fun < T > NamedDomainObjectContainer < T > . getOrCreate ( name : String , action : Action < in T > ) : T","body":"= try { this . create ( name , action ) } catch ( e : InvalidUserDataException ) { this . getByName ( name ) }","docstring":"/**\n * Adds new object named [name] and configure it with [action] or return already existing object with this name.\n *\n * Similar to [NamedDomainObjectContainer.maybeCreate] but with [action] argument that will be applied only if\n * an object is being created.\n */"} {"signature":"fun onlyIf ( spec : Spec < in KonanTarget > )","body":"{ this . onlyIf . add ( spec ) }","docstring":"/**\n * Builds this source set only if [spec] is satisfied.\n */"} {"signature":"fun main ( action : Action < in SourceSet > ) : SourceSet","body":"= create ( MAIN_SOURCE_SET_NAME ) { this . inputFiles . include ( \"\" , \"\" ) this . inputFiles . exclude ( \"\" , \"\" , \"\" , \"\" ) compileTask . configure { this . group = BUILD_TASK_GROUP } task . configure { this . group = BUILD_TASK_GROUP } action . execute ( this ) }","docstring":"/**\n * Configure `main` source set. Used for main module sources. Included into `compileBitcodeMainElements` configuration.\n */"} {"signature":"fun testFixtures ( action : Action < in SourceSet > ) : SourceSet","body":"= create ( TEST_FIXTURES_SOURCE_SET_NAME ) { this . inputFiles . include ( \"\" , \"\" ) this . headersDirs . from ( googleTestExtension . headersDirs ) dependencies . add ( project . tasks . named ( \"\" ) ) compileTask . configure { this . group = VERIFICATION_BUILD_TASK_GROUP } task . configure { this . group = VERIFICATION_BUILD_TASK_GROUP } action . execute ( this ) }","docstring":"/**\n * Configure `testFixtures` source set. Used for testing API parts of module. Included into `compileBitcodeTestFixturesElements` configuration.\n */"} {"signature":"fun test ( action : Action < in SourceSet > ) : SourceSet","body":"= create ( TEST_SOURCE_SET_NAME ) { this . inputFiles . include ( \"\" , \"\" ) this . headersDirs . from ( googleTestExtension . headersDirs ) dependencies . add ( project . tasks . named ( \"\" ) ) compileTask . configure { this . group = VERIFICATION_BUILD_TASK_GROUP } task . configure { this . group = VERIFICATION_BUILD_TASK_GROUP } action . execute ( this ) }","docstring":"/**\n * Configure `test` source set. Used for test files of module. Included into `compileBitcodeTestElements` configuration.\n */"} {"signature":"fun onlyIf ( spec : Spec < in KonanTarget > )","body":"{ this . onlyIf . add ( spec ) }","docstring":"/**\n * Builds this source set only if [spec] is satisfied.\n */"} {"signature":"fun sourceSets ( action : Action < in SourceSets > )","body":"= sourceSets . apply { action . execute ( this ) }","docstring":"/**\n * Container for [SourceSet]s.\n */"} {"signature":"public fun detectLandmarks ( image : I ) : List < Landmark >","body":"= predict ( image )","docstring":"/**\n * Detects [Landmark] objects on the given [image].\n */"} {"signature":"public fun KtWhenExpression . getMissingCases ( ) : List < WhenMissingCase >","body":"= withValidityAssertion { analysisSession . expressionInfoProvider . getWhenMissingCases ( this ) }","docstring":"/**\n * Returns cases missing from the branches of [KtWhenExpression].\n *\n * The missing cases of the when-expression in the following example are Direction.WEST and Direction.EAST:\n *\n * enum class Direction {\n * NORTH, SOUTH, WEST, EAST\n * }\n * foo = when(direction) {\n * Direction.NORTH -> 1\n * Direction.SOUTH -> 2\n * else -> 3\n * }\n *\n * If when-expression has no subject, then else-branch would be reported as missing even if it is explicitly present:\n *\n * fun test() {\n * when {\n * true -> {}\n * else -> {}\n * }\n * }\n *\n * Note that this function returns the same missing cases regardless of the existence of the else branch.\n * If you have to assume that it does not have the missing cases when it has an else branch,\n * you need a separate check whether it has an else branch or not.\n */"} {"signature":"public fun KtExpression . isUsedAsExpression ( ) : Boolean","body":"= withValidityAssertion { analysisSession . expressionInfoProvider . isUsedAsExpression ( this ) }","docstring":"/**\n * Compute if the value of a given expression is possibly used. Or,\n * conversely, compute whether the value of an expression is *not* safe to\n * discard.\n *\n * E.g. `x` in the following examples *are* used (`x.isUsedAsExpression() == true`)\n * - `if (x) { ... } else { ... }`\n * - `val a = x`\n * - `x + 8`\n * - `when (x) { 1 -> ...; else -> ... }\n *\n * E.g. `x` in the following example is definitely *not* used (`x.isUsedAsExpression() == false`)\n * - `run { x; println(50) }`\n * - `when (x) { else -> ... }`\n *\n * **Note!** This is a conservative check, not a control-flow analysis.\n * E.g. `x` in the following example *is possibly used*, even though the\n * value is never consumed at runtime.\n * - `x + try { throw Exception() } finally { return }`\n *\n */"} {"signature":"internal fun noImpl ( ) : Nothing","body":"= throw UnsupportedOperationException ( \"\" )","docstring":"/**\n * **GENERAL NOTE**\n *\n * These deprecations are added to improve user experience when they will start to\n * search for their favourite operators and/or patterns that are missing or renamed in Flow.\n * Deprecated functions also are moved here when they renamed. The difference is that they have\n * a body with their implementation while pure stubs have [noImpl].\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR ) public fun < T > Flow < T > . observeOn ( context : CoroutineContext ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * `observeOn` has no direct match in [Flow] API because all terminal flow operators are suspending and\n * thus use the context of the caller.\n *\n * For example, the following code:\n * ```\n * flowable\n * .observeOn(Schedulers.io())\n * .doOnEach { value -> println(\"Received $value\") }\n * .subscribe()\n * ```\n *\n * has the following Flow equivalent:\n * ```\n * withContext(Dispatchers.IO) {\n * flow.collect { value -> println(\"Received $value\") }\n * }\n *\n * ```\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR ) public fun < T > Flow < T > . publishOn ( context : CoroutineContext ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * `publishOn` has no direct match in [Flow] API because all terminal flow operators are suspending and\n * thus use the context of the caller.\n *\n * For example, the following code:\n * ```\n * flux\n * .publishOn(Schedulers.io())\n * .doOnEach { value -> println(\"Received $value\") }\n * .subscribe()\n * ```\n *\n * has the following Flow equivalent:\n * ```\n * withContext(Dispatchers.IO) {\n * flow.collect { value -> println(\"Received $value\") }\n * }\n *\n * ```\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR ) public fun < T > Flow < T > . subscribeOn ( context : CoroutineContext ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * `subscribeOn` has no direct match in [Flow] API because [Flow] preserves its context and does not leak it.\n *\n * For example, the following code:\n * ```\n * flowable\n * .map { value -> println(\"Doing map in IO\"); value }\n * .subscribeOn(Schedulers.io())\n * .observeOn(Schedulers.computation())\n * .doOnEach { value -> println(\"Processing $value in computation\")\n * .subscribe()\n * ```\n * has the following Flow equivalent:\n * ```\n * withContext(Dispatchers.Default) {\n * flow\n * .map { value -> println(\"Doing map in IO\"); value }\n * .flowOn(Dispatchers.IO) // Works upstream, doesn't change downstream\n * .collect { value ->\n * println(\"Processing $value in computation\")\n * }\n * }\n * ```\n * Opposed to subscribeOn, it it **possible** to use multiple `flowOn` operators in the one flow\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . onErrorResume ( fallback : Flow < T > ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `onErrorXxx` is [catch].\n * Use `catch { emitAll(fallback) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . onErrorResumeNext ( fallback : Flow < T > ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `onErrorXxx` is [catch].\n * Use `catch { emitAll(fallback) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR ) public fun < T > Flow < T > . subscribe ( ) : Unit","body":"= noImpl ( )","docstring":"/**\n * `subscribe` is Rx-specific API that has no direct match in flows.\n * One can use [launchIn] instead, for example the following:\n * ```\n * flowable\n * .observeOn(Schedulers.io())\n * .subscribe({ println(\"Received $it\") }, { println(\"Exception $it happened\") }, { println(\"Flowable is completed successfully\") }\n * ```\n *\n * has the following Flow equivalent:\n * ```\n * flow\n * .onEach { value -> println(\"Received $value\") }\n * .onCompletion { cause -> if (cause == null) println(\"Flow is completed successfully\") }\n * .catch { cause -> println(\"Exception $cause happened\") }\n * .flowOn(Dispatchers.IO)\n * .launchIn(myScope)\n * ```\n *\n * Note that resulting value of [launchIn] is not used because the provided scope takes care of cancellation.\n *\n * Or terminal operators like [single] can be used from suspend functions.\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR ) public fun < T > Flow < T > . subscribe ( onEach : suspend ( T ) -> Unit ) : Unit","body":"= noImpl ( )","docstring":"/**\n * Use [launchIn] with [onEach], [onCompletion] and [catch] operators instead.\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR ) public fun < T > Flow < T > . subscribe ( onEach : suspend ( T ) -> Unit , onError : suspend ( Throwable ) -> Unit ) : Unit","body":"= noImpl ( )","docstring":"/**\n * Use [launchIn] with [onEach], [onCompletion] and [catch] operators instead.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T , R > Flow < T > . flatMap ( mapper : suspend ( T ) -> Flow < R > ) : Flow < R >","body":"= noImpl ( )","docstring":"/**\n * Note that this replacement is sequential (`concat`) by default.\n * For concurrent flatMap [flatMapMerge] can be used instead.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T , R > Flow < T > . concatMap ( mapper : ( T ) -> Flow < R > ) : Flow < R >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `concatMap` is [flatMapConcat].\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < Flow < T > > . merge ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Note that this replacement is sequential (`concat`) by default.\n * For concurrent flatMap [flattenMerge] can be used instead.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < Flow < T > > . flatten ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `flatten` is [flattenConcat].\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T , R > Flow < T > . compose ( transformer : Flow < T > . ( ) -> Flow < R > ) : Flow < R >","body":"= noImpl ( )","docstring":"/**\n * Kotlin has a built-in generic mechanism for making chained calls.\n * If you wish to write something like\n * ```\n * myFlow.compose(MyFlowExtensions.ignoreErrors()).collect { ... }\n * ```\n * you can replace it with\n *\n * ```\n * myFlow.let(MyFlowExtensions.ignoreErrors()).collect { ... }\n * ```\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . skip ( count : Int ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `skip` is [drop].\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . forEach ( action : suspend ( value : T ) -> Unit ) : Unit","body":"= noImpl ( )","docstring":"/**\n * Flow extension to iterate over elements is [collect].\n * Foreach wasn't introduced deliberately to avoid confusion.\n * Flow is not a collection, iteration over it may be not idempotent\n * and can *launch* computations with side-effects.\n * This behaviour is not reflected in [forEach] name.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T , R > Flow < T > . scanFold ( initial : R , @ BuilderInference operation : suspend ( accumulator : R , value : T ) -> R ) : Flow < R >","body":"= noImpl ( )","docstring":"/**\n * Flow has less verbose [scan] shortcut.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . onErrorReturn ( fallback : T ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `onErrorXxx` is [catch].\n * Use `catch { emit(fallback) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . onErrorReturn ( fallback : T , predicate : ( Throwable ) -> Boolean = { true } ) : Flow < T >","body":"= catch { e -> if ( ! predicate ( e ) ) throw e emit ( fallback ) }","docstring":"/**\n * Flow analogue of `onErrorXxx` is [catch].\n * Use `catch { e -> if (predicate(e)) emit(fallback) else throw e }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . startWith ( value : T ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `startWith` is [onStart].\n * Use `onStart { emit(value) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . startWith ( other : Flow < T > ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `startWith` is [onStart].\n * Use `onStart { emitAll(other) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . concatWith ( value : T ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `concatWith` is [onCompletion].\n * Use `onCompletion { emit(value) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . concatWith ( other : Flow < T > ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Flow analogue of `concatWith` is [onCompletion].\n * Use `onCompletion { if (it == null) emitAll(other) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T1 , T2 , R > Flow < T1 > . combineLatest ( other : Flow < T2 > , transform : suspend ( T1 , T2 ) -> R ) : Flow < R >","body":"= combine ( this , other , transform )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T1 , T2 , T3 , R > Flow < T1 > . combineLatest ( other : Flow < T2 > , other2 : Flow < T3 > , transform : suspend ( T1 , T2 , T3 ) -> R )","body":"= combine ( this , other , other2 , transform )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T1 , T2 , T3 , T4 , R > Flow < T1 > . combineLatest ( other : Flow < T2 > , other2 : Flow < T3 > , other3 : Flow < T4 > , transform : suspend ( T1 , T2 , T3 , T4 ) -> R )","body":"= combine ( this , other , other2 , other3 , transform )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T1 , T2 , T3 , T4 , T5 , R > Flow < T1 > . combineLatest ( other : Flow < T2 > , other2 : Flow < T3 > , other3 : Flow < T4 > , other4 : Flow < T5 > , transform : suspend ( T1 , T2 , T3 , T4 , T5 ) -> R ) : Flow < R >","body":"= combine ( this , other , other2 , other3 , other4 , transform )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . delayFlow ( timeMillis : Long ) : Flow < T >","body":"= onStart { delay ( timeMillis ) }","docstring":"/**\n * Delays the emission of values from this flow for the given [timeMillis].\n * Use `onStart { delay(timeMillis) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . delayEach ( timeMillis : Long ) : Flow < T >","body":"= onEach { delay ( timeMillis ) }","docstring":"/**\n * Delays each element emitted by the given flow for the given [timeMillis].\n * Use `onEach { delay(timeMillis) }`.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T , R > Flow < T > . switchMap ( transform : suspend ( value : T ) -> Flow < R > ) : Flow < R >","body":"= flatMapLatest ( transform )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . scanReduce ( operation : suspend ( accumulator : T , value : T ) -> T ) : Flow < T >","body":"= runningReduce ( operation )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" + \"\" + \"\" + \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . publish ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" + \"\" + \"\" + \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . publish ( bufferSize : Int ) : Flow < T >","body":"= noImpl ( )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" + \"\" + \"\" + \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . replay ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" + \"\" + \"\" + \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . replay ( bufferSize : Int ) : Flow < T >","body":"= noImpl ( )","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > Flow < T > . cache ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/** @suppress */"} {"signature":"@ Composable fun VerticalGrid ( modifier : Modifier = Modifier , columns : Int = , content : @ Composable ( ) -> Unit )","body":"{ Layout ( content = content , modifier = modifier ) { measurables , constraints -> val itemWidth = constraints . maxWidth / columns val itemConstraints = constraints . copy ( minWidth = itemWidth , maxWidth = itemWidth ) val placeables = measurables . map { it . measure ( itemConstraints ) } val columnHeights = Array ( columns ) { } placeables . forEachIndexed { index , placeable -> val column = index % columns columnHeights [ column ] += placeable . height } val height = ( columnHeights . maxOrNull ( ) ? : constraints . minHeight ) . coerceAtMost ( constraints . maxHeight ) layout ( width = constraints . maxWidth , height = height ) { val columnY = Array ( columns ) { } placeables . forEachIndexed { index , placeable -> val column = index % columns placeable . placeRelative ( x = column * itemWidth , y = columnY [ column ] ) columnY [ column ] += placeable . height } } } }","docstring":"/**\n * A simple grid which lays elements out vertically in evenly sized [columns].\n */"} {"signature":"public inline operator fun < reified T > String . invoke ( ) : ColumnAccessor < T >","body":"= column ( this )","docstring":"/**\n * Returns a new typed [ColumnReference] to the column with the receiver [String] as a name and given type.\n * The pointer name and type must be exactly the same as the name and type of the\n * column in the [DataFrame].\n *\n * @param T type of the column\n * @receiver name of the column\n */"} {"signature":"@ Test fun testDelayInArbitraryContext ( )","body":"= runBlocking { var thread : Thread ? = null val pool = Executors . newFixedThreadPool ( ) { runnable -> Thread ( runnable ) . also { thread = it } } val context = CustomInterceptor ( pool ) val c = async ( context ) { assertEquals ( thread , Thread . currentThread ( ) ) delay ( ) assertEquals ( thread , Thread . currentThread ( ) ) } assertEquals ( , c . await ( ) ) pool . shutdown ( ) }","docstring":"/**\n * Test that delay works properly in contexts with custom [ContinuationInterceptor]\n */"} {"signature":"internal fun KtAnalysisSession . getDRIFromReceiverParameter ( receiverParameterSymbol : KtReceiverParameterSymbol ) : DRI","body":"= getDRIFromReceiverType ( receiverParameterSymbol . type )","docstring":"/**\n * @return [DRI] to receiver type\n */"} {"signature":"private fun KtAnalysisSession . getDRIFromLocalFunction ( symbol : KtFunctionLikeSymbol ) : DRI","body":"{ val containingSymbolDRI = symbol . getContainingSymbol ( ) ? . let { getDRIFromNonCallablePossibleLocalSymbol ( it ) } ? : throw IllegalStateException ( \"\" ) return containingSymbolDRI . copy ( callable = Callable ( ( symbol as? KtNamedSymbol ) ? . name ? . asString ( ) ? : \"\" , params = symbol . valueParameters . map { getTypeReferenceFrom ( it . returnType ) } , receiver = symbol . receiverType ? . let { getTypeReferenceFrom ( it ) } ) ) }","docstring":"/**\n * Currently, it's used only for functions from enum entry,\n * For its members: `memberSymbol.callableIdIfNonLocal=null`\n */"} {"signature":"@ OptIn ( UnsafeApi :: class ) operator fun < T > KotlinGradlePluginExtensionPoint < T > . set ( project : Project , extensions : List < T > )","body":"{ ( this as KotlinGradlePluginExtensionPointInternal < T > ) set ( project , extensions ) }","docstring":"/**\n * Completely overwrites the currently registered extensions on this [KotlinGradlePluginExtensionPoint] in this project.\n */"} {"signature":"fun IrSimpleType . argumentTypesOrUpperBounds ( ) : List < IrType >","body":"{ val params = this . classOrUpperBound ( ) ! ! . owner . typeParameters return arguments . mapIndexed { index , argument -> argument . typeOrNull ? : params [ index ] . representativeUpperBound } }","docstring":"/**\n * Replaces star projections with representativeUpperBound of respective type parameter\n * to mimic behaviour of old FE (see StarProjectionImpl.getType())\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ LowPriorityInOverloadResolution public fun < T : Any > KClass < T > . cast ( value : Any ? ) : T","body":"{ if ( ! isInstance ( value ) ) throw ClassCastException ( \"\" ) return value as T }","docstring":"/**\n * Casts the given [value] to the class represented by this [KClass] object.\n * Throws an exception if the value is `null` or if it is not an instance of this class.\n *\n * This is an experimental function that behaves as a similar function from kotlin.reflect.full on JVM.\n *\n * @see [KClass.isInstance]\n * @see [KClass.safeCast]\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ LowPriorityInOverloadResolution public fun < T : Any > KClass < T > . safeCast ( value : Any ? ) : T ?","body":"{ return if ( isInstance ( value ) ) value as T else null }","docstring":"/**\n * Casts the given [value] to the class represented by this [KClass] object.\n * Returns `null` if the value is `null` or if it is not an instance of this class.\n *\n * This is an experimental function that behaves as a similar function from kotlin.reflect.full on JVM.\n *\n * @see [KClass.isInstance]\n * @see [KClass.cast]\n */"} {"signature":"public fun run ( session : Session )","body":"{ session . runner ( ) . addTarget ( assign ) . run ( ) }","docstring":"/**\n * Initialize the variable using the default initializer\n * @param [session] session to use\n */"} {"signature":"public fun fill ( data : Any , session : Session )","body":"{ var tensorData = data if ( data is Array < * > && data . isArrayOf < Float > ( ) ) { tensorData = ( data as Array < Float > ) . toFloatArray ( ) } Tensor . create ( tensorData ) . use { tensor -> session . runner ( ) . feed ( initialValue , tensor ) . addTarget ( assign ) . run ( ) } }","docstring":"/**\n * Fill the variable using the given data\n * @param [data] data to use, should have correct shape and type\n * @param [session] session to use\n */"} {"signature":"private fun initializeRepo ( )","body":"{ val uri = uri . get ( ) val commitId = commitId . get ( ) val gitRepoInitialized = RepositoryCache . FileKey . isGitRepository ( localRepoDir , FS . DETECTED ) val repo = if ( gitRepoInitialized ) { Git . open ( localRepoDir ) } else { fs . delete { delete ( localRepoDir ) } Git . cloneRepository ( ) . setProgressMonitor ( gitOperationsPrinter ) . setNoCheckout ( true ) . setURI ( uri ) . setDirectory ( localRepoDir ) . call ( ) } repo . use { git -> git . checkout ( ) . setProgressMonitor ( gitOperationsPrinter ) . setForced ( true ) . setName ( commitId ) . call ( ) git . reset ( ) . setProgressMonitor ( gitOperationsPrinter ) . setMode ( HARD ) . call ( ) git . clean ( ) . setForce ( true ) . setCleanDirectories ( true ) . setIgnore ( false ) . call ( ) } }","docstring":"/**\n * Initialize [uri] in [localRepoDir].\n *\n * If a git repo already exists in [localRepoDir], try to re-use it.\n *\n * Any changes to tracked or untracked files will be forcibly removed.\n */"} {"signature":"fun StubContainer . computeNamesToBeDeclared ( pkgName : String ) : List < String >","body":"{ fun checkPackageCorrectness ( classifier : Classifier ) { assert ( classifier . pkg == pkgName ) { \"\"\"\"\"\" . trimMargin ( ) } } val classNames = classes . mapNotNull { when ( it ) { is ClassStub . Simple -> it . classifier is ClassStub . Companion -> null is ClassStub . Enum -> it . classifier } } . onEach { checkPackageCorrectness ( it ) } . map { it . topLevelName } val typealiasNames = typealiases . onEach { checkPackageCorrectness ( it . alias ) } . map { it . alias . topLevelName } val namesFromNestedContainers = simpleContainers . flatMap { it . computeNamesToBeDeclared ( pkgName ) } return classNames + typealiasNames + namesFromNestedContainers }","docstring":"/**\n * Compute which names will be declared by [StubContainer] in the given [pkgName]\n */"} {"signature":"fun File . deleteDirectoryContents ( )","body":"{ when { isDirectory -> listFiles ( ) ! ! . forEach { it . deleteRecursivelyOrThrow ( ) } isFile -> error ( \"\" ) else -> error ( \"\" ) } }","docstring":"/**\n * Deletes the contents of this directory (not the directory itself).\n *\n * If the directory does not exist or if this is a regular file, this method will throw an exception.\n */"} {"signature":"fun File . deleteRecursivelyOrThrow ( )","body":"{ if ( ! deleteRecursively ( ) ) { throw IOException ( \"\" ) } }","docstring":"/** Deletes this file or directory recursively (if it exists), throwing an exception if the deletion failed. */"} {"signature":"@ Suppress ( \"\" ) fun File . createDirectory ( )","body":"{ when { isDirectory -> Unit isFile -> error ( \"\" ) else -> { if ( ! mkdirs ( ) && ! isDirectory ) { throw IOException ( \"\" ) } } } }","docstring":"/**\n * Creates this directory (if it does not yet exist).\n *\n * If a regular file already exists at this path, this method will throw an exception.\n */"} {"signature":"private fun clearGroupedConstraintCaches ( )","body":"{ constraintsGroupedByContainedTypeVariables = null constraintsGroupedByTypeHashCode = null }","docstring":"/**\n * Every part that modifies [constraints] should either maintain the consistences of the grouped caches above\n * or call this function.\n */"} {"signature":"fun source ( vararg sources : Any )","body":"fun source ( vararg sources : Any )","docstring":"/**\n * Adds input sources for this task.\n *\n * @param sources object is evaluated as per [org.gradle.api.Project.files].\n */"} {"signature":"fun setSource ( vararg sources : Any )","body":"fun setSource ( vararg sources : Any )","docstring":"/**\n * Sets input sources for this task.\n *\n * **Note**: due to [a bug](https://youtrack.jetbrains.com/issue/KT-59632/KotlinCompileTool.setSource-should-replace-existing-sources),\n * the `setSource()` function does not update already added sources.\n *\n * @param sources object is evaluated as per [org.gradle.api.Project.files].\n */"} {"signature":"@ Internal override fun getExcludes ( ) : MutableSet < String >","body":"@ Internal override fun getExcludes ( ) : MutableSet < String >","docstring":"/**\n * Returns the set of exclude patterns.\n *\n * @return The exclude patterns. Returns an empty set when there are no exclude patterns.\n */"} {"signature":"@ Internal override fun getIncludes ( ) : MutableSet < String >","body":"@ Internal override fun getIncludes ( ) : MutableSet < String >","docstring":"/**\n * Returns the set of include patterns.\n *\n * @return The include patterns. Returns an empty set when there are no include patterns.\n */"} {"signature":"protected open fun resolveAllSupertypesForOuterClass ( outerClass : FirClass )","body":"{ resolveAllSupertypes ( outerClass , outerClass . superTypeRefs ) }","docstring":"/**\n * Resolve all super types. [outerClass] is used as an outer scope for nested class or companion\n */"} {"signature":"fun resolveSpecificClassLikeSupertypes ( classLikeDeclaration : FirClassLikeDeclaration , supertypeRefs : List < FirTypeRef > , ) : List < FirResolvedTypeRef >","body":"{ return resolveSpecificClassLikeSupertypes ( classLikeDeclaration ) { transformer , scopeDeclaration -> supertypeRefs . mapTo ( mutableListOf ( ) ) { val superTypeRef = it . transform < FirTypeRef , ScopeClassDeclaration > ( transformer , scopeDeclaration ) val typeParameterType = superTypeRef . coneTypeSafe < ConeTypeParameterType > ( ) when { typeParameterType != null -> buildErrorTypeRef { source = superTypeRef . source diagnostic = ConeTypeParameterSupertype ( typeParameterType . lookupTag . typeParameterSymbol ) } superTypeRef !is FirResolvedTypeRef -> createErrorTypeRef ( superTypeRef , \"\" , DiagnosticKind . UnresolvedSupertype ) else -> superTypeRef } } . also { addSupertypesFromExtensions ( classLikeDeclaration , it , transformer , scopeDeclaration ) } } }","docstring":"/**\n * The function won't call supertypeRefs on classLikeDeclaration directly\n */"} {"signature":"protected open fun reportLoopErrorRefs ( classLikeDeclaration : FirClassLikeDeclaration , supertypeRefs : List < FirResolvedTypeRef > )","body":"{ supertypeStatusMap [ classLikeDeclaration ] = SupertypeComputationStatus . Computed ( supertypeRefs ) }","docstring":"/**\n * @param supertypeRefs a collection where at least one element is [FirErrorTypeRef] for looped references\n */"} {"signature":"protected fun breakLoopFor ( declaration : FirClassLikeDeclaration , session : FirSession , visited : MutableSet < FirClassLikeDeclaration > , looped : MutableSet < FirClassLikeDeclaration > , pathSet : MutableSet < FirClassLikeDeclaration > , path : MutableList < FirClassLikeDeclaration > , )","body":"{ require ( path . isEmpty ( ) ) { \"\" } require ( pathSet . isEmpty ( ) ) { \"\" } fun checkIsInLoop ( classLikeDeclaration : FirClassLikeDeclaration ? , wasSubtypingInvolved : Boolean , wereTypeArgumentsInvolved : Boolean , ) { if ( classLikeDeclaration == null ) return require ( ! wasSubtypingInvolved || ! wereTypeArgumentsInvolved ) { \"\" } val supertypeStatus = supertypeStatusMap [ classLikeDeclaration ] val supertypeRefs : List < FirResolvedTypeRef > = if ( supertypeStatus != null ) { require ( supertypeStatus is SupertypeComputationStatus . Computed ) { \"\" } supertypeStatus . supertypeRefs } else { getResolvedSuperTypeRefsForOutOfSessionDeclaration ( classLikeDeclaration ) ? : return } if ( classLikeDeclaration in visited ) { if ( classLikeDeclaration in pathSet ) { looped . add ( classLikeDeclaration ) looped . addAll ( path . takeLastWhile { element -> element != classLikeDeclaration } ) } return } path . add ( classLikeDeclaration ) pathSet . add ( classLikeDeclaration ) visited . add ( classLikeDeclaration ) val parentId = classLikeDeclaration . symbol . classId . relativeClassName . parent ( ) if ( ! parentId . isRoot ) { val parentSymbol = session . symbolProvider . getClassLikeSymbolByClassId ( ClassId . fromString ( parentId . asString ( ) ) ) if ( parentSymbol is FirRegularClassSymbol ) { checkIsInLoop ( parentSymbol . fir , wasSubtypingInvolved , wereTypeArgumentsInvolved ) } } val isTypeAlias = classLikeDeclaration is FirTypeAlias val isSubtypingCurrentlyInvolved = ! isTypeAlias if ( wereTypeArgumentsInvolved && isSubtypingCurrentlyInvolved ) { path . removeAt ( path . size - ) pathSet . remove ( classLikeDeclaration ) return } val isSubtypingInvolved = wasSubtypingInvolved || isSubtypingCurrentlyInvolved var isErrorInSupertypesFound = false val resultSupertypeRefs = mutableListOf < FirResolvedTypeRef > ( ) for ( supertypeRef in supertypeRefs ) { if ( isTypeAlias ) { for ( annotation in supertypeRef . annotations ) { val resolvedType = annotation . resolvedType as? ConeClassLikeType ? : continue val typeArgumentClassLikeDeclaration = resolvedType . lookupTag . toSymbol ( session ) ? . fir checkIsInLoop ( typeArgumentClassLikeDeclaration , wasSubtypingInvolved , wereTypeArgumentsInvolved ) } } val supertypeFir = supertypeRef . firClassLike ( session ) ? : supertypeRef . firClassLike ( classLikeDeclaration . moduleData . session ) checkIsInLoop ( supertypeFir , isSubtypingInvolved , wereTypeArgumentsInvolved ) if ( ! isSubtypingInvolved ) { val areTypeArgumentsCurrentlyInvolved = true fun checkTypeArgumentsRecursively ( type : ConeKotlinType , visitedTypes : MutableSet < ConeKotlinType > ) { if ( type in visitedTypes ) return visitedTypes += type for ( typeArgument in type . typeArguments ) { if ( typeArgument is ConeClassLikeType ) { checkIsInLoop ( typeArgument . lookupTag . toSymbol ( session ) ? . fir , wasSubtypingInvolved , areTypeArgumentsCurrentlyInvolved , ) checkTypeArgumentsRecursively ( typeArgument , visitedTypes ) } } } checkTypeArgumentsRecursively ( supertypeRef . type , mutableSetOf ( ) ) } resultSupertypeRefs . add ( if ( classLikeDeclaration in looped ) { isErrorInSupertypesFound = true createErrorTypeRef ( supertypeRef , \"\" , if ( isTypeAlias ) DiagnosticKind . RecursiveTypealiasExpansion else DiagnosticKind . LoopInSupertype ) } else { supertypeRef } ) } if ( isErrorInSupertypesFound ) { reportLoopErrorRefs ( classLikeDeclaration , resultSupertypeRefs ) } path . removeAt ( path . size - ) pathSet . remove ( classLikeDeclaration ) } checkIsInLoop ( declaration , wasSubtypingInvolved = false , wereTypeArgumentsInvolved = false ) require ( path . isEmpty ( ) ) { \"\" } }","docstring":"/**\n * @param declaration declaration to be checked for loops\n * @param visited visited declarations during the current loop search\n * @param looped declarations inside loop\n */"} {"signature":"fun js ( )","body":"{ }","docstring":"/**\n * Function declares in JS source set\n */"} {"signature":"fun shared ( )","body":"{ }","docstring":"/**\n * Function declared in JS source set.\n *\n * Function with the same name exists in another source set as well.\n */"} {"signature":"fun String . myExtension ( )","body":"= println ( \"\" )","docstring":"/**\n * Extension declared in JS source set\n */"} {"signature":"fun buildCompileList ( source : Path , outputDirectory : String , defaultModule : TestModule = TestModule . default ( ) ) : List < TestFile >","body":"{ val result = mutableListOf < TestFile > ( ) val srcFile = source . toFile ( ) val srcText = srcFile . readText ( ) . replace ( Regex ( \"\" ) ) { match -> match . groupValues [ ] } var supportModule : TestModule ? = if ( srcText . contains ( \"\" ) ) TestModule . support ( ) else null val moduleMatcher = MODULE_PATTERN . matcher ( srcText ) val fileMatcher = FILE_PATTERN . matcher ( srcText ) var nextModuleExists = moduleMatcher . find ( ) var nextFileExists = fileMatcher . find ( ) if ( ! nextModuleExists && ! nextFileExists ) { if ( supportModule != null ) defaultModule . dependencies . add ( supportModule . name ) result . add ( TestFile ( srcFile . name , \"\" , srcText , defaultModule ) ) } else { var processedChars = var module : TestModule = defaultModule while ( nextModuleExists || nextFileExists ) { if ( nextModuleExists ) { var moduleName = moduleMatcher . group ( ) val moduleDependencies = moduleMatcher . group ( ) val moduleFriends = moduleMatcher . group ( ) if ( moduleName != null ) { moduleName = moduleName . trim { it <= '' } val dependencies = mutableListOf < String > ( ) . apply { addAll ( moduleDependencies . parseModuleList ( ) . map { if ( it != \"\" ) \"\" else it } ) } module = TestModule ( \"\" , dependencies , mutableListOf < String > ( ) . apply { addAll ( moduleFriends . parseModuleList ( ) . map { \"\" } ) } ) } } if ( supportModule != null && ! module . dependencies . contains ( \"\" ) ) { module . dependencies . add ( \"\" ) } nextModuleExists = moduleMatcher . find ( ) while ( nextFileExists ) { val fileName = fileMatcher . group ( ) val filePath = \"\" val start = processedChars nextFileExists = fileMatcher . find ( ) val end = when { nextFileExists && nextModuleExists -> Math . min ( fileMatcher . start ( ) , moduleMatcher . start ( ) ) nextFileExists -> fileMatcher . start ( ) else -> srcText . length } val fileText = srcText . substring ( start , end ) processedChars = end if ( fileName . endsWith ( \"\" ) ) { result . add ( TestFile ( fileName , filePath , fileText , module ) ) } if ( nextModuleExists && nextFileExists && fileMatcher . start ( ) > moduleMatcher . start ( ) ) break } } } return result }","docstring":"/**\n * Creates test files from the given source file that may contain different test directives.\n *\n * @return list of test files [TestFile] to be compiled\n */"} {"signature":"fun writeTextToFile ( )","body":"{ Paths . get ( path ) . takeUnless { text . isEmpty ( ) } ? . run { parent . toFile ( ) . takeUnless { it . exists ( ) } ? . mkdirs ( ) toFile ( ) . writeText ( text ) } }","docstring":"/**\n * Writes [text] to the file created from the [path].\n */"} {"signature":"@ Suppress ( \"\" ) fun pathToPlatformSdk ( platformName : String ) : String","body":"= when ( platformName . toLowerCase ( ) ) { \"\" -> macosxSdk \"\" -> iphoneosSdk \"\" -> iphonesimulatorSdk \"\" -> appletvosSdk \"\" -> appletvsimulatorSdk \"\" -> watchosSdk \"\" -> watchsimulatorSdk else -> error ( \"\" ) }","docstring":"/**\n * TODO: `toLowerCase` is deprecated and should be replaced with `lowercase`, but\n * this code used in buildSrc which depends on bootstrap version of stdlib, so right version\n * of this function isn't available, please replace warning suppression with right function\n * when compatible version of bootstrap will be available.\n */"} {"signature":"fun g ( )","body":"{ }","docstring":"/**\n * [X.YY.aa]\n */"} {"signature":"fun getFunctionKindPackageNames ( ) : Set < FqName >","body":"= extractor . getFunctionKindPackageNames ( )","docstring":"/**\n * Returns all package names for which [getKindByClassNamePrefix] may return a [FunctionTypeKind].\n */"} {"signature":"fun hasExtensionKinds ( ) : Boolean","body":"= extractor . hasExtensionKinds ( )","docstring":"/**\n * Whether [getKindByClassNamePrefix] may return a [FunctionTypeKind] added by a compiler plugin.\n */"} {"signature":"public fun getClasslike ( dri : DRI , sourceSet : DokkaSourceSet ) : DClasslike ?","body":"public fun getClasslike ( dri : DRI , sourceSet : DokkaSourceSet ) : DClasslike ?","docstring":"/**\n * Returns a valid and fully initialized [DClasslike] if the [dri] points to a class-like\n * declaration (annotation, class, enum, interface, object) that can be found among\n * [DokkaSourceSet.classpath] entries.\n *\n * If the [dri] points to a non-class-like declaration (like a function),\n * or the declaration cannot be found, it returns `null`.\n *\n * Note: the implementation is not expected to cache results or return pre-computed values, so\n * it may need to analyze parts of the project and instantiate new documentables on every invocation.\n * Use this function sparingly, and cache results on your side if you need to.\n */"} {"signature":"internal fun TaskCollection < Test > . instrument ( koverContext : KoverContext , koverDisabled : Provider < Boolean > , current : KoverCurrentProjectVariantsConfigImpl )","body":"{ configureEach { val binReportProvider = project . layout . buildDirectory . map { dir -> dir . file ( binReportPath ( name , koverContext . toolProvider . get ( ) . variant . vendor ) ) } dependsOn ( koverContext . findAgentJarTask ) doFirst { binReportProvider . get ( ) . asFile . delete ( ) } val excludedClassesWithAndroid = current . instrumentation . excludedClasses . map { it + setOf ( \"\" , \"\" , \"\" ) } val taskInstrumentationDisabled = koverDisabled . map { if ( it ) return@map true if ( current . instrumentation . disabledForAll . get ( ) ) return@map true if ( name in current . instrumentation . disabledForTestTasks . get ( ) ) return@map true return@map false } jvmArgumentProviders += JvmTestTaskArgumentProvider ( temporaryDir , koverContext . toolProvider , koverContext . findAgentJarTask . map { it . agentJar . get ( ) . asFile } , taskInstrumentationDisabled , excludedClassesWithAndroid , binReportProvider ) } }","docstring":"/**\n * Add online instrumentation to all JVM test tasks.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public fun < T > sequence ( @ BuilderInference block : suspend SequenceScope < T > . ( ) -> Unit ) : Sequence < T >","body":"= Sequence { iterator ( block ) }","docstring":"/**\n * Builds a [Sequence] lazily yielding values one by one.\n *\n * @see kotlin.sequences.generateSequence\n *\n * @sample samples.collections.Sequences.Building.buildSequenceYieldAll\n * @sample samples.collections.Sequences.Building.buildFibonacciSequence\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public fun < T > iterator ( @ BuilderInference block : suspend SequenceScope < T > . ( ) -> Unit ) : Iterator < T >","body":"{ val iterator = SequenceBuilderIterator < T > ( ) iterator . nextStep = block . createCoroutineUnintercepted ( receiver = iterator , completion = iterator ) return iterator }","docstring":"/**\n * Builds an [Iterator] lazily yielding values one by one.\n *\n * @sample samples.collections.Sequences.Building.buildIterator\n * @sample samples.collections.Iterables.Building.iterable\n */"} {"signature":"public abstract suspend fun yield ( value : T )","body":"public abstract suspend fun yield ( value : T )","docstring":"/**\n * Yields a value to the [Iterator] being built and suspends\n * until the next value is requested.\n *\n * @sample samples.collections.Sequences.Building.buildSequenceYieldAll\n * @sample samples.collections.Sequences.Building.buildFibonacciSequence\n */"} {"signature":"public abstract suspend fun yieldAll ( iterator : Iterator < T > )","body":"public abstract suspend fun yieldAll ( iterator : Iterator < T > )","docstring":"/**\n * Yields all values from the `iterator` to the [Iterator] being built\n * and suspends until all these values are iterated and the next one is requested.\n *\n * The sequence of values returned by the given iterator can be potentially infinite.\n *\n * @sample samples.collections.Sequences.Building.buildSequenceYieldAll\n */"} {"signature":"public suspend fun yieldAll ( elements : Iterable < T > )","body":"{ if ( elements is Collection && elements . isEmpty ( ) ) return return yieldAll ( elements . iterator ( ) ) }","docstring":"/**\n * Yields a collections of values to the [Iterator] being built\n * and suspends until all these values are iterated and the next one is requested.\n *\n * @sample samples.collections.Sequences.Building.buildSequenceYieldAll\n */"} {"signature":"public suspend fun yieldAll ( sequence : Sequence < T > ) : Unit","body":"= yieldAll ( sequence . iterator ( ) )","docstring":"/**\n * Yields potentially infinite sequence of values to the [Iterator] being built\n * and suspends until all these values are iterated and the next one is requested.\n *\n * The sequence can be potentially infinite.\n *\n * @sample samples.collections.Sequences.Building.buildSequenceYieldAll\n */"} {"signature":"public fun labels ( zeroIndexed : Boolean = false ) : Map < Int , String >","body":"{ return when ( this ) { V2014 -> if ( zeroIndexed ) toZeroIndexed ( cocoCategories2014 ) else cocoCategories2014 V2017 -> if ( zeroIndexed ) toZeroIndexed ( cocoCategories2017 ) else cocoCategories2017 } }","docstring":"/**\n * Returns a map of COCO labels according to the [Coco] version.\n * @param [zeroIndexed] if true, then labels are indexed from 0, otherwise from 1.\n */"} {"signature":"private fun getCallExpressionTypeInfoWithoutFinalTypeCheck ( callExpression : KtCallExpression , receiver : Receiver ? , callOperationNode : ASTNode ? , context : ExpressionTypingContext , initialDataFlowInfoForArguments : DataFlowInfo ) : KotlinTypeInfo","body":"{ val call = CallMaker . makeCall ( receiver , callOperationNode , callExpression ) val temporaryForFunction = TemporaryTraceAndCache . create ( context , \"\" , callExpression ) val ( resolveResult , resolvedCall ) = getResolvedCallForFunction ( call , context . replaceTraceAndCache ( temporaryForFunction ) , CheckArgumentTypesMode . CHECK_VALUE_ARGUMENTS , initialDataFlowInfoForArguments ) if ( resolveResult ) { val functionDescriptor = resolvedCall ? . resultingDescriptor temporaryForFunction . commit ( ) if ( callExpression . valueArgumentList == null && callExpression . lambdaArguments . isEmpty ( ) ) { val hasValueParameters = functionDescriptor == null || functionDescriptor . valueParameters . size > context . trace . report ( FUNCTION_CALL_EXPECTED . on ( callExpression , callExpression , hasValueParameters ) ) } if ( functionDescriptor == null ) { return noTypeInfo ( context ) } if ( functionDescriptor is ConstructorDescriptor ) { val constructedClass = functionDescriptor . constructedClass if ( DescriptorUtils . isAnnotationClass ( constructedClass ) && ! canInstantiateAnnotationClass ( callExpression , context . trace ) ) { val supported = context . languageVersionSettings . supportsFeature ( LanguageFeature . InstantiationOfAnnotationClasses ) if ( ! supported ) context . trace . report ( ANNOTATION_CLASS_CONSTRUCTOR_CALL . on ( callExpression ) ) } if ( DescriptorUtils . isEnumClass ( constructedClass ) ) { context . trace . report ( ENUM_CLASS_CONSTRUCTOR_CALL . on ( callExpression ) ) } if ( DescriptorUtils . isSealedClass ( constructedClass ) ) { context . trace . report ( SEALED_CLASS_CONSTRUCTOR_CALL . on ( callExpression ) ) } } val type = functionDescriptor . returnType val arguments = callExpression . valueArguments val resultFlowInfo = resolvedCall . dataFlowInfoForArguments . resultInfo var jumpFlowInfo = resultFlowInfo var jumpOutPossible = false for ( argument in arguments ) { val argTypeInfo = context . trace . get ( BindingContext . EXPRESSION_TYPE_INFO , argument . getArgumentExpression ( ) ) if ( argTypeInfo != null && argTypeInfo . jumpOutPossible ) { jumpOutPossible = true jumpFlowInfo = argTypeInfo . jumpFlowInfo break } } return createTypeInfo ( type , resultFlowInfo , jumpOutPossible , jumpFlowInfo ) } val calleeExpression = callExpression . calleeExpression if ( calleeExpression is KtSimpleNameExpression && callExpression . typeArgumentList == null ) { val temporaryForVariable = TemporaryTraceAndCache . create ( context , \"\" , callExpression ) val ( notNothing , type ) = getVariableType ( calleeExpression , receiver , callOperationNode , context . replaceTraceAndCache ( temporaryForVariable ) ) val qualifier = temporaryForVariable . trace . get ( BindingContext . QUALIFIER , calleeExpression ) if ( notNothing && ( qualifier == null || qualifier !is PackageQualifier ) ) { callExpression . getResolvedCall ( temporaryForVariable . trace . bindingContext ) . let { ( it as? ResolvedCallImpl ) ? . addStatus ( ResolutionStatus . OTHER_ERROR ) } temporaryForVariable . commit ( ) context . trace . report ( FUNCTION_EXPECTED . on ( calleeExpression , calleeExpression , type ? : ErrorUtils . createErrorType ( ErrorTypeKind . ERROR_EXPECTED_TYPE ) ) ) argumentTypeResolver . analyzeArgumentsAndRecordTypes ( BasicCallResolutionContext . create ( context , call , CheckArgumentTypesMode . CHECK_VALUE_ARGUMENTS , DataFlowInfoForArgumentsImpl ( initialDataFlowInfoForArguments , call ) ) , ResolveArgumentsMode . RESOLVE_FUNCTION_ARGUMENTS ) return noTypeInfo ( context ) } } temporaryForFunction . commit ( ) return noTypeInfo ( context ) }","docstring":"/**\n * Visits a call expression and its arguments.\n * Determines the result type and data flow information after the call.\n */"} {"signature":"fun getQualifiedExpressionTypeInfo ( expression : KtQualifiedExpression , context : ExpressionTypingContext ) : KotlinTypeInfo","body":"{ val currentContext = context . replaceExpectedType ( NO_EXPECTED_TYPE ) . replaceContextDependency ( INDEPENDENT ) val trace = currentContext . trace val elementChain = expression . elementChain ( currentContext ) val firstReceiver = elementChain . first ( ) . receiver var receiverTypeInfo = when ( trace . get ( BindingContext . QUALIFIER , firstReceiver ) ) { null -> expressionTypingServices . getTypeInfo ( firstReceiver , currentContext ) else -> KotlinTypeInfo ( null , currentContext . dataFlowInfo ) } var resultTypeInfo = receiverTypeInfo var allUnsafe = true var branchPointDataFlowInfo = receiverTypeInfo . dataFlowInfo for ( element in elementChain ) { val receiverType = receiverTypeInfo . type ? : ErrorUtils . createErrorType ( ErrorTypeKind . ERROR_RECEIVER_TYPE , when ( val receiver = element . receiver ) { is KtNameReferenceExpression -> receiver . getReferencedName ( ) else -> receiver . text } ) val receiver = trace . get ( BindingContext . QUALIFIER , element . receiver ) ? : ExpressionReceiver . create ( element . receiver , receiverType , trace . bindingContext ) val qualifiedExpression = element . qualified val lastStage = qualifiedExpression === expression val contextForSelector = ( if ( lastStage ) context else currentContext ) . replaceDataFlowInfo ( if ( receiver is ReceiverValue && TypeUtils . isNullableType ( receiver . type ) && ! element . safe ) { branchPointDataFlowInfo } else { receiverTypeInfo . dataFlowInfo } ) val selectorTypeInfo = getSafeOrUnsafeSelectorTypeInfo ( receiver , element , contextForSelector ) allUnsafe = allUnsafe && ! element . safe if ( allUnsafe ) { branchPointDataFlowInfo = selectorTypeInfo . dataFlowInfo } resultTypeInfo = checkSelectorTypeInfo ( qualifiedExpression , selectorTypeInfo , contextForSelector ) . replaceDataFlowInfo ( branchPointDataFlowInfo ) if ( ! lastStage ) { recordResultTypeInfo ( qualifiedExpression , resultTypeInfo , contextForSelector ) } receiverTypeInfo = selectorTypeInfo } return resultTypeInfo }","docstring":"/**\n * Visits a qualified expression like x.y or x?.z controlling data flow information changes.\n\n * @return qualified expression type together with data flow information\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun < T > ObservableValue < T > . asFlow ( ) : Flow < T >","body":"= callbackFlow < T > { val listener = ChangeListener < T > { _ , _ , newValue -> trySend ( newValue ) } addListener ( listener ) send ( value ) awaitClose { removeListener ( listener ) } } . flowOn ( Dispatchers . JavaFx ) . conflate ( )","docstring":"/**\n * Creates an instance of a cold [Flow] that subscribes to the given [ObservableValue] and emits\n * its values as they change. The resulting flow is conflated, meaning that if several values arrive in quick\n * succession, only the last one will be emitted.\n * Since this implementation uses [ObservableValue.addListener], even if this [ObservableValue]\n * supports lazy evaluation, eager computation will be enforced while the flow is being collected.\n * All the calls to JavaFX API are performed in [Dispatchers.JavaFx].\n * This flow emits at least the initial value.\n *\n * ### Operator fusion\n *\n * Adjacent applications of [flowOn], [buffer], [conflate], and [produceIn] to the result of `asFlow` are fused.\n * [conflate] has no effect, as this flow is already conflated; one can use [buffer] to change that instead.\n */"} {"signature":"fun reportMetric ( name : String , value : String , subprojectName : String ? = null )","body":"fun reportMetric ( name : String , value : String , subprojectName : String ? = null )","docstring":"/**\n * Reports a metric by its name and optionally subproject.\n *\n * @param name the metric name\n * @param value the metric value.\n * @param subprojectName the subproject name for which the metric is being reported.\n */"} {"signature":"fun reportMetric ( name : String , value : Number , subprojectName : String ? = null )","body":"fun reportMetric ( name : String , value : Number , subprojectName : String ? = null )","docstring":"/**\n * @see org.jetbrains.kotlin.gradle.fus.GradleBuildFusStatisticsService.reportMetric(java.lang.String, java.lang.String, java.lang.String)\n */"} {"signature":"fun reportMetric ( name : String , value : Boolean , subprojectName : String ? = null )","body":"fun reportMetric ( name : String , value : Boolean , subprojectName : String ? = null )","docstring":"/**\n * @see org.jetbrains.kotlin.gradle.fus.GradleBuildFusStatisticsService.reportMetric(java.lang.String, java.lang.String, java.lang.String)\n */"} {"signature":"private inline fun solveLowerTriangleSystem ( sizeA : Int , sizeX : Int , action : ( Int , Int , Int ) -> Unit )","body":"{ for ( i in until sizeA ) { for ( k in i + until sizeA ) { for ( j in until sizeX ) { action ( i , k , j ) } } } }","docstring":"/**\n * Solve inplace lower triangle system\n * Solves ax=b equation where a lower triangular matrix with units on diagonal,\n * rewrite b with solution\n *\n * notice: intentionally there is no checks that a[i, i] == 1.0 and a[i, >i] == 0.0,\n * it is a contract of this method having no such checks\n *\n * lapack: dtrsm can do it (and have some extra options)\n */"} {"signature":"public fun < T > explode ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( EXPLODE , column . name ( ) , null ) }","docstring":"/**\n * Maps the `explode` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > explode ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( EXPLODE , column . name , null ) }","docstring":"/**\n * Maps the `explode` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun explode ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping < Any ? > ( EXPLODE , column , null ) }","docstring":"/**\n * Maps the `explode` aesthetic to a data column by [String].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > explode ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( EXPLODE , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `explode` aesthetic to iterable of values.\n *\n * @param values The iterable of values to be mapped.\n * @return A [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > explode ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( EXPLODE , values , null ) }","docstring":"/**\n * Maps the `explode` aesthetic to a data column.\n *\n * @param values the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public infix fun UByte . until ( to : UByte ) : UIntRange","body":"{ if ( to <= UByte . MIN_VALUE ) return UIntRange . EMPTY return this . toUInt ( ) .. ( to - ) . toUInt ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n *\n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"public infix fun UInt . until ( to : UInt ) : UIntRange","body":"{ if ( to <= UInt . MIN_VALUE ) return UIntRange . EMPTY return this .. ( to - ) . toUInt ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n *\n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"public infix fun ULong . until ( to : ULong ) : ULongRange","body":"{ if ( to <= ULong . MIN_VALUE ) return ULongRange . EMPTY return this .. ( to - ) . toULong ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n *\n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"public infix fun UShort . until ( to : UShort ) : UIntRange","body":"{ if ( to <= UShort . MIN_VALUE ) return UIntRange . EMPTY return this . toUInt ( ) .. ( to - ) . toUInt ( ) }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n *\n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"} {"signature":"private fun PsiInlineDocTag . toHtml ( javadocTag : JavadocTag ? ) : String ?","body":"= when ( this . name ) { \"\" , \"\" -> this . referenceElement ( ) ? . toDocumentationLinkString ( this . dataElements . filterIsInstance < PsiDocToken > ( ) . joinToString ( \"\" ) { it . stringifyElementAsText ( keepFormatting = false ) . orEmpty ( ) } ) \"\" -> \"\" \"\" -> \"\" \"\" -> \"\" \"\" -> { val inheritDocContent = inheritDocTagResolver . resolveContent ( commentResolutionContext ) val html = inheritDocContent ? . fold ( HtmlParsingResult ( javadocTag ) ) { result , content -> result + content . toInheritDocHtml ( result . newState , docTagParserContext ) } ? . parsedLine . orEmpty ( ) html } else -> this . text }","docstring":"/**\n * Inline tags can be met in the middle of some text. Example of an inline tag usage:\n *\n * ```java\n * Use the {@link #getComponentAt(int, int) getComponentAt} method.\n * ```\n */"} {"signature":"private fun PsiElement . shouldHaveSpaceAtTheEnd ( ) : Boolean","body":"{ val siblings = siblings ( withItself = false ) . toList ( ) . filterNot { it . text . trim ( ) == \"\" } val nextNotEmptySibling = ( siblings . firstOrNull ( ) as? PsiDocToken ) val furtherNotEmptySibling = ( siblings . drop ( ) . firstOrNull { it is PsiDocToken && ! it . isLeadingAsterisk ( ) } as? PsiDocToken ) val lastHtmlTag = text . trim ( ) . substringAfterLast ( \"\" ) val endsWithAnUnclosedTag = lastHtmlTag . endsWith ( \">\" ) && ! lastHtmlTag . startsWith ( \"\" ) return ( nextSibling as? PsiWhiteSpace ) ? . text ? . startsWith ( \"\" ) == true && ( getNextSiblingIgnoringWhitespace ( ) as? PsiDocToken ) ? . tokenType != JavaDocTokenTypes . INSTANCE . commentEnd ( ) && nextNotEmptySibling ? . isLeadingAsterisk ( ) == true && furtherNotEmptySibling ? . tokenType == JavaDocTokenTypes . INSTANCE . commentData ( ) && ! endsWithAnUnclosedTag }","docstring":"/**\n * We would like to know if we need to have a space after a this tag\n *\n * The space is required when:\n * - tag spans multiple lines, between every line we would need a space\n *\n * We wouldn't like to render a space if:\n * - tag is followed by an end of comment\n * - after a tag there is another tag (eg. multiple @author tags)\n * - they end with an html tag like: Something since then the space will be displayed in the following text\n * - next line starts with a

or 

 token\n */"}
{"signature":"internal fun Char . isWhitespaceImpl ( ) : Boolean","body":"{  val ch = this . code  return ch in  ..   || ch in  ..   || ch ==   || ch >  && ( ch ==  || ch in  ..  || ch ==  || ch ==  || ch ==  || ch ==  || ch ==  )  }","docstring":"/**\n * Returns `true` if this character is a whitespace.\n */"}
{"signature":"fun api ( sourceSetName : String , name : String , version : String ) : Unit","body":"= project  . kotlinExtension  . sourceSets  . getByName ( sourceSetName )  . dependencies { api ( mockedDependency ( name , version ) ) }","docstring":"/**\n * Declares an API dependency to test:[name]:[version] for [sourceSetName] source set\n */"}
{"signature":"fun assertSourceSetDependenciesResolution ( expectedFilePath : String , withProject : ProjectInternal ? = null , configure : SourceSetDependenciesDsl . ( Project ) -> Unit )","body":"{  val repoRoot = tempFolder . newFolder ( )  val project = withProject ? : buildProject {  applyMultiplatformPlugin ( )  }  project . allprojects {  it . enableDefaultStdlibDependency ( false )  it . enableDependencyVerification ( false )  it . repositories . maven ( repoRoot )  }  val dsl = SourceSetDependenciesDsl ( project )  dsl . configure ( project )  dsl . declaredDependencies . forEach { project . multiplatformExtension . publishAsMockedLibrary ( repoRoot , it . first , it . second ) }  project . evaluate ( )  val actualResult = project . resolveAllSourceSetDependencies ( )  val expectedFile = resourcesRoot . resolve ( \"\" ) . resolve ( expectedFilePath )  KotlinTestUtils . assertEqualsToFile ( expectedFile , actualResult )  }","docstring":"/**\n * If [withProject] is not null then dependencies of source sets in this projects will be verified against [expectedFilePath]\n *\n */"}
{"signature":"internal actual fun < K , V > createMapForCache ( initialCapacity : Int ) : MutableMap < K , V >","body":"= HashMap ( initialCapacity )","docstring":"/**\n * Creates a ConcurrentHashMap on JVM and regular HashMap on other platforms.\n * To make actual use of cache in Kotlin/Native, mark a top-level object with this map\n * as a @[ThreadLocal].\n */"}
{"signature":"fun columnPlot ( plots : Iterable < Plot > , columns : Int , imageSize : Int ) : Figure","body":"=  gggrid ( plots , columns )","docstring":"/**\n * Column plot arranges the given iterable of plots in a specified number of columns and\n * creates a single figure from all given plots\n *\n * @param plots these are arranged into a single figure\n * @param columns specifies the number of columns in which the plots are arranged\n * @param imageSize is a height and width of the single plot in a returned plots figure\n * @return a [Figure] with all given plots\n */"}
{"signature":"fun xyPlot ( xSize : Int , ySize : Int , plotFeature : PlotFeature , f : ( Int , Int ) -> Float ) : Plot","body":"{  val gridX = List ( xSize ) { List ( ySize ) { it } } . flatten ( )  val gridY = List ( ySize ) { y -> List ( xSize ) { y } } . flatten ( )  val gridZ = gridX . zip ( gridY . reversed ( ) ) . map { f ( it . first , it . second ) }  return letsPlot {  x = gridX  y = gridY  fill = gridZ  } + FEATURE_MAP_THEME + plotFeature . scale  }","docstring":"/**\n * Create a tile plot with weights from specified function `f(x, y)` that specifies the\n * intensity of the single tile on the plot `(x, y)` position.\n *\n * @param xSize size of X domain of `f` function as a range [0, xSize)\n * @param ySize size of Y domain of `f` function as a range [0, ySize)\n * @param plotFeature filling colors of the created plot\n * @param f function that is plotted\n * @return [Plot] for specified function on defined domain\n */"}
{"signature":"fun xyPlot ( imageSize : Int , plotFeature : PlotFeature , f : ( Int , Int ) -> Float ) : Plot","body":"=  xyPlot ( imageSize , imageSize , plotFeature , f )","docstring":"/**\n * Create a tile plot with weights from specified function `f(x, y)` that specifies the\n * intensity of the single tile on the plot `(x, y)` position.\n *\n * @param imageSize size of X and Y domains of `f` function as a range [0, imageSize)\n * @param plotFeature filling colors of the created plot\n * @param f function that is plotted\n * @return [Plot] for specified function on defined domain\n */"}
{"signature":"fun flattenImagePlot ( sampleNumber : Int , dataset : Dataset , predict : ( FloatData ) -> Int ? = { null } , labelEncoding : ( Int ) -> Any ? = { it } , plotFeature : PlotFeature = PlotFeature . GRAY ) : Plot","body":"{  val imageSize =   val imageData = dataset . getX ( sampleNumber )  val imageLabel = dataset . getY ( sampleNumber ) . toInt ( ) . run ( labelEncoding )  val predictedLabel = predict ( imageData ) ? . run ( labelEncoding )  val title = if ( predictedLabel == null ) {  \"\"  } else {  \"\"  }  return xyPlot ( imageSize , plotFeature ) { x , y -> imageData . floats [ y * imageSize + x ] } + ggtitle ( title )  }","docstring":"/**\n * Create a [xyPlot] for image data given as an array of the following intensities of the\n * plot tiles.\n *\n * Function intended to use it with the input images from some [Dataset] for\n * model as it offers to plot extra label that the specified image is labeled by (and\n * additionally supports plotting some predicted label when model prediction is given)\n *\n * @param sampleNumber index of sample in [dataset] to be plotted\n * @param dataset that contains the input data to be plotted as model input image and base label\n * @param predict function that can define the label based on model input\n * Defaults to no predict function so no model predict label is plotted.\n * @param labelEncoding mapping from output label number to some human-readable label that is plotted.\n * Defaults to identity function.\n * @param plotFeature filling colors of the created plot\n * @return [Plot] representing model sample with prediction label if available\n */"}
{"signature":"fun soundPlot ( wavFile : WavFile , beginDrop : Double =  , endDrop : Double =  ) : Plot","body":"= wavFile . use { it ->  val soundData = it . readRemainingFrames ( )  val sampleRate = it . format . sampleRate  val frames = it . frames  val channels = it . format . numChannels  val secondsPerFrame =  / sampleRate . toDouble ( )  val dropBeginFrames = ( frames * beginDrop ) . roundToInt ( )  val dropEndFrames = ( frames * endDrop ) . roundToInt ( )  val takeFrames = max (  , frames - dropBeginFrames - dropEndFrames ) . toInt ( )  val singleTimeData = List ( takeFrames ) { ( it + dropBeginFrames ) * secondsPerFrame }  val channelName = List ( channels ) { idx -> List ( takeFrames ) { \"\" } } . flatten ( )  val xData = List ( channels ) { singleTimeData } . flatten ( )  val yData = soundData . flatMap { it . drop ( dropBeginFrames ) . take ( takeFrames ) }  val data = mapOf ( \"\" to channelName , \"\" to xData , \"\" to yData )  letsPlot ( data ) {  x = \"\"  y = \"\"  fill = \"\"  } + geomPath ( )  }","docstring":"/**\n * Create a [soundPlot] for all channels of given [WavFile]. If it is needed, the plot data can be\n * cut from the beginning or its end because there may be extra noises that disturbs visualization.\n *\n * @param wavFile to read sound data from\n * @param beginDrop part of data to drop from beginning from range [0, 1]\n * @param endDrop part of data to drop from an end from range [0, 1]\n * @return [Plot] representing the amplitude of sound of given [WavFile]\n */"}
{"signature":"private fun CInteropMetadataDependencyTransformationTask . configureTaskOrder ( )","body":"{  val tasksForVisibleSourceSets = Callable {  val allVisibleSourceSets = sourceSet . dependsOnClosure + sourceSet . getAdditionalVisibleSourceSets ( )  project . tasks . withType < CInteropMetadataDependencyTransformationTask > ( ) . matching { it . sourceSet in allVisibleSourceSets }  }  mustRunAfter ( tasksForVisibleSourceSets )  }","docstring":"/**\n * The transformation tasks will internally access the lazy [GranularMetadataTransformation.metadataDependencyResolutionsOrEmpty] property\n * which internally will potentially resolve dependencies. Having multiple tasks accessing this synchronized lazy property\n * during execution and/or configuration phase will result in an internal deadlock in Gradle\n * `DefaultResourceLockCoordinationService.withStateLock`\n *\n * To avoid this deadlock tasks shall be ordered, so that dependsOn source sets (and source sets visible based on associate compilations)\n * will run the transformation first.\n */"}
{"signature":"fun invoke ( cause : Throwable ? )","body":"fun invoke ( cause : Throwable ? )","docstring":"/**\n * Signals completion.\n *\n * This function:\n * - Does not throw any exceptions.\n * For [Job] instances that are coroutines, exceptions thrown by this function will be caught, wrapped into\n * [CompletionHandlerException], and passed to [handleCoroutineException], but for those that are not coroutines,\n * they will just be rethrown, potentially crashing unrelated code.\n * - Is fast, non-blocking, and thread-safe.\n * - Can be invoked concurrently with the surrounding code.\n * - Can be invoked from any context.\n *\n * The meaning of `cause` that is passed to the handler is:\n * - It is `null` if the job has completed normally.\n * - It is an instance of [CancellationException] if the job was cancelled _normally_.\n * **It should not be treated as an error**. In particular, it should not be reported to error logs.\n * - Otherwise, the job had _failed_.\n */"}
{"signature":"override fun invoke ( cause : Throwable ? )","body":"{ handler ( cause ) }","docstring":"/** @suppress */"}
{"signature":"public fun serialize ( encoder : Encoder , value : T )","body":"public fun serialize ( encoder : Encoder , value : T )","docstring":"/**\n * Serializes the [value] of type [T] using the format that is represented by the given [encoder].\n * [serialize] method is format-agnostic and operates with a high-level structured [Encoder] API.\n * Throws [SerializationException] if value cannot be serialized.\n *\n * Example of serialize method:\n * ```\n * class MyData(int: Int, stringList: List, alwaysZero: Long)\n *\n * fun serialize(encoder: Encoder, value: MyData): Unit = encoder.encodeStructure(descriptor) {\n * // encodeStructure encodes beginning and end of the structure\n * // encode 'int' property as Int\n * encodeIntElement(descriptor, index = 0, value.int)\n * // encode 'stringList' property as List\n * encodeSerializableElement(descriptor, index = 1, serializer>, value.stringList)\n * // don't encode 'alwaysZero' property because we decided to do so\n * } // end of the structure\n * ```\n *\n * @throws SerializationException in case of any serialization-specific error\n * @throws IllegalArgumentException if the supplied input does not comply encoder's specification\n * @see KSerializer for additional information about general contracts and exception specifics\n */"}
{"signature":"public fun deserialize ( decoder : Decoder ) : T","body":"public fun deserialize ( decoder : Decoder ) : T","docstring":"/**\n * Deserializes the value of type [T] using the format that is represented by the given [decoder].\n * [deserialize] method is format-agnostic and operates with a high-level structured [Decoder] API.\n * As long as most of the formats imply an arbitrary order of properties, deserializer should be able\n * to decode these properties in an arbitrary order and in a format-agnostic way.\n * For that purposes, [CompositeDecoder.decodeElementIndex]-based loop is used: decoder firstly\n * signals property at which index it is ready to decode and then expects caller to decode\n * property with the given index.\n *\n * Throws [SerializationException] if value cannot be deserialized.\n *\n * Example of deserialize method:\n * ```\n * class MyData(int: Int, stringList: List, alwaysZero: Long)\n *\n * fun deserialize(decoder: Decoder): MyData = decoder.decodeStructure(descriptor) {\n * // decodeStructure decodes beginning and end of the structure\n * var int: Int? = null\n * var list: List? = null\n * loop@ while (true) {\n * when (val index = decodeElementIndex(descriptor)) {\n * DECODE_DONE -> break@loop\n * 0 -> {\n * // Decode 'int' property as Int\n * int = decodeIntElement(descriptor, index = 0)\n * }\n * 1 -> {\n * // Decode 'stringList' property as List\n * list = decodeSerializableElement(descriptor, index = 1, serializer>())\n * }\n * else -> throw SerializationException(\"Unexpected index $index\")\n * }\n * }\n * if (int == null || list == null) throwMissingFieldException()\n * // Always use 0 as a value for alwaysZero property because we decided to do so.\n * return MyData(int, list, alwaysZero = 0L)\n * }\n * ```\n *\n * @throws MissingFieldException if non-optional fields were not found during deserialization\n * @throws SerializationException in case of any deserialization-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n * @see KSerializer for additional information about general contracts and exception specifics\n */"}
{"signature":"fun invokeAll ( )","body":"{  outputTargets . forEach { outputTarget -> invokeTarget ( outputTarget ) }  assert ( deserializedTargets . isEmpty ( ) ) { \"\" }  assert ( commonizedTargets . isEmpty ( ) ) { \"\" }  assert ( targetDependencies . isEmpty ( ) ) { \"\" }  }","docstring":"/**\n * Runs all tasks/targets in this queue\n */"}
{"signature":"fun ensureLookupsCacheAttributesSaved ( )","body":"{  if ( lookupAttributesSaved . compareAndSet ( false , true ) ) {  initialLookupsCacheStateDiff . manager . writeVersion ( )  }  }","docstring":"/**\n * Called on every successful compilation\n */"}
{"signature":"public fun l2Normalize ( scope : Scope ? , x : Operand < Float > , axis : IntArray ? ) : Operand < Float >","body":"{  val squareSum : Operand < Float > = ReduceSum . create ( scope , Square . create ( scope , x ) , Constant . create ( scope , axis ) , ReduceSum . keepDims ( true ) )  val invNorm : Operand < Float > = Rsqrt . create ( scope , org . tensorflow . op . math . Maximum . create ( scope , squareSum , Constant . create ( scope ,  ) ) )  return Mul . create ( scope , x , invNorm )  }","docstring":"/**\n * Normalizes a tensor wrt the L2 norm alongside the specified axis.\n *\n * @param scope: Current scope\n * @param x: Operand\n * @param axis: Axis along which to perform normalization\n */"}
{"signature":"public fun batchDot ( scope : Scope ? , x : Operand < Float > , y : Operand < Float > , axis : IntArray ) : Operand < Float >","body":"{  val xDim = x . asOutput ( ) . shape ( ) . numDimensions ( )  val yDim = y . asOutput ( ) . shape ( ) . numDimensions ( )  val diff : Int  var x2 : Operand < Float > = x  var y2 : Operand < Float > = y  if ( xDim > yDim ) {  diff = xDim - yDim  y2 = Reshape . create ( scope , y , Concat . create ( scope , listOf ( Shape . create ( scope , y ) ) + List ( diff ) { Constant . create ( scope ,  ) } , Constant . create ( scope ,  ) ) , )  } else if ( yDim > xDim ) {  diff = yDim - xDim  x2 = Reshape . create ( scope , x , Concat . create ( scope , listOf ( Shape . create ( scope , x ) ) + List ( diff ) { Constant . create ( scope ,  ) } , Constant . create ( scope ,  ) ) , )  } else {  diff =   }  var out : Operand < Float >  val x2Dim = x2 . asOutput ( ) . shape ( ) . numDimensions ( )  val y2Dim = y2 . asOutput ( ) . shape ( ) . numDimensions ( )  if ( x2Dim ==  && y2Dim ==  ) {  out = if ( axis [  ] == axis [  ] ) {  ReduceSum . create ( scope , Mul . create ( scope , x2 , y2 ) , Constant . create ( scope , axis [  ] ) )  } else {  ReduceSum . create ( scope , Mul . create ( scope , Transpose . create ( scope , x2 , Constant . create ( scope , intArrayOf (  ,  ) ) ) , y2 ) , Constant . create ( scope , axis [  ] ) )  }  } else {  val adjX = when ( axis [  ] == x2Dim -  ) {  true -> null  false -> true  }  val adjY = when ( axis [  ] == y2Dim -  ) {  true -> true  false -> null  }  out = MatMul . create ( scope , x2 , y2 , MatMul . transposeA ( adjX ) , MatMul . transposeB ( adjY ) )  }  val idx : Float  if ( diff !=  ) {  idx = if ( xDim > yDim ) {  ( xDim + yDim -  ) . toFloat ( )  } else {  ( xDim -  ) . toFloat ( )  }  out = Squeeze . create ( scope , Constant . create ( scope , FloatArray ( diff ) { it + idx } ) )  }  if ( out . asOutput ( ) . shape ( ) . numDimensions ( ) ==  ) {  ExpandDims . create ( scope , out , Constant . create ( scope ,  ) )  }  return out  }","docstring":"/**\n * Batchwise dot product.\n *\n * @param scope: Current scope\n * @param x: Operand with dimensions>=2\n * @param y: Operand with dimensions>=2\n * @param axis: Axis along which to perform batch dot\n */"}
{"signature":"public fun doBefore ( )","body":"public fun doBefore ( )","docstring":"/**\n * Runs all methods that were marked with `@BeforeTest` annotation.\n *\n * @see kotlin.test.BeforeTest\n */"}
{"signature":"public fun doRun ( )","body":"public fun doRun ( )","docstring":"/**\n * Runs the test method itself\n *\n * @see kotlin.test.Test\n */"}
{"signature":"public fun run ( )","body":"{  try {  doBefore ( )  doRun ( )  } finally {  doAfter ( )  }  }","docstring":"/**\n * Runs test with its before and after functions.\n */"}
{"signature":"public fun doAfter ( )","body":"public fun doAfter ( )","docstring":"/**\n * Runs all methods that were marked with `@AfterTest` annotation.\n *\n * @see kotlin.test.AfterTest\n */"}
{"signature":"public fun doBeforeClass ( )","body":"public fun doBeforeClass ( )","docstring":"/**\n * Executes all methods marked with `@BeforeClass` annotation\n *\n * @see kotlin.test.BeforeClass\n */"}
{"signature":"public fun doAfterClass ( )","body":"public fun doAfterClass ( )","docstring":"/**\n * Executes all methods marked with `@AfterClass` annotation\n *\n * @see @see kotlin.test.AfterClass\n */"}
{"signature":"fun FirQualifiedAccessExpression . createConeSubstitutorFromTypeArguments ( callableSymbol : FirCallableSymbol < * > , session : FirSession , discardErrorTypes : Boolean = false , ) : ConeSubstitutor","body":"{  val typeArgumentMap = buildMap {  typeArguments . zip ( callableSymbol . typeParameterSymbols ) . forEach { ( typeArgument , typeParameterSymbol ) ->  val type = ( typeArgument as? FirTypeProjectionWithVariance ) ? . typeRef ? . coneType ? : return@forEach  if ( type is ConeErrorType && discardErrorTypes ) return@forEach  put ( typeParameterSymbol , type )  }  }  return substitutorByMap ( typeArgumentMap , session )  }","docstring":"/**\n * @param discardErrorTypes if true, then type arguments with error types are not added to the substitution map\n */"}
{"signature":"fun < T : IrElement > T . patchDeclarationParents ( initialParent : IrDeclarationParent ? = null ) : T","body":"= apply {  accept ( PatchDeclarationParentsVisitor , initialParent )  }","docstring":"/**\n * For each [IrDeclaration] in the IR subtree with the root in `this`, sets its [IrDeclaration.parent]\n * property to its _actual_ parent in the subtree.\n *\n * @param initialParent If this parameter is not `null`, assign topmost [IrDeclaration]s'\n * parents to that value (starting with `this`, if it is an [IrDeclaration]).\n * If null, skip those topmost [IrDeclaration]s' and start assigning parents one level below\n * (this is, once an [IrDeclarationParent] is found).\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun < T : Comparable < T > > maxOf ( a : T , b : T ) : T","body":"{  return if ( a >= b ) a else b  }","docstring":"/**\n * Returns the greater of two values.\n * \n * If values are equal, returns the first one.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Byte , b : Byte ) : Byte","body":"{  return maxOf ( a . toInt ( ) , b . toInt ( ) ) . toByte ( )  }","docstring":"/**\n * Returns the greater of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Short , b : Short ) : Short","body":"{  return maxOf ( a . toInt ( ) , b . toInt ( ) ) . toShort ( )  }","docstring":"/**\n * Returns the greater of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Int , b : Int ) : Int","body":"{  return if ( a >= b ) a else b  }","docstring":"/**\n * Returns the greater of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Long , b : Long ) : Long","body":"{  return if ( a >= b ) a else b  }","docstring":"/**\n * Returns the greater of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Float , b : Float ) : Float","body":"{  return if ( a . compareTo ( b ) >=  ) a else b  }","docstring":"/**\n * Returns the greater of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Double , b : Double ) : Double","body":"{  return if ( a . compareTo ( b ) >=  ) a else b  }","docstring":"/**\n * Returns the greater of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun < T : Comparable < T > > maxOf ( a : T , b : T , c : T ) : T","body":"{  return maxOf ( a , maxOf ( b , c ) )  }","docstring":"/**\n * Returns the greater of three values.\n * \n * If there are multiple equal maximal values, returns the first of them.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Byte , b : Byte , c : Byte ) : Byte","body":"{  return maxOf ( a . toInt ( ) , maxOf ( b . toInt ( ) , c . toInt ( ) ) ) . toByte ( )  }","docstring":"/**\n * Returns the greater of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Short , b : Short , c : Short ) : Short","body":"{  return maxOf ( a . toInt ( ) , maxOf ( b . toInt ( ) , c . toInt ( ) ) ) . toShort ( )  }","docstring":"/**\n * Returns the greater of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Int , b : Int , c : Int ) : Int","body":"{  return maxOf ( a , maxOf ( b , c ) )  }","docstring":"/**\n * Returns the greater of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Long , b : Long , c : Long ) : Long","body":"{  return maxOf ( a , maxOf ( b , c ) )  }","docstring":"/**\n * Returns the greater of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Float , b : Float , c : Float ) : Float","body":"{  return maxOf ( a , maxOf ( b , c ) )  }","docstring":"/**\n * Returns the greater of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun maxOf ( a : Double , b : Double , c : Double ) : Double","body":"{  return maxOf ( a , maxOf ( b , c ) )  }","docstring":"/**\n * Returns the greater of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun < T : Comparable < T > > maxOf ( a : T , vararg other : T ) : T","body":"{  var max = a  for ( e in other ) max = maxOf ( max , e )  return max  }","docstring":"/**\n * Returns the greater of the given values.\n * \n * If there are multiple equal maximal values, returns the first of them.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun maxOf ( a : Byte , vararg other : Byte ) : Byte","body":"{  var max = a  for ( e in other ) max = maxOf ( max , e )  return max  }","docstring":"/**\n * Returns the greater of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun maxOf ( a : Short , vararg other : Short ) : Short","body":"{  var max = a  for ( e in other ) max = maxOf ( max , e )  return max  }","docstring":"/**\n * Returns the greater of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun maxOf ( a : Int , vararg other : Int ) : Int","body":"{  var max = a  for ( e in other ) max = maxOf ( max , e )  return max  }","docstring":"/**\n * Returns the greater of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun maxOf ( a : Long , vararg other : Long ) : Long","body":"{  var max = a  for ( e in other ) max = maxOf ( max , e )  return max  }","docstring":"/**\n * Returns the greater of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun maxOf ( a : Float , vararg other : Float ) : Float","body":"{  var max = a  for ( e in other ) max = maxOf ( max , e )  return max  }","docstring":"/**\n * Returns the greater of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun maxOf ( a : Double , vararg other : Double ) : Double","body":"{  var max = a  for ( e in other ) max = maxOf ( max , e )  return max  }","docstring":"/**\n * Returns the greater of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun < T : Comparable < T > > minOf ( a : T , b : T ) : T","body":"{  return if ( a <= b ) a else b  }","docstring":"/**\n * Returns the smaller of two values.\n * \n * If values are equal, returns the first one.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Byte , b : Byte ) : Byte","body":"{  return minOf ( a . toInt ( ) , b . toInt ( ) ) . toByte ( )  }","docstring":"/**\n * Returns the smaller of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Short , b : Short ) : Short","body":"{  return minOf ( a . toInt ( ) , b . toInt ( ) ) . toShort ( )  }","docstring":"/**\n * Returns the smaller of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Int , b : Int ) : Int","body":"{  return if ( a <= b ) a else b  }","docstring":"/**\n * Returns the smaller of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Long , b : Long ) : Long","body":"{  return if ( a <= b ) a else b  }","docstring":"/**\n * Returns the smaller of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Float , b : Float ) : Float","body":"{  return when {  a . isNaN ( ) -> a  b . isNaN ( ) -> b  else -> if ( a . compareTo ( b ) <=  ) a else b  }  }","docstring":"/**\n * Returns the smaller of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Double , b : Double ) : Double","body":"{  return when {  a . isNaN ( ) -> a  b . isNaN ( ) -> b  else -> if ( a . compareTo ( b ) <=  ) a else b  }  }","docstring":"/**\n * Returns the smaller of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun < T : Comparable < T > > minOf ( a : T , b : T , c : T ) : T","body":"{  return minOf ( a , minOf ( b , c ) )  }","docstring":"/**\n * Returns the smaller of three values.\n * \n * If there are multiple equal minimal values, returns the first of them.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Byte , b : Byte , c : Byte ) : Byte","body":"{  return minOf ( a . toInt ( ) , minOf ( b . toInt ( ) , c . toInt ( ) ) ) . toByte ( )  }","docstring":"/**\n * Returns the smaller of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Short , b : Short , c : Short ) : Short","body":"{  return minOf ( a . toInt ( ) , minOf ( b . toInt ( ) , c . toInt ( ) ) ) . toShort ( )  }","docstring":"/**\n * Returns the smaller of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Int , b : Int , c : Int ) : Int","body":"{  return minOf ( a , minOf ( b , c ) )  }","docstring":"/**\n * Returns the smaller of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Long , b : Long , c : Long ) : Long","body":"{  return minOf ( a , minOf ( b , c ) )  }","docstring":"/**\n * Returns the smaller of three values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Float , b : Float , c : Float ) : Float","body":"{  return minOf ( a , minOf ( b , c ) )  }","docstring":"/**\n * Returns the smaller of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public actual inline fun minOf ( a : Double , b : Double , c : Double ) : Double","body":"{  return minOf ( a , minOf ( b , c ) )  }","docstring":"/**\n * Returns the smaller of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun < T : Comparable < T > > minOf ( a : T , vararg other : T ) : T","body":"{  var min = a  for ( e in other ) min = minOf ( min , e )  return min  }","docstring":"/**\n * Returns the smaller of the given values.\n * \n * If there are multiple equal minimal values, returns the first of them.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun minOf ( a : Byte , vararg other : Byte ) : Byte","body":"{  var min = a  for ( e in other ) min = minOf ( min , e )  return min  }","docstring":"/**\n * Returns the smaller of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun minOf ( a : Short , vararg other : Short ) : Short","body":"{  var min = a  for ( e in other ) min = minOf ( min , e )  return min  }","docstring":"/**\n * Returns the smaller of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun minOf ( a : Int , vararg other : Int ) : Int","body":"{  var min = a  for ( e in other ) min = minOf ( min , e )  return min  }","docstring":"/**\n * Returns the smaller of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun minOf ( a : Long , vararg other : Long ) : Long","body":"{  var min = a  for ( e in other ) min = minOf ( min , e )  return min  }","docstring":"/**\n * Returns the smaller of the given values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun minOf ( a : Float , vararg other : Float ) : Float","body":"{  var min = a  for ( e in other ) min = minOf ( min , e )  return min  }","docstring":"/**\n * Returns the smaller of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public actual fun minOf ( a : Double , vararg other : Double ) : Double","body":"{  var min = a  for ( e in other ) min = minOf ( min , e )  return min  }","docstring":"/**\n * Returns the smaller of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"}
{"signature":"fun renderResult ( host : ExecutionHost , field : FieldValue , ) : Any ?","body":"fun renderResult ( host : ExecutionHost , field : FieldValue , ) : Any ?","docstring":"/**\n * Renders cell result [field] represented as [FieldValue] in the [host] context\n */"}
{"signature":"fun register ( renderer : RendererFieldHandler ) : Code ?","body":"fun register ( renderer : RendererFieldHandler ) : Code ?","docstring":"/**\n * Adds new [renderer] for this notebook.\n * Returns code to be executed on execution host\n * for [PrecompiledRendererTypeHandler]'s.\n */"}
{"signature":"open fun generate ( valueArgumentsByIndex : List < ResolvedValueArgument > , actualArgs : List < ResolvedValueArgument > , calleeDescriptor : CallableDescriptor ?  ) : DefaultCallArgs","body":"{  assert ( valueArgumentsByIndex . size == actualArgs . size ) {  \"\"  }  val arg2Index = valueArgumentsByIndex . mapToIndex ( )  val actualArgsWithDeclIndex = actualArgs . filter { it !is DefaultValueArgument } . map {  ArgumentAndDeclIndex ( it , arg2Index [ it ] ! ! )  } . toMutableList ( )  for ( ( index , value ) in valueArgumentsByIndex . withIndex ( ) ) {  if ( value is DefaultValueArgument ) {  actualArgsWithDeclIndex . add ( index , ArgumentAndDeclIndex ( value , index ) )  }  }  val defaultArgs = DefaultCallArgs ( calleeDescriptor ? . unwrapFrontendVersion ( ) ? . valueParameters ? . size ? :  )  for ( argumentWithDeclIndex in actualArgsWithDeclIndex ) {  val argument = argumentWithDeclIndex . arg  val declIndex = argumentWithDeclIndex . declIndex  when ( argument ) {  is ExpressionValueArgument -> {  generateExpression ( declIndex , argument )  }  is DefaultValueArgument -> {  defaultArgs . mark ( declIndex )  generateDefault ( declIndex , argument )  }  is VarargValueArgument -> {  generateVararg ( declIndex , argument )  }  else -> {  generateOther ( declIndex , argument )  }  }  }  reorderArgumentsIfNeeded ( actualArgsWithDeclIndex )  return defaultArgs  }","docstring":"/**\n * @return a `List` of bit masks of default arguments that should be passed as last arguments to $default method, if there were\n * any default arguments, or an empty `List` if there were none\n *\n * @see kotlin.reflect.jvm.internal.KCallableImpl.callBy\n */"}
{"signature":"private fun InteropCallContext . findMemoryAccessFunction ( isRead : Boolean , valueType : IrType ) : IrFunction","body":"{  val requiredType = if ( isRead ) {  IntrinsicType . INTEROP_READ_PRIMITIVE  } else {  IntrinsicType . INTEROP_WRITE_PRIMITIVE  }  val nativeMemUtilsClass = symbols . nativeMemUtils . owner  return nativeMemUtilsClass . functions . filter {  val annotationArgument = it . annotations  . findAnnotation ( RuntimeNames . typedIntrinsicAnnotation )  ? . getAnnotationStringValue ( )  annotationArgument == requiredType . name  } . firstOrNull {  if ( isRead ) {  it . returnType . classOrNull == valueType . classOrNull  } else {  it . valueParameters . last ( ) . type . classOrNull == valueType . classOrNull  }  } ? : error ( \"\" )  }","docstring":"/**\n * Search for memory read/write function in [kotlinx.cinterop.nativeMemUtils] of a given [valueType].\n */"}
{"signature":"private fun InteropCallContext . castToBoolean ( sourceClass : IrClassSymbol , value : IrExpression ) : IrExpression","body":"{  val ( primitiveBinaryType , immZero ) = when ( sourceClass ) {  symbols . byte -> PrimitiveBinaryType . BYTE to builder . irByte (  )  symbols . long -> PrimitiveBinaryType . LONG to builder . irLong (  )  else -> error ( \"\" )  }  val areEqualByValuesBytes = symbols . areEqualByValue . getValue ( primitiveBinaryType )  val compareToZero = builder . irCall ( areEqualByValuesBytes ) . apply {  putValueArgument (  , value )  putValueArgument (  , immZero )  }  return builder . irCall ( irBuiltIns . booleanNotSymbol ) . apply {  dispatchReceiver = compareToZero  }  }","docstring":"/**\n * Perform (value != 0)\n */"}
{"signature":"private fun InteropCallContext . castFromBoolean ( targetClass : IrClassSymbol , value : IrExpression ) : IrExpression","body":"{  val ( thenPart , elsePart ) = when ( targetClass ) {  symbols . byte -> builder . irByte (  ) to builder . irByte (  )  symbols . long -> builder . irLong (  ) to builder . irLong (  )  else -> error ( \"\" )  }  return builder . irIfThenElse ( targetClass . defaultType , value , thenPart , elsePart )  }","docstring":"/**\n * Perform if (value) 1 else 0\n */"}
{"signature":"internal fun tryGenerateInteropMemberAccess ( callSite : IrCall , symbols : KonanSymbols , builder : IrBuilderWithScope , failCompilation : ( String ) -> Nothing ) : IrExpression ?","body":"= when {  callSite . symbol . owner . isCEnumVarValueAccessor ( symbols ) ->  generateInteropCall ( symbols , builder , failCompilation ) { generateEnumVarValueAccess ( callSite ) }  callSite . symbol . owner . isCStructMemberAtAccessor ( ) ->  generateInteropCall ( symbols , builder , failCompilation ) { generateMemberAtAccess ( callSite ) }  callSite . symbol . owner . isCStructBitFieldAccessor ( ) ->  generateInteropCall ( symbols , builder , failCompilation ) { generateBitFieldAccess ( callSite ) }  callSite . symbol . owner . isCStructArrayMemberAtAccessor ( ) ->  generateInteropCall ( symbols , builder , failCompilation ) { generateArrayMemberAtAccess ( callSite ) }  else -> null  }","docstring":"/** Returns non-null result if [callSite] is accessor to:\n * 1. T.value, T : CEnumVar\n * 2. T., T : CStructVar and accessor is annotated with\n * [kotlinx.cinterop.internal.CStruct.MemberAt] or [kotlinx.cinterop.internal.CStruct.BitField]\n */"}
{"signature":"fun loadModuleMetadata ( name : String ) : SerializedMetadata","body":"fun loadModuleMetadata ( name : String ) : SerializedMetadata","docstring":"/**\n * Loads metadata for the specified module.\n */"}
{"signature":"@ DisplayName ( \"\" )  @ GradleTest  @ TestMetadata ( \"\" )  fun testTouchLibCommon ( gradleVersion : GradleVersion )","body":"= withProject ( gradleVersion ) {  build ( \"\" )  val usedInAppCommon = resolvePath ( \"\" , \"\" , \"\" )  multiStepCheckIncrementalBuilds ( incrementalPath = usedInAppCommon , steps = listOf ( \"\" , \"\" ) , tasksExpectedToExecuteOnEachStep = mainCompileTasks , afterEachStep = {  assertIncrementalCompilation ( listOf ( usedInAppCommon , resolvePath ( \"\" , \"\" , \"\" ) ) . relativizeTo ( projectPath ) )  } )  val usedInAppPlatform = resolvePath ( \"\" , \"\" , \"\" )  usedInAppPlatform . replaceWithVersion ( \"\" )  fun testIndividualTarget ( moduleTask : String , extraAssertions : BuildResult . ( ) -> Unit = { } ) {  build ( \"\" , buildOptions = defaultBuildOptions . copy ( logLevel = LogLevel . DEBUG ) ) {  val targetTasks = setOf ( \"\" , \"\" )  assertTasksExecuted ( targetTasks )  assertTasksAreNotInTaskGraph ( * ( mainCompileTasks - targetTasks ) . toTypedArray ( ) )  extraAssertions ( )  }  }  testIndividualTarget ( \"\" ) {  assertCompiledKotlinSources ( listOf ( usedInAppPlatform , resolvePath ( \"\" , \"\" , \"\" ) ) . relativizeTo ( projectPath ) , output )  }  testIndividualTarget ( \"\" ) {  assertIncrementalCompilation ( listOf ( usedInAppPlatform , resolvePath ( \"\" , \"\" , \"\" ) ) . relativizeTo ( projectPath ) )  }  testIndividualTarget ( \"\" )  }","docstring":"/**\n * Tests api change across the module + sourceSet boundary\n */"}
{"signature":"@ DisplayName ( \"\" )  @ GradleTest  @ TestMetadata ( \"\" )  fun testTouchLibPlatform ( gradleVersion : GradleVersion )","body":"= withProject ( gradleVersion ) {  build ( \"\" )  val commonSteps = listOf ( \"\" , \"\" )  val jvmUtil = resolvePath ( \"\" , \"\" , \"\" )  multiStepCheckIncrementalBuilds ( incrementalPath = jvmUtil , steps = commonSteps , tasksExpectedToExecuteOnEachStep = setOf ( \"\" , \"\" ) , afterEachStep = {  assertCompiledKotlinSources ( expectedSources = listOf ( jvmUtil , resolvePath ( \"\" , \"\" , \"\" ) ) . relativizeTo ( projectPath ) , output = output )  } )  val jsUtil = resolvePath ( \"\" , \"\" , \"\" )  multiStepCheckIncrementalBuilds ( incrementalPath = jsUtil , steps = commonSteps , tasksExpectedToExecuteOnEachStep = setOf ( \"\" , \"\" ) , afterEachStep = {  assertIncrementalCompilation ( listOf ( jsUtil , resolvePath ( \"\" , \"\" , \"\" ) ) . relativizeTo ( projectPath ) )  } )  val nativeUtil = resolvePath ( \"\" , \"\" , \"\" )  multiStepCheckIncrementalBuilds ( incrementalPath = nativeUtil , steps = commonSteps , tasksExpectedToExecuteOnEachStep = setOf ( \"\" , \"\" ) )  }","docstring":"/**\n * Three platforms, two steps for each. Do source-compatible changes: first add default parameter,\n * then change return type.\n * lib/platform utils are used in app/platform with deduced return type.\n */"}
{"signature":"@ DisplayName ( \"\" )  @ GradleTest  @ TestMetadata ( \"\" )  fun testTouchAppCommon ( gradleVersion : GradleVersion )","body":"= withProject ( gradleVersion ) {  build ( \"\" )  val utilPath = resolvePath ( \"\" , \"\" , \"\" )  multiStepCheckIncrementalBuilds ( incrementalPath = utilPath , steps = listOf ( \"\" , \"\" ) , tasksExpectedToExecuteOnEachStep = setOf ( \"\" , \"\" , \"\" , \"\" ) , afterEachStep = {  assertIncrementalCompilation ( listOf ( utilPath , resolvePath ( \"\" , \"\" , \"\" ) , resolvePath ( \"\" , \"\" , \"\" ) ) . relativizeTo ( projectPath ) )  } )  }","docstring":"/**\n * Main smoke tests for api changes on the source set boundary\n */"}
{"signature":"@ DisplayName ( \"\" )  @ GradleTest  @ TestMetadata ( \"\" )  fun testTouchAppPlatform ( gradleVersion : GradleVersion )","body":"= withProject ( gradleVersion ) {  build ( \"\" )  val changedJvmSource = resolvePath ( \"\" , \"\" , \"\" )  . replaceWithVersion ( \"\" )  checkIncrementalBuild ( tasksExpectedToExecute = setOf ( \"\" ) ) {  assertCompiledKotlinSources ( listOf ( changedJvmSource ) . relativizeTo ( projectPath ) , output )  }  val changedJsSource = resolvePath ( \"\" , \"\" , \"\" )  . replaceWithVersion ( \"\" )  checkIncrementalBuild ( tasksExpectedToExecute = setOf ( \"\" ) ) {  assertIncrementalCompilation ( listOf ( changedJsSource ) . relativizeTo ( projectPath ) )  }  resolvePath ( \"\" , \"\" , \"\" )  . replaceWithVersion ( \"\" )  checkIncrementalBuild ( tasksExpectedToExecute = setOf ( \"\" ) )  }","docstring":"/**\n * Platform changes in a non-dependency shouldn't affect anything else\n */"}
{"signature":"internal fun buildThrowableAsErrorMethod ( ) : ObjCMethod","body":"{  return ObjCMethod ( comment = null , isInstanceMethod = true , returnType = ObjCClassType ( \"\" ) , selectors = listOf ( \"\" ) , parameters = emptyList ( ) , attributes = listOf ( swiftNameAttribute ( \"\" ) ) , origin = null )  }","docstring":"/**\n * See K1: [org.jetbrains.kotlin.backend.konan.objcexport.ObjCExportTranslatorImpl.buildThrowableAsErrorMethod]\n */"}
{"signature":"@ Test  fun `test - simple project - jvmTarget is explicit - and uses correct default` ( )","body":"{  val project = buildProjectWithJvm ( )  val kotlin = project . kotlinJvmExtension  project . evaluate ( )  val mainCompilation = kotlin . target . compilations . getByName ( \"\" )  val mainCompilationTask = mainCompilation . compileTaskProvider . get ( ) as KotlinCompile  val arguments = mainCompilationTask . createCompilerArguments ( lenient )  val argumentsString = ArgumentUtils . convertArgumentsToStringList ( arguments )  val jvmTargetArgument = K2JVMCompilerArguments :: jvmTarget . javaField ! ! . getAnnotation ( Argument :: class . java ) ! ! . value  if ( jvmTargetArgument !in argumentsString ) fail ( \"\" )  val indexOfJvmTargetArgument = argumentsString . indexOf ( jvmTargetArgument )  val jvmTargetTargetArgumentValue = argumentsString . getOrNull ( indexOfJvmTargetArgument +  )  assertEquals ( JvmTarget . fromTarget ( JavaVersion . current ( ) . toString ( ) ) . target , jvmTargetTargetArgumentValue )  val parsedArguments = K2JVMCompilerArguments ( ) . apply { parseCommandLineArguments ( argumentsString , this ) }  assertNotNull ( parsedArguments . jvmTarget )  assertEquals ( JvmTarget . fromTarget ( JavaVersion . current ( ) . toString ( ) ) . target , parsedArguments . jvmTarget )  }","docstring":"/**\n * The jvmTargets default argument value is up for change over time.\n * The argument shall always be explicitly set!\n */"}
{"signature":"public expect fun CoroutineScope . newCoroutineContext ( context : CoroutineContext ) : CoroutineContext","body":"public expect fun CoroutineScope . newCoroutineContext ( context : CoroutineContext ) : CoroutineContext","docstring":"/**\n * Creates a context for a new coroutine. It installs [Dispatchers.Default] when no other dispatcher or\n * [ContinuationInterceptor] is specified and adds optional support for debugging facilities (when turned on)\n * and copyable-thread-local facilities on JVM.\n */"}
{"signature":"@ InternalCoroutinesApi  public expect fun CoroutineContext . newCoroutineContext ( addedContext : CoroutineContext ) : CoroutineContext","body":"@ InternalCoroutinesApi  public expect fun CoroutineContext . newCoroutineContext ( addedContext : CoroutineContext ) : CoroutineContext","docstring":"/**\n * Creates a context for coroutine builder functions that do not launch a new coroutine, e.g. [withContext].\n * @suppress\n */"}
{"signature":"fun theAnswer ( )","body":"= ","docstring":"/**\n * The ultimate answer to life, universe, and everything can be printed like this:\n * ```kotlin\n * fun main() {\n * println(theAnswer())\n * }\n * ```\n * \n */"}
{"signature":"@ Provides @ Singleton @ ForApplication  fun provideApplicationContext ( ) : Context","body":"{  return application  }","docstring":"/**\n * Allow the application context to be injected but require that it be annotated with\n * [@Annotation][ForApplication] to explicitly differentiate it from an activity context.\n */"}
{"signature":"fun poseDetectionMoveNet ( )","body":"{  val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) )  val modelType = ONNXModels . PoseDetection . MoveNetSinglePoseLighting  val model = modelHub . loadModel ( modelType )  model . printSummary ( )  model . use {  println ( it )  val file = getFileFromResource ( \"\" )  val image = ImageConverter . toBufferedImage ( file )  val preprocessing = pipeline < BufferedImage > ( )  . resize {  outputHeight =   outputWidth =   }  . convert { colorMode = ColorMode . BGR }  . toFloatArray { }  . call ( modelType . preprocessor )  val inputData = preprocessing . apply ( image )  val rawPoseLandMarks = it . predict ( inputData ) { result ->  result . get2DFloatArray ( \"\" )  }  println ( rawPoseLandMarks . contentDeepToString ( ) )  val keypoints = mapOf (  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" ,  to \"\" )  rawPoseLandMarks . forEachIndexed { index , data ->  println ( keypoints [ index ] + \"\" + data [  ] + \"\" + data [  ] + \"\" + data [  ] )  }  val foundPoseLandmarks = mutableListOf < PoseLandmark > ( )  for ( i in rawPoseLandMarks . indices ) {  val poseLandmark = PoseLandmark ( x = rawPoseLandMarks [ i ] [  ] , y = rawPoseLandMarks [ i ] [  ] , probability = rawPoseLandMarks [ i ] [  ] , label = keypoints [ i ] ! !  )  foundPoseLandmarks . add ( i , poseLandmark )  }  val detectedPose = DetectedPose ( foundPoseLandmarks , emptyList ( ) )  val displayedImage = pipeline < BufferedImage > ( )  . resize { outputWidth =  ; outputHeight =  }  . apply ( image )  showFrame ( \"\" , createDetectedPosePanel ( displayedImage , detectedPose ) )  }  }","docstring":"/**\n * This examples demonstrates the inference concept on MoveNetSinglePoseLighting model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n * - Special preprocessing is applied to each image before prediction.\n */"}
{"signature":"fun main ( ) : Unit","body":"= poseDetectionMoveNet ( )","docstring":"/** */"}
{"signature":"override fun toString ( )","body":"= if ( diff == null )  \"\"  else  \"\"","docstring":"/**\n * Formats difference returned by [computeLinesDiff] for display in exception messages.\n */"}
{"signature":"public fun computeLinesDiff ( oldLines : List < String > , newLines : List < String > , limit : Int = DIFF_LIMIT ) : ComputedLinesDiff","body":"{  val diff = computeDiff ( oldLines , newLines , limit ) ? : return ComputedLinesDiff ( null )  val out = ArrayList < String > ( diff . size *  )  var pOp : DiffOp ? = null  var pPos =   var pHdr = -   var d1 : Diff by Delegates . notNull ( )  var d2 : Diff by Delegates . notNull ( )  fun flushHeader ( ) {  if ( pHdr <  ) return  out [ pHdr ] = formatHeader ( d1 , d2 )  pHdr = -   }  for ( d in diff ) {  val pos = if ( d . op == DiffOp . DELETE ) d . x else d . y  if ( d . op != pOp || pos != pPos +  ) {  if ( pOp == DiffOp . DELETE && d . op == DiffOp . INSERT && d . x == d2 . x ) {  d1 = Diff ( d1 . x , d . y , DiffOp . CHANGE , \"\" )  d2 = d  out . add ( \"\" )  } else {  flushHeader ( )  d1 = d  d2 = d  pHdr = out . size  out . add ( \"\" )  }  } else {  d2 = d  }  out . add ( \"\" )  pOp = d . op  pPos = pos  }  flushHeader ( )  return ComputedLinesDiff ( out )  }","docstring":"/**\n * Computes difference between two set of lines and returns it in diff format as a list of strings.\n * The resulting [ComputedLinesDiff.diff] is `null` when difference exceeds [limit] lines.\n */"}
{"signature":"public fun resnet50 ( imageSize : Long =  , numberOfClasses : Int =  , numberOfInputChannels : Long =  , lastLayerActivation : Activations = Activations . Linear , ) : Functional","body":"{  val stackFn = fun ( pointer : Layer ) : Layer {  var x = pointer  x = stack1 ( x ,  ,  , stride1 =  , name = \"\" )  x = stack1 ( x ,  ,  , name = \"\" )  x = stack1 ( x ,  ,  , name = \"\" )  return stack1 ( x ,  ,  , name = \"\" )  }  return resnet ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = false )  }","docstring":"/**\n * Instantiates the ResNet50 architecture as a Functional model.\n *\n * @param [imageSize] Height = width of image.\n * @param [numberOfClasses] Number of neurons in the last layer (usually, Dense layer).\n * @param [lastLayerActivation] Activation for last layer (usually, Dense layer).\n *\n * @see \n * Deep Residual Learning for Image Recognition.\n * @see \n * Detailed description of ResNet'50 model and an approach to build it in Keras.\n */"}
{"signature":"public fun resnet101 ( imageSize : Long =  , numberOfClasses : Int =  , numberOfInputChannels : Long =  , lastLayerActivation : Activations = Activations . Linear , ) : Functional","body":"{  val stackFn = fun ( pointer : Layer ) : Layer {  var x = pointer  x = stack1 ( x ,  ,  , stride1 =  , name = \"\" )  x = stack1 ( x ,  ,  , name = \"\" )  x = stack1 ( x ,  ,  , name = \"\" )  return stack1 ( x ,  ,  , name = \"\" )  }  return resnet ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = false )  }","docstring":"/**\n * Instantiates the ResNet101 architecture as a Functional model.\n *\n * @param [imageSize] Height = width of image.\n * @param [numberOfClasses] Number of neurons in the last layer (usually, Dense layer).\n * @param [lastLayerActivation] Activation for last layer (usually, Dense layer).\n *\n * @see \n * Deep Residual Learning for Image Recognition.\n * @see \n * Detailed description of ResNet101 model and an approach to build it in Keras.\n */"}
{"signature":"public fun resnet152 ( imageSize : Long =  , numberOfClasses : Int =  , numberOfInputChannels : Long =  , lastLayerActivation : Activations = Activations . Linear , ) : Functional","body":"{  val stackFn = fun ( pointer : Layer ) : Layer {  var x = pointer  x = stack1 ( x ,  ,  , stride1 =  , name = \"\" )  x = stack1 ( x ,  ,  , name = \"\" )  x = stack1 ( x ,  ,  , name = \"\" )  return stack1 ( x ,  ,  , name = \"\" )  }  return resnet ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = false )  }","docstring":"/**\n * Instantiates the ResNet152 architecture as a Functional model.\n *\n * @param [imageSize] Height = width of image.\n * @param [numberOfClasses] Number of neurons in the last layer (usually, Dense layer).\n * @param [lastLayerActivation] Activation for last layer (usually, Dense layer).\n *\n * @see \n * Deep Residual Learning for Image Recognition.\n * @see \n * Detailed description of ResNet152 model and an approach to build it in Keras.\n */"}
{"signature":"public fun resnet50v2 ( imageSize : Long =  , numberOfClasses : Int =  , numberOfInputChannels : Long =  , lastLayerActivation : Activations = Activations . Linear , ) : Functional","body":"{  val stackFn = fun ( pointer : Layer ) : Layer {  var x = pointer  x = stack2 ( x ,  ,  , name = \"\" )  x = stack2 ( x ,  ,  , name = \"\" )  x = stack2 ( x ,  ,  , name = \"\" )  return stack2 ( x ,  ,  , stride1 =  , name = \"\" )  }  return resnet ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = true )  }","docstring":"/**\n * Instantiates the ResNet50V2 architecture as a Functional model.\n *\n * @param [imageSize] Height = width of image.\n * @param [numberOfClasses] Number of neurons in the last layer (usually, Dense layer).\n * @param [lastLayerActivation] Activation for last layer (usually, Dense layer).\n *\n * @see \n * Deep Residual Learning for Image Recognition.\n * @see \n * Detailed description of ResNet50V2 model and an approach to build it in Keras.\n */"}
{"signature":"public fun resnet101v2 ( imageSize : Long =  , numberOfClasses : Int =  , numberOfInputChannels : Long =  , lastLayerActivation : Activations = Activations . Linear , ) : Functional","body":"{  val stackFn = fun ( pointer : Layer ) : Layer {  var x = pointer  x = stack2 ( x ,  ,  , name = \"\" )  x = stack2 ( x ,  ,  , name = \"\" )  x = stack2 ( x ,  ,  , name = \"\" )  return stack2 ( x ,  ,  , stride1 =  , name = \"\" )  }  return resnet ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = true )  }","docstring":"/**\n * Instantiates the ResNet101V2 architecture as a Functional model.\n *\n * @param [imageSize] Height = width of image.\n * @param [numberOfClasses] Number of neurons in the last layer (usually, Dense layer).\n * @param [lastLayerActivation] Activation for last layer (usually, Dense layer).\n *\n * @see \n * Deep Residual Learning for Image Recognition.\n * @see \n * Detailed description of ResNet101V2 model and an approach to build it in Keras.\n */"}
{"signature":"public fun resnet152v2 ( imageSize : Long =  , numberOfClasses : Int =  , numberOfInputChannels : Long =  , lastLayerActivation : Activations = Activations . Linear , ) : Functional","body":"{  val stackFn = fun ( pointer : Layer ) : Layer {  var x = pointer  x = stack2 ( x ,  ,  , name = \"\" )  x = stack2 ( x ,  ,  , name = \"\" )  x = stack2 ( x ,  ,  , name = \"\" )  return stack2 ( x ,  ,  , stride1 =  , name = \"\" )  }  return resnet ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = true )  }","docstring":"/**\n * Instantiates the ResNet152V2 architecture as a Functional model.\n *\n * @param [imageSize] Height = width of image.\n * @param [numberOfClasses] Number of neurons in the last layer (usually, Dense layer).\n * @param [lastLayerActivation] Activation for last layer (usually, Dense layer).\n *\n * @see \n * Deep Residual Learning for Image Recognition.\n * @see \n * Detailed description of ResNet152V2 model and an approach to build it in Keras.\n */"}
{"signature":"private fun stack1 ( pointer : Layer , filters : Int , blocks : Int , stride1 : Int =  , name : String , ) : Layer","body":"{  var x = pointer  x = block1 ( x , filters , stride = stride1 , name = name + \"\" )  for ( i in  until blocks +  ) {  x = block1 ( x , filters , conv_shortcut = false , name = name + \"\" + i )  }  return x  }","docstring":"/**\n * A set of stacked residual blocks.\n *\n * @param [pointer]: input tensor.\n * @param [filters]: filters of the bottleneck layer in a block.\n * @param [blocks]: blocks in the stacked blocks.\n * @param [stride1]: default 2, stride of the first layer in the first block.\n * @param [name]: string, stack label.\n */"}
{"signature":"private fun stack2 ( pointer : Layer , filters : Int , blocks : Int , stride1 : Int =  , name : String ) : Layer","body":"{  var x = pointer  x = block2 ( x , filters , convShortcut = true , stride = stride1 , name = name + \"\" )  for ( i in  until blocks ) {  x = block2 ( x , filters , name = name + \"\" + i )  }  x = block2 ( x , filters , stride = stride1 , name = name + \"\" + blocks )  return x  }","docstring":"/**\n * A set of stacked residual blocks.\n *\n * @param [pointer]: input tensor.\n * @param [filters]: filters of the bottleneck layer in a block.\n * @param [blocks]: blocks in the stacked blocks.\n * @param [stride1]: default 2, stride of the first layer in the first block.\n * @param [name]: string, stack label.\n */"}
{"signature":"private fun Context . similarOrCloselyBoundCapturedTypes ( subType : KotlinTypeMarker ? , superType : KotlinTypeMarker ? ) : Boolean","body":"{  if ( subType == null ) return false  if ( superType == null ) return false  val subTypeLowerConstructor = subType . lowerBoundIfFlexible ( ) . typeConstructor ( )  if ( ! subTypeLowerConstructor . isCapturedTypeConstructor ( ) ) return false  if ( superType in subTypeLowerConstructor . supertypes ( ) && superType . contains { it . typeConstructor ( ) . isCapturedTypeConstructor ( ) } ) {  return true  }  return subTypeLowerConstructor == subType . upperBoundIfFlexible ( ) . typeConstructor ( ) &&  subTypeLowerConstructor == superType . lowerBoundIfFlexible ( ) . typeConstructor ( ) &&  subTypeLowerConstructor == superType . upperBoundIfFlexible ( ) . typeConstructor ( )  }","docstring":"/**\n * This function is used to determine if a resulting captured type should be approximated before returning it as a result type.\n *\n * In general, it's good not to approximate resulting captured types at all (see KT-66346).\n * Strictly speaking, such an approximation can build a type which is out of given constraints at all, e.g. (see KT-67221):\n *\n * Given CapturedType(out Generic) <: T <: Generic,\n * we can produce just Generic and break the constraint system.\n *\n * However, avoiding approximation can also have drawbacks.\n * In cases like CapturedType(out String) <: T <: String (constraint system from KT-54077),\n * we can approximate the result to String safely, and if we keep CapturedType(out String) instead,\n * we get type mismatch error later. Also, extra captured types can break diagnostics like REIFIED_TYPE_FORBIDDEN_SUBSTITUTION.\n *\n * So currently (before full KT-66346 implementation), we are doing something intermediate\n * and this function should return true if approximation is not needed.\n *\n * Currently, it does so for \"similar captured types\": it's a pair of captured-type based types like\n * CapturedType&Any..CapturedType? and CapturedType..CapturedType?.\n * Type constructors of lower/upper bound of both types should be the same captured types, to get true result here.\n *\n * Also, true is returned for \"closely bound captured types\":\n * in this case a captured [subType] is inherited from a captured-containing [superType].\n *\n * @return true for similar or closely bound [subType] and [superType] captured types, which aren't approximated after that.\n */"}
{"signature":"public fun matchEntire ( input : CharSequence ) : MatchResult ?","body":"public fun matchEntire ( input : CharSequence ) : MatchResult ?","docstring":"/**\n * Attempts to match the entire [input] CharSequence against the pattern.\n *\n * @return An instance of [MatchResult] if the entire input matches or `null` otherwise.\n */"}
{"signature":"public infix fun matches ( input : CharSequence ) : Boolean","body":"public infix fun matches ( input : CharSequence ) : Boolean","docstring":"/** Indicates whether the regular expression matches the entire [input]. */"}
{"signature":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public fun matchAt ( input : CharSequence , index : Int ) : MatchResult ?","body":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public fun matchAt ( input : CharSequence , index : Int ) : MatchResult ?","docstring":"/**\n * Attempts to match a regular expression exactly at the specified [index] in the [input] char sequence.\n *\n * Unlike [matchEntire] function, it doesn't require the match to span to the end of [input].\n *\n * @return An instance of [MatchResult] if the input matches this [Regex] at the specified [index] or `null` otherwise.\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of the [input] char sequence.\n * @sample samples.text.Regexps.matchAt\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public fun matchesAt ( input : CharSequence , index : Int ) : Boolean","body":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public fun matchesAt ( input : CharSequence , index : Int ) : Boolean","docstring":"/**\n * Checks if a regular expression matches a part of the specified [input] char sequence\n * exactly at the specified [index].\n *\n * Unlike [matches] function, it doesn't require the match to span to the end of [input].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of the [input] char sequence.\n * @sample samples.text.Regexps.matchesAt\n */"}
{"signature":"public fun containsMatchIn ( input : CharSequence ) : Boolean","body":"public fun containsMatchIn ( input : CharSequence ) : Boolean","docstring":"/** Indicates whether the regular expression can find at least one match in the specified [input]. */"}
{"signature":"public fun replace ( input : CharSequence , replacement : String ) : String","body":"public fun replace ( input : CharSequence , replacement : String ) : String","docstring":"/**\n * Replaces all occurrences of this regular expression in the specified [input] string with specified [replacement] expression.\n *\n * The replacement string may contain references to the captured groups during a match. Occurrences of `${name}` or `$index`\n * in the replacement string will be substituted with the subsequences corresponding to the captured groups with the specified name or index.\n * In case of `$index`, the first digit after '$' is always treated as a part of group reference. Subsequent digits are incorporated\n * into `index` only if they would form a valid group reference. Only the digits '0'..'9' are considered as potential components\n * of the group reference. Note that indexes of captured groups start from 1, and the group with index 0 is the whole match.\n * In case of `${name}`, the `name` can consist of latin letters 'a'..'z' and 'A'..'Z', or digits '0'..'9'. The first character must be\n * a letter.\n *\n * Backslash character '\\' can be used to include the succeeding character as a literal in the replacement string, e.g, `\\$` or `\\\\`.\n * [Regex.escapeReplacement] can be used if [replacement] have to be treated as a literal string.\n *\n * @param input the char sequence to find matches of this regular expression in\n * @param replacement the expression to replace found matches with\n * @return the result of replacing each occurrence of this regular expression in [input] with the result of evaluating the [replacement] expression\n * @throws RuntimeException if [replacement] expression is malformed, or capturing group with specified `name` or `index` does not exist\n */"}
{"signature":"public fun replace ( input : CharSequence , transform : ( MatchResult ) -> CharSequence ) : String","body":"public fun replace ( input : CharSequence , transform : ( MatchResult ) -> CharSequence ) : String","docstring":"/**\n * Replaces all occurrences of this regular expression in the specified [input] string with the result of\n * the given function [transform] that takes [MatchResult] and returns a string to be used as a\n * replacement for that match.\n */"}
{"signature":"public fun replaceFirst ( input : CharSequence , replacement : String ) : String","body":"public fun replaceFirst ( input : CharSequence , replacement : String ) : String","docstring":"/**\n * Replaces the first occurrence of this regular expression in the specified [input] string with specified [replacement] expression.\n *\n * The replacement string may contain references to the captured groups during a match. Occurrences of `${name}` or `$index`\n * in the replacement string will be substituted with the subsequences corresponding to the captured groups with the specified name or index.\n * In case of `$index`, the first digit after '$' is always treated as a part of group reference. Subsequent digits are incorporated\n * into `index` only if they would form a valid group reference. Only the digits '0'..'9' are considered as potential components\n * of the group reference. Note that indexes of captured groups start from 1, and the group with index 0 is the whole match.\n * In case of `${name}`, the `name` can consist of latin letters 'a'..'z' and 'A'..'Z', or digits '0'..'9'. The first character must be\n * a letter.\n *\n * Backslash character '\\' can be used to include the succeeding character as a literal in the replacement string, e.g, `\\$` or `\\\\`.\n * [Regex.escapeReplacement] can be used if [replacement] have to be treated as a literal string.\n *\n * @param input the char sequence to find a match of this regular expression in\n * @param replacement the expression to replace the found match with\n * @return the result of replacing the first occurrence of this regular expression in [input] with the result of evaluating the [replacement] expression\n * @throws RuntimeException if [replacement] expression is malformed, or capturing group with specified `name` or `index` does not exist\n */"}
{"signature":"public fun find ( input : CharSequence , startIndex : Int =  ) : MatchResult ?","body":"public fun find ( input : CharSequence , startIndex : Int =  ) : MatchResult ?","docstring":"/**\n * Returns the first match of a regular expression in the [input], beginning at the specified [startIndex].\n *\n * @param startIndex An index to start search with, by default 0. Must be not less than zero and not greater than `input.length()`\n * @return An instance of [MatchResult] if match was found or `null` otherwise.\n * @throws IndexOutOfBoundsException if [startIndex] is less than zero or greater than the length of the [input] char sequence.\n * @sample samples.text.Regexps.find\n */"}
{"signature":"public fun findAll ( input : CharSequence , startIndex : Int =  ) : Sequence < MatchResult >","body":"public fun findAll ( input : CharSequence , startIndex : Int =  ) : Sequence < MatchResult >","docstring":"/**\n * Returns a sequence of all occurrences of a regular expression within the [input] string, beginning at the specified [startIndex].\n *\n * @throws IndexOutOfBoundsException if [startIndex] is less than zero or greater than the length of the [input] char sequence.\n *\n * @sample samples.text.Regexps.findAll\n */"}
{"signature":"public fun split ( input : CharSequence , limit : Int =  ) : List < String >","body":"public fun split ( input : CharSequence , limit : Int =  ) : List < String >","docstring":"/**\n * Splits the [input] CharSequence to a list of strings around matches of this regular expression.\n *\n * @param limit Non-negative value specifying the maximum number of substrings the string can be split to.\n * Zero by default means no limit is set.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public fun splitToSequence ( input : CharSequence , limit : Int =  ) : Sequence < String >","body":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public fun splitToSequence ( input : CharSequence , limit : Int =  ) : Sequence < String >","docstring":"/**\n * Splits the [input] CharSequence to a sequence of strings around matches of this regular expression.\n *\n * @param limit Non-negative value specifying the maximum number of substrings the string can be split to.\n * Zero by default means no limit is set.\n * @sample samples.text.Regexps.splitToSequence\n */"}
{"signature":"public fun fromLiteral ( literal : String ) : Regex","body":"public fun fromLiteral ( literal : String ) : Regex","docstring":"/**\n * Returns a regular expression that matches the specified [literal] string literally.\n * No characters of that string will have special meaning when searching for an occurrence of the regular expression.\n */"}
{"signature":"public fun escape ( literal : String ) : String","body":"public fun escape ( literal : String ) : String","docstring":"/**\n * Returns a regular expression pattern string that matches the specified [literal] string literally.\n * No characters of that string will have special meaning when searching for an occurrence of the regular expression.\n */"}
{"signature":"public fun escapeReplacement ( literal : String ) : String","body":"public fun escapeReplacement ( literal : String ) : String","docstring":"/**\n * Returns a literal replacement expression for the specified [literal] string.\n * No characters of that string will have special meaning when it is used as a replacement string in [Regex.replace] function.\n */"}
{"signature":"public expect fun Char . isHighSurrogate ( ) : Boolean","body":"public expect fun Char . isHighSurrogate ( ) : Boolean","docstring":"/**\n * Returns `true` if this character is a Unicode high-surrogate code unit (also known as leading-surrogate code unit).\n */"}
{"signature":"public expect fun Char . isLowSurrogate ( ) : Boolean","body":"public expect fun Char . isLowSurrogate ( ) : Boolean","docstring":"/**\n * Returns `true` if this character is a Unicode low-surrogate code unit (also known as trailing-surrogate code unit).\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ Deprecated ( \"\" , ReplaceWith ( \"\" ) )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" )  public expect fun String ( chars : CharArray ) : String","body":"@ SinceKotlin ( \"\" )  @ Deprecated ( \"\" , ReplaceWith ( \"\" ) )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" )  public expect fun String ( chars : CharArray ) : String","docstring":"/**\n * Converts the characters in the specified array to a string.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ Deprecated ( \"\" , ReplaceWith ( \"\" ) )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" )  public expect fun String ( chars : CharArray , offset : Int , length : Int ) : String","body":"@ SinceKotlin ( \"\" )  @ Deprecated ( \"\" , ReplaceWith ( \"\" ) )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" )  public expect fun String ( chars : CharArray , offset : Int , length : Int ) : String","docstring":"/**\n * Converts the characters from a portion of the specified array to a string.\n *\n * @throws IndexOutOfBoundsException if either [offset] or [length] are less than zero\n * or `offset + length` is out of [chars] array bounds.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun CharArray . concatToString ( ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun CharArray . concatToString ( ) : String","docstring":"/**\n * Concatenates characters in this [CharArray] into a String.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun CharArray . concatToString ( startIndex : Int =  , endIndex : Int = this . size ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun CharArray . concatToString ( startIndex : Int =  , endIndex : Int = this . size ) : String","docstring":"/**\n * Concatenates characters in this [CharArray] or its subrange into a String.\n *\n * @param startIndex the beginning (inclusive) of the subrange of characters, 0 by default.\n * @param endIndex the end (exclusive) of the subrange of characters, size of this array by default.\n *\n * @throws IndexOutOfBoundsException if [startIndex] is less than zero or [endIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [startIndex] is greater than [endIndex].\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String . toCharArray ( ) : CharArray","body":"@ SinceKotlin ( \"\" )  public expect fun String . toCharArray ( ) : CharArray","docstring":"/**\n * Returns a [CharArray] containing characters of this string.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String . toCharArray ( startIndex : Int =  , endIndex : Int = this . length ) : CharArray","body":"@ SinceKotlin ( \"\" )  public expect fun String . toCharArray ( startIndex : Int =  , endIndex : Int = this . length ) : CharArray","docstring":"/**\n * Returns a [CharArray] containing characters of this string or its substring.\n *\n * @param startIndex the beginning (inclusive) of the substring, 0 by default.\n * @param endIndex the end (exclusive) of the substring, length of this string by default.\n *\n * @throws IndexOutOfBoundsException if [startIndex] is less than zero or [endIndex] is greater than the length of this string.\n * @throws IllegalArgumentException if [startIndex] is greater than [endIndex].\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String . toCharArray ( destination : CharArray , destinationOffset : Int =  , startIndex : Int =  , endIndex : Int = length ) : CharArray","body":"@ SinceKotlin ( \"\" )  public expect fun String . toCharArray ( destination : CharArray , destinationOffset : Int =  , startIndex : Int =  , endIndex : Int = length ) : CharArray","docstring":"/**\n * Copies characters from this string into the [destination] character array and returns that array.\n *\n * @param destination the array to copy to.\n * @param destinationOffset the position in the array to copy to.\n * @param startIndex the start offset (inclusive) of the substring to copy.\n * @param endIndex the end offset (exclusive) of the substring to copy.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this string builder indices or when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException when the subrange doesn't fit into the [destination] array starting at the specified [destinationOffset],\n * or when that index is out of the [destination] array indices range.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ByteArray . decodeToString ( ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun ByteArray . decodeToString ( ) : String","docstring":"/**\n * Decodes a string from the bytes in UTF-8 encoding in this array.\n *\n * Malformed byte sequences are replaced by the replacement char `\\uFFFD`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ByteArray . decodeToString ( startIndex : Int =  , endIndex : Int = this . size , throwOnInvalidSequence : Boolean = false ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun ByteArray . decodeToString ( startIndex : Int =  , endIndex : Int = this . size , throwOnInvalidSequence : Boolean = false ) : String","docstring":"/**\n * Decodes a string from the bytes in UTF-8 encoding in this array or its subrange.\n *\n * @param startIndex the beginning (inclusive) of the subrange to decode, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to decode, size of this array by default.\n * @param throwOnInvalidSequence specifies whether to throw an exception on malformed byte sequence or replace it by the replacement char `\\uFFFD`.\n *\n * @throws IndexOutOfBoundsException if [startIndex] is less than zero or [endIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [startIndex] is greater than [endIndex].\n * @throws CharacterCodingException if the byte array contains malformed UTF-8 byte sequence and [throwOnInvalidSequence] is true.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String . encodeToByteArray ( ) : ByteArray","body":"@ SinceKotlin ( \"\" )  public expect fun String . encodeToByteArray ( ) : ByteArray","docstring":"/**\n * Encodes this string to an array of bytes in UTF-8 encoding.\n *\n * Any malformed char sequence is replaced by the replacement byte sequence.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String . encodeToByteArray ( startIndex : Int =  , endIndex : Int = this . length , throwOnInvalidSequence : Boolean = false ) : ByteArray","body":"@ SinceKotlin ( \"\" )  public expect fun String . encodeToByteArray ( startIndex : Int =  , endIndex : Int = this . length , throwOnInvalidSequence : Boolean = false ) : ByteArray","docstring":"/**\n * Encodes this string or its substring to an array of bytes in UTF-8 encoding.\n *\n * @param startIndex the beginning (inclusive) of the substring to encode, 0 by default.\n * @param endIndex the end (exclusive) of the substring to encode, length of this string by default.\n * @param throwOnInvalidSequence specifies whether to throw an exception on malformed char sequence or replace.\n *\n * @throws IndexOutOfBoundsException if [startIndex] is less than zero or [endIndex] is greater than the length of this string.\n * @throws IllegalArgumentException if [startIndex] is greater than [endIndex].\n * @throws CharacterCodingException if this string contains malformed char sequence and [throwOnInvalidSequence] is true.\n */"}
{"signature":"public expect fun CharSequence . repeat ( n : Int ) : String","body":"public expect fun CharSequence . repeat ( n : Int ) : String","docstring":"/**\n * Returns a string containing this char sequence repeated [n] times.\n * @throws [IllegalArgumentException] when n < 0.\n * @sample samples.text.Strings.repeat\n */"}
{"signature":"public expect fun String . replace ( oldChar : Char , newChar : Char , ignoreCase : Boolean = false ) : String","body":"public expect fun String . replace ( oldChar : Char , newChar : Char , ignoreCase : Boolean = false ) : String","docstring":"/**\n * Returns a new string with all occurrences of [oldChar] replaced with [newChar].\n * \n * @sample samples.text.Strings.replace\n */"}
{"signature":"public expect fun String . replace ( oldValue : String , newValue : String , ignoreCase : Boolean = false ) : String","body":"public expect fun String . replace ( oldValue : String , newValue : String , ignoreCase : Boolean = false ) : String","docstring":"/**\n * Returns a new string obtained by replacing all occurrences of the [oldValue] substring in this string\n * with the specified [newValue] string.\n *\n * @sample samples.text.Strings.replace\n */"}
{"signature":"public expect fun String . replaceFirst ( oldChar : Char , newChar : Char , ignoreCase : Boolean = false ) : String","body":"public expect fun String . replaceFirst ( oldChar : Char , newChar : Char , ignoreCase : Boolean = false ) : String","docstring":"/**\n * Returns a new string with the first occurrence of [oldChar] replaced with [newChar].\n */"}
{"signature":"public expect fun String . replaceFirst ( oldValue : String , newValue : String , ignoreCase : Boolean = false ) : String","body":"public expect fun String . replaceFirst ( oldValue : String , newValue : String , ignoreCase : Boolean = false ) : String","docstring":"/**\n * Returns a new string obtained by replacing the first occurrence of the [oldValue] substring in this string\n * with the specified [newValue] string.\n */"}
{"signature":"public expect fun String ? . equals ( other : String ? , ignoreCase : Boolean = false ) : Boolean","body":"public expect fun String ? . equals ( other : String ? , ignoreCase : Boolean = false ) : Boolean","docstring":"/**\n * Returns `true` if this string is equal to [other], optionally ignoring character case.\n *\n * Two strings are considered to be equal if they have the same length and the same character at the same index.\n * If [ignoreCase] is true, the result of `Char.uppercaseChar().lowercaseChar()` on each character is compared.\n *\n * @param ignoreCase `true` to ignore character case when comparing strings. By default `false`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String . compareTo ( other : String , ignoreCase : Boolean = false ) : Int","body":"@ SinceKotlin ( \"\" )  public expect fun String . compareTo ( other : String , ignoreCase : Boolean = false ) : Int","docstring":"/**\n * Compares two strings lexicographically, optionally ignoring case differences.\n *\n * If [ignoreCase] is true, the result of `Char.uppercaseChar().lowercaseChar()` on each character is compared.\n */"}
{"signature":"public expect fun CharSequence . regionMatches ( thisOffset : Int , other : CharSequence , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","body":"public expect fun CharSequence . regionMatches ( thisOffset : Int , other : CharSequence , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","docstring":"/**\n * Returns `true` if the specified range in this char sequence is equal to the specified range in another char sequence.\n * @param thisOffset the start offset in this char sequence of the substring to compare.\n * @param other the string against a substring of which the comparison is performed.\n * @param otherOffset the start offset in the other char sequence of the substring to compare.\n * @param length the length of the substring to compare.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String . regionMatches ( thisOffset : Int , other : String , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","body":"@ SinceKotlin ( \"\" )  public expect fun String . regionMatches ( thisOffset : Int , other : String , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","docstring":"/**\n * Returns `true` if the specified range in this string is equal to the specified range in another string.\n * @param thisOffset the start offset in this string of the substring to compare.\n * @param other the string against a substring of which the comparison is performed.\n * @param otherOffset the start offset in the other string of the substring to compare.\n * @param length the length of the substring to compare.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun String ? . toBoolean ( ) : Boolean","body":"@ SinceKotlin ( \"\" )  public expect fun String ? . toBoolean ( ) : Boolean","docstring":"/**\n * Returns `true` if this string is not `null` and its content is equal to the word \"true\", ignoring case, and `false` otherwise.\n *\n * There are also strict versions of the function available on non-nullable String, [toBooleanStrict] and [toBooleanStrictOrNull].\n */"}
{"signature":"public expect fun String . toByte ( ) : Byte","body":"public expect fun String . toByte ( ) : Byte","docstring":"/**\n * Parses the string as a signed [Byte] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"}
{"signature":"public expect fun String . toByte ( radix : Int ) : Byte","body":"public expect fun String . toByte ( radix : Int ) : Byte","docstring":"/**\n * Parses the string as a signed [Byte] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"}
{"signature":"public expect fun String . toShort ( ) : Short","body":"public expect fun String . toShort ( ) : Short","docstring":"/**\n * Parses the string as a [Short] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"}
{"signature":"public expect fun String . toShort ( radix : Int ) : Short","body":"public expect fun String . toShort ( radix : Int ) : Short","docstring":"/**\n * Parses the string as a [Short] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"}
{"signature":"public expect fun String . toInt ( ) : Int","body":"public expect fun String . toInt ( ) : Int","docstring":"/**\n * Parses the string as an [Int] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"}
{"signature":"public expect fun String . toInt ( radix : Int ) : Int","body":"public expect fun String . toInt ( radix : Int ) : Int","docstring":"/**\n * Parses the string as an [Int] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"}
{"signature":"public expect fun String . toLong ( ) : Long","body":"public expect fun String . toLong ( ) : Long","docstring":"/**\n * Parses the string as a [Long] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"}
{"signature":"public expect fun String . toLong ( radix : Int ) : Long","body":"public expect fun String . toLong ( radix : Int ) : Long","docstring":"/**\n * Parses the string as a [Long] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"}
{"signature":"public expect fun String . toDouble ( ) : Double","body":"public expect fun String . toDouble ( ) : Double","docstring":"/**\n * Parses the string as a [Double] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"}
{"signature":"public expect fun String . toFloat ( ) : Float","body":"public expect fun String . toFloat ( ) : Float","docstring":"/**\n * Parses the string as a [Float] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"}
{"signature":"public expect fun String . toDoubleOrNull ( ) : Double ?","body":"public expect fun String . toDoubleOrNull ( ) : Double ?","docstring":"/**\n * Parses the string as a [Double] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"}
{"signature":"public expect fun String . toFloatOrNull ( ) : Float ?","body":"public expect fun String . toFloatOrNull ( ) : Float ?","docstring":"/**\n * Parses the string as a [Float] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Byte . toString ( radix : Int ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun Byte . toString ( radix : Int ) : String","docstring":"/**\n * Returns a string representation of this [Byte] value in the specified [radix].\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for number to string conversion.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Short . toString ( radix : Int ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun Short . toString ( radix : Int ) : String","docstring":"/**\n * Returns a string representation of this [Short] value in the specified [radix].\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for number to string conversion.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Int . toString ( radix : Int ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun Int . toString ( radix : Int ) : String","docstring":"/**\n * Returns a string representation of this [Int] value in the specified [radix].\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for number to string conversion.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Long . toString ( radix : Int ) : String","body":"@ SinceKotlin ( \"\" )  public expect fun Long . toString ( radix : Int ) : String","docstring":"/**\n * Returns a string representation of this [Long] value in the specified [radix].\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for number to string conversion.\n */"}
{"signature":"fun saveClassToCache ( kotlinClassInfo : KotlinClassInfo , sourceFiles : List < File > ? , changesCollector : ChangesCollector )","body":"{  val className = kotlinClassInfo . className  dirtyOutputClassesMap . notDirty ( className )  if ( sourceFiles != null ) {  sourceFiles . forEach {  sourceToClassesMap . append ( it , className )  }  if ( ! icContext . useCompilerMapsOnly ) internalNameToSource [ className . internalName ] = sourceFiles  }  if ( kotlinClassInfo . classId . isLocal ) return  when ( kotlinClassInfo . classKind ) {  KotlinClassHeader . Kind . FILE_FACADE -> {  if ( sourceFiles != null ) {  assert ( sourceFiles . size ==  ) { \"\" }  }  packagePartMap . addPackagePart ( className )  protoMap . process ( kotlinClassInfo , changesCollector )  if ( ! icContext . useCompilerMapsOnly ) {  constantsMap . process ( kotlinClassInfo , changesCollector )  inlineFunctionsMap . process ( kotlinClassInfo , changesCollector )  }  }  KotlinClassHeader . Kind . MULTIFILE_CLASS -> {  val partNames = kotlinClassInfo . classHeaderData . toList ( )  check ( partNames . isNotEmpty ( ) ) { \"\" }  multifileFacadeToParts [ className ] = partNames  if ( className in protoMap ) {  changesCollector . collectSignature ( className . fqNameForClassNameWithoutDollars , areSubclassesAffected = true )  }  protoMap . remove ( className , changesCollector )  classFqNameToSourceMap . remove ( className . fqNameForClassNameWithoutDollars )  if ( ! icContext . useCompilerMapsOnly ) {  classAttributesMap . remove ( className . fqNameForClassNameWithoutDollars )  internalNameToSource . remove ( className . internalName )  constantsMap . process ( kotlinClassInfo , changesCollector )  inlineFunctionsMap . process ( kotlinClassInfo , changesCollector )  }  }  KotlinClassHeader . Kind . MULTIFILE_CLASS_PART -> {  if ( sourceFiles != null ) {  assert ( sourceFiles . size ==  ) { \"\" }  }  packagePartMap . addPackagePart ( className )  partToMultifileFacade [ className ] = kotlinClassInfo . multifileClassName ! !  protoMap . process ( kotlinClassInfo , changesCollector )  if ( ! icContext . useCompilerMapsOnly ) {  constantsMap . process ( kotlinClassInfo , changesCollector )  inlineFunctionsMap . process ( kotlinClassInfo , changesCollector )  }  }  KotlinClassHeader . Kind . CLASS -> {  if ( ! icContext . useCompilerMapsOnly ) {  addToClassStorage ( kotlinClassInfo . protoData as ClassProtoData , sourceFiles ? . let { sourceFiles . single ( ) } )  }  protoMap . process ( kotlinClassInfo , changesCollector )  if ( ! icContext . useCompilerMapsOnly ) {  constantsMap . process ( kotlinClassInfo , changesCollector )  inlineFunctionsMap . process ( kotlinClassInfo , changesCollector )  }  }  KotlinClassHeader . Kind . UNKNOWN , KotlinClassHeader . Kind . SYNTHETIC_CLASS -> {  }  }  }","docstring":"/**\n * Saves information about the given (Kotlin) class to this cache, and stores changes between this class and its previous version into\n * the given [ChangesCollector].\n *\n * @param kotlinClassInfo Information about a Kotlin class\n * @param sourceFiles The source files that the given class was generated from, or `null` if this information is not available\n * @param changesCollector A [ChangesCollector]\n */"}
{"signature":"public fun disable ( )","body":"public fun disable ( )","docstring":"/**\n *\n */"}
{"signature":"public fun useJacoco ( )","body":"public fun useJacoco ( )","docstring":"/**\n * Use [JaCoCo](https://www.jacoco.org/jacoco/) as coverage tool with version [JACOCO_TOOL_DEFAULT_VERSION] for measure coverage and generate reports.\n */"}
{"signature":"public fun useJacoco ( version : String )","body":"public fun useJacoco ( version : String )","docstring":"/**\n * Use [JaCoCo](https://www.jacoco.org/jacoco/) as coverage tool with version [version] for measure coverage and generate reports.\n */"}
{"signature":"public fun currentProject ( block : Action < KoverCurrentProjectVariantsConfig > )","body":"public fun currentProject ( block : Action < KoverCurrentProjectVariantsConfig > )","docstring":"/**\n * Customize report variants shared by the current project.\n *\n * A report variant is a set of information used to generate a reports, namely:\n * project classes, a list of Gradle test tasks, classes that need to be excluded from instrumentation.\n *\n * ```\n * currentProject {\n * // create report variant with custom name,\n * // in which it is acceptable to add information from other variants of the current project, as well as `kover` dependencies\n * createVariant(\"custom\") {\n * // ...\n * }\n *\n * // Configure the variant that is automatically created in the current project\n * // For example, \"jvm\" for JVM target or \"debug\" for Android build variant\n * providedVariant(\"jvm\") {\n * // ...\n * }\n *\n * // Configure the variant for all the code that is available in the current project.\n * // This variant always exists for any type of project.\n * totalVariant {\n * // ...\n * }\n * }\n * ```\n */"}
{"signature":"public fun reports ( block : Action < KoverReportsConfig > )","body":"public fun reports ( block : Action < KoverReportsConfig > )","docstring":"/**\n * Configuration of Kover reports.\n *\n * An individual set of reports is created for each Kover report variant.\n * All these sets can be configured independently of each other.\n *\n * The main difference between the reports sets and the report variants is that the reports are individual for each project, the settings of reports in different projects do not affect each other in any way.\n * At the same time, changing a report variant affects all reports that are based on it, for example, if several projects import a variant through a dependency `kover(project(\":subproject\"))`.\n *\n * Example of usage:\n * ```\n * kover {\n * reports {\n * filters {\n * // common filters for all reports of all variants\n * }\n * verify {\n * // common verification rules for all variants\n * }\n *\n * /*\n * Total reports set - special reports for all code of current project and it's kover dependencies.\n * These are the reports for total variant of current project and it's kover dependencies.\n * */\n * total {\n * // config\n * }\n *\n * /*\n * Configure custom reports set with name \"custom\".\n * These are the reports for variant \"custom\" of current project and it's kover dependencies.\n * */\n * variant(\"custom\") {\n * }\n * }\n * }\n * ```\n */"}
{"signature":"public fun merge ( block : Action < KoverMergingConfig > )","body":"public fun merge ( block : Action < KoverMergingConfig > )","docstring":"/**\n * Configuring a merged report.\n *\n * **Attention! Usage of this block breaks project isolation and is incompatible with the configuration cache!**\n * If you need configuration cache support, please explicitly configure Kover plugin in each project using [currentProject] blocks.\n *\n * Used as a shortcut for group configuration of the plugin in several projects and merging reports.\n * If you specify this block without additional commands\n * ```\n * kover {\n * merge {\n * }\n * }\n * ```\n * it will be equivalent to this code\n * ```\n * val thisProject = project\n * subprojects {\n * apply(\"org.jetbrains.kotlinx.kover\")\n * thisProject.dependencies.add(\"kover\", this)\n *\n * // apply values from `useJacoco` and `jacocoVersion`\n * }\n * ```\n * As a result, a merged report will be created in the project in which this `merge` block was called (merging project).\n *\n * It is acceptable to limit the projects in which the configuration will take place by adding filters:\n * ```\n * kover {\n * merge {\n * subprojects {\n * it.name != \"uncovered\"\n * }\n * }\n * }\n * ```\n * This way Kover plugin will not be applied in a project named `uncovered`.\n *\n * If you specify several filters, Kover plugin will be applied in the project if at least one of these filters will return `true`.\n *\n *\n * Full list of functions:\n * ```\n * kover {\n * merge {\n * // include all subprojects\n * subprojects()\n *\n * // include subprojects that have passed the filter\n * subprojects {\n * // filter predicate\n * }\n *\n * // include all projects of the build\n * allProjects()\n *\n * // include all projects of the build that have passed the filter\n * allProjects {\n * // filter predicate\n * }\n *\n * // include projects by name or path\n * projects(\"project-name\", \":\")\n *\n * sources {\n * // set up sources for all variants of all included projects\n * }\n *\n * instrumentation {\n * // set up instrumentation for all variants of all included projects\n * }\n *\n * createVariant(\"variantName\") {\n * // create custom variant\n * }\n * }\n * }\n * ```\n */"}
{"signature":"fun joinFlow ( flows : Collection < PersistentFlow > , statementFlows : Collection < PersistentFlow > , union : Boolean ) : MutableFlow","body":"{  when ( flows . size ) {   -> return MutableFlow ( )   -> return flows . first ( ) . fork ( )  }  val commonFlow = flows . reduce { a , b -> a . lowestCommonAncestor ( b ) ? : error ( \"\" ) }  val result = commonFlow . fork ( )  result . mergeAssignments ( flows )  if ( union ) {  result . copyNonConflictingAliases ( flows , commonFlow )  } else {  result . copyCommonAliases ( flows )  }  result . copyStatements ( statementFlows , commonFlow , union )  result . copyImplications ( statementFlows )  return result  }","docstring":"/**\n * Creates the next [Flow] by joining a set of previous [Flow]s.\n *\n * @param flows All [PersistentFlow]s which flow into the join flow. These will determine assignments and variable aliases for the\n * resulting join flow.\n * @param statementFlows A *subset* of [flows] used to determine what [TypeStatement]s and [Implication]s will be copied to the joined\n * flow.\n * @param union Determines if [TypeStatement]s from different flows should be combined with union or intersection logic.\n */"}
{"signature":"public fun < T > createValueColumn ( name : String , values : List < T > , type : KType , infer : Infer = Infer . None , defaultValue : T ? = null , ) : ValueColumn < T >","body":"= ValueColumnImpl ( values , name , getValuesType ( values , type , infer ) , defaultValue )","docstring":"/**\n * Creates [ValueColumn] using given [name], [values] and [type].\n *\n * @param name name of the column\n * @param values list of column values\n * @param type type of the column\n * @param infer column type inference mode\n */"}
{"signature":"public inline fun < reified T > createValueColumn ( name : String , values : List < T > , infer : Infer = Infer . None , ) : ValueColumn < T >","body":"= createValueColumn ( name , values , getValuesType ( values , typeOf < T > ( ) , infer ) )","docstring":"/**\n * Creates [ValueColumn] using given [name], [values] and reified column [type].\n *\n * Note, that column [type] will be defined at compile-time using [T] argument\n *\n * @param T type of the column\n * @param name name of the column\n * @param values list of column values\n * @param infer column type inference mode\n */"}
{"signature":"fun getQualifiedClassName ( index : Int ) : String","body":"fun getQualifiedClassName ( index : Int ) : String","docstring":"/**\n * @return the fully qualified name of some class in the format: `org/foo/bar/Test.Inner`\n */"}
{"signature":"private fun ControlFlowGraph . contains ( firCandidates : Set < FirElement > ) : Boolean","body":"{  for ( node in nodes ) {  if ( node . fir in firCandidates ) {  return true  }  if ( node is CFGNodeWithSubgraphs < * > && node . subGraphs . any { it . contains ( firCandidates ) } ) {  return true  }  }  return false  }","docstring":"/**\n * Returns `true` if the control graph contains at least one of the [firCandidates].\n */"}
{"signature":"fun findLast ( fir : FirElement ) : CFGNode < * > ?","body":"{  val directNodes = mapping [ fir ]  if ( directNodes != null ) {  return directNodes . last ( )  }  if ( fir is FirBlock ) {  return fir . statements  . asReversed ( )  . firstNotNullOfOrNull ( :: findLast )  }  return null  }","docstring":"/**\n * Find the last node in a graph (or its subgraphs) that point to the given [fir] element.\n */"}
{"signature":"internal fun processEvent ( marker : Any )","body":"{  check ( marker is Runnable )  marker . run ( )  }","docstring":"/** Notifies the dispatcher that it should process a single event marked with [marker] happening at time [time]. */"}
{"signature":"override fun scheduleResumeAfterDelay ( timeMillis : Long , continuation : CancellableContinuation < Unit > )","body":"{  val timedRunnable = CancellableContinuationRunnable ( continuation , this )  val handle = scheduler . registerEvent ( this , timeMillis , timedRunnable , continuation . context , :: cancellableRunnableIsCancelled )  continuation . disposeOnCancellation ( handle )  }","docstring":"/** @suppress */"}
{"signature":"override fun invokeOnTimeout ( timeMillis : Long , block : Runnable , context : CoroutineContext ) : DisposableHandle","body":"=  scheduler . registerEvent ( this , timeMillis , block , context ) { false }","docstring":"/** @suppress */"}
{"signature":"@ Suppress ( \"\" )  @ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN )  public override fun timeoutMessage ( timeout : Duration ) : String","body":"=  \"\" +  \"\"","docstring":"/** @suppress */"}
{"signature":"public operator fun < T > java . util . Enumeration < T > . iterator ( ) : Iterator < T >","body":"= object : Iterator < T > {  override fun hasNext ( ) : Boolean = hasMoreElements ( )  public override fun next ( ) : T = nextElement ( )  }","docstring":"/**\n * Creates an [Iterator] for an [java.util.Enumeration], allowing to use it in `for` loops.\n * @sample samples.collections.Iterators.iteratorForEnumeration\n */"}
{"signature":"@ Composable  public fun FlowRow ( modifier : Modifier = Modifier , mainAxisSize : SizeMode = SizeMode . Wrap , mainAxisAlignment : FlowMainAxisAlignment = FlowMainAxisAlignment . Start , mainAxisSpacing : Dp =  . dp , crossAxisAlignment : FlowCrossAxisAlignment = FlowCrossAxisAlignment . Start , crossAxisSpacing : Dp =  . dp , lastLineMainAxisAlignment : FlowMainAxisAlignment = mainAxisAlignment , content : @ Composable ( ) -> Unit )","body":"{  Flow ( modifier = modifier , orientation = LayoutOrientation . Horizontal , mainAxisSize = mainAxisSize , mainAxisAlignment = mainAxisAlignment , mainAxisSpacing = mainAxisSpacing , crossAxisAlignment = crossAxisAlignment , crossAxisSpacing = crossAxisSpacing , lastLineMainAxisAlignment = lastLineMainAxisAlignment , content = content )  }","docstring":"/**\n * A composable that places its children in a horizontal flow. Unlike [Row], if the\n * horizontal space is too small to put all the children in one row, multiple rows may be used.\n *\n * Note that just like [Row], flex values cannot be used with [FlowRow].\n *\n * @param modifier The modifier to be applied to the FlowRow.\n * @param mainAxisSize The size of the layout in the main axis direction.\n * @param mainAxisAlignment The alignment of each row's children in the main axis direction.\n * @param mainAxisSpacing The main axis spacing between the children of each row.\n * @param crossAxisAlignment The alignment of each row's children in the cross axis direction.\n * @param crossAxisSpacing The cross axis spacing between the rows of the layout.\n * @param lastLineMainAxisAlignment Overrides the main axis alignment of the last row.\n */"}
{"signature":"@ Composable  public fun FlowColumn ( modifier : Modifier = Modifier , mainAxisSize : SizeMode = SizeMode . Wrap , mainAxisAlignment : FlowMainAxisAlignment = FlowMainAxisAlignment . Start , mainAxisSpacing : Dp =  . dp , crossAxisAlignment : FlowCrossAxisAlignment = FlowCrossAxisAlignment . Start , crossAxisSpacing : Dp =  . dp , lastLineMainAxisAlignment : FlowMainAxisAlignment = mainAxisAlignment , content : @ Composable ( ) -> Unit )","body":"{  Flow ( modifier = modifier , orientation = LayoutOrientation . Vertical , mainAxisSize = mainAxisSize , mainAxisAlignment = mainAxisAlignment , mainAxisSpacing = mainAxisSpacing , crossAxisAlignment = crossAxisAlignment , crossAxisSpacing = crossAxisSpacing , lastLineMainAxisAlignment = lastLineMainAxisAlignment , content = content )  }","docstring":"/**\n * A composable that places its children in a vertical flow. Unlike [Column], if the\n * vertical space is too small to put all the children in one column, multiple columns may be used.\n *\n * Note that just like [Column], flex values cannot be used with [FlowColumn].\n *\n * @param modifier The modifier to be applied to the FlowColumn.\n * @param mainAxisSize The size of the layout in the main axis direction.\n * @param mainAxisAlignment The alignment of each column's children in the main axis direction.\n * @param mainAxisSpacing The main axis spacing between the children of each column.\n * @param crossAxisAlignment The alignment of each column's children in the cross axis direction.\n * @param crossAxisSpacing The cross axis spacing between the columns of the layout.\n * @param lastLineMainAxisAlignment Overrides the main axis alignment of the last column.\n */"}
{"signature":"@ Composable  private fun Flow ( modifier : Modifier , orientation : LayoutOrientation , mainAxisSize : SizeMode , mainAxisAlignment : FlowMainAxisAlignment , mainAxisSpacing : Dp , crossAxisAlignment : FlowCrossAxisAlignment , crossAxisSpacing : Dp , lastLineMainAxisAlignment : FlowMainAxisAlignment , content : @ Composable ( ) -> Unit )","body":"{  fun Placeable . mainAxisSize ( ) =  if ( orientation == LayoutOrientation . Horizontal ) width else height  fun Placeable . crossAxisSize ( ) =  if ( orientation == LayoutOrientation . Horizontal ) height else width  Layout ( content , modifier ) { measurables , outerConstraints ->  val sequences = mutableListOf < List < Placeable > > ( )  val crossAxisSizes = mutableListOf < Int > ( )  val crossAxisPositions = mutableListOf < Int > ( )  var mainAxisSpace =   var crossAxisSpace =   val currentSequence = mutableListOf < Placeable > ( )  var currentMainAxisSize =   var currentCrossAxisSize =   val constraints = OrientationIndependentConstraints ( outerConstraints , orientation )  val childConstraints = if ( orientation == LayoutOrientation . Horizontal ) {  Constraints ( maxWidth = constraints . mainAxisMax )  } else {  Constraints ( maxHeight = constraints . mainAxisMax )  }  fun canAddToCurrentSequence ( placeable : Placeable ) =  currentSequence . isEmpty ( ) || currentMainAxisSize + mainAxisSpacing . roundToPx ( ) +  placeable . mainAxisSize ( ) <= constraints . mainAxisMax  fun startNewSequence ( ) {  if ( sequences . isNotEmpty ( ) ) {  crossAxisSpace += crossAxisSpacing . roundToPx ( )  }  sequences += currentSequence . toList ( )  crossAxisSizes += currentCrossAxisSize  crossAxisPositions += crossAxisSpace  crossAxisSpace += currentCrossAxisSize  mainAxisSpace = max ( mainAxisSpace , currentMainAxisSize )  currentSequence . clear ( )  currentMainAxisSize =   currentCrossAxisSize =   }  for ( measurable in measurables ) {  val placeable = measurable . measure ( childConstraints )  if ( ! canAddToCurrentSequence ( placeable ) ) startNewSequence ( )  if ( currentSequence . isNotEmpty ( ) ) {  currentMainAxisSize += mainAxisSpacing . roundToPx ( )  }  currentSequence . add ( placeable )  currentMainAxisSize += placeable . mainAxisSize ( )  currentCrossAxisSize = max ( currentCrossAxisSize , placeable . crossAxisSize ( ) )  }  if ( currentSequence . isNotEmpty ( ) ) startNewSequence ( )  val mainAxisLayoutSize = if ( constraints . mainAxisMax != Constraints . Infinity && mainAxisSize == SizeMode . Expand ) {  constraints . mainAxisMax  } else {  max ( mainAxisSpace , constraints . mainAxisMin )  }  val crossAxisLayoutSize = max ( crossAxisSpace , constraints . crossAxisMin )  val layoutWidth = if ( orientation == LayoutOrientation . Horizontal ) {  mainAxisLayoutSize  } else {  crossAxisLayoutSize  }  val layoutHeight = if ( orientation == LayoutOrientation . Horizontal ) {  crossAxisLayoutSize  } else {  mainAxisLayoutSize  }  layout ( layoutWidth , layoutHeight ) {  sequences . forEachIndexed { i , placeables ->  val childrenMainAxisSizes = IntArray ( placeables . size ) { j ->  placeables [ j ] . mainAxisSize ( ) +  if ( j < placeables . lastIndex ) mainAxisSpacing . roundToPx ( ) else   }  val arrangement = if ( i < sequences . lastIndex ) {  mainAxisAlignment . arrangement  } else {  lastLineMainAxisAlignment . arrangement  }  val mainAxisPositions = IntArray ( childrenMainAxisSizes . size ) {  }  with ( arrangement ) {  arrange ( mainAxisLayoutSize , childrenMainAxisSizes , mainAxisPositions )  }  placeables . forEachIndexed { j , placeable ->  val crossAxis = when ( crossAxisAlignment ) {  FlowCrossAxisAlignment . Start ->   FlowCrossAxisAlignment . End ->  crossAxisSizes [ i ] - placeable . crossAxisSize ( )  FlowCrossAxisAlignment . Center ->  Alignment . Center . align ( IntSize . Zero , IntSize ( width =  , height = crossAxisSizes [ i ] - placeable . crossAxisSize ( ) ) , LayoutDirection . Ltr ) . y  }  if ( orientation == LayoutOrientation . Horizontal ) {  placeable . place ( x = mainAxisPositions [ j ] , y = crossAxisPositions [ i ] + crossAxis )  } else {  placeable . place ( x = crossAxisPositions [ i ] + crossAxis , y = mainAxisPositions [ j ] )  }  }  }  }  }  }","docstring":"/**\n * Layout model that arranges its children in a horizontal or vertical flow.\n */"}
{"signature":"fun InputStreamReader . readSourceFileWithMapping ( ) : Pair < CharSequence , KtSourceFileLinesMapping >","body":"{  val buffer = CharArray (  )  var bufLength = -   var bufPos =   var skipNextLf = false  var charsRead =   val lineOffsets = mutableListOf (  )  val sb = StringBuilder ( )  while ( true ) {  if ( bufPos >= bufLength ) {  bufLength = read ( buffer )  bufPos =   if ( bufLength <  ) {  break  }  } else {  val c = buffer [ bufPos ++ ]  charsRead ++  when {  c == '' && skipNextLf -> {  charsRead --  skipNextLf = false  }  c == '' || c == '' -> {  sb . append ( '' )  lineOffsets . add ( charsRead )  skipNextLf = c == ''  }  else -> {  sb . append ( c )  skipNextLf = false  }  }  }  }  return sb to KtSourceFileLinesMappingFromLineStartOffsets ( lineOffsets . toIntArray ( ) , charsRead )  }","docstring":"/**\n * Reads file contents from reader, converts line separators and calculates source lines to file offsets mapping\n *\n * Returns KtSourceFileLinesMapping and char sequence (StringBuilder to avoid premature copying) containing converted text\n * The separators are converted similarly to the com.intellij.openapi.util.text.StringUtilRt algorithms\n */"}
{"signature":"fun CharSequence . toSourceLinesMapping ( ) : KtSourceFileLinesMapping","body":"{  val lineOffsets = mutableListOf (  )  var offset =   for ( c in this ) {  offset ++  if ( c == '' ) lineOffsets . add ( offset )  }  return KtSourceFileLinesMappingFromLineStartOffsets ( lineOffsets . toIntArray ( ) , offset )  }","docstring":"/**\n * Extracts source lines to offsets mapping from text\n *\n * intended for using mainly in tests, so no care is taken about performance or possible corner cases\n */"}
{"signature":"fun api ( dependencyNotation : Any ) : Dependency ?","body":"fun api ( dependencyNotation : Any ) : Dependency ?","docstring":"/**\n * Adds an `api` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.apiConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun api ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","body":"fun api ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","docstring":"/**\n * Adds an `api` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.apiConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure Additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun api ( dependencyNotation : String , configure : Action < ExternalModuleDependency > ) : ExternalModuleDependency","body":"= api ( dependencyNotation ) {  configure . execute ( this )  }","docstring":"/**\n * Adds an `api` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.apiConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure Additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun < T : Dependency > api ( dependency : T , configure : T . ( ) -> Unit ) : T","body":"fun < T : Dependency > api ( dependency : T , configure : T . ( ) -> Unit ) : T","docstring":"/**\n * Adds an `api` dependency to this entity.\n *\n * @see [HasKotlinDependencies.apiConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun < T : Dependency > api ( dependency : T , configure : Action < T > )","body":"= api ( dependency ) { configure . execute ( this ) }","docstring":"/**\n * Adds an `api` dependency to this entity.\n *\n * @see [HasKotlinDependencies.apiConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun implementation ( dependencyNotation : Any ) : Dependency ?","body":"fun implementation ( dependencyNotation : Any ) : Dependency ?","docstring":"/**\n * Adds an `implementation`\n * [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies) to this entity.\n *\n * @see [HasKotlinDependencies.implementationConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun implementation ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","body":"fun implementation ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","docstring":"/**\n * Adds an `implementation`\n * [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies) to this entity.\n *\n * @see [HasKotlinDependencies.implementationConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure Additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun implementation ( dependencyNotation : String , configure : Action < ExternalModuleDependency > )","body":"=  implementation ( dependencyNotation ) { configure . execute ( this ) }","docstring":"/**\n * Adds an `implementation`\n * [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies) to this entity.\n *\n * @see [HasKotlinDependencies.implementationConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun < T : Dependency > implementation ( dependency : T , configure : T . ( ) -> Unit ) : T","body":"fun < T : Dependency > implementation ( dependency : T , configure : T . ( ) -> Unit ) : T","docstring":"/**\n * Adds an `implementation` dependency to this entity.\n *\n * @see [HasKotlinDependencies.implementationConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun < T : Dependency > implementation ( dependency : T , configure : Action < T > )","body":"=  implementation ( dependency ) { configure . execute ( this ) }","docstring":"/**\n * Adds an `implementation` dependency to this entity.\n *\n * @see [HasKotlinDependencies.implementationConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun compileOnly ( dependencyNotation : Any ) : Dependency ?","body":"fun compileOnly ( dependencyNotation : Any ) : Dependency ?","docstring":"/**\n * Adds a `compileOnly` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.compileOnlyConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun compileOnly ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","body":"fun compileOnly ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","docstring":"/**\n * Adds a `compileOnly` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.compileOnlyConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure Additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun compileOnly ( dependencyNotation : String , configure : Action < ExternalModuleDependency > )","body":"=  compileOnly ( dependencyNotation ) { configure . execute ( this ) }","docstring":"/**\n * Adds a `compileOnly` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.compileOnlyConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure Additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun < T : Dependency > compileOnly ( dependency : T , configure : T . ( ) -> Unit ) : T","body":"fun < T : Dependency > compileOnly ( dependency : T , configure : T . ( ) -> Unit ) : T","docstring":"/**\n * Adds a `compileOnly` dependency to this entity.\n *\n * @see [HasKotlinDependencies.compileOnlyConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun < T : Dependency > compileOnly ( dependency : T , configure : Action < T > )","body":"=  compileOnly ( dependency ) { configure . execute ( this ) }","docstring":"/**\n * Adds a `compileOnly` dependency to this entity.\n *\n * @see [HasKotlinDependencies.compileOnlyConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun runtimeOnly ( dependencyNotation : Any ) : Dependency ?","body":"fun runtimeOnly ( dependencyNotation : Any ) : Dependency ?","docstring":"/**\n * Adds a `runtimeOnly` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.runtimeOnlyConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun runtimeOnly ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","body":"fun runtimeOnly ( dependencyNotation : String , configure : ExternalModuleDependency . ( ) -> Unit ) : ExternalModuleDependency","docstring":"/**\n * Adds a `runtimeOnly` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.runtimeOnlyConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure Additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun runtimeOnly ( dependencyNotation : String , configure : Action < ExternalModuleDependency > )","body":"=  runtimeOnly ( dependencyNotation ) { configure . execute ( this ) }","docstring":"/**\n * Adds a `runtimeOnly` [module dependency](https://docs.gradle.org/current/userguide/declaring_dependencies.html#sub:module_dependencies)\n * to this entity.\n *\n * @see [HasKotlinDependencies.runtimeOnlyConfigurationName]\n *\n * @param dependencyNotation The module dependency notation, as per [DependencyHandler.create].\n * @param configure Additional configuration for the created module dependency.\n * @return The module dependency, or `null` if dependencyNotation is a provider.\n */"}
{"signature":"fun < T : Dependency > runtimeOnly ( dependency : T , configure : T . ( ) -> Unit ) : T","body":"fun < T : Dependency > runtimeOnly ( dependency : T , configure : T . ( ) -> Unit ) : T","docstring":"/**\n * Adds a `runtimeOnly` dependency to this entity.\n *\n * @see [HasKotlinDependencies.runtimeOnlyConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun < T : Dependency > runtimeOnly ( dependency : T , configure : Action < T > )","body":"=  runtimeOnly ( dependency ) { configure . execute ( this ) }","docstring":"/**\n * Adds a `runtimeOnly` dependency to this entity.\n *\n * @see [HasKotlinDependencies.runtimeOnlyConfigurationName]\n *\n * @param dependency The dependency to add.\n * @param configure Additional configuration for the [dependency].\n * @return The added [dependency].\n */"}
{"signature":"fun kotlin ( simpleModuleName : String ) : ExternalModuleDependency","body":"= kotlin ( simpleModuleName , null )","docstring":"/**\n * Creates a dependency to an official Kotlin library with the same version that is configured\n * in [KotlinTopLevelExtensionConfig.coreLibrariesVersion].\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jvmMain\"].dependencies {\n * implementation(kotlin(\"stdlib\"))\n * }\n * ```\n *\n * The official Kotlin dependencies are always part of the \"org.jetbrains.kotlin\" group and the module name always has prefix: \"kotlin-\".\n *\n * @param simpleModuleName The Kotlin module name that follows after the \"kotlin-\" prefix. For example, for \"kotlin-reflect\":\n * ```\n * implementation(kotlin(\"reflect\"))\n * // equivalent to\n * implementation(\"org.jetbrains.kotlin:kotlin-reflect\")\n * ```\n */"}
{"signature":"fun kotlin ( simpleModuleName : String , version : String ? ) : ExternalModuleDependency","body":"fun kotlin ( simpleModuleName : String , version : String ? ) : ExternalModuleDependency","docstring":"/**\n * Creates a dependency to an official Kotlin library.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jvmMain\"].dependencies {\n * implementation(kotlin(\"stdlib\", \"2.0.0\"))\n * }\n * ```\n *\n * The official Kotlin dependencies are always part of the \"org.jetbrains.kotlin\" group and the module name always has prefix: \"kotlin-\".\n *\n * @param simpleModuleName The Kotlin module name followedthat follows after the \"kotlin-\" prefix. For example, for \"kotlin-reflect\":\n * ```\n * implementation(kotlin(\"reflect\", \"2.0.0\"))\n * // equivalent to\n * implementation(\"org.jetbrains.kotlin:kotlin-reflect:2.0.0\")\n * ```\n * @param version dependency version or `null` to use the version defined in [KotlinTopLevelExtensionConfig.coreLibrariesVersion].\n */"}
{"signature":"fun project ( path : String , configuration : String ? = null ) : ProjectDependency","body":"=  project ( listOf ( \"\" , \"\" ) . zip ( listOfNotNull ( path , configuration ) ) . toMap ( ) )","docstring":"/**\n * Creates a Gradle project dependency.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jvmMain\"].dependencies {\n * implementation(project(\":my-library\", \"customLibraryConfiguration\"))\n * }\n * ```\n *\n * @param path The project path\n * @param configuration The optional target configuration in the project\n */"}
{"signature":"fun project ( notation : Map < String , Any ? > ) : ProjectDependency","body":"fun project ( notation : Map < String , Any ? > ) : ProjectDependency","docstring":"/**\n * Creates a Gradle project dependency.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jvmMain\"].dependencies {\n * implementation(project(mapOf(\"path\" to \":project-a\", \"configuration\" to \"someOtherConfiguration\")))\n * }\n * ```\n *\n * @param notation Project notation described in [DependencyHandler].\n */"}
{"signature":"@ Deprecated ( \"\" , replaceWith = ReplaceWith ( \"\" ) )  fun enforcedPlatform ( notation : Any ) : Dependency","body":"=  project . dependencies . enforcedPlatform ( notation )","docstring":"/**\n * @suppress\n */"}
{"signature":"@ Deprecated ( \"\" , replaceWith = ReplaceWith ( \"\" ) )  fun enforcedPlatform ( notation : Any , configureAction : Action < in Dependency > ) : Dependency","body":"=  project . dependencies . enforcedPlatform ( notation , configureAction )","docstring":"/**\n * @suppress\n */"}
{"signature":"@ Deprecated ( \"\" , replaceWith = ReplaceWith ( \"\" ) )  fun platform ( notation : Any ) : Dependency","body":"=  project . dependencies . platform ( notation )","docstring":"/**\n * @suppress\n */"}
{"signature":"@ Deprecated ( \"\" , replaceWith = ReplaceWith ( \"\" ) )  fun platform ( notation : Any , configureAction : Action < in Dependency > ) : Dependency","body":"=  project . dependencies . platform ( notation , configureAction )","docstring":"/**\n * @suppress\n */"}
{"signature":"@ Deprecated ( \"\" )  fun npm ( name : String , version : String , generateExternals : Boolean ) : Dependency","body":"{  @ Suppress ( \"\" )  ( warnNpmGenerateExternals ( project . logger ) )  return npm ( name , version )  }","docstring":"/**\n * @suppress\n */"}
{"signature":"fun npm ( name : String , version : String ) : Dependency","body":"fun npm ( name : String , version : String ) : Dependency","docstring":"/**\n * Creates a dependency on the [NPM](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#dependencies) module.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(npm(\"is-odd-even\", \"1.0.0\"))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param name The NPM dependency name\n * @param version The NPM dependency version\n */"}
{"signature":"@ Deprecated ( \"\" )  fun npm ( name : String , directory : File , generateExternals : Boolean ) : Dependency","body":"{  @ Suppress ( \"\" )  ( warnNpmGenerateExternals ( project . logger ) )  return npm ( name , directory )  }","docstring":"/**\n * @suppress\n */"}
{"signature":"fun npm ( name : String , directory : File ) : Dependency","body":"fun npm ( name : String , directory : File ) : Dependency","docstring":"/**\n * Creates a dependency on the [NPM](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#dependencies) module.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(npm(\"is-odd-even\", project.file(\"npm/is-odd-even\")))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param name The NPM dependency name\n * @param directory The directory where dependency files are located\n * (See NPM [directory](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#local-paths) keyword)\n */"}
{"signature":"@ Deprecated ( \"\" )  fun npm ( directory : File , generateExternals : Boolean ) : Dependency","body":"{  @ Suppress ( \"\" )  ( warnNpmGenerateExternals ( project . logger ) )  return npm ( directory )  }","docstring":"/**\n * @suppress\n */"}
{"signature":"fun npm ( directory : File ) : Dependency","body":"fun npm ( directory : File ) : Dependency","docstring":"/**\n * Creates a dependency on the [NPM](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#dependencies) module.\n * The name of the dependency is derived either from the `package.json` file located in the [directory] or the [directory] name itself.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(npm(project.file(\"npm/is-odd-even\")))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param directory The directory where dependency files are located\n * (See NPM [directory](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#local-paths) keyword)\n */"}
{"signature":"fun devNpm ( name : String , version : String ) : Dependency","body":"fun devNpm ( name : String , version : String ) : Dependency","docstring":"/**\n * Creates a dependency to a NPM module that is added\n * to [devDependencies](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#devdependencies).\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(devNpm(\"is-odd-even\", \"1.1.0\"))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param name The NPM dependency name\n * @param version The NPM dependency version\n */"}
{"signature":"fun devNpm ( name : String , directory : File ) : Dependency","body":"fun devNpm ( name : String , directory : File ) : Dependency","docstring":"/**\n * Creates a dependency to a NPM module that is added\n * to [devDependencies](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#devdependencies).\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(devNpm(\"is-odd-even\", project.file(\"npm/is-odd-even\")))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param name The NPM dependency name\n * @param directory The directory where dependency files are located\n * (See NPM [directory](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#local-paths) keyword)\n */"}
{"signature":"fun devNpm ( directory : File ) : Dependency","body":"fun devNpm ( directory : File ) : Dependency","docstring":"/**\n * Creates a dependency to a NPM module that is added\n * to [devDependencies](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#devdependencies).\n * The name of the dependency is derived either from the `package.json` file located in the [directory] or the [directory] name itself.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(devNpm(project.file(\"npm/is-odd-even\")))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param directory The directory where dependency files are located\n * (See NPM [directory](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#repository) keyword)\n */"}
{"signature":"@ Deprecated ( \"\" )  fun optionalNpm ( name : String , version : String , generateExternals : Boolean ) : Dependency","body":"{  @ Suppress ( \"\" )  ( warnNpmGenerateExternals ( project . logger ) )  return optionalNpm ( name , version )  }","docstring":"/**\n * @suppress\n */"}
{"signature":"fun optionalNpm ( name : String , version : String ) : Dependency","body":"fun optionalNpm ( name : String , version : String ) : Dependency","docstring":"/**\n * Creates a dependency to a NPM module that is added\n * to [optionalDependencies](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#optionaldependencies).\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(optionalNpm(\"is-odd-even\", \"1.0.0\"))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param name The NPM dependency name\n * @param version The NPM dependency version\n */"}
{"signature":"@ Deprecated ( \"\" )  fun optionalNpm ( name : String , directory : File , generateExternals : Boolean ) : Dependency","body":"{  @ Suppress ( \"\" )  ( warnNpmGenerateExternals ( project . logger ) )  return optionalNpm ( name , directory )  }","docstring":"/**\n * @suppress\n */"}
{"signature":"fun optionalNpm ( name : String , directory : File ) : Dependency","body":"fun optionalNpm ( name : String , directory : File ) : Dependency","docstring":"/**\n * Creates a dependency to a NPM module that is added\n * to [optionalDependencies](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#optionaldependencies).\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(optionalNpm(\"is-odd-even\", project.file(\"npm/is-odd-even\")))\n * }\n * ```\n *\n * **Note**: Only relevant for Kotlin entities targeting only [KotlinPlatformType.js] or [KotlinPlatformType.wasm]!\n *\n * @param name The NPM dependency name\n * @param directory The directory where dependency files are located\n * (See NPM [directory](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#local-paths) keyword)\n */"}
{"signature":"@ Deprecated ( \"\" )  fun optionalNpm ( directory : File , generateExternals : Boolean ) : Dependency","body":"{  @ Suppress ( \"\" )  ( warnNpmGenerateExternals ( project . logger ) )  return optionalNpm ( directory )  }","docstring":"/**\n * @suppress\n */"}
{"signature":"fun optionalNpm ( directory : File ) : Dependency","body":"fun optionalNpm ( directory : File ) : Dependency","docstring":"/**\n * Creates a dependency to a NPM module that is added\n * to [optionalDependencies](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#optionaldependencies).\n * The name of the dependency is derived either from the `package.json` file located in the [directory] or the [directory] name itself.\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(optionalNpm(project.file(\"npm/is-odd-even\")))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param directory The directory where dependency files are located\n * (See NPM [directory](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#local-paths) keyword)\n */"}
{"signature":"fun peerNpm ( name : String , version : String ) : Dependency","body":"fun peerNpm ( name : String , version : String ) : Dependency","docstring":"/**\n * Creates a dependency to a NPM module that is added\n * to [peerDependencies](https://docs.npmjs.com/cli/v10/configuring-npm/package-json#peerdependencies).\n *\n * Note: The created dependency should be manually added to this entity using other methods from this DSL:\n * ```\n * kotlin.sourceSets[\"jsMain\"].dependencies {\n * implementation(peerNpm(\"is-odd-even\", \"1.0.0\"))\n * }\n * ```\n *\n * This is only relevant for Kotlin entities that target only [KotlinPlatformType.js] or [KotlinPlatformType.wasm].\n *\n * @param name The NPM dependency name\n * @param version The NPM dependency version\n */"}
{"signature":"private fun getTypePreservingFlexibilityWrtTypeVariable ( type : ConeKotlinType , typeParameter : FirTypeParameterRef , session : FirSession , ) : ConeKotlinType","body":"{  val containingDeclarationSymbol = typeParameter . symbol . containingDeclarationSymbol  return if ( containingDeclarationSymbol is FirCallableSymbol && containingDeclarationSymbol !is FirSyntheticFunctionSymbol && typeParameter . shouldBeFlexible ( session . typeContext ) ) {  when ( type ) {  is ConeSimpleKotlinType -> ConeFlexibleType ( type . withNullability ( ConeNullability . NOT_NULL , session . typeContext ) , type . withNullability ( ConeNullability . NULLABLE , session . typeContext ) )  is ConeFlexibleType -> ConeFlexibleType ( type . lowerBound . withNullability ( ConeNullability . NOT_NULL , session . typeContext ) , type . upperBound . withNullability ( ConeNullability . NULLABLE , session . typeContext ) )  }  } else {  type  }  }","docstring":"/**\n * This function provides a type for a newly created EQUALS constraint on a fresh type variable,\n * for a situation when we have an explicit type argument and type parameter is a Java type parameter without known nullability.\n *\n * For a normal function call, like foo, we create a constraint T = SomeType!.\n * This is an unsafe solution, however yet we have to keep it, otherwise a lot of code becomes red.\n * Typical \"strange\" example:\n *\n * ```\n * // Java\n * public class Foo {\n * static  T id(T foo) {\n * return null;\n * }\n * }\n *\n * // Kotlin\n * fun test(): String {\n * return Foo.id(null) // OK...\n * }\n * ```\n *\n * We keep more sound constraint T = SomeType for regular and SAM constructor calls. Typical examples are:\n *\n * ```\n * fun test1() = J1() // type should be J1, not J1\n * // J1.java\n * public class J1 {}\n * ```\n *\n * or\n *\n * ```\n * // Again, type should be J and not J\n * fun test1() = J { x -> x }\n *\n *\n * // FILE: J.java\n * public interface J {\n * T foo(T x);\n * }\n * ```\n *\n * @return type which is chosen for EQUALS constraint\n */"}
{"signature":"@ InternalCoroutinesApi  public fun tryResume ( value : T , idempotent : Any ? = null ) : Any ?","body":"@ InternalCoroutinesApi  public fun tryResume ( value : T , idempotent : Any ? = null ) : Any ?","docstring":"/**\n * Tries to resume this continuation with the specified [value] and returns a non-null object token if successful,\n * or `null` otherwise (it was already resumed or cancelled). When a non-null object is returned,\n * [completeResume] must be invoked with it.\n *\n * When [idempotent] is not `null`, this function performs an _idempotent_ operation, so that\n * further invocations with the same non-null reference produce the same result.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"}
{"signature":"@ InternalCoroutinesApi  public fun tryResume ( value : T , idempotent : Any ? , onCancellation : ( ( cause : Throwable ) -> Unit ) ? ) : Any ?","body":"@ InternalCoroutinesApi  public fun tryResume ( value : T , idempotent : Any ? , onCancellation : ( ( cause : Throwable ) -> Unit ) ? ) : Any ?","docstring":"/**\n * Same as [tryResume] but with [onCancellation] handler that called if and only if the value is not\n * delivered to the caller because of the dispatch in the process, so that atomicity delivery\n * guaranteed can be provided by having a cancellation fallback.\n *\n * Implementation note: current implementation always returns RESUME_TOKEN or `null`\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"}
{"signature":"@ InternalCoroutinesApi  public fun tryResumeWithException ( exception : Throwable ) : Any ?","body":"@ InternalCoroutinesApi  public fun tryResumeWithException ( exception : Throwable ) : Any ?","docstring":"/**\n * Tries to resume this continuation with the specified [exception] and returns a non-null object token if successful,\n * or `null` otherwise (it was already resumed or cancelled). When a non-null object is returned,\n * [completeResume] must be invoked with it.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"}
{"signature":"@ InternalCoroutinesApi  public fun completeResume ( token : Any )","body":"@ InternalCoroutinesApi  public fun completeResume ( token : Any )","docstring":"/**\n * Completes the execution of [tryResume] or [tryResumeWithException] on its non-null result.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"}
{"signature":"@ InternalCoroutinesApi  public fun initCancellability ( )","body":"@ InternalCoroutinesApi  public fun initCancellability ( )","docstring":"/**\n * Internal function that setups cancellation behavior in [suspendCancellableCoroutine].\n * It's illegal to call this function in any non-`kotlinx.coroutines` code and\n * such calls lead to undefined behaviour.\n * Exposed in our ABI since 1.0.0 withing `suspendCancellableCoroutine` body.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"}
{"signature":"public fun cancel ( cause : Throwable ? = null ) : Boolean","body":"public fun cancel ( cause : Throwable ? = null ) : Boolean","docstring":"/**\n * Cancels this continuation with an optional cancellation `cause`. The result is `true` if this continuation was\n * cancelled as a result of this invocation, and `false` otherwise.\n */"}
{"signature":"public fun invokeOnCancellation ( handler : CompletionHandler )","body":"public fun invokeOnCancellation ( handler : CompletionHandler )","docstring":"/**\n * Registers a [handler] to be **synchronously** invoked on [cancellation][cancel] (regular or exceptional) of this continuation.\n * When the continuation is already cancelled, the handler is immediately invoked with the cancellation exception.\n * Otherwise, the handler will be invoked as soon as this continuation is cancelled.\n *\n * The installed [handler] should not throw any exceptions.\n * If it does, they will get caught, wrapped into a [CompletionHandlerException] and\n * processed as an uncaught exception in the context of the current coroutine\n * (see [CoroutineExceptionHandler]).\n *\n * At most one [handler] can be installed on a continuation.\n * Attempting to call `invokeOnCancellation` a second time produces an [IllegalStateException].\n *\n * This handler is also called when this continuation [resumes][Continuation.resume] normally (with a value) and then\n * is cancelled while waiting to be dispatched. More generally speaking, this handler is called whenever\n * the caller of [suspendCancellableCoroutine] is getting a [CancellationException].\n *\n * A typical example of `invokeOnCancellation` usage is given in\n * the documentation for the [suspendCancellableCoroutine] function.\n *\n * **Note**: Implementations of [CompletionHandler] must be fast, non-blocking, and thread-safe.\n * This [handler] can be invoked concurrently with the surrounding code.\n * There is no guarantee on the execution context in which the [handler] will be invoked.\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public fun CoroutineDispatcher . resumeUndispatched ( value : T )","body":"@ ExperimentalCoroutinesApi  public fun CoroutineDispatcher . resumeUndispatched ( value : T )","docstring":"/**\n * Resumes this continuation with the specified [value] in the invoker thread without going through\n * the [dispatch][CoroutineDispatcher.dispatch] function of the [CoroutineDispatcher] in the [context].\n * This function is designed to only be used by [CoroutineDispatcher] implementations.\n * **It should not be used in general code**.\n *\n * **Note: This function is experimental.** Its signature general code may be changed in the future.\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public fun CoroutineDispatcher . resumeUndispatchedWithException ( exception : Throwable )","body":"@ ExperimentalCoroutinesApi  public fun CoroutineDispatcher . resumeUndispatchedWithException ( exception : Throwable )","docstring":"/**\n * Resumes this continuation with the specified [exception] in the invoker thread without going through\n * the [dispatch][CoroutineDispatcher.dispatch] function of the [CoroutineDispatcher] in the [context].\n * This function is designed to only be used by [CoroutineDispatcher] implementations.\n * **It should not be used in general code**.\n *\n * **Note: This function is experimental.** Its signature general code may be changed in the future.\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public fun resume ( value : T , onCancellation : ( ( cause : Throwable ) -> Unit ) ? )","body":"@ ExperimentalCoroutinesApi  public fun resume ( value : T , onCancellation : ( ( cause : Throwable ) -> Unit ) ? )","docstring":"/**\n * Resumes this continuation with the specified `value` and calls the specified `onCancellation`\n * handler when either resumed too late (when continuation was already cancelled) or, although resumed\n * successfully (before cancellation), the coroutine's job was cancelled before it had a\n * chance to run in its dispatcher, so that the suspended function threw an exception\n * instead of returning this value.\n *\n * The installed [onCancellation] handler should not throw any exceptions.\n * If it does, they will get caught, wrapped into a [CompletionHandlerException] and\n * processed as an uncaught exception in the context of the current coroutine\n * (see [CoroutineExceptionHandler]).\n *\n * This function shall be used when resuming with a resource that must be closed by\n * code that called the corresponding suspending function, for example:\n *\n * ```\n * continuation.resume(resource) {\n * resource.close()\n * }\n * ```\n *\n * A more complete example and further details are given in\n * the documentation for the [suspendCancellableCoroutine] function.\n *\n * **Note**: The [onCancellation] handler must be fast, non-blocking, and thread-safe.\n * It can be invoked concurrently with the surrounding code.\n * There is no guarantee on the execution context of its invocation.\n */"}
{"signature":"internal fun < T > CancellableContinuation < T > . invokeOnCancellation ( handler : CancelHandler )","body":"= when ( this ) {  is CancellableContinuationImpl -> invokeOnCancellationInternal ( handler )  else -> throw UnsupportedOperationException ( \"\" )  }","docstring":"/**\n * A version of `invokeOnCancellation` that accepts a class as a handler instead of a lambda, but identical otherwise.\n * This allows providing a custom [toString] instance that will look better during debugging.\n */"}
{"signature":"public suspend inline fun < T > suspendCancellableCoroutine ( crossinline block : ( CancellableContinuation < T > ) -> Unit ) : T","body":"=  suspendCoroutineUninterceptedOrReturn { uCont ->  val cancellable = CancellableContinuationImpl ( uCont . intercepted ( ) , resumeMode = MODE_CANCELLABLE )  cancellable . initCancellability ( )  block ( cancellable )  cancellable . getResult ( )  }","docstring":"/**\n * Suspends the coroutine like [suspendCoroutine], but providing a [CancellableContinuation] to\n * the [block]. This function throws a [CancellationException] if the [Job] of the coroutine is\n * cancelled or completed while it is suspended.\n *\n * A typical use of this function is to suspend a coroutine while waiting for a result\n * from a single-shot callback API and to return the result to the caller.\n * For multi-shot callback APIs see [callbackFlow][kotlinx.coroutines.flow.callbackFlow].\n *\n * ```\n * suspend fun awaitCallback(): T = suspendCancellableCoroutine { continuation ->\n * val callback = object : Callback { // Implementation of some callback interface\n * override fun onCompleted(value: T) {\n * // Resume coroutine with a value provided by the callback\n * continuation.resume(value)\n * }\n * override fun onApiError(cause: Throwable) {\n * // Resume coroutine with an exception provided by the callback\n * continuation.resumeWithException(cause)\n * }\n * }\n * // Register callback with an API\n * api.register(callback)\n * // Remove callback on cancellation\n * continuation.invokeOnCancellation { api.unregister(callback) }\n * // At this point the coroutine is suspended by suspendCancellableCoroutine until callback fires\n * }\n * ```\n *\n * > The callback `register`/`unregister` methods provided by an external API must be thread-safe, because\n * > `invokeOnCancellation` block can be called at any time due to asynchronous nature of cancellation, even\n * > concurrently with the call of the callback.\n *\n * ### Prompt cancellation guarantee\n *\n * This function provides **prompt cancellation guarantee**.\n * If the [Job] of the current coroutine was cancelled while this function was suspended it will not resume\n * successfully, even if [CancellableContinuation.resume] was already invoked.\n *\n * The cancellation of the coroutine's job is generally asynchronous with respect to the suspended coroutine.\n * The suspended coroutine is resumed with a call to its [Continuation.resumeWith] member function or to the\n * [resume][Continuation.resume] extension function.\n * However, when coroutine is resumed, it does not immediately start executing, but is passed to its\n * [CoroutineDispatcher] to schedule its execution when dispatcher's resources become available for execution.\n * The job's cancellation can happen before, after, and concurrently with the call to `resume`. In any\n * case, prompt cancellation guarantees that the coroutine will not resume its code successfully.\n *\n * If the coroutine was resumed with an exception (for example, using [Continuation.resumeWithException] extension\n * function) and cancelled, then the exception thrown by the `suspendCancellableCoroutine` function is determined\n * by what happened first: exceptional resume or cancellation.\n *\n * ### Returning resources from a suspended coroutine\n *\n * As a result of the prompt cancellation guarantee, when a closeable resource\n * (like open file or a handle to another native resource) is returned from a suspended coroutine as a value,\n * it can be lost when the coroutine is cancelled. To ensure that the resource can be properly closed\n * in this case, the [CancellableContinuation] interface provides two functions.\n *\n * - [invokeOnCancellation][CancellableContinuation.invokeOnCancellation] installs a handler that is called\n * whenever a suspend coroutine is being cancelled. In addition to the example at the beginning, it can be\n * used to ensure that a resource that was opened before the call to\n * `suspendCancellableCoroutine` or in its body is closed in case of cancellation.\n *\n * ```\n * suspendCancellableCoroutine { continuation ->\n * val resource = openResource() // Opens some resource\n * continuation.invokeOnCancellation {\n * resource.close() // Ensures the resource is closed on cancellation\n * }\n * // ...\n * }\n * ```\n *\n * - [resume(value) { ... }][CancellableContinuation.resume] method on a [CancellableContinuation] takes\n * an optional `onCancellation` block. It can be used when resuming with a resource that must be closed by\n * the code that called the corresponding suspending function.\n *\n * ```\n * suspendCancellableCoroutine { continuation ->\n * val callback = object : Callback { // Implementation of some callback interface\n * // A callback provides a reference to some closeable resource\n * override fun onCompleted(resource: T) {\n * // Resume coroutine with a value provided by the callback and ensure the resource is closed in case\n * // when the coroutine is cancelled before the caller gets a reference to the resource.\n * continuation.resume(resource) {\n * resource.close() // Close the resource on cancellation\n * }\n * }\n * // ...\n * }\n * ```\n *\n * ### Implementation details and custom continuation interceptors\n *\n * The prompt cancellation guarantee is the result of a coordinated implementation inside `suspendCancellableCoroutine`\n * function and the [CoroutineDispatcher] class. The coroutine dispatcher checks for the status of the [Job] immediately\n * before continuing its normal execution and aborts this normal execution, calling all the corresponding\n * cancellation handlers, if the job was cancelled.\n *\n * If a custom implementation of [ContinuationInterceptor] is used in a coroutine's context that does not extend\n * [CoroutineDispatcher] class, then there is no prompt cancellation guarantee. A custom continuation interceptor\n * can resume execution of a previously suspended coroutine even if its job was already cancelled.\n */"}
{"signature":"internal suspend inline fun < T > suspendCancellableCoroutineReusable ( crossinline block : ( CancellableContinuationImpl < T > ) -> Unit ) : T","body":"= suspendCoroutineUninterceptedOrReturn { uCont ->  val cancellable = getOrCreateCancellableContinuation ( uCont . intercepted ( ) )  try {  block ( cancellable )  } catch ( e : Throwable ) {  cancellable . releaseClaimedReusableContinuation ( )  throw e  }  cancellable . getResult ( )  }","docstring":"/**\n * Suspends the coroutine similar to [suspendCancellableCoroutine], but an instance of\n * [CancellableContinuationImpl] is reused.\n */"}
{"signature":"@ InternalCoroutinesApi  public fun CancellableContinuation < * > . disposeOnCancellation ( handle : DisposableHandle ) : Unit","body":"=  invokeOnCancellation ( handler = DisposeOnCancel ( handle ) )","docstring":"/**\n * Disposes the specified [handle] when this continuation is cancelled.\n *\n * This is a shortcut for the following code with slightly more efficient implementation (one fewer object created):\n * ```\n * invokeOnCancellation { handle.dispose() }\n * ```\n *\n * @suppress **This an internal API and should not be used from general code.**\n */"}
{"signature":"private fun Any ? . transformKotlinToJvm ( expectedType : Class < * > ) : Any ?","body":"{  @ Suppress ( \"\" )  val result = when ( this ) {  is Class < * > -> return null  is KClass < * > -> this . java  is Array < * > -> when {  this . isArrayOf < Class < * > > ( ) -> return null  this . isArrayOf < KClass < * > > ( ) -> ( this as Array < KClass < * > > ) . map ( KClass < * > :: java ) . toTypedArray ( )  else -> this  }  else -> this  }  return if ( expectedType . isInstance ( result ) ) result else null  }","docstring":"/**\n * Transforms a Kotlin value to the one required by the JVM, e.g. KClass<*> -> Class<*> or Array> -> Array>.\n * Returns `null` in case when no transformation is possible (an argument of an incorrect type was passed).\n */"}
{"signature":"public fun Buffer . snapshot ( ) : ByteString","body":"{  if ( size ==  ) return ByteString ( )  check ( size <= Int . MAX_VALUE ) { \"\" }  return buildByteString ( size . toInt ( ) ) {  var curr = head  do {  check ( curr != null ) { \"\" }  append ( curr . data , curr . pos , curr . limit )  curr = curr . next  } while ( curr !== head )  }  }","docstring":"/**\n * Creates a byte string containing a copy of all the data from this buffer.\n *\n * This call doesn't consume data from the buffer, but instead copies it.\n */"}
{"signature":"public fun Buffer . indexOf ( byte : Byte , startIndex : Long =  , endIndex : Long = size ) : Long","body":"{  val endOffset = minOf ( endIndex , size )  checkBounds ( size , startIndex , endOffset )  if ( startIndex == endOffset ) return -   seek ( startIndex ) { seg , o ->  if ( o == -  ) {  return -   }  var segment = seg ! !  var offset = o  do {  check ( endOffset > offset )  val idx = segment . indexOf ( byte , maxOf ( ( startIndex - offset ) . toInt ( ) ,  ) , minOf ( segment . size , ( endOffset - offset ) . toInt ( ) ) )  if ( idx != -  ) {  return offset + idx . toLong ( )  }  offset += segment . size  segment = segment . next ! !  } while ( segment !== head && offset < endOffset )  return -   }  }","docstring":"/**\n * Returns an index of [byte] first occurrence in the range of [startIndex] to [endIndex],\n * or `-1` when the range doesn't contain [byte].\n *\n * The scan terminates at either [endIndex] or buffers' exhaustion, whichever comes first.\n *\n * @param byte the value to find.\n * @param startIndex the start of the range (inclusive) to find [byte], `0` by default.\n * @param endIndex the end of the range (exclusive) to find [byte], [Buffer.size] by default.\n *\n * @throws IllegalStateException when the source is closed.\n * @throws IllegalArgumentException when `startIndex > endIndex` or either of indices is negative.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.indexOfByteSample\n */"}
{"signature":"fun encodeBufferedImage ( image : BufferedImage ) : JsonPrimitive","body":"{  val format = \"\"  val stream = ByteArrayOutputStream ( )  ImageIO . write ( image , format , stream )  val data = stream . toByteArray ( )  val encoder = Base64 . getEncoder ( )  val encodedData = encoder . encodeToString ( data )  return JsonPrimitive ( encodedData )  }","docstring":"/**\n * Convert a buffered image to a PNG file encoded as a Base64 Json string.\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun < V , V1 : V > Map < in String , @ Exact V > . getValue ( thisRef : Any ? , property : KProperty < * > ) : V1","body":"=  @ Suppress ( \"\" ) ( getOrImplicitDefault ( property . name ) as V1 )","docstring":"/**\n * Returns the value of the property for the given object from this read-only map.\n * @param thisRef the object for which the value is requested (not used).\n * @param property the metadata for the property, used to get the name of property and lookup the value corresponding to this name in the map.\n * @return the property value.\n *\n * @throws NoSuchElementException when the map doesn't contain value for the property name and doesn't provide an implicit default (see [withDefault]).\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ kotlin . internal . InlineOnly  public inline operator fun < V , V1 : V > MutableMap < in String , out @ Exact V > . getValue ( thisRef : Any ? , property : KProperty < * > ) : V1","body":"=  @ Suppress ( \"\" ) ( getOrImplicitDefault ( property . name ) as V1 )","docstring":"/**\n * Returns the value of the property for the given object from this mutable map.\n * @param thisRef the object for which the value is requested (not used).\n * @param property the metadata for the property, used to get the name of property and lookup the value corresponding to this name in the map.\n * @return the property value.\n *\n * @throws NoSuchElementException when the map doesn't contain value for the property name and doesn't provide an implicit default (see [withDefault]).\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun < V > MutableMap < in String , in V > . setValue ( thisRef : Any ? , property : KProperty < * > , value : V )","body":"{  this . put ( property . name , value )  }","docstring":"/**\n * Stores the value of the property for the given object in this mutable map.\n * @param thisRef the object for which the value is requested (not used).\n * @param property the metadata for the property, used to get the name of property and store the value associated with that name in the map.\n * @param value the value to set.\n */"}
{"signature":"public fun Source . readShortLe ( ) : Short","body":"{  return readShort ( ) . reverseBytes ( )  }","docstring":"/**\n * Removes two bytes from this source and returns a short integer composed of it according to the little-endian order.\n *\n * @throws EOFException when there are not enough data to read a short value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readShortLe\n */"}
{"signature":"public fun Source . readIntLe ( ) : Int","body":"{  return readInt ( ) . reverseBytes ( )  }","docstring":"/**\n * Removes four bytes from this source and returns an integer composed of it according to the little-endian order.\n *\n * @throws EOFException when there are not enough data to read an int value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readIntLe\n */"}
{"signature":"public fun Source . readLongLe ( ) : Long","body":"{  return readLong ( ) . reverseBytes ( )  }","docstring":"/**\n * Removes eight bytes from this source and returns a long integer composed of it according to the little-endian order.\n *\n * @throws EOFException when there are not enough data to read a long value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readLongLe\n */"}
{"signature":"@ OptIn ( InternalIoApi :: class )  public fun Source . readDecimalLong ( ) : Long","body":"{  require (  )  var currIdx =   var negative = false  var value =   var seen =   var overflowDigit = OVERFLOW_DIGIT_START  when ( val b = buffer [ currIdx ++ ] ) {  '' . code . toByte ( ) -> {  negative = true  overflowDigit --  }  in '' . code .. '' . code -> {  value = ( '' . code - b ) . toLong ( )  seen =   }  else -> {  throw NumberFormatException ( \"\" )  }  }  while ( request ( currIdx +  ) ) {  val b = buffer [ currIdx ++ ]  if ( b in '' . code .. '' . code ) {  val digit = '' . code - b  if ( value < OVERFLOW_ZONE || value == OVERFLOW_ZONE && digit < overflowDigit ) {  with ( Buffer ( ) ) {  writeDecimalLong ( value )  writeByte ( b )  if ( ! negative ) readByte ( )  throw NumberFormatException ( \"\" )  }  }  value = value *  + digit  seen ++  } else {  break  }  }  if ( seen <  ) {  require (  )  val expected = if ( negative ) \"\" else \"\"  throw NumberFormatException ( \"\" )  }  skip ( currIdx . toLong ( ) -  )  return if ( negative ) value else - value  }","docstring":"/**\n * Reads a long from this source in signed decimal form (i.e., as a string in base 10 with\n * optional leading `-`).\n *\n * Source data will be consumed until the source is exhausted, the first occurrence of non-digit byte,\n * or overflow happened during resulting value construction.\n *\n * @throws NumberFormatException if the found digits do not fit into a `long` or a decimal\n * number was not present.\n * @throws EOFException if the source is exhausted before a call of this method.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readDecimalLong\n */"}
{"signature":"@ OptIn ( InternalIoApi :: class )  public fun Source . readHexadecimalUnsignedLong ( ) : Long","body":"{  require (  )  var result = when ( val b = buffer [  ] ) {  in '' . code .. '' . code -> b - '' . code  in '' . code .. '' . code -> b - '' . code +   in '' . code .. '' . code -> b - '' . code +   else -> throw NumberFormatException ( \"\" )  } . toLong ( )  var bytesRead =   while ( request ( bytesRead +  ) ) {  val b = buffer [ bytesRead ]  val bDigit = when ( b ) {  in '' . code .. '' . code -> b - '' . code  in '' . code .. '' . code -> b - '' . code +   in '' . code .. '' . code -> b - '' . code +   else -> break  }  if ( result and -  !=  ) {  with ( Buffer ( ) ) {  writeHexadecimalUnsignedLong ( result )  writeByte ( b )  throw NumberFormatException ( \"\" + readString ( ) )  }  }  result = result . shl (  ) + bDigit  bytesRead ++  }  skip ( bytesRead )  return result  }","docstring":"/**\n * Reads a long form this source in hexadecimal form (i.e., as a string in base 16).\n *\n * Source data will be consumed until the source is exhausted, the first occurrence of non-digit byte,\n * or overflow happened during resulting value construction.\n *\n * @throws NumberFormatException if the found hexadecimal does not fit into a `long` or\n * hexadecimal was not found.\n * @throws EOFException if the source is exhausted before a call of this method.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readHexLong\n */"}
{"signature":"@ OptIn ( InternalIoApi :: class )  public fun Source . indexOf ( byte : Byte , startIndex : Long =  , endIndex : Long = Long . MAX_VALUE ) : Long","body":"{  require ( startIndex in  .. endIndex ) {  if ( endIndex <  ) {  \"\"  } else {  \"\"  }  }  if ( startIndex == endIndex ) return -   var offset = startIndex  while ( offset < endIndex && request ( offset +  ) ) {  val idx = buffer . indexOf ( byte , offset , minOf ( endIndex , buffer . size ) )  if ( idx != -  ) {  return idx  }  offset = buffer . size  }  return -   }","docstring":"/**\n * Returns an index of [byte] first occurrence in the range of [startIndex] to [endIndex],\n * or `-1` when the range doesn't contain [byte].\n *\n * The scan terminates at either [endIndex] or source's exhaustion, whichever comes first. The\n * maximum number of bytes scanned is `toIndex-fromIndex`.\n * If [byte] not found in buffered data, [endIndex] is yet to be reached and the underlying source is not yet exhausted\n * then new data will be read from the underlying source into the buffer.\n *\n * @param byte the value to find.\n * @param startIndex the start of the range (inclusive) to find [byte], `0` by default.\n * @param endIndex the end of the range (exclusive) to find [byte], [Long.MAX_VALUE] by default.\n *\n * @throws IllegalStateException when the source is closed.\n * @throws IllegalArgumentException when `startIndex > endIndex` or either of indices is negative.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.indexOfByteSample\n */"}
{"signature":"public fun Source . readByteArray ( ) : ByteArray","body":"{  return readByteArrayImpl ( -  )  }","docstring":"/**\n * Removes all bytes from this source and returns them as a byte array.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readToArraySample\n */"}
{"signature":"public fun Source . readByteArray ( byteCount : Int ) : ByteArray","body":"{  checkByteCount ( byteCount . toLong ( ) )  return readByteArrayImpl ( byteCount )  }","docstring":"/**\n * Removes [byteCount] bytes from this source and returns them as a byte array.\n *\n * @param byteCount the number of bytes that should be read from the source.\n *\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws EOFException when the underlying source is exhausted before [byteCount] bytes of data could be read.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readToArraySample\n */"}
{"signature":"public fun Source . readTo ( sink : ByteArray , startIndex : Int =  , endIndex : Int = sink . size )","body":"{  checkBounds ( sink . size , startIndex , endIndex )  var offset = startIndex  while ( offset < endIndex ) {  val bytesRead = readAtMostTo ( sink , offset , endIndex )  if ( bytesRead == -  ) {  throw EOFException ( \"\" + \"\" )  }  offset += bytesRead  }  }","docstring":"/**\n * Removes exactly `endIndex - startIndex` bytes from this source and copies them into [sink] subrange starting at\n * [startIndex] and ending at [endIndex].\n *\n * @param sink the array to write data to\n * @param startIndex the startIndex (inclusive) of the [sink] subrange to read data into, 0 by default.\n * @param endIndex the endIndex (exclusive) of the [sink] subrange to read data into, `sink.size` by default.\n *\n * @throws EOFException when the requested number of bytes cannot be read.\n * @throws IllegalStateException when the source is closed.\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [sink] array indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readToArraySample\n */"}
{"signature":"public fun Source . readUByte ( ) : UByte","body":"= readByte ( ) . toUByte ( )","docstring":"/**\n * Removes an unsigned byte from this source and returns it.\n *\n * @throws EOFException when there are no more bytes to read.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUByte\n */"}
{"signature":"public fun Source . readUShort ( ) : UShort","body":"= readShort ( ) . toUShort ( )","docstring":"/**\n * Removes two bytes from this source and returns an unsigned short integer composed of it\n * according to the big-endian order.\n *\n * @throws EOFException when there are not enough data to read an unsigned short value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUShort\n */"}
{"signature":"public fun Source . readUInt ( ) : UInt","body":"= readInt ( ) . toUInt ( )","docstring":"/**\n * Removes four bytes from this source and returns an unsigned integer composed of it\n * according to the big-endian order.\n *\n * @throws EOFException when there are not enough data to read an unsigned int value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUInt\n */"}
{"signature":"public fun Source . readULong ( ) : ULong","body":"= readLong ( ) . toULong ( )","docstring":"/**\n * Removes eight bytes from this source and returns an unsigned long integer composed of it\n * according to the big-endian order.\n *\n * @throws EOFException when there are not enough data to read an unsigned long value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readULong\n */"}
{"signature":"public fun Source . readUShortLe ( ) : UShort","body":"= readShortLe ( ) . toUShort ( )","docstring":"/**\n * Removes two bytes from this source and returns an unsigned short integer composed of it\n * according to the little-endian order.\n *\n * @throws EOFException when there are not enough data to read an unsigned short value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUShortLe\n */"}
{"signature":"public fun Source . readUIntLe ( ) : UInt","body":"= readIntLe ( ) . toUInt ( )","docstring":"/**\n * Removes four bytes from this source and returns an unsigned integer composed of it\n * according to the little-endian order.\n *\n * @throws EOFException when there are not enough data to read an unsigned int value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUIntLe\n */"}
{"signature":"public fun Source . readULongLe ( ) : ULong","body":"= readLongLe ( ) . toULong ( )","docstring":"/**\n * Removes eight bytes from this source and returns an unsigned long integer composed of it\n * according to the little-endian order.\n *\n * @throws EOFException when there are not enough data to read an unsigned long value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readULongLe\n */"}
{"signature":"public fun Source . readFloat ( ) : Float","body":"= Float . fromBits ( readInt ( ) )","docstring":"/**\n * Removes four bytes from this source and returns a floating point number with type [Float] composed of it\n * according to the big-endian order.\n *\n * The [Float.Companion.fromBits] function is used for decoding bytes into [Float].\n *\n * @throws EOFException when there are not enough data to read an unsigned int value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readFloat\n */"}
{"signature":"public fun Source . readDouble ( ) : Double","body":"= Double . fromBits ( readLong ( ) )","docstring":"/**\n * Removes eight bytes from this source and returns a floating point number with type [Double] composed of it\n * according to the big-endian order.\n *\n * The [Double.Companion.fromBits] function is used for decoding bytes into [Double].\n *\n * @throws EOFException when there are not enough data to read an unsigned int value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readDouble\n */"}
{"signature":"public fun Source . readFloatLe ( ) : Float","body":"= Float . fromBits ( readIntLe ( ) )","docstring":"/**\n * Removes four bytes from this source and returns a floating point number with type [Float] composed of it\n * according to the little-endian order.\n *\n * The [Float.Companion.fromBits] function is used for decoding bytes into [Float].\n *\n * @throws EOFException when there are not enough data to read an unsigned int value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readFloatLe\n */"}
{"signature":"public fun Source . readDoubleLe ( ) : Double","body":"= Double . fromBits ( readLongLe ( ) )","docstring":"/**\n * Removes eight bytes from this source and returns a floating point number with type [Double] composed of it\n * according to the little-endian order.\n *\n * The [Double.Companion.fromBits] function is used for decoding bytes into [Double].\n *\n * @throws EOFException when there are not enough data to read an unsigned int value.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readDoubleLe\n */"}
{"signature":"@ OptIn ( InternalIoApi :: class )  public fun Source . startsWith ( byte : Byte ) : Boolean","body":"= request (  ) && buffer [  ] == byte","docstring":"/**\n * Return `true` if the next byte to be consumed from this source is equal to [byte].\n * Otherwise, return `false` as well as when the source is exhausted.\n *\n * If there is no buffered data, this call will result in a fetch from the underlying source.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.startsWithSample\n */"}
{"signature":"internal fun Ops . withExpandedDimensions ( input : Operand < Float > , operation : ( Operand < Float > ) -> Operand < Float > ) : Operand < Float >","body":"{  val expandedInput = expandDims ( input , constant ( EXTRA_DIM ) )  val expandedOutput = operation ( expandedInput )  return squeeze ( expandedOutput , squeezeAxis )  }","docstring":"/**\n * Adds an extra dimension to the input, performs the provided operation\n * and squeezes the result by removing the dimension added previously.\n * This allows to perform 2D operations on 1D inputs.\n */"}
{"signature":"@ ExperimentalForeignApi  public fun asCPointer ( ) : COpaquePointer ?","body":"= interpretCPointer < COpaque > ( stable . value )","docstring":"/**\n * Returns raw C pointer value, usable for interoperability with C scenarious.\n */"}
{"signature":"@ FreezingIsDeprecated  @ ObsoleteWorkersApi  public inline fun < reified T > DetachedObjectGraph < T > . attach ( ) : T","body":"{  var rawStable : NativePtr  do {  rawStable = stable . value  } while ( ! stable . compareAndSet ( rawStable , NativePtr . NULL ) )  val result = attachObjectGraphInternal ( rawStable ) as T  return result  }","docstring":"/**\n * Attaches previously detached object subgraph created by [DetachedObjectGraph].\n * Please note, that once object graph is attached, the [DetachedObjectGraph.stable] pointer does not\n * make sense anymore, and shall be discarded, so attach of one DetachedObjectGraph object can only\n * happen once.\n */"}
{"signature":"public fun getStackTraceElement ( ) : StackTraceElement ?","body":"public fun getStackTraceElement ( ) : StackTraceElement ?","docstring":"/**\n * Returns stack trace element that correspond to this stack frame.\n * The result is `null` if the stack trace element is not available for this frame.\n * In this case, the debugger represents this stack frame using the\n * result of [toString] function.\n */"}
{"signature":"protected abstract fun upSample ( tf : Ops , input : Operand < Float > ) : Operand < Float >","body":"protected abstract fun upSample ( tf : Ops , input : Operand < Float > ) : Operand < Float >","docstring":"/**\n * The actual implementation of upsampling operation which each subclassed layer needs to\n * implement. This method will then be called from [build] method to upsample the input tensor.\n */"}
{"signature":"internal fun repeat ( tf : Ops , value : Operand < Float > , repeats : Int , axis : Int ) : Operand < Float >","body":"{  val inputShape = value . asOutput ( ) . shape ( )  val splits = tf . split ( tf . constant ( axis ) , value , inputShape . size ( axis ) )  val multiples = tf . constant ( IntArray ( inputShape . numDimensions ( ) ) { if ( it == axis ) repeats else  } )  val repeated = splits . map { tf . tile ( it , multiples ) }  if ( repeated . size ==  )  return repeated [  ]  return tf . concat ( repeated , tf . constant ( axis ) )  }","docstring":"/**\n * Repeat elements of a given tensor [value] for [repeats] times along the given [axis].\n *\n * For example, if the given tensor is equal to `[1, 2, 3]`, `repeats=2` and `axis=0`,\n * the output of this function would be `[1, 1, 2, 2, 3, 3]`.\n */"}
{"signature":"private fun IrBuilderWithScope . add ( sourceFile : SourceFile , node : ExpressionNode , variables : List < IrTemporaryVariable > , call : IrBuilderWithScope . ( IrExpression , List < IrTemporaryVariable > ) -> IrExpression , ) : IrExpression","body":"{  return irBlock {  val head = node . expressions . first ( ) . deepCopyWithSymbols ( scope . getLocalDeclarationParent ( ) )  val expressions = ( buildTree ( head ) as ExpressionNode ) . expressions  val transformer = IrTemporaryExtractionTransformer ( this @ irBlock , expressions . toSet ( ) , sourceFile )  val transformed = expressions . first ( ) . transform ( transformer , null )  + call ( transformed , variables + transformer . variables )  }  }","docstring":"/**\n * ```\n * val result = call(1 + 2 + 3)\n * ```\n * Transforms to\n * ```\n * val result = run {\n * val tmp0 = 1 + 2\n * val tmp1 = tmp0 + 3\n * call(tmp1, )\n * }\n * ```\n */"}
{"signature":"private fun IrBuilderWithScope . nest ( sourceFile : SourceFile , node : AndNode , index : Int , variables : List < IrTemporaryVariable > , call : IrBuilderWithScope . ( IrExpression , List < IrTemporaryVariable > ) -> IrExpression , ) : IrExpression","body":"{  val children = node . children  val child = children [ index ]  return buildExpression ( sourceFile , child , variables ) { argument , newVariables ->  if ( index +  == children . size ) {  call ( argument , newVariables )  } else {  irIfThenElse ( context . irBuiltIns . anyType , argument , nest ( sourceFile , node , index +  , newVariables , call ) , call ( irFalse ( ) , newVariables ) , )  }  }  }","docstring":"/**\n * ```\n * val result = call(1 == 1 && 2 == 2)\n * ```\n * Transforms to\n * ```\n * val result = run {\n * val tmp0 = 1 == 1\n * if (tmp0) {\n * val tmp1 = 2 == 2\n * call(tmp1, )\n * }\n * else call(false, )\n * }\n * ```\n */"}
{"signature":"private fun IrBuilderWithScope . nest ( sourceFile : SourceFile , node : OrNode , index : Int , variables : List < IrTemporaryVariable > , call : IrBuilderWithScope . ( IrExpression , List < IrTemporaryVariable > ) -> IrExpression , ) : IrExpression","body":"{  val children = node . children  val child = children [ index ]  return buildExpression ( sourceFile , child , variables ) { argument , newVariables ->  if ( index +  == children . size ) {  call ( argument , newVariables )  } else {  irIfThenElse ( context . irBuiltIns . anyType , argument , call ( irTrue ( ) , newVariables ) , nest ( sourceFile , node , index +  , newVariables , call ) , )  }  }  }","docstring":"/**\n * ```\n * val result = call(1 == 1 || 2 == 2)\n * ```\n * Transforms to\n * ```\n * val result = run {\n * val tmp0 = 1 == 1\n * if (tmp0) call(true, )\n * else {\n * val tmp1 = 2 == 2\n * call(tmp1, )\n * }\n * }\n * ```\n */"}
{"signature":"fun refineDeclarationModality ( modifierListOwner : KtModifierListOwner , declaration : DeclarationDescriptor ? , containingDeclaration : DeclarationDescriptor ? , currentModality : Modality , isImplicitModality : Boolean ) : Modality ?","body":"= null","docstring":"/**\n * Returns the new modality for the [declaration], or null if the [currentModality] is good enough.\n */"}
{"signature":"private fun List < Documentable > . filterOutActualTypeAlias ( ) : List < Documentable >","body":"{  fun List < Documentable > . hasExpectClass ( dri : DRI ) =  find { it is DClasslike && it . dri == dri && it . expectPresentInSet != null } != null  return this . filterNot { it is DTypeAlias && this . hasExpectClass ( it . dri ) }  }","docstring":"/**\n * We want to generate separated pages for no-actual typealias.\n * Actual typealias are displayed on pages for their expect class (trough [ActualTypealias] extra).\n *\n * @see ActualTypealias\n */"}
{"signature":"public open fun pageForClasslikes ( documentables : List < Documentable > ) : ClasslikePageNode","body":"{  val dri = documentables . dri . also {  if ( it . size !=  ) {  logger . error ( \"\" )  }  }  val classlikes = documentables . filterIsInstance < DClasslike > ( )  val constructors =  if ( classlikes . shouldDocumentConstructors ( ) ) {  classlikes . flatMap { ( it as? WithConstructors ) ? . constructors ? : emptyList ( ) }  } else {  emptyList ( )  }  val nestedClasslikes = classlikes . flatMap { it . classlikes }  val functions = classlikes . flatMap { it . filteredFunctions }  val props = classlikes . flatMap { it . filteredProperties }  val entries = classlikes . flatMap { if ( it is DEnum ) it . entries else emptyList ( ) }  val childrenPages = constructors . map ( :: pageForFunction ) +  if ( mergeImplicitExpectActualDeclarations )  nestedClasslikes . mergeClashingDocumentable ( ) . map ( :: pageForClasslikes ) +  functions . mergeClashingDocumentable ( ) . map ( :: pageForFunctions ) +  props . mergeClashingDocumentable ( ) . map ( :: pageForProperties ) +  entries . mergeClashingDocumentable ( ) . map ( :: pageForEnumEntries )  else  nestedClasslikes . renameClashingDocumentable ( ) . map ( :: pageForClasslike ) +  functions . renameClashingDocumentable ( ) . map ( :: pageForFunction ) +  props . renameClashingDocumentable ( ) . mapNotNull ( :: pageForProperty ) +  entries . renameClashingDocumentable ( ) . map ( :: pageForEnumEntry )  return ClasslikePageNode ( documentables . first ( ) . nameAfterClash ( ) , contentForClasslikesAndEntries ( documentables ) , dri , documentables , childrenPages )  }","docstring":"/**\n * @param documentables a list of [DClasslike] and [DTypeAlias] with the same dri in different sourceSets\n */"}
{"signature":"protected open fun contentForClasslikesAndEntries ( documentables : List < Documentable > ) : ContentGroup","body":"=  contentBuilder . contentFor ( documentables . dri , documentables . sourceSets ) {  val classlikes = documentables . filterIsInstance < DClasslike > ( )  @ Suppress ( \"\" )  val extensions = ( classlikes as List < WithExtraProperties < DClasslike > > ) . flatMap {  it . extra [ CallableExtensions ] ? . extensions  ? . filterIsInstance < Documentable > ( ) . orEmpty ( )  }  . distinctBy { it . sourceSets to it . dri }  group ( kind = ContentKind . Cover , sourceSets = mainSourcesetData + extensions . sourceSets ) {  cover ( documentables . first ( ) . name . orEmpty ( ) )  sourceSetDependentHint ( documentables . dri , documentables . sourceSets ) {  documentables . forEach {  + buildSignature ( it )  + contentForDescription ( it )  }  }  }  val csEnum = classlikes . filterIsInstance < DEnum > ( )  val csWithConstructor = classlikes . filterIsInstance < WithConstructors > ( )  val scopes = documentables . filterIsInstance < WithScope > ( )  val constructorsToDocumented = csWithConstructor . flatMap { it . constructors }  group ( styles = setOf ( ContentStyle . TabbedContent ) , sourceSets = mainSourcesetData + extensions . sourceSets , extra = mainExtra ) {  if ( constructorsToDocumented . isNotEmpty ( ) && documentables . shouldDocumentConstructors ( ) ) {  + contentForConstructors ( constructorsToDocumented , classlikes . dri , classlikes . sourceSets )  }  if ( csEnum . isNotEmpty ( ) ) {  + contentForEntries ( csEnum . flatMap { it . entries } , csEnum . dri , csEnum . sourceSets )  }  + contentForScopes ( scopes , documentables . sourceSets , extensions )  }  }","docstring":"/**\n * @param documentables a list of [DClasslike] and [DEnumEntry] and [DTypeAlias] with the same dri in different sourceSets\n */"}
{"signature":"private fun sortDivergentElementsDeterministically ( elements : List < Documentable > ) : List < Documentable >","body":"=  elements . takeIf { it . size >  }  ? . sortedWith ( divergentDocumentableComparator )  ? : elements","docstring":"/**\n * Divergent elements, such as extensions for the same receiver, can have identical signatures\n * if they are declared in different places. If such elements are shown on the same page together,\n * they need to be rendered deterministically to have reproducible builds.\n *\n * For example, you can have three identical extensions, if they are declared as:\n * 1) top-level in package A\n * 2) top-level in package B\n * 3) inside a companion object in package A/B\n *\n * @see divergentBlock\n *\n * @param elements can contain types (annotation/class/interface/object/typealias), functions and properties\n * @return the original list if it has one or zero elements\n */"}
{"signature":"@ Test  fun testSupervisorScopeExternalCancellation ( )","body":"= runTest {  var childJob : Job ? = null  val job = launch {  supervisorScope {  childJob = launch ( start = CoroutineStart . UNDISPATCHED ) {  try {  delay ( Long . MAX_VALUE )  } finally {  expect (  )  }  }  }  }  while ( childJob == null ) yield ( )  expect (  )  job . cancel ( )  assertTrue ( childJob ! ! . isCancelled )  job . join ( )  finish (  )  }","docstring":"/**\n * Tests that [supervisorScope] cancels all its children when the current coroutine is cancelled.\n */"}
{"signature":"private fun PsiClass . createDefaultConstructor ( ) : PsiMethod","body":"{  val psiElementFactory = JavaPsiFacade . getElementFactory ( project )  val signature = when ( val classVisibility = getVisibility ( ) ) {  JavaVisibility . Default -> name . orEmpty ( )  else -> \"\"  }  return psiElementFactory . createConstructor ( signature , this )  }","docstring":"/**\n * PSI doesn't return a default constructor if class doesn't contain an explicit one.\n * This method create synthetic constructor\n * Visibility modifier is preserved from the class.\n */"}
{"signature":"private fun Collection < PsiAnnotation > . findJvmFieldAnnotation ( ) : Annotations . Annotation ?","body":"{  val anyJvmFieldAnnotation = this . any {  it . qualifiedName == \"\"  }  return if ( anyJvmFieldAnnotation ) {  Annotations . Annotation ( DRI ( JVM_FIELD_PACKAGE_NAME , JVM_FIELD_CLASS_NAMES ) , emptyMap ( ) )  } else {  null  }  }","docstring":"/**\n * Workaround for getting JvmField Kotlin annotation in PSIs\n */"}
{"signature":"private fun JvmAnnotationAttributeValue . toValue ( ) : AnnotationParameterValue ?","body":"{  return when ( this ) {  is JvmAnnotationEnumFieldValue -> ( field as? PsiElement ) ? . let { EnumValue ( fieldName ? : \"\" , DRI . from ( it ) ) }  is JvmAnnotationConstantValue -> this . constantValue ? . toAnnotationLiteralValue ( )  else -> null  }  }","docstring":"/**\n * This is a workaround for static imports from JDK like RetentionPolicy\n * For some reason they are not represented in the same way than using normal import\n */"}
{"signature":"public fun Scheduler . asCoroutineDispatcher ( ) : CoroutineDispatcher","body":"=  if ( this is DispatcherScheduler ) {  dispatcher  } else {  SchedulerCoroutineDispatcher ( this )  }","docstring":"/**\n * Converts an instance of [Scheduler] to an implementation of [CoroutineDispatcher]\n * and provides native support of [delay] and [withTimeout].\n */"}
{"signature":"public fun CoroutineDispatcher . asScheduler ( ) : Scheduler","body":"=  if ( this is SchedulerCoroutineDispatcher ) {  scheduler  } else {  DispatcherScheduler ( this )  }","docstring":"/**\n * Converts an instance of [CoroutineDispatcher] to an implementation of [Scheduler].\n */"}
{"signature":"private fun CoroutineScope . scheduleTask ( block : Runnable , delayMillis : Long , adaptForScheduling : ( Task ) -> Runnable ) : Disposable","body":"{  val ctx = coroutineContext  var handle : DisposableHandle ? = null  val disposable = Disposables . fromRunnable {  handle ? . dispose ( )  }  val decoratedBlock = RxJavaPlugins . onSchedule ( block )  suspend fun task ( ) {  if ( disposable . isDisposed ) return  try {  runInterruptible {  decoratedBlock . run ( )  }  } catch ( e : Throwable ) {  handleUndeliverableException ( e , ctx )  }  }  val toSchedule = adaptForScheduling ( :: task )  if ( ! isActive ) return Disposables . disposed ( )  if ( delayMillis <=  ) {  toSchedule . run ( )  } else {  @ Suppress ( \"\" , \"\" )  ctx . delay . invokeOnTimeout ( delayMillis , toSchedule , ctx ) . let { handle = it }  }  return disposable  }","docstring":"/**\n * Schedule [block] so that an adapted version of it, wrapped in [adaptForScheduling], executes after [delayMillis]\n * milliseconds.\n */"}
{"signature":"override fun dispatch ( context : CoroutineContext , block : Runnable )","body":"{  scheduler . scheduleDirect ( block )  }","docstring":"/** @suppress */"}
{"signature":"override fun scheduleResumeAfterDelay ( timeMillis : Long , continuation : CancellableContinuation < Unit > )","body":"{  val disposable = scheduler . scheduleDirect ( {  with ( continuation ) { resumeUndispatched ( Unit ) }  } , timeMillis , TimeUnit . MILLISECONDS )  continuation . disposeOnCancellation ( disposable )  }","docstring":"/** @suppress */"}
{"signature":"override fun invokeOnTimeout ( timeMillis : Long , block : Runnable , context : CoroutineContext ) : DisposableHandle","body":"{  val disposable = scheduler . scheduleDirect ( block , timeMillis , TimeUnit . MILLISECONDS )  return DisposableHandle { disposable . dispose ( ) }  }","docstring":"/** @suppress */"}
{"signature":"override fun equals ( other : Any ? ) : Boolean","body":"= other is SchedulerCoroutineDispatcher && other . scheduler === scheduler","docstring":"/** @suppress */"}
{"signature":"override fun hashCode ( ) : Int","body":"= System . identityHashCode ( scheduler )","docstring":"/** @suppress */"}
{"signature":"fun < R , D > accept ( visitor : IrElementVisitor < R , D > , data : D ) : R","body":"fun < R , D > accept ( visitor : IrElementVisitor < R , D > , data : D ) : R","docstring":"/**\n * Runs the provided [visitor] on the IR subtree with the root at this node.\n *\n * @param visitor The visitor to accept.\n * @param data An arbitrary context to pass to each invocation of [visitor]'s methods.\n * @return The value returned by the topmost `visit*` invocation.\n */"}
{"signature":"fun < D > transform ( transformer : IrElementTransformer < D > , data : D ) : IrElement","body":"fun < D > transform ( transformer : IrElementTransformer < D > , data : D ) : IrElement","docstring":"/**\n * Runs the provided [transformer] on the IR subtree with the root at this node.\n *\n * @param transformer The transformer to use.\n * @param data An arbitrary context to pass to each invocation of [transformer]'s methods.\n * @return The transformed node.\n */"}
{"signature":"fun < D > acceptChildren ( visitor : IrElementVisitor < Unit , D > , data : D )","body":"fun < D > acceptChildren ( visitor : IrElementVisitor < Unit , D > , data : D )","docstring":"/**\n * Runs the provided [visitor] on subtrees with roots in this node's children.\n *\n * Basically, calls `accept(visitor, data)` on each child of this node.\n *\n * Does **not** run [visitor] on this node itself.\n *\n * @param visitor The visitor for children to accept.\n * @param data An arbitrary context to pass to each invocation of [visitor]'s methods.\n */"}
{"signature":"fun < D > transformChildren ( transformer : IrElementTransformer < D > , data : D )","body":"fun < D > transformChildren ( transformer : IrElementTransformer < D > , data : D )","docstring":"/**\n * Recursively transforms this node's children *in place* using [transformer].\n *\n * Basically, executes `this.child = this.child.transform(transformer, data)` for each child of this node.\n *\n * Does **not** run [transformer] on this node itself.\n *\n * @param transformer The transformer to use for transforming the children.\n * @param data An arbitrary context to pass to each invocation of [transformer]'s methods.\n */"}
{"signature":"private fun fixOffsetRepresentation ( isoString : String ) : String","body":"{  val time = isoString . indexOf ( '' , ignoreCase = true )  if ( time == -  ) return isoString  val offset = isoString . indexOfLast { c -> c == '' || c == '' }  if ( offset < time ) return isoString  val separator = isoString . indexOf ( '' , offset )  return if ( separator != -  ) isoString else \"\"  }","docstring":"/** A workaround for the string representations of Instant that have an offset of the form\n * \"+XX\" not being recognized by [jtOffsetDateTime.parse], while \"+XX:XX\" work fine. */"}
{"signature":"public fun instrument ( resultDir : File , originalDirs : List < File ? > , filters : ClassFilters , countHits : Boolean )","body":"{  val outputs = ArrayList < File > ( originalDirs . size )  for ( i in originalDirs . indices ) {  outputs . add ( resultDir )  }  val previousConDySetting = ConDySettings . disableConDy ( )  try {  OfflineInstrumentationApi . instrument ( originalDirs , outputs , filters . convert ( ) , countHits )  } finally {  ConDySettings . restoreConDy ( previousConDySetting )  }  }","docstring":"/**\n * Generate modified class-files to measure the coverage.\n *\n * @param resultDir Directory where the instrumented class-files will be placed\n * @param originalDirs Root directories where the original files are located, the coverage of which needs to be measured\n * @param filters Filters to limit the classes that will be displayed in the report\n * @param countHits Flag indicating whether to count the number of executions to each block of code. `false` if it is enough to register only the fact of at least one execution\n */"}
{"signature":"@ Throws ( IOException :: class )  public fun generateXmlReport ( xmlFile : File , binaryReports : List < File > , classfileDirs : List < File > , sourceDirs : List < File > , title : String , filters : ClassFilters )","body":"{  ReportApi . xmlReport ( xmlFile , title , binaryReports , classfileDirs , sourceDirs , filters . convert ( ) )  }","docstring":"/**\n * Generate Kover XML report, compatible with JaCoCo XML.\n *\n * @param xmlFile Path to the generated XML report\n * @param binaryReports List of coverage binary reports in IC format\n * @param classfileDirs List of root directories for compiled class-files\n * @param sourceDirs List of root directories for Java and Kotlin source files\n * @param title Title for header\n * @param filters Filters to limit the classes that will be displayed in the report\n * @throws IOException In case of a report generation error\n */"}
{"signature":"@ Throws ( IOException :: class )  public fun generateHtmlReport ( htmlDir : File , charsetName : String ? , binaryReports : List < File > , classfileDirs : List < File > , sourceDirs : List < File > , title : String , filters : ClassFilters )","body":"{  ErrorReporter . setLogLevel ( ErrorReporter . ERROR )  val oldFreemarkerLogger = System . setProperty ( FREE_MARKER_LOGGER_PROPERTY_NAME , \"\" )  try {  ReportApi . htmlReport ( htmlDir , title , charsetName , binaryReports , classfileDirs , sourceDirs , filters . convert ( ) )  } finally {  if ( oldFreemarkerLogger == null ) {  System . clearProperty ( FREE_MARKER_LOGGER_PROPERTY_NAME )  } else {  System . setProperty ( FREE_MARKER_LOGGER_PROPERTY_NAME , oldFreemarkerLogger )  }  }  }","docstring":"/**\n * Generate Kover HTML report.\n *\n * @param htmlDir Output directory with result HTML report\n * @param charsetName Name of charset used in HTML report\n * @param binaryReports List of coverage binary reports in IC format\n * @param classfileDirs List of root directories for compiled class-files\n * @param sourceDirs List of root directories for Java and Kotlin source files\n * @param title Title for header\n * @param filters Filters to limit the classes that will be displayed in the report.\n * @throws IOException In case of a report generation error\n */"}
{"signature":"public fun verify ( rules : List < Rule > , tempDir : File , filters : ClassFilters , binaryReports : List < File > , classfileDirs : List < File > ) : List < RuleViolations >","body":"{  try {  return LegacyVerification . verify ( rules , tempDir , filters , binaryReports , classfileDirs )  } catch ( e : IOException ) {  throw RuntimeException ( \"\" , e )  }  }","docstring":"/**\n * Verify coverage by specified verification rules.\n *\n * @param rules List of the verification rules to check\n * @param tempDir Directory to create temporary files\n * @param filters Filters to limit the classes that will be verified\n * @param binaryReports List of coverage binary reports in IC format\n * @param classfileDirs List of root directories for compiled class-files\n * @return List of rule violation errors, empty list if there is no verification errors.\n */"}
{"signature":"public fun aggregateIc ( icFile : File , filters : ClassFilters , tempDir : File , binaryReports : List < File > , classfileDirs : List < File > )","body":"{  val smapFile = tempDir . resolve ( \"\" )  val request = Request ( filters . convert ( ) , icFile , smapFile )  AggregatorApi . aggregate ( listOf ( request ) , binaryReports , classfileDirs )  }","docstring":"/**\n * Merge several IC binaryReports into one file.\n *\n * @param icFile Target IC report file\n * @param filters Filters to limit the classes that will be placed into result file\n * @param tempDir Directory to create temporary files\n * @param binaryReports List of coverage binary reports in IC format\n * @param classfileDirs List of root directories for compiled class-files\n */"}
{"signature":"public fun evalCoverage ( groupBy : GroupingBy , coverageUnit : CoverageUnit , aggregationForGroup : AggregationType , tempDir : File , filters : ClassFilters , binaryReports : List < File > , classfileDirs : List < File > ) : List < CoverageValue >","body":"{  val bound = Bound ( LegacyVerification . ONE_HUNDRED , BigDecimal . ZERO , coverageUnit , aggregationForGroup )  val rule = Rule ( \"\" , groupBy , listOf ( bound ) )  val violations = verify ( listOf ( rule ) , tempDir , filters , binaryReports , classfileDirs )  val result = ArrayList < CoverageValue > ( )  for ( violation in violations ) {  for ( boundViolation in violation . violations ) {  result . add ( CoverageValue ( boundViolation . entityName , boundViolation . value ) )  }  }  return result  }","docstring":"/**\n * Get coverage values from binary reports.\n *\n * @param groupBy Code unit for which coverage will be aggregated\n * @param coverageUnit Specify which units to measure coverage for (line, branch, etc.)\n * @param aggregationForGroup Aggregation function that will be calculated over all the elements of the same group\n * @param tempDir Directory to create temporary files\n * @param filters Filters to limit the classes that will be placed into result coverage\n * @param binaryReports List of coverage binary reports in IC format\n * @param classfileDirs List of root directories for compiled class-files\n * @return List of coverage values.\n */"}
{"signature":"protected open fun getOutputDepth ( numberOfChannels : Long ) : Long","body":"= filters . toLong ( )","docstring":"/** Define the number of output channels given the number of input channels.\n * Defaults to the number of filter in convolutional layer. */"}
{"signature":"protected open fun computeKernelShape ( numberOfChannels : Long ) : Shape","body":"=  shapeFromDims ( * kernelSize . toLongArray ( ) , numberOfChannels , filters . toLong ( ) )","docstring":"/**\n * Define the [kernel] shape by default from its [kernelSize],\n * [filters] and the given [numberOfChannels] from input Tensor.\n *\n * @param numberOfChannels for input of this layer\n */"}
{"signature":"protected open fun computeBiasShape ( numberOfChannels : Long ) : Shape","body":"=  Shape . make ( filters . toLong ( ) )","docstring":"/**\n * Define the [bias] shape by default from its [filters] and\n * the given [numberOfChannels] from input Tensor.\n *\n * @param numberOfChannels for input of this layer\n */"}
{"signature":"protected abstract fun kernelVarName ( name : String ) : String","body":"protected abstract fun kernelVarName ( name : String ) : String","docstring":"/** Given a layer name specify its kernel name. */"}
{"signature":"protected abstract fun biasVarName ( name : String ) : String","body":"protected abstract fun biasVarName ( name : String ) : String","docstring":"/** Given a layer name specify its bias name. */"}
{"signature":"protected abstract fun convImplementation ( tf : Ops , input : Operand < Float > ) : Operand < Float >","body":"protected abstract fun convImplementation ( tf : Ops , input : Operand < Float > ) : Operand < Float >","docstring":"/** The actual layer operation implementation without adding the bias which is added by the abstract class. */"}
{"signature":"@ Test  fun testDifferentClassLoaders ( )","body":"{  val elementKType1 = SimpleKType ( loadClass ( ) . kotlin )  val elementKType2 = SimpleKType ( loadClass ( ) . kotlin )  assertEquals ( elementKType1 . classifier . java . canonicalName , elementKType2 . classifier . java . canonicalName )  assertNotSame ( elementKType1 . classifier . java . classLoader , elementKType2 . classifier . java . classLoader )  assertEquals ( elementKType1 , elementKType2 )  val kType1 = SingleParametrizedKType ( List :: class , elementKType1 )  val kType2 = SingleParametrizedKType ( List :: class , elementKType2 )  val serializer1 = serializer ( kType1 )  val serializer2 = serializer ( kType2 )  assertNotSame ( serializer1 , serializer2 )  Json . decodeFromString ( serializer1 , \"\" )  Json . decodeFromString ( serializer2 , \"\" )  }","docstring":"/**\n * Checking the case when a parameterized type is loaded in different parallel [ClassLoader]s.\n *\n * If the main type is loaded by a common parent [ClassLoader] (for example, a bootstrap for [List]),\n * and the element class is loaded by different loaders, then some implementations of the [KType] (e.g. `KTypeImpl` from reflection) may not see the difference between them.\n *\n * As a result, a serializer for another loader will be returned from the cache, and it will generate instances, when working with which we will get an [ClassCastException].\n *\n * The test checks the correctness of the cache for such cases - that different serializers for different loaders will be returned.\n *\n * [see](https://youtrack.jetbrains.com/issue/KT-54523).\n */"}
{"signature":"private fun loadClass ( ) : Class < * >","body":"{  val classesUrl = this :: class . java . classLoader . getResource ( \"\" )  val loader1 = URLClassLoader ( arrayOf ( classesUrl ) , this :: class . java . classLoader )  return loader1 . loadClass ( \"\" )  }","docstring":"/**\n * Load class `example.Foo` via new class loader. Compiled class-file located in the resources.\n */"}
{"signature":"public fun < T > predict ( inputData : FloatData , extractResult : ( R ) -> T ) : T","body":"public fun < T > predict ( inputData : FloatData , extractResult : ( R ) -> T ) : T","docstring":"/**\n * Run inference on the provided [inputData] and pass inference result to the [extractResult] function.\n */"}
{"signature":"public fun < T > predict ( inputs : Map < String , FloatData > , outputs : List < String > , extractResult : ( R ) -> T ) : T","body":"public fun < T > predict ( inputs : Map < String , FloatData > , outputs : List < String > , extractResult : ( R ) -> T ) : T","docstring":"/**\n * Run inference on the provided [inputs], calculate the specified [outputs]\n * and pass inference result to the [extractResult] function.\n */"}
{"signature":"public fun copy ( ) : InferenceModel < R >","body":"public fun copy ( ) : InferenceModel < R >","docstring":"/**\n * Creates a copy of this model.\n *\n * @return A copied inference model.\n */"}
{"signature":"@ Suppress ( \"\" , \"\" )  public inline fun < D : Dimension > dimensionOf ( dim : Int ) : D","body":"= when ( dim ) {   -> D1   -> D2   -> D3   -> D4  else -> DN ( dim )  } as D","docstring":"/**\n * Returns specific [Dimension] by integer [dim].\n */"}
{"signature":"public inline fun < reified D : Dimension > dimensionClassOf ( dim : Int = -  ) : D","body":"= when ( D :: class ) {  D1 :: class -> D1  D2 :: class -> D2  D3 :: class -> D3  D4 :: class -> D4  else -> DN ( dim )  } as D","docstring":"/**\n * * Returns specific [Dimension] by integer [dim]. Where [D] is `reified` type.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . all ( ) : Boolean","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this ) , kClass = Boolean :: class )","docstring":"/**\n * Test whether all array elements along a given axis evaluate to *true*.\n *\n * @return [Boolean] value.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . all ( vararg axis : Int ) : KtNDArray < Boolean >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ) )","docstring":"/**\n * @param axis: [Int] or [IntArray]- axis along which a logical AND reduction is performed.\n * If [axis] is negative, in which case if counts from the last to the first axis.\n *\n * @return new [KtNDArray] of type [Boolean].\n */"}
{"signature":"inline fun < T : Any > KtNDArray < T > . all ( predicate : ( T ) -> Boolean ) : Boolean","body":"{  for ( element in this . flatIter ( ) ) if ( ! predicate ( element ) ) return false  return true  }","docstring":"/**\n * Returns *true* if all elements satisfy the predicate.\n * Using buffer.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . any ( ) : Boolean","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this ) , kClass = Boolean :: class )","docstring":"/**\n * Test whether any array element along a given axis evaluates to *true*.\n *\n * @return [Boolean] value.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . any ( vararg axis : Int ) : KtNDArray < Boolean >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ) )","docstring":"/**\n * @param axis: default none, [Int] or [IntArray] - Axis along which a logical OR reduction is performed.\n * If [axis] is negative, in which case it counts from the last to the first axis.\n * @return new [KtNDArray] of type [Boolean].\n */"}
{"signature":"inline fun < T : Any > KtNDArray < T > . any ( predicate : ( T ) -> Boolean ) : Boolean","body":"{  for ( element in this . flatIter ( ) ) if ( predicate ( element ) ) return true  return false  }","docstring":"/**\n * Returns 'true' if any element satisfy the predicate.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . argMax ( ) : Long","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this ) , kClass = Long :: class )","docstring":"/**\n * Returns the indices of the maximum values along an axis.\n *\n * @return [Long] value.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . argMax ( axis : Int ) : KtNDArray < Long >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ) )","docstring":"/**\n * @param axis index is into the specified axis. By default, the index is into the flattened array.\n * @return new [KtNDArray] of type [Long]. Array indices into the array.\n * It has the same shape as shape with the dimension along [axis] removed.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . argMin ( ) : Long","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this ) , kClass = Long :: class )","docstring":"/**\n * Return the indices of the minimum values along the given axis of array.\n *\n * @return [Long] value.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . argMin ( axis : Int ) : KtNDArray < Long >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ) )","docstring":"/**\n * @param axis By default, axis is none, the index is nto the flattened array,\n * otherwise along the specified axis.\n * @return new [KtNDArray] of type [Long].\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . argSort ( axis : Int ? = -  , kind : String ? = null ) : KtNDArray < Long >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ? : None . none , kind ? : None . none ) )","docstring":"/**\n * Returns the indices that would sort this array.\n *\n * @param axis axis along which to sort.\n * The default is -1 (the last axis). If null, the flattened array is used.\n * @param kind sorting algorithm from {'quicksort', 'mergesort', 'heapsort', 'stable'}. The default is 'quicksort'.\n * @return [KtNDArray] of [Long] type. Array of indices that sort this array along the specified [axis].\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . byteSwap ( inplace : Boolean = false ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , inplace ) )","docstring":"/**\n * Swap the bytes of the array elements.\n *\n * @param inplace if 'true', swap swap in-place. Default value 'false'.\n * @return [KtNDArray]. If inplace 'true' return view, else copy data to new buffer.\n */"}
{"signature":"fun < E : Number , T : Number > KtNDArray < T > . choose ( choices : Array < E > , mode : Mode = Mode . RAISE ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , choices , None . none , mode . str ) )","docstring":"/**\n * Use an index array to construct a new array from a set of choices.\n *\n * @param choices choice arrays.\n * @param mode specifies how indices outside ```[0, n-1]``` will be treated.\n * @return The merged [KtNDArray] of type [T].\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . clip ( min : T ? = null , max : T ? = null ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , min ? : None . none , max ? : None . none ) )","docstring":"/**\n * Return an array whose values are limited to (min, max). One of max or min must be given.\n *\n * @param min minimum value. If null, clipping is not performed on lower interval edge.\n * Not more than one of [min] and [max] may be null.\n * @param max maximum value. If null, clipping is not performed on upper interval edge.\n * Not more than one of [min] and [max] may be null.\n * @return [KtNDArray] of type [T].\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . compress ( condition : BooleanArray , axis : Int ? = null ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , condition , axis ? : None . none ) )","docstring":"/** Return selected slices of this array along given axis.\n *\n * @param condition array of boolean that selects which entries to return.\n * @param axis axis along which to take slices. If null (default), work on the flattened array.\n * @return a copy of a without the slices along axis for which condition is false.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . copy ( order : Order = Order . C ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , order . name ) )","docstring":"/** Return a copy of the array. */"}
{"signature":"fun < T : Any > KtNDArray < T > . cumProd ( axis : Int ? = null ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ? : None . none , this . dtype ) )","docstring":"/**\n * Return the cumulative product of the elements along the given axis.\n *\n * @param axis along which the cumulative product is computed.\n * The default (null) is to compute the [cumProd] over the flattened array.\n * @return a new [KtNDArray] of type [T].\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . cumSum ( axis : Int ? = null ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ? : None . none , this . dtype ) )","docstring":"/**\n * Return the cumulative sum of the elements along the given axis.\n *\n * @param axis along which the cumulative sum is computed.\n * The default (null) is to compute the [cumSum] over the flattened array.\n * @return a new [KtNDArray] of type [T].\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . diagonal ( offset : Int =  , axis1 : Int =  , axis2 : Int =  ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , offset , axis1 , axis2 ) )","docstring":"/** Return specified diagonals.\n *\n * @param offset of the digonal from the main diagonal. Can be positive or negative.\n * Defaults to main diagonal, offset is 0.\n * @param axis1 to be used as the first axis of the 2D subarrays from which the diagonals should be taken.\n * Defaults to first axis is 0.\n * @param axis2 to be used as the second axis of the 2D subarrays from which the diagonals should be taken.\n * Defaults to second axis is 1\n */"}
{"signature":"@ JvmName ( \"\" )  fun < T : Number > KtNDArray < Byte > . dot ( b : KtNDArray < T > ) : KtNDArray < T >","body":"= this . prDot ( b )","docstring":"/**\n * Dot product of two arrays.\n *\n * @param b second array.\n * @return returns the dot product this array and b array.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . dump ( file : String )","body":"{  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , file ) , kClass = Unit :: class )  }","docstring":"/**\n * Dump a pickle of the array to the specified file.\n * @param file filename.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . dumps ( ) : String","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this ) , kClass = String :: class )","docstring":"/**\n * Returns the pickle of the array as a string.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . fill ( value : T )","body":"{  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , value ) , kClass = Unit :: class )  }","docstring":"/**\n * Fill the array with a scalar value.\n *\n * @param value - all elements of a will be assigned this value.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . flatten ( order : Order = Order . C ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , order . name ) )","docstring":"/**\n * Return a copy of the array collapsed into one dimension.\n *\n * @param order see [Order].\n * @return a flatten [KtNDArray] of type [T].\n */"}
{"signature":"inline fun < T : Any , reified R : Any > KtNDArray < T > . getfield ( offset : Int =  ) : KtNDArray < R >","body":"=  callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , R :: class . javaObjectType , offset ) )","docstring":"/**\n * Returns a field of the given array as a certain type.\n * A field is a view of the array data with a given data-type.\n *\n * @param T type of array.\n * @param R type of field.\n * @param offset numbers of bytes to skip before beginning the element view.\n * @return view of [KtNDArray] of type [R].\n */"}
{"signature":"inline fun < reified T : Any > KtNDArray < T > . item ( vararg arg : Int ) : T","body":"=  callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , arg ) , kClass = T :: class )","docstring":"/**\n * Copy an element of an array to a standard Python/Java scalar and return it.\n */"}
{"signature":"inline fun < reified T : Number > KtNDArray < T > . max ( ) : T ?","body":"=  callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this ) , kClass = T :: class )","docstring":"/**\n * Maximum of an array or maximum along an axis.\n *\n * @param axis axis or axes along which to operate. By default, flattened input is used.\n * @return new [KtNDArray] of type [T] or [T] value.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . mean ( ) : Double","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , None . none , Double :: class . javaObjectType ) , kClass = Double :: class )","docstring":"/**\n * Returns the average of the array elements along given axis.\n *\n * @return [Double].\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . mean ( vararg axis : Int ) : KtNDArray < Double >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis , Double :: class . javaObjectType ) )","docstring":"/**\n * @param axis Int or IntArray - axis or axes along which the means are computed.\n * @return [KtNDArray].\n */"}
{"signature":"inline fun < reified T : Any > KtNDArray < T > . min ( ) : T ?","body":"=  callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this ) , kClass = T :: class )","docstring":"/**\n * Return the minimum along a given axis.\n *\n * @return [T] value.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . min ( vararg axis : Int ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ) )","docstring":"/**\n * @param axis axis or axes along which to operate.\n * @return new [KtNDArray] of type [T]/\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . nonZero ( ) : Array < Any >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this ) , kClass = Array < Any > :: class )","docstring":"/**\n * Return the indices of the elements that are non-zero.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . partition ( kth : IntArray , axis : Int = -  , kind : String = \"\" )","body":"{  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , kth , axis , kind ) , kClass = Unit :: class )  }","docstring":"/**\n * Rearranges the elements in the array in such a way that the value of\n * the element in kth position is in the position it would be in a sorted array.\n *\n * @param kth element index to partition by.\n * @param axis axis along which to sort. Default is -1, which means sort along the last axis.\n * @param kind selection algorithm. Default is 'introselect'.\n */"}
{"signature":"inline fun < reified T : Number > KtNDArray < T > . prod ( ) : T","body":"=  callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , None . none , T :: class . javaObjectType ) , kClass = T :: class )","docstring":"/**\n * Return the product of the array elements over the given axis.\n *\n * @return [T] value.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . prod ( vararg axis : Int ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis , this . dtype ) )","docstring":"/**\n * @param axis [Int] or [IntArray] - axis or axes along which a product is performed.\n *\n * @return new [KtNDArray] of type [T].\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . ptp ( vararg axis : Int ? = emptyArray ( ) ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis . ifEmpty { None . none } ) )","docstring":"/**\n * Peak to peak (maximum - minimum) value along a given axis.\n *\n * @param axis null, [Int], [IntArray] - Axis along which to find the peaks.\n * @return A new array holding the result.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . put ( indices : IntArray , values : Array < T > , mode : Mode = Mode . RAISE )","body":"{  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , indices , values , mode . str ) , kClass = Unit :: class )  }","docstring":"/**\n * Set array.flat.set(n) = values.set(n) for all n in indices.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . ravel ( order : Order = Order . C ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , order . name ) )","docstring":"/**\n * Return a flattened array.\n *\n * Return a contiguous flattened array.\n * A 1-D array, containing the elements of the input, is returned.\n *\n * @return view of [KtNDArray].\n * */"}
{"signature":"fun < T : Any > KtNDArray < T > . repeat ( repeats : Int , axis : Int ? = null ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , repeats , axis ? : None . none ) )","docstring":"/**\n * Repeat elements of an array.\n *\n * @param repeats The number of repetitions for each element.\n * @param axis The axis along which to repeat values.\n * By default, use the flattened input array, and return a flat output array.\n *\n * @return [KtNDArray]. Output array which has the same shape as input array, except along the given axis.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . reshape ( vararg dims : Int , order : Order = Order . C ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , dims ) , order = order )","docstring":"/**\n * Returns an array containing the same data with a new shape.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . resize ( vararg dims : Int )","body":"{  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , dims ) , kClass = Unit :: class )  }","docstring":"/**\n * Change shape and size of array in-place.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . round ( decimals : Int =  ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , decimals ) )","docstring":"/**\n * Return a with each element rounded to the given number of decimals.\n *\n * @param decimals Number of decimal places to round to (default: 0).\n * If decimals is negative, it specifies the number of positions to the left of the decimal point.\n *\n * @return [KtNDArray]\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . searchSorted ( v : Int , side : String = \"\" ) : Long","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , v , side ) , kClass = Long :: class )","docstring":"/**\n * Find indices where elements of v should be inserted in a to maintain order.\n */"}
{"signature":"inline fun < T : Any , reified R : Any > KtNDArray < T > . setfield ( value : R , offset : Int =  )","body":"{  callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , value , R :: class . javaObjectType , offset ) , kClass = Unit :: class )  }","docstring":"/**\n * Put a value into a specified place in a field defined by a data-type.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . setFlags ( write : Int ? = null , align : Int ? = null , uic : Int ? = null )","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , write ? : None . none , align ? : None . none , uic ? : None . none ) , kClass = Unit :: class )","docstring":"/**\n * Set array flags WRITEABLE, ALIGNED, (WRITEBACKIFCOPY and UPDATEIFCOPY), respectively.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . sort ( axis : Int = -  , kind : KindSort ? = null )","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis , kind ? : None . none ) , kClass = Unit :: class )","docstring":"/**\n * Sort an array, in-place.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . squeeze ( axis : Int ? = null ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis ? : None . none ) )","docstring":"/**\n * Remove single-dimensional entries from the shape of a.\n *\n * @return View.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . std ( ddof : Int =  ) : Double","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , None . none , Double :: class . javaObjectType , None . none , ddof ) , kClass = Double :: class )","docstring":"/**\n * Returns the standard deviation of the array elements along given axis.\n *\n * @return [Double] or [KtNDArray] of [Double].\n */"}
{"signature":"inline fun < reified T : Number > KtNDArray < T > . sum ( ) : T ?","body":"=  callFunc ( nameMethod = arrayOf ( \"\" , \"\" ) , args = arrayOf ( this , None . none , T :: class . javaObjectType ) , kClass = T :: class )","docstring":"/**\n * Sum of array elements over a given axis.\n *\n * @return [T] value.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . sum ( axis : Int ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis , this . dtype ) )","docstring":"/**\n * @param axis Axis or axes along which a sum is performed.\n * If [axis] is negative it counts from the last to the first axis.\n * @return new [KtNDArray] of type [T]. An array with the same shape as *this*,\n * with the specified axis removed.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . swapAxes ( axis1 : Int , axis2 : Int ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axis1 , axis2 ) )","docstring":"/**\n * Return a view of the array with axis1 and axis2 interchanged.\n *\n * @return View of [KtNDArray].\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . take ( indices : KtNDArray < Long > , axis : Int ? = null , mode : Mode = Mode . RAISE ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , indices , axis ? : None . none , None . none , mode . str ) )","docstring":"/**\n * Return an array formed from the elements of a at the given indices.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . toBytes ( order : Order = Order . C ) : ByteArray","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , order . name ) , kClass = ByteArray :: class )","docstring":"/**\n * Construct Python bytes containing the raw data bytes in the array.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . toFile ( fid : String , sep : String = \"\" , format : String = \"\" )","body":"{  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , fid , sep , format ) , kClass = Unit :: class )  }","docstring":"/**\n * Write array to a file as text or binary (default).\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . trace ( offset : Int =  , axis1 : Int =  , axis2 : Int =  ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , offset , axis1 , axis2 ) )","docstring":"/**\n * Return the sum along diagonals of the array.\n */"}
{"signature":"fun < T : Any > KtNDArray < T > . transpose ( vararg axes : Int ? = emptyArray ( ) ) : KtNDArray < T >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , axes . ifEmpty { None . none } ) )","docstring":"/**\n * Returns a view of the array with axes transposed.\n */"}
{"signature":"fun < T : Number > KtNDArray < T > . `var` ( ddof : Int =  ) : Double","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this , None . none , Double :: class . javaObjectType , None . none , ddof ) , kClass = Double :: class )","docstring":"/**\n * Returns the variance of the array elements, along given axis.\n */"}
{"signature":"fun < T : Any , NT : Any > KtNDArray < T > . view ( ) : KtNDArray < NT >","body":"=  callFunc ( nameMethod = arrayOf ( NDARRAY_STR , \"\" ) , args = arrayOf ( this ) )","docstring":"/**\n * New view of array with the same data.\n */"}
{"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . ERROR )  fun postProcess ( )","body":"= postProcess ( inOrAfterLinkageStep = true )","docstring":"/**\n * [postProcess] has two usages with different expectations:\n * - IR plugin API: actualize expects/actuals, generate fake overrides\n * - Linker(s): the same + run partial linkage\n *\n * In the future, this function should be split into several functions with different semantics for more precise use.\n */"}
{"signature":"fun modernLenetWithRegularizers ( )","body":"{  val ( train , test ) = mnist ( )  modernLeNet . use {  it . compile ( optimizer = SGD ( learningRate =  ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY )  println ( \"\" )  println ( it . kGraph )  it . init ( )  var accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  println ( \"\" )  println ( it . kGraph )  it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE )  println ( \"\" )  println ( it . kGraph )  accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  println ( it . kGraph )  println ( \"\" )  }  }","docstring":"/**\n * This example shows how to do image classification from scratch using [modernLeNet], without leveraging pre-trained weights or a pre-made model.\n * We demonstrate the workflow on the Mnist classification dataset.\n *\n * It includes:\n * - dataset loading from S3\n * - model compilation\n * - model summary (including TensorFlow graph operands)\n * - model training\n * - model evaluation\n */"}
{"signature":"fun main ( ) : Unit","body":"= modernLenetWithRegularizers ( )","docstring":"/** */"}
{"signature":"fun analyze ( project : Project , configuration : CompilerConfiguration ) : Boolean ?","body":"{  val extensions = FirAnalysisHandlerExtension . getInstances ( project ) . filter { it . isApplicable ( configuration ) }  return if ( extensions . isEmpty ( ) ) null else extensions . all { it . doAnalysis ( configuration ) }  }","docstring":"/**\n * Applies [FirAnalysisHandlerExtension] instances to a project\n * @receiver the project to analyze\n * @param configuration compiler configuration\n * @return [null] if no applicable extensions were found, [true] if all applicable extensions returned [true] from [doAnalysis],\n * [false] if any applicable extension returned [false]\n *\n * @see FirAnalysisHandlerExtension.isApplicable\n * @see FirAnalysisHandlerExtension.doAnalysis\n */"}
{"signature":"abstract fun isApplicable ( configuration : CompilerConfiguration ) : Boolean","body":"abstract fun isApplicable ( configuration : CompilerConfiguration ) : Boolean","docstring":"/**\n * Checks whether [doAnalysis] should be called\n * @param configuration compiler configuration\n * @return true if [doAnalysis] should be called\n */"}
{"signature":"abstract fun doAnalysis ( configuration : CompilerConfiguration ) : Boolean","body":"abstract fun doAnalysis ( configuration : CompilerConfiguration ) : Boolean","docstring":"/**\n * Performs code analysis\n * @param configuration compiler configuration\n * @return [true] if analysis completed successfully, [false] otherwise.\n * There can be different causes of failure, an incorrect configuration for example.\n * A failure means that there's no reason to continue building the project.\n */"}
{"signature":"public fun DataFrame . Companion . readSqlTable ( dbConfig : DatabaseConfiguration , tableName : String , limit : Int = DEFAULT_LIMIT ) : AnyFrame","body":"{  DriverManager . getConnection ( dbConfig . url , dbConfig . user , dbConfig . password ) . use { connection ->  return readSqlTable ( connection , tableName , limit )  }  }","docstring":"/**\n * Reads data from an SQL table and converts it into a DataFrame.\n *\n * @param [dbConfig] the configuration for the database, including URL, user, and password.\n * @param [tableName] the name of the table to read data from.\n * @param [limit] the maximum number of rows to retrieve from the table.\n * @return the DataFrame containing the data from the SQL table.\n */"}
{"signature":"public fun DataFrame . Companion . readSqlTable ( connection : Connection , tableName : String , limit : Int = DEFAULT_LIMIT ) : AnyFrame","body":"{  var preparedQuery = \"\"  if ( limit >  ) preparedQuery += \"\"  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  connection . createStatement ( ) . use { st ->  logger . debug { \"\" }  st . executeQuery ( preparedQuery ) . use { rs ->  val tableColumns = getTableColumnsMetadata ( rs )  return fetchAndConvertDataFromResultSet ( tableColumns , rs , dbType , limit )  }  }  }","docstring":"/**\n * Reads data from an SQL table and converts it into a DataFrame.\n *\n * @param [connection] the database connection to read tables from.\n * @param [tableName] the name of the table to read data from.\n * @param [limit] the maximum number of rows to retrieve from the table.\n * @return the DataFrame containing the data from the SQL table.\n *\n * @see DriverManager.getConnection\n */"}
{"signature":"public fun DataFrame . Companion . readSqlQuery ( dbConfig : DatabaseConfiguration , sqlQuery : String , limit : Int = DEFAULT_LIMIT ) : AnyFrame","body":"{  DriverManager . getConnection ( dbConfig . url , dbConfig . user , dbConfig . password ) . use { connection ->  return readSqlQuery ( connection , sqlQuery , limit )  }  }","docstring":"/**\n * Converts the result of an SQL query to the DataFrame.\n *\n * NOTE: SQL query should start from SELECT and contain one query for reading data without any manipulation.\n * It should not contain `;` symbol.\n *\n * @param [dbConfig] the database configuration to connect to the database, including URL, user, and password.\n * @param [sqlQuery] the SQL query to execute.\n * @param [limit] the maximum number of rows to retrieve from the result of the SQL query execution.\n * @return the DataFrame containing the result of the SQL query.\n */"}
{"signature":"public fun DataFrame . Companion . readSqlQuery ( connection : Connection , sqlQuery : String , limit : Int = DEFAULT_LIMIT ) : AnyFrame","body":"{  require ( isValid ( sqlQuery ) ) { \"\" }  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  var internalSqlQuery = sqlQuery  if ( limit >  ) internalSqlQuery += \"\"  logger . debug { \"\" }  connection . createStatement ( ) . use { st ->  st . executeQuery ( internalSqlQuery ) . use { rs ->  val tableColumns = getTableColumnsMetadata ( rs )  return fetchAndConvertDataFromResultSet ( tableColumns , rs , dbType , DEFAULT_LIMIT )  }  }  }","docstring":"/**\n * Converts the result of an SQL query to the DataFrame.\n *\n * NOTE: SQL query should start from SELECT and contain one query for reading data without any manipulation.\n * It should not contain `;` symbol.\n *\n * @param [connection] the database connection to execute the SQL query.\n * @param [sqlQuery] the SQL query to execute.\n * @param [limit] the maximum number of rows to retrieve from the result of the SQL query execution.\n * @return the DataFrame containing the result of the SQL query.\n *\n * @see DriverManager.getConnection\n */"}
{"signature":"private fun isValid ( sqlQuery : String ) : Boolean","body":"{  val normalizedSqlQuery = sqlQuery . trim ( ) . uppercase ( )  return normalizedSqlQuery . startsWith ( START_OF_READ_SQL_QUERY ) &&  ! normalizedSqlQuery . contains ( MULTIPLE_SQL_QUERY_SEPARATOR )  }","docstring":"/** SQL-query is accepted only if it starts from SELECT */"}
{"signature":"public fun DataFrame . Companion . readResultSet ( resultSet : ResultSet , dbType : DbType , limit : Int = DEFAULT_LIMIT ) : AnyFrame","body":"{  val tableColumns = getTableColumnsMetadata ( resultSet )  return fetchAndConvertDataFromResultSet ( tableColumns , resultSet , dbType , limit )  }","docstring":"/**\n * Reads the data from a [ResultSet] and converts it into a DataFrame.\n *\n * @param [resultSet] the [ResultSet] containing the data to read.\n * @param [dbType] the type of database that the [ResultSet] belongs to.\n * @param [limit] the maximum number of rows to read from the [ResultSet].\n * @return the DataFrame generated from the [ResultSet] data.\n */"}
{"signature":"public fun DataFrame . Companion . readResultSet ( resultSet : ResultSet , connection : Connection , limit : Int = DEFAULT_LIMIT ) : AnyFrame","body":"{  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  return readResultSet ( resultSet , dbType , limit )  }","docstring":"/**\n * Reads the data from a [ResultSet] and converts it into a DataFrame.\n *\n * @param [resultSet] the [ResultSet] containing the data to read.\n * @param [connection] the connection to the database (it's required to extract the database type).\n * @param [limit] the maximum number of rows to read from the [ResultSet].\n * @return the DataFrame generated from the [ResultSet] data.\n */"}
{"signature":"public fun DataFrame . Companion . readAllSqlTables ( dbConfig : DatabaseConfiguration , catalogue : String ? = null , limit : Int = DEFAULT_LIMIT ) : List < AnyFrame >","body":"{  DriverManager . getConnection ( dbConfig . url , dbConfig . user , dbConfig . password ) . use { connection ->  return readAllSqlTables ( connection , catalogue , limit )  }  }","docstring":"/**\n * Reads all tables from the given database using the provided database configuration and limit.\n *\n * @param [dbConfig] the database configuration to connect to the database, including URL, user, and password.\n * @param [limit] the maximum number of rows to read from each table.\n * @return a list of [AnyFrame] objects representing the non-system tables from the database.\n */"}
{"signature":"public fun DataFrame . Companion . readAllSqlTables ( connection : Connection , catalogue : String ? = null , limit : Int = DEFAULT_LIMIT ) : List < AnyFrame >","body":"{  val metaData = connection . metaData  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  val tables = metaData . getTables ( catalogue , null , null , arrayOf ( \"\" ) )  val dataFrames = mutableListOf < AnyFrame > ( )  while ( tables . next ( ) ) {  val table = dbType . buildTableMetadata ( tables )  if ( ! dbType . isSystemTable ( table ) ) {  val tableName = if ( catalogue != null ) catalogue + \"\" + table . name else table . name  logger . debug { \"\" }  val dataFrame = readSqlTable ( connection , tableName , limit )  dataFrames += dataFrame  logger . debug { \"\" }  }  }  return dataFrames  }","docstring":"/**\n * Reads all non-system tables from a database and returns them as a list of data frames.\n *\n * @param [connection] the database connection to read tables from.\n * @param [limit] the maximum number of rows to read from each table.\n * @return a list of [AnyFrame] objects representing the non-system tables from the database.\n *\n * @see DriverManager.getConnection\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForSqlTable ( dbConfig : DatabaseConfiguration , tableName : String ) : DataFrameSchema","body":"{  DriverManager . getConnection ( dbConfig . url , dbConfig . user , dbConfig . password ) . use { connection ->  return getSchemaForSqlTable ( connection , tableName )  }  }","docstring":"/**\n * Retrieves the schema for an SQL table using the provided database configuration.\n *\n * @param [dbConfig] the database configuration to connect to the database, including URL, user, and password.\n * @param [tableName] the name of the SQL table for which to retrieve the schema.\n * @return the [DataFrameSchema] object representing the schema of the SQL table\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForSqlTable ( connection : Connection , tableName : String ) : DataFrameSchema","body":"{  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  val preparedQuery = \"\"  connection . createStatement ( ) . use { st ->  st . executeQuery ( preparedQuery ) . use { rs ->  val tableColumns = getTableColumnsMetadata ( rs )  return buildSchemaByTableColumns ( tableColumns , dbType )  }  }  }","docstring":"/**\n * Retrieves the schema for an SQL table using the provided database connection.\n *\n * @param [connection] the database connection.\n * @param [tableName] the name of the SQL table for which to retrieve the schema.\n * @return the schema of the SQL table as a [DataFrameSchema] object.\n *\n * @see DriverManager.getConnection\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForSqlQuery ( dbConfig : DatabaseConfiguration , sqlQuery : String ) : DataFrameSchema","body":"{  DriverManager . getConnection ( dbConfig . url , dbConfig . user , dbConfig . password ) . use { connection ->  return getSchemaForSqlQuery ( connection , sqlQuery )  }  }","docstring":"/**\n * Retrieves the schema of an SQL query result using the provided database configuration.\n *\n * @param [dbConfig] the database configuration to connect to the database, including URL, user, and password.\n * @param [sqlQuery] the SQL query to execute and retrieve the schema from.\n * @return the schema of the SQL query as a [DataFrameSchema] object.\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForSqlQuery ( connection : Connection , sqlQuery : String ) : DataFrameSchema","body":"{  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  connection . createStatement ( ) . use { st ->  st . executeQuery ( sqlQuery ) . use { rs ->  val tableColumns = getTableColumnsMetadata ( rs )  return buildSchemaByTableColumns ( tableColumns , dbType )  }  }  }","docstring":"/**\n * Retrieves the schema of an SQL query result using the provided database connection.\n *\n * @param [connection] the database connection.\n * @param [sqlQuery] the SQL query to execute and retrieve the schema from.\n * @return the schema of the SQL query as a [DataFrameSchema] object.\n *\n * @see DriverManager.getConnection\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForResultSet ( resultSet : ResultSet , dbType : DbType ) : DataFrameSchema","body":"{  val tableColumns = getTableColumnsMetadata ( resultSet )  return buildSchemaByTableColumns ( tableColumns , dbType )  }","docstring":"/**\n * Retrieves the schema from [ResultSet].\n *\n * NOTE: This function will not close connection and result set and not retrieve data from the result set.\n *\n * @param [resultSet] the [ResultSet] obtained from executing a database query.\n * @param [dbType] the type of database that the [ResultSet] belongs to.\n * @return the schema of the [ResultSet] as a [DataFrameSchema] object.\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForResultSet ( resultSet : ResultSet , connection : Connection ) : DataFrameSchema","body":"{  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  val tableColumns = getTableColumnsMetadata ( resultSet )  return buildSchemaByTableColumns ( tableColumns , dbType )  }","docstring":"/**\n * Retrieves the schema from [ResultSet].\n *\n * NOTE: [connection] is required to extract the database type.\n * This function will not close connection and result set and not retrieve data from the result set.\n *\n * @param [resultSet] the [ResultSet] obtained from executing a database query.\n * @param [connection] the connection to the database (it's required to extract the database type).\n * @return the schema of the [ResultSet] as a [DataFrameSchema] object.\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForAllSqlTables ( dbConfig : DatabaseConfiguration ) : List < DataFrameSchema >","body":"{  DriverManager . getConnection ( dbConfig . url , dbConfig . user , dbConfig . password ) . use { connection ->  return getSchemaForAllSqlTables ( connection )  }  }","docstring":"/**\n * Retrieves the schema of all non-system tables in the database using the provided database configuration.\n *\n * @param [dbConfig] the database configuration to connect to the database, including URL, user, and password.\n * @return a list of [DataFrameSchema] objects representing the schema of each non-system table.\n */"}
{"signature":"public fun DataFrame . Companion . getSchemaForAllSqlTables ( connection : Connection ) : List < DataFrameSchema >","body":"{  val metaData = connection . metaData  val url = connection . metaData . url  val dbType = extractDBTypeFromUrl ( url )  val tableTypes = arrayOf ( \"\" )  val tables = metaData . getTables ( null , null , null , tableTypes )  val dataFrameSchemas = mutableListOf < DataFrameSchema > ( )  while ( tables . next ( ) ) {  val jdbcTable = dbType . buildTableMetadata ( tables )  if ( ! dbType . isSystemTable ( jdbcTable ) ) {  val dataFrameSchema = getSchemaForSqlTable ( connection , jdbcTable . name )  dataFrameSchemas += dataFrameSchema  }  }  return dataFrameSchemas  }","docstring":"/**\n * Retrieves the schema of all non-system tables in the database using the provided database connection.\n *\n * @param [connection] the database connection.\n * @return a list of [DataFrameSchema] objects representing the schema of each non-system table.\n */"}
{"signature":"private fun buildSchemaByTableColumns ( tableColumns : MutableList < TableColumnMetadata > , dbType : DbType ) : DataFrameSchema","body":"{  val schemaColumns = tableColumns . associate {  Pair ( it . name , generateColumnSchemaValue ( dbType , it ) )  }  return DataFrameSchemaImpl ( columns = schemaColumns )  }","docstring":"/**\n * Builds a DataFrame schema based on the given table columns.\n *\n * @param [tableColumns] a mutable map containing the table columns, where the key represents the column name\n * and the value represents the metadata of the column\n * @param [dbType] the type of database.\n * @return a [DataFrameSchema] object representing the schema built from the table columns.\n */"}
{"signature":"private fun getTableColumnsMetadata ( rs : ResultSet ) : MutableList < TableColumnMetadata >","body":"{  val metaData : ResultSetMetaData = rs . metaData  val numberOfColumns : Int = metaData . columnCount  val tableColumns = mutableListOf < TableColumnMetadata > ( )  val columnNameCounter = mutableMapOf < String , Int > ( )  val databaseMetaData : DatabaseMetaData = rs . statement . connection . metaData  val catalog : String ? = rs . statement . connection . catalog . takeUnless { it . isNullOrBlank ( ) }  val schema : String ? = rs . statement . connection . schema . takeUnless { it . isNullOrBlank ( ) }  for ( i in  until numberOfColumns +  ) {  val columnResultSet : ResultSet =  databaseMetaData . getColumns ( catalog , schema , metaData . getTableName ( i ) , metaData . getColumnName ( i ) )  val isNullable = if ( columnResultSet . next ( ) ) {  columnResultSet . getString ( \"\" ) == \"\"  } else {  true  }  val name = manageColumnNameDuplication ( columnNameCounter , metaData . getColumnName ( i ) )  val size = metaData . getColumnDisplaySize ( i )  val type = metaData . getColumnTypeName ( i )  val jdbcType = metaData . getColumnType ( i )  val javaClassName = metaData . getColumnClassName ( i )  tableColumns += TableColumnMetadata ( name , type , jdbcType , size , javaClassName , isNullable )  }  return tableColumns  }","docstring":"/**\n * Retrieves the metadata of the columns in the result set.\n *\n * @param rs the result set\n * @return a mutable list of [TableColumnMetadata] objects,\n * where each TableColumnMetadata object contains information such as the column type,\n * JDBC type, size, and name.\n */"}
{"signature":"private fun manageColumnNameDuplication ( columnNameCounter : MutableMap < String , Int > , originalName : String ) : String","body":"{  var name = originalName  val count = columnNameCounter [ originalName ]  if ( count != null ) {  var incrementedCount = count +   while ( columnNameCounter . containsKey ( \"\" ) ) {  incrementedCount ++  }  columnNameCounter [ originalName ] = incrementedCount  name = \"\"  } else {  columnNameCounter [ originalName ] =   }  return name  }","docstring":"/**\n * Manages the duplication of column names by appending a unique identifier to the original name if necessary.\n *\n * @param columnNameCounter a mutable map that keeps track of the count for each column name.\n * @param originalName the original name of the column to be managed.\n * @return the modified column name that is free from duplication.\n */"}
{"signature":"private fun fetchAndConvertDataFromResultSet ( tableColumns : MutableList < TableColumnMetadata > , rs : ResultSet , dbType : DbType , limit : Int ) : AnyFrame","body":"{  val data = List ( tableColumns . size ) { mutableListOf < Any ? > ( ) }  val kotlinTypesForSqlColumns = mutableMapOf < Int , KType > ( )  List ( tableColumns . size ) { index ->  kotlinTypesForSqlColumns [ index ] = generateKType ( dbType , tableColumns [ index ] )  }  var counter =   if ( limit >  ) {  while ( counter < limit && rs . next ( ) ) {  extractNewRowFromResultSetAndAddToData ( tableColumns , data , rs , kotlinTypesForSqlColumns )  counter ++  }  } else {  while ( rs . next ( ) ) {  extractNewRowFromResultSetAndAddToData ( tableColumns , data , rs , kotlinTypesForSqlColumns )  counter ++  }  }  val dataFrame = data . mapIndexed { index , values ->  DataColumn . createValueColumn ( name = tableColumns [ index ] . name , values = values , type = kotlinTypesForSqlColumns [ index ] ! !  )  } . toDataFrame ( )  logger . debug { \"\" }  return dataFrame  }","docstring":"/**\n * Fetches and converts data from a ResultSet into a mutable map.\n *\n * @param [tableColumns] a list containing the column metadata for the table.\n * @param [rs] the ResultSet object containing the data to be fetched and converted.\n * @param [dbType] the type of the database.\n * @param [limit] the maximum number of rows to fetch and convert.\n * @return A mutable map containing the fetched and converted data.\n */"}
{"signature":"private fun generateKType ( dbType : DbType , tableColumnMetadata : TableColumnMetadata ) : KType","body":"{  return dbType . convertSqlTypeToKType ( tableColumnMetadata ) ? : makeCommonSqlToKTypeMapping ( tableColumnMetadata )  }","docstring":"/**\n * Generates a KType based on the given database type and table column metadata.\n *\n * @param dbType The database type.\n * @param tableColumnMetadata The table column metadata.\n *\n * @return The generated KType.\n */"}
{"signature":"private fun makeCommonSqlToKTypeMapping ( tableColumnMetadata : TableColumnMetadata ) : KType","body":"{  val jdbcTypeToKTypeMapping = mapOf ( Types . BIT to Boolean :: class , Types . TINYINT to Int :: class , Types . SMALLINT to Int :: class , Types . INTEGER to Int :: class , Types . BIGINT to Long :: class , Types . FLOAT to Float :: class , Types . REAL to Float :: class , Types . DOUBLE to Double :: class , Types . NUMERIC to BigDecimal :: class , Types . DECIMAL to BigDecimal :: class , Types . CHAR to Char :: class , Types . VARCHAR to String :: class , Types . LONGVARCHAR to String :: class , Types . DATE to Date :: class , Types . TIME to Time :: class , Types . TIMESTAMP to Timestamp :: class , Types . BINARY to ByteArray :: class , Types . VARBINARY to ByteArray :: class , Types . LONGVARBINARY to ByteArray :: class , Types . NULL to String :: class , Types . OTHER to Any :: class , Types . JAVA_OBJECT to Any :: class , Types . DISTINCT to Any :: class , Types . STRUCT to Any :: class , Types . ARRAY to Array < Any > :: class , Types . BLOB to Blob :: class , Types . CLOB to Clob :: class , Types . REF to Ref :: class , Types . DATALINK to Any :: class , Types . BOOLEAN to Boolean :: class , Types . ROWID to RowId :: class , Types . NCHAR to Char :: class , Types . NVARCHAR to String :: class , Types . LONGNVARCHAR to String :: class , Types . NCLOB to NClob :: class , Types . SQLXML to SQLXML :: class , Types . REF_CURSOR to Ref :: class , Types . TIME_WITH_TIMEZONE to Time :: class , Types . TIMESTAMP_WITH_TIMEZONE to Timestamp :: class )  val kClass = jdbcTypeToKTypeMapping [ tableColumnMetadata . jdbcType ] ? : String :: class  return kClass . createType ( nullable = tableColumnMetadata . isNullable )  }","docstring":"/**\n * Creates a mapping between common SQL types and their corresponding KTypes.\n *\n * @param tableColumnMetadata The metadata of the table column.\n * @return The KType associated with the SQL type, or a default type if no mapping is found.\n */"}
{"signature":"fun CPointer < CPointed > . customExtension ( )","body":"{  println ( this . rawValue )  }","docstring":"/**\n * Will print the raw value\n */"}
{"signature":"fun mobileNetV2Prediction ( )","body":"{  runImageRecognitionPrediction ( modelType = TFModels . CV . MobileNetV2 ( ) )  }","docstring":"/**\n * This example demonstrates the inference concept on MobileNetV2 model:\n * - Model configuration, model weights and labels are obtained from [TFModelHub].\n * - Weights are loaded from .h5 file, configuration is loaded from .json file.\n * - Model predicts on a few images located in resources.\n * - Special preprocessing (used in MobileNetV2 during training on ImageNet dataset) is applied to each image before prediction.\n */"}
{"signature":"fun main ( ) : Unit","body":"= mobileNetV2Prediction ( )","docstring":"/** */"}
{"signature":"private fun IrFunction . wasAlreadyCalled ( ) : Boolean","body":"{  val anyParameter = this . getLastOverridden ( ) . dispatchReceiverParameter ! ! . symbol  val callStack = callInterceptor . environment . callStack  if ( callStack . containsStateInMemory ( anyParameter ) && callStack . loadState ( anyParameter ) === state ) return true  return this == callInterceptor . environment . callStack . currentFrameOwner  }","docstring":"/**\n * This check used to avoid cyclic calls. For example:\n * override fun toString(): String = super.toString()\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . a ( href : String ? = null , target : String ? = null , classes : String ? = null , crossinline block : A . ( ) -> Unit = { } , ) : T","body":"= A ( attributesMapOf ( \"\" , href , \"\" , target , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Anchor\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . abbr ( classes : String ? = null , crossinline block : ABBR . ( ) -> Unit = { } ) : T","body":"= ABBR ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Abbreviated form (e.g., WWW, HTTP,etc.)\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . address ( classes : String ? = null , crossinline block : ADDRESS . ( ) -> Unit = { } ) : T","body":"= ADDRESS ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Information on author\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . area ( shape : AreaShape ? = null , alt : String ? = null , classes : String ? = null , crossinline block : AREA . ( ) -> Unit = { } , ) : T","body":"= AREA ( attributesMapOf ( \"\" , shape ? . enumEncode ( ) , \"\" , alt , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Client-side image map area\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . article ( classes : String ? = null , crossinline block : ARTICLE . ( ) -> Unit = { } ) : T","body":"= ARTICLE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Self-contained syndicatable or reusable composition\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . aside ( classes : String ? = null , crossinline block : ASIDE . ( ) -> Unit = { } ) : T","body":"= ASIDE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Sidebar for tangentially related content\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . audio ( classes : String ? = null , crossinline block : AUDIO . ( ) -> Unit = { } ) : T","body":"= AUDIO ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Audio player\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . b ( classes : String ? = null , crossinline block : B . ( ) -> Unit = { } ) : T","body":"= B ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Bold text style\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . base ( classes : String ? = null , crossinline block : BASE . ( ) -> Unit = { } ) : T","body":"= BASE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Document base URI\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . bdi ( classes : String ? = null , crossinline block : BDI . ( ) -> Unit = { } ) : T","body":"= BDI ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Text directionality isolation\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . bdo ( classes : String ? = null , crossinline block : BDO . ( ) -> Unit = { } ) : T","body":"= BDO ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * I18N BiDi over-ride\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . blockQuote ( classes : String ? = null , crossinline block : BLOCKQUOTE . ( ) -> Unit = { } ) : T","body":"= BLOCKQUOTE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Long quotation\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . body ( classes : String ? = null , crossinline block : BODY . ( ) -> Unit = { } ) : T","body":"= BODY ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Document body\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . br ( classes : String ? = null , crossinline block : BR . ( ) -> Unit = { } ) : T","body":"= BR ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Forced line break\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . button ( formEncType : ButtonFormEncType ? = null , formMethod : ButtonFormMethod ? = null , name : String ? = null , type : ButtonType ? = null , classes : String ? = null , crossinline block : BUTTON . ( ) -> Unit = { } , ) : T","body":"= BUTTON ( attributesMapOf ( \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , type ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Push button\n */"}
{"signature":"@ HtmlTagMarker  public fun < T , C : TagConsumer < T > > C . canvas ( classes : String ? = null , content : String = \"\" ) : T","body":"=  CANVAS ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Scriptable bitmap canvas\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . canvas ( classes : String ? = null , crossinline block : CANVAS . ( ) -> Unit = { } ) : T","body":"= CANVAS ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Scriptable bitmap canvas\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . caption ( classes : String ? = null , crossinline block : CAPTION . ( ) -> Unit = { } ) : T","body":"= CAPTION ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table caption\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . cite ( classes : String ? = null , crossinline block : CITE . ( ) -> Unit = { } ) : T","body":"= CITE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Citation\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . code ( classes : String ? = null , crossinline block : CODE . ( ) -> Unit = { } ) : T","body":"= CODE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Computer code fragment\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . col ( classes : String ? = null , crossinline block : COL . ( ) -> Unit = { } ) : T","body":"= COL ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table column\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . colGroup ( classes : String ? = null , crossinline block : COLGROUP . ( ) -> Unit = { } ) : T","body":"= COLGROUP ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table column group\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . dataList ( classes : String ? = null , crossinline block : DATALIST . ( ) -> Unit = { } ) : T","body":"= DATALIST ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Container for options for \n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . dd ( classes : String ? = null , crossinline block : DD . ( ) -> Unit = { } ) : T","body":"= DD ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Definition description\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . del ( classes : String ? = null , crossinline block : DEL . ( ) -> Unit = { } ) : T","body":"= DEL ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Deleted text\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . details ( classes : String ? = null , crossinline block : DETAILS . ( ) -> Unit = { } ) : T","body":"= DETAILS ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Disclosure control for hiding details\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . dfn ( classes : String ? = null , crossinline block : DFN . ( ) -> Unit = { } ) : T","body":"= DFN ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Instance definition\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . dialog ( classes : String ? = null , crossinline block : DIALOG . ( ) -> Unit = { } ) : T","body":"= DIALOG ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Dialog box or window\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . div ( classes : String ? = null , crossinline block : DIV . ( ) -> Unit = { } ) : T","body":"= DIV ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Generic language/style container\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . dl ( classes : String ? = null , crossinline block : DL . ( ) -> Unit = { } ) : T","body":"= DL ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Definition list\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . dt ( classes : String ? = null , crossinline block : DT . ( ) -> Unit = { } ) : T","body":"= DT ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Definition term\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . em ( classes : String ? = null , crossinline block : EM . ( ) -> Unit = { } ) : T","body":"= EM ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Emphasis\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . embed ( classes : String ? = null , crossinline block : EMBED . ( ) -> Unit = { } ) : T","body":"= EMBED ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Plugin\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . fieldSet ( classes : String ? = null , crossinline block : FIELDSET . ( ) -> Unit = { } ) : T","body":"= FIELDSET ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Form control group\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . figcaption ( classes : String ? = null , crossinline block : FIGCAPTION . ( ) -> Unit = { } ) : T","body":"= FIGCAPTION ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Caption for \n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . figure ( classes : String ? = null , crossinline block : FIGURE . ( ) -> Unit = { } ) : T","body":"= FIGURE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Figure with optional caption\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . footer ( classes : String ? = null , crossinline block : FOOTER . ( ) -> Unit = { } ) : T","body":"= FOOTER ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Footer for a page or section\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . form ( action : String ? = null , encType : FormEncType ? = null , method : FormMethod ? = null , classes : String ? = null , crossinline block : FORM . ( ) -> Unit = { } , ) : T","body":"= FORM ( attributesMapOf ( \"\" , action , \"\" , encType ? . enumEncode ( ) , \"\" , method ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Interactive form\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . h1 ( classes : String ? = null , crossinline block : H1 . ( ) -> Unit = { } ) : T","body":"= H1 ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Heading\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . h2 ( classes : String ? = null , crossinline block : H2 . ( ) -> Unit = { } ) : T","body":"= H2 ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Heading\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . h3 ( classes : String ? = null , crossinline block : H3 . ( ) -> Unit = { } ) : T","body":"= H3 ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Heading\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . h4 ( classes : String ? = null , crossinline block : H4 . ( ) -> Unit = { } ) : T","body":"= H4 ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Heading\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . h5 ( classes : String ? = null , crossinline block : H5 . ( ) -> Unit = { } ) : T","body":"= H5 ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Heading\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . h6 ( classes : String ? = null , crossinline block : H6 . ( ) -> Unit = { } ) : T","body":"= H6 ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Heading\n */"}
{"signature":"@ HtmlTagMarker  @ Suppress ( \"\" )  @ Deprecated ( \"\" )  public fun < T , C : TagConsumer < T > > C . head ( content : String = \"\" ) : T","body":"= HEAD ( emptyMap , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Document head\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . head ( crossinline block : HEAD . ( ) -> Unit = { } ) : T","body":"=  HEAD ( emptyMap , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Document head\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . `header` ( classes : String ? = null , crossinline block : HEADER . ( ) -> Unit = { } ) : T","body":"= HEADER ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Introductory or navigational aids for a page or section\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . hr ( classes : String ? = null , crossinline block : HR . ( ) -> Unit = { } ) : T","body":"= HR ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Horizontal rule\n */"}
{"signature":"@ HtmlTagMarker  @ Suppress ( \"\" )  @ Deprecated ( \"\" )  public fun < T , C : TagConsumer < T > > C . html ( content : String = \"\" , namespace : String ? = null ) : T","body":"=  HTML ( emptyMap , this , namespace )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Document root element\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . html ( namespace : String ? = null , crossinline block : HTML . ( ) -> Unit = { } ) : T","body":"= HTML ( emptyMap , this , namespace )  . visitAndFinalize ( this , block )","docstring":"/**\n * Document root element\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . i ( classes : String ? = null , crossinline block : I . ( ) -> Unit = { } ) : T","body":"= I ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Italic text style\n */"}
{"signature":"@ HtmlTagMarker  public fun < T , C : TagConsumer < T > > C . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , content : String = \"\" , ) : T","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Inline subwindow\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , crossinline block : IFRAME . ( ) -> Unit = { } , ) : T","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Inline subwindow\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . img ( alt : String ? = null , src : String ? = null , loading : ImgLoading ? = null , classes : String ? = null , crossinline block : IMG . ( ) -> Unit = { } , ) : T","body":"= IMG ( attributesMapOf ( \"\" , alt , \"\" , src , \"\" , loading ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Embedded image\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . input ( type : InputType ? = null , formEncType : InputFormEncType ? = null , formMethod : InputFormMethod ? = null , name : String ? = null , classes : String ? = null , crossinline block : INPUT . ( ) -> Unit = { } , ) : T","body":"= INPUT ( attributesMapOf ( \"\" , type ? . enumEncode ( ) , \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Form control\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . ins ( classes : String ? = null , crossinline block : INS . ( ) -> Unit = { } ) : T","body":"= INS ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Inserted text\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . kbd ( classes : String ? = null , crossinline block : KBD . ( ) -> Unit = { } ) : T","body":"= KBD ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Text to be entered by the user\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . keyGen ( keyType : KeyGenKeyType ? = null , classes : String ? = null , crossinline block : KEYGEN . ( ) -> Unit = { } , ) : T","body":"= KEYGEN ( attributesMapOf ( \"\" , keyType ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Cryptographic key-pair generator form control\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . label ( classes : String ? = null , crossinline block : LABEL . ( ) -> Unit = { } ) : T","body":"= LABEL ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Form field label text\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . legend ( classes : String ? = null , crossinline block : LEGEND . ( ) -> Unit = { } ) : T","body":"= LEGEND ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Fieldset legend\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . li ( classes : String ? = null , crossinline block : LI . ( ) -> Unit = { } ) : T","body":"= LI ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * List item\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . link ( href : String ? = null , rel : String ? = null , type : String ? = null , crossinline block : LINK . ( ) -> Unit = { } , ) : T","body":"= LINK ( attributesMapOf ( \"\" , href , \"\" , rel , \"\" , type ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * A media-independent link\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . main ( classes : String ? = null , crossinline block : MAIN . ( ) -> Unit = { } ) : T","body":"= MAIN ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Container for the dominant contents of another element\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . map ( name : String ? = null , classes : String ? = null , crossinline block : MAP . ( ) -> Unit = { } , ) : T","body":"= MAP ( attributesMapOf ( \"\" , name , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Client-side image map\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . mark ( classes : String ? = null , crossinline block : MARK . ( ) -> Unit = { } ) : T","body":"= MARK ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Highlight\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . meta ( name : String ? = null , content : String ? = null , charset : String ? = null , crossinline block : META . ( ) -> Unit = { } , ) : T","body":"= META ( attributesMapOf ( \"\" , name , \"\" , content , \"\" , charset ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Generic metainformation\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . meter ( classes : String ? = null , crossinline block : METER . ( ) -> Unit = { } ) : T","body":"= METER ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Gauge\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . nav ( classes : String ? = null , crossinline block : NAV . ( ) -> Unit = { } ) : T","body":"= NAV ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Section with navigational links\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . noScript ( classes : String ? = null , crossinline block : NOSCRIPT . ( ) -> Unit = { } ) : T","body":"= NOSCRIPT ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Generic metainformation\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . htmlObject ( classes : String ? = null , crossinline block : OBJECT . ( ) -> Unit = { } ) : T","body":"= OBJECT ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Generic embedded object\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . ol ( classes : String ? = null , crossinline block : OL . ( ) -> Unit = { } ) : T","body":"= OL ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Ordered list\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . optGroup ( label : String ? = null , classes : String ? = null , crossinline block : OPTGROUP . ( ) -> Unit = { } , ) : T","body":"= OPTGROUP ( attributesMapOf ( \"\" , label , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Option group\n */"}
{"signature":"@ HtmlTagMarker  public fun < T , C : TagConsumer < T > > C . option ( classes : String ? = null , content : String = \"\" ) : T","body":"=  OPTION ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Selectable choice\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . option ( classes : String ? = null , crossinline block : OPTION . ( ) -> Unit = { } ) : T","body":"= OPTION ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Selectable choice\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . output ( classes : String ? = null , crossinline block : OUTPUT . ( ) -> Unit = { } ) : T","body":"= OUTPUT ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Calculated output value\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . p ( classes : String ? = null , crossinline block : P . ( ) -> Unit = { } ) : T","body":"= P ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Paragraph\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . `param` ( name : String ? = null , `value` : String ? = null , crossinline block : PARAM . ( ) -> Unit = { } , ) : T","body":"= PARAM ( attributesMapOf ( \"\" , name , \"\" , value ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Named property value\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . picture ( crossinline block : PICTURE . ( ) -> Unit = { } ) : T","body":"=  PICTURE ( emptyMap , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Pictures container\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . pre ( classes : String ? = null , crossinline block : PRE . ( ) -> Unit = { } ) : T","body":"= PRE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Preformatted text\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . progress ( classes : String ? = null , crossinline block : PROGRESS . ( ) -> Unit = { } ) : T","body":"= PROGRESS ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Progress bar\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . q ( classes : String ? = null , crossinline block : Q . ( ) -> Unit = { } ) : T","body":"= Q ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Short inline quotation\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . rp ( classes : String ? = null , crossinline block : RP . ( ) -> Unit = { } ) : T","body":"= RP ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Parenthesis for ruby annotation text\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . rt ( classes : String ? = null , crossinline block : RT . ( ) -> Unit = { } ) : T","body":"= RT ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Ruby annotation text\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . ruby ( classes : String ? = null , crossinline block : RUBY . ( ) -> Unit = { } ) : T","body":"= RUBY ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Ruby annotation(s)\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . s ( classes : String ? = null , crossinline block : S . ( ) -> Unit = { } ) : T","body":"= S ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Strike-through text style\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . samp ( classes : String ? = null , crossinline block : SAMP . ( ) -> Unit = { } ) : T","body":"= SAMP ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Sample or quote text style\n */"}
{"signature":"@ HtmlTagMarker  @ Suppress ( \"\" )  @ Deprecated ( \"\" )  public fun < T , C : TagConsumer < T > > C . script ( type : String ? = null , src : String ? = null , crossorigin : ScriptCrossorigin ? = null , content : String = \"\" , ) : T","body":"= SCRIPT ( attributesMapOf ( \"\" , type , \"\" , src , \"\" , crossorigin ? . enumEncode ( ) ) , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Script statements\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . script ( type : String ? = null , src : String ? = null , crossorigin : ScriptCrossorigin ? = null , crossinline block : SCRIPT . ( ) -> Unit = { } , ) : T","body":"= SCRIPT ( attributesMapOf ( \"\" , type , \"\" , src , \"\" , crossorigin ? . enumEncode ( ) ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Script statements\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . section ( classes : String ? = null , crossinline block : SECTION . ( ) -> Unit = { } ) : T","body":"= SECTION ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Generic document or application section\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . select ( classes : String ? = null , crossinline block : SELECT . ( ) -> Unit = { } ) : T","body":"= SELECT ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Option selector\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . small ( classes : String ? = null , crossinline block : SMALL . ( ) -> Unit = { } ) : T","body":"= SMALL ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Small text style\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . source ( classes : String ? = null , crossinline block : SOURCE . ( ) -> Unit = { } ) : T","body":"= SOURCE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Media source for \n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . span ( classes : String ? = null , crossinline block : SPAN . ( ) -> Unit = { } ) : T","body":"= SPAN ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Generic language/style container\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . strong ( classes : String ? = null , crossinline block : STRONG . ( ) -> Unit = { } ) : T","body":"= STRONG ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Strong emphasis\n */"}
{"signature":"@ HtmlTagMarker  @ Suppress ( \"\" )  @ Deprecated ( \"\" )  public fun < T , C : TagConsumer < T > > C . style ( type : String ? = null , content : String = \"\" ) : T","body":"=  STYLE ( attributesMapOf ( \"\" , type ) , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Style info\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . style ( type : String ? = null , crossinline block : STYLE . ( ) -> Unit = { } ) : T","body":"= STYLE ( attributesMapOf ( \"\" , type ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Style info\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . sub ( classes : String ? = null , crossinline block : SUB . ( ) -> Unit = { } ) : T","body":"= SUB ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Subscript\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . summary ( classes : String ? = null , crossinline block : SUMMARY . ( ) -> Unit = { } ) : T","body":"= SUMMARY ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Caption for \n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . sup ( classes : String ? = null , crossinline block : SUP . ( ) -> Unit = { } ) : T","body":"= SUP ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Superscript\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . table ( classes : String ? = null , crossinline block : TABLE . ( ) -> Unit = { } ) : T","body":"= TABLE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n *\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . tbody ( classes : String ? = null , crossinline block : TBODY . ( ) -> Unit = { } ) : T","body":"= TBODY ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table body\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . td ( classes : String ? = null , crossinline block : TD . ( ) -> Unit = { } ) : T","body":"= TD ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table data cell\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . template ( classes : String ? = null , crossinline block : TEMPLATE . ( ) -> Unit = { } ) : T","body":"= TEMPLATE ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Template\n */"}
{"signature":"@ HtmlTagMarker  public fun < T , C : TagConsumer < T > > C . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , content : String = \"\" , ) : T","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Multi-line text field\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , crossinline block : TEXTAREA . ( ) -> Unit = { } , ) : T","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Multi-line text field\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . tfoot ( classes : String ? = null , crossinline block : TFOOT . ( ) -> Unit = { } ) : T","body":"= TFOOT ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table footer\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . th ( scope : ThScope ? = null , classes : String ? = null , crossinline block : TH . ( ) -> Unit = { } , ) : T","body":"= TH ( attributesMapOf ( \"\" , scope ? . enumEncode ( ) , \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table header cell\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . thead ( classes : String ? = null , crossinline block : THEAD . ( ) -> Unit = { } ) : T","body":"= THEAD ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table header\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . time ( classes : String ? = null , crossinline block : TIME . ( ) -> Unit = { } ) : T","body":"= TIME ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Machine-readable equivalent of date- or time-related data\n */"}
{"signature":"@ HtmlTagMarker  public fun < T , C : TagConsumer < T > > C . title ( content : String = \"\" ) : T","body":"= TITLE ( emptyMap , this )  . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Document title\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . title ( crossinline block : TITLE . ( ) -> Unit = { } ) : T","body":"=  TITLE ( emptyMap , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Document title\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . tr ( classes : String ? = null , crossinline block : TR . ( ) -> Unit = { } ) : T","body":"= TR ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Table row\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . u ( classes : String ? = null , crossinline block : U . ( ) -> Unit = { } ) : T","body":"= U ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Underlined text style\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . ul ( classes : String ? = null , crossinline block : UL . ( ) -> Unit = { } ) : T","body":"= UL ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Unordered list\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . htmlVar ( classes : String ? = null , crossinline block : VAR . ( ) -> Unit = { } ) : T","body":"= VAR ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Unordered list\n */"}
{"signature":"@ HtmlTagMarker  public inline fun < T , C : TagConsumer < T > > C . video ( classes : String ? = null , crossinline block : VIDEO . ( ) -> Unit = { } ) : T","body":"= VIDEO ( attributesMapOf ( \"\" , classes ) , this )  . visitAndFinalize ( this , block )","docstring":"/**\n * Video player\n */"}
{"signature":"override fun toString ( ) : String","body":"= toStringInternalImpl ( ) ? : \"\"","docstring":"/**\n * Returns a name of this main dispatcher for debugging purposes. This implementation returns\n * `Dispatchers.Main` or `Dispatchers.Main.immediate` if it is the same as the corresponding\n * reference in [Dispatchers] or a short class-name representation with address otherwise.\n */"}
{"signature":"@ InternalCoroutinesApi  protected fun toStringInternalImpl ( ) : String ?","body":"{  val main = Dispatchers . Main  if ( this === main ) return \"\"  val immediate =  try { main . immediate }  catch ( e : UnsupportedOperationException ) { null }  if ( this === immediate ) return \"\"  return null  }","docstring":"/**\n * Internal method for more specific [toString] implementations. It returns non-null\n * string if this dispatcher is set in the platform as the main one.\n * @suppress\n */"}
{"signature":"fun testRunClassFileWithExtensionInDefaultPackage ( )","body":"{  val subDir = File ( \"\" ) . apply { mkdirs ( ) }  val testDir = File ( \"\" )  kotlincInProcess ( \"\" , \"\" , testDir . path )  assertExists ( File ( \"\" ) )  runProcess ( \"\" , \"\" , workDirectory = tmpdir , expectedExitCode =  , expectedStderr = \"\"\"\"\"\" . trimIndent ( ) )  runProcess ( \"\" , \"\" , expectedStdout = \"\" , workDirectory = testDir )  runProcess ( \"\" , \"\" , expectedStdout = \"\" , workDirectory = testDir )  runProcess ( \"\" , \"\" , expectedExitCode =  , expectedStderr = \"\" , workDirectory = subDir )  }","docstring":"/**\n * A class whose full qualified name is `DefaultPackageKt` and is located in path `$tmpdir/test/DefaultPackageKt.class`\n */"}
{"signature":"fun testRunClassFileWithExtensionNotInDefaultPackage ( )","body":"{  val subDir = File ( \"\" ) . apply { mkdirs ( ) }  val testDir = File ( \"\" )  kotlincInProcess ( \"\" , \"\" , tmpdir . path )  assertExists ( File ( \"\" ) )  runProcess ( \"\" , \"\" , expectedStdout = \"\" , workDirectory = tmpdir )  runProcess ( \"\" , \"\" , expectedExitCode =  , expectedStderr = \"\" , workDirectory = tmpdir )  runProcess ( \"\" , \"\" , expectedStdout = \"\" , workDirectory = tmpdir )  runProcess ( \"\" , \"\" , workDirectory = testDir , expectedExitCode =  , expectedStderr = \"\"\"\"\"\" . trimIndent ( ) )  runProcess ( \"\" , \"\" , workDirectory = testDir , expectedExitCode =  , expectedStderr = \"\"\"\"\"\" . trimIndent ( ) )  runProcess ( \"\" , \"\" , expectedExitCode =  , expectedStderr = \"\" , workDirectory = subDir )  }","docstring":"/**\n * A class whose full qualified name is `test.HelloWorldKt` and is located in path `$tmpdir/test/HelloWorldKt.class`\n */"}
{"signature":"fun reset ( )","body":"fun reset ( )","docstring":"/**\n * Performs truly reset of the engine state.\n * */"}
{"signature":"fun saveGlobalState ( )","body":"fun saveGlobalState ( )","docstring":"/**\n * Saves current state of global object.\n *\n * See also [restoreGlobalState]\n */"}
{"signature":"fun restoreGlobalState ( )","body":"fun restoreGlobalState ( )","docstring":"/**\n * Restores global object from the last saved state.\n *\n * See also [saveGlobalState]\n */"}
{"signature":"fun release ( )","body":"fun release ( )","docstring":"/**\n * Release held resources.\n *\n * Must be called explicitly before an object is garbage collected to avoid leaking resources.\n */"}
{"signature":"private fun findCommonSuperTypeOrIntersectionType ( types : Collection < SimpleType > , mode : Mode ) : SimpleType ?","body":"{  if ( types . isEmpty ( ) ) return null  return types . reduce { left : SimpleType ? , right : SimpleType ? -> fold ( left , right , mode ) }  }","docstring":"/**\n * intersection(ILT(types), PrimitiveType) = commonSuperType(ILT(types), PrimitiveType) =\n * PrimitiveType in types -> PrimitiveType\n * PrimitiveType !in types -> null\n *\n * intersection(ILT(types_1), ILT(types_2)) = ILT(types_1 union types_2)\n *\n * commonSuperType(ILT(types_1), ILT(types_2)) = ILT(types_1 intersect types_2)\n */"}
{"signature":"fun CompiledProject . assertTestResults ( @ TestDataFile assertionFileName : String , vararg testReportNames : String )","body":"= assertTestResults ( resourcesRootFile . resolve ( assertionFileName ) , * testReportNames )","docstring":"/**\n * @param assertionFileName path to xml with expected test results, relative to test resources root\n */"}
{"signature":"fun CompiledProject . getOutputForTask ( taskPath : String ) : String","body":"= getOutputForTask ( taskPath , output )","docstring":"/**\n * Filter output for specific task with given [taskPath]\n *\n * Requires using [LogLevel.DEBUG].\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ JvmName ( \"\" )  internal fun BaseContinuationImpl . getStackTraceElementImpl ( ) : StackTraceElement ?","body":"{  val debugMetadata = getDebugMetadataAnnotation ( ) ? : return null  checkDebugMetadataVersion ( COROUTINES_DEBUG_METADATA_VERSION , debugMetadata . version )  val label = getLabel ( )  val lineNumber = if ( label <  ) -  else debugMetadata . lineNumbers [ label ]  val moduleName = ModuleNameRetriever . getModuleName ( this )  val moduleAndClass = if ( moduleName == null ) debugMetadata . className else \"\"  return StackTraceElement ( moduleAndClass , debugMetadata . methodName , debugMetadata . sourceFile , lineNumber )  }","docstring":"/**\n * Returns [StackTraceElement] containing file name and line number of current coroutine's suspension point.\n * The coroutine can be either running coroutine, that calls the function on its continuation and obtaining\n * the information about current file and line number, or, more likely, the function is called to produce accurate stack traces of\n * suspended coroutine.\n *\n * The result is `null` when debug metadata is not available.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ JvmName ( \"\" )  internal fun BaseContinuationImpl . getSpilledVariableFieldMapping ( ) : Array < String > ?","body":"{  val debugMetadata = getDebugMetadataAnnotation ( ) ? : return null  checkDebugMetadataVersion ( COROUTINES_DEBUG_METADATA_VERSION , debugMetadata . version )  val res = arrayListOf < String > ( )  val label = getLabel ( )  for ( ( i , labelOfIndex ) in debugMetadata . indexToLabel . withIndex ( ) ) {  if ( labelOfIndex == label ) {  res . add ( debugMetadata . spilled [ i ] )  res . add ( debugMetadata . localNames [ i ] )  }  }  return res . toTypedArray ( )  }","docstring":"/**\n * Returns an array of spilled variable names and continuation's field names where the variable has been spilled.\n * The structure is the following:\n * - field names take 2*k'th indices\n * - corresponding variable names take (2*k + 1)'th indices.\n *\n * The function is for debugger to use, thus it returns simplest data type possible.\n * This function should only be called on suspended coroutines to get accurate mapping.\n *\n * The result is `null` when debug metadata is not available.\n */"}
{"signature":"fun resolveAndCheckFir ( session : FirSession , firFiles : List < FirFile > , diagnosticsReporter : BaseDiagnosticsCollector ) : ModuleCompilerAnalyzedOutput","body":"{  val ( scopeSession , fir ) = session . runResolution ( firFiles )  session . runCheckers ( scopeSession , fir , diagnosticsReporter , MppCheckerKind . Common )  return ModuleCompilerAnalyzedOutput ( session , scopeSession , fir )  }","docstring":"/**\n * This function runs only common checkers\n * Platform checkers should be run separately, after all parts of MPP structure will be resolved\n */"}
{"signature":"fun ssdLightAPI ( )","body":"{  val modelHub =  ONNXModelHub ( cacheDirectory = File ( \"\" ) )  val model = ONNXModels . ObjectDetection . SSD . pretrainedModel ( modelHub )  model . printSummary ( )  model . use { detectionModel ->  println ( detectionModel )  val imageFile = getFileFromResource ( \"\" )  val detectedObjects =  detectionModel . detectObjects ( imageFile = imageFile , topK =  )  detectedObjects . forEach {  println ( \"\" )  }  }  }","docstring":"/**\n * This examples demonstrates the light-weight inference API with [SSDObjectDetectionModel] on SSD model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts rectangles for the detected objects on a few images located in resources.\n */"}
{"signature":"fun main ( ) : Unit","body":"= ssdLightAPI ( )","docstring":"/** */"}
{"signature":"fun lenetClassic ( )","body":"{  val ( train , test ) = mnist ( )  lenet5Classic . use {  it . compile ( optimizer = Adam ( clipGradient = ClipGradientByValue (  ) ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY )  it . logSummary ( )  it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE )  val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  }  }","docstring":"/**\n * This example shows how to do image classification from scratch using [lenet5Classic], without leveraging pre-trained weights or a pre-made model.\n * We demonstrate the workflow on the Mnist classification dataset.\n *\n * It includes:\n * - dataset loading from S3\n * - model compilation\n * - model summary\n * - model training\n * - model evaluation\n */"}
{"signature":"fun main ( ) : Unit","body":"= lenetClassic ( )","docstring":"/** */"}
{"signature":"private fun FirNamedFunctionSymbol . computeGetterCompatibility ( ) : GetterCompatibilityResult","body":"{  val kotlinBaseAllowed = ! session . languageVersionSettings . supportsFeature ( ForbidSyntheticPropertiesWithoutBaseJavaGetter )  var isHiddenEverywhereBesideSuperCalls = false  var isDeprecatedOverrideOfHidden = false  var result = Incompatible  val visited = mutableSetOf < MemberWithBaseScope < FirNamedFunctionSymbol > > ( )  fun checkJavaOrigin ( symbol : FirNamedFunctionSymbol , scope : FirTypeScope , isOverridden : Boolean ) {  val hidden = symbol . hiddenStatusOfCall ( isSuperCall = isSuperCall , isCallToOverride = isOverridden )  when ( hidden ) {  CallToPotentiallyHiddenSymbolResult . Hidden -> isHiddenEverywhereBesideSuperCalls = true  CallToPotentiallyHiddenSymbolResult . VisibleWithDeprecation -> isDeprecatedOverrideOfHidden = true  CallToPotentiallyHiddenSymbolResult . Visible -> { }  }  val overriddenWithScope = scope . getDirectOverriddenFunctionsWithBaseScope ( symbol )  if ( symbol . origin == FirDeclarationOrigin . Enhancement ) {  val potentialResult = when {  overriddenWithScope . isEmpty ( ) -> HasJavaOrigin  kotlinBaseAllowed -> HasKotlinOrigin  else -> Incompatible  }  result = maxOf ( result , potentialResult )  }  overriddenWithScope . forEach {  if ( ! visited . add ( it ) ) return@forEach  checkJavaOrigin ( it . member , it . baseScope , isOverridden = true )  }  }  checkJavaOrigin ( this , baseScope , isOverridden = false )  val syntheticGetterCompatibility = when {  isHiddenEverywhereBesideSuperCalls -> Incompatible  result != Incompatible -> result  ! kotlinBaseAllowed -> Incompatible  isJavaTypeOnThePath ( this . dispatchReceiverType ) -> HasKotlinOrigin  else -> Incompatible  }  return GetterCompatibilityResult ( syntheticGetterCompatibility , isDeprecatedOverrideOfHidden )  }","docstring":"/**\n * This method computes if getter method can be used as base for synthetic property based on overridden hierarchy\n * There are three kinds of compatibility:\n * - `Incompatible` (obvious)\n * - `HasJavaOrigin` indicates that this getter is based on root java function (ok to create property)\n * - `HasKotlinOrigin` shows that there is no base java getter overridden. Property will be created only with some LV (KT-64358)\n */"}
{"signature":"public fun ImageRecognitionModelBase < Bitmap > . predictObject ( imageProxy : ImageProxy ) : String","body":"=  when ( this ) {  is CameraXCompatibleModel -> {  doWithRotation ( imageProxy . imageInfo . rotationDegrees ) { predictObject ( imageProxy . toBitmap ( ) ) }  }  else -> predictObject ( imageProxy . toBitmap ( applyRotation = true ) )  }","docstring":"/**\n * Predicts object for the given [imageProxy].\n * Internal preprocessing is updated to rotate image to match target orientation.\n * After prediction, internal preprocessing is restored to the original state.\n *\n * @param [imageProxy] Input image.\n *\n * @return The label of the recognized object with the highest probability.\n */"}
{"signature":"public fun ImageRecognitionModelBase < Bitmap > . predictTopKObjects ( imageProxy : ImageProxy , topK : Int =  ) : List < Pair < String , Float > >","body":"=  when ( this ) {  is CameraXCompatibleModel -> {  doWithRotation ( imageProxy . imageInfo . rotationDegrees ) { predictTopKObjects ( imageProxy . toBitmap ( ) , topK ) }  }  else -> predictTopKObjects ( imageProxy . toBitmap ( applyRotation = true ) , topK )  }","docstring":"/**\n * Predicts [topK] objects for the given [imageProxy].\n * Internal preprocessing is updated to rotate image to match target orientation.\n * After prediction, internal preprocessing is restored to the original state.\n *\n * @param [imageProxy] Input image.\n * @param [topK] Number of top ranked predictions to return\n *\n * @return The list of pairs  sorted from the most probable to the lowest probable.\n */"}
{"signature":"public fun ByteString . decodeToString ( charset : Charset ) : String","body":"= getBackingArrayReference ( ) . toString ( charset )","docstring":"/**\n * Decodes the content of a byte string to a string using given [charset].\n *\n * @param charset the charset to decode data into a string.\n */"}
{"signature":"public fun String . encodeToByteString ( charset : Charset ) : ByteString","body":"= ByteString . wrap ( toByteArray ( charset ) )","docstring":"/**\n * Encodes a string into a byte string using [charset].\n *\n * @param charset the encoding.\n */"}
{"signature":"public fun < T > alpha ( column : ColumnReference < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{  return addNonPositionalMapping < T , Double > ( ALPHA , column . name ( ) , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) . also {  validateParameters ( it )  } )  }","docstring":"/**\n * Maps the alpha aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to alpha.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return the created [NonPositionalMapping].\n * @throws IllegalArgumentException if any mapped alpha value is not in the range [0.0, 1.0].\n */"}
{"signature":"public fun < T > alpha ( column : KProperty < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{  return addNonPositionalMapping < T , Double > ( ALPHA , column . name , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) . also {  validateParameters ( it )  } )  }","docstring":"/**\n * Maps the alpha aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to alpha.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return the created [NonPositionalMapping].\n * @throws IllegalArgumentException if any mapped alpha value is not in the range [0.0, 1.0].\n */"}
{"signature":"public fun alpha ( column : String , parameters : LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , Double >","body":"{  return addNonPositionalMapping < Any ? , Double > ( ALPHA , column , LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > ( ) . apply ( parameters ) . also {  validateParameters ( it )  } )  }","docstring":"/**\n * Maps the alpha aesthetic to a data column by [String].\n *\n * @param column the data column to map to alpha.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return the created [NonPositionalMapping].\n * @throws IllegalArgumentException if any mapped alpha value is not in the range [0.0, 1.0].\n */"}
{"signature":"public fun < T > alpha ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{  return addNonPositionalMapping < T , Double > ( ALPHA , values . toList ( ) , name , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) . also {  validateParameters ( it )  } )  }","docstring":"/**\n * Maps the alpha aesthetic to an iterable collection of discrete values.\n *\n * @param values an iterable collection containing the discrete values.\n * @param name optional name for this aesthetic mapping.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return the created [NonPositionalMapping].\n * @throws IllegalArgumentException if any mapped alpha value is not in the range [0.0, 1.0].\n */"}
{"signature":"public fun < T > alpha ( values : DataColumn < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{  return addNonPositionalMapping < T , Double > ( ALPHA , values , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) . also {  validateParameters ( it )  } )  }","docstring":"/**\n * Maps the alpha aesthetic to a data column.\n *\n * @param values the data column to map to alpha.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return the created [NonPositionalMapping].\n * @throws IllegalArgumentException if any mapped alpha value is not in the range [0.0, 1.0].\n */"}
{"signature":"fun createDetectedObjectsPanel ( bufferedImage : BufferedImage , detectedObjects : List < DetectedObject > ) : JPanel","body":"= createImagePanel ( bufferedImage ) {  drawObjects ( detectedObjects , bufferedImage . width , bufferedImage . height )  }","docstring":"/**\n * Create a component with the given [bufferedImage] and [detectedObjects] drawn on top of it.\n */"}
{"signature":"fun createDetectedPosePanel ( bufferedImage : BufferedImage , detectedPose : DetectedPose ) : JPanel","body":"= createImagePanel ( bufferedImage ) {  drawPose ( detectedPose , bufferedImage . width , bufferedImage . height )  }","docstring":"/**\n * Create a component with the given [bufferedImage] and [detectedPose] drawn on top of it.\n */"}
{"signature":"fun createMultipleDetectedPosesPanel ( bufferedImage : BufferedImage , multiPoseDetectionResult : MultiPoseDetectionResult ) : JPanel","body":"= createImagePanel ( bufferedImage ) {  drawMultiplePoses ( multiPoseDetectionResult , bufferedImage . width , bufferedImage . height )  }","docstring":"/**\n * Create a component with the given [bufferedImage] and [multiPoseDetectionResult] drawn on top of it.\n */"}
{"signature":"fun createDetectedLandmarksPanel ( bufferedImage : BufferedImage , landmarks : List < Landmark > ) : JPanel","body":"= createImagePanel ( bufferedImage ) {  drawLandmarks ( landmarks , bufferedImage . width , bufferedImage . height )  }","docstring":"/**\n * Create a component with the given [bufferedImage] and [landmarks] drawn on top of it.\n */"}
{"signature":"protected open fun onCompleted ( value : T )","body":"{ }","docstring":"/**\n * This function is invoked once when the job was completed normally with the specified [value],\n * right before all the waiters for the coroutine's completion are notified.\n */"}
{"signature":"protected open fun onCancelled ( cause : Throwable , handled : Boolean )","body":"{ }","docstring":"/**\n * This function is invoked once when the job was cancelled with the specified [cause],\n * right before all the waiters for coroutine's completion are notified.\n *\n * **Note:** the state of the coroutine might not be final yet in this function and should not be queried.\n * You can use [completionCause] and [completionCauseHandled] to recover parameters that we passed\n * to this `onCancelled` invocation only when [isCompleted] returns `true`.\n *\n * @param cause The cancellation (failure) cause\n * @param handled `true` if the exception was handled by parent (always `true` when it is a [CancellationException])\n */"}
{"signature":"public final override fun resumeWith ( result : Result < T > )","body":"{  val state = makeCompletingOnce ( result . toState ( ) )  if ( state === COMPLETING_WAITING_CHILDREN ) return  afterResume ( state )  }","docstring":"/**\n * Completes execution of this with coroutine with the specified result.\n */"}
{"signature":"public fun < R > start ( start : CoroutineStart , receiver : R , block : suspend R . ( ) -> T )","body":"{  start ( block , receiver , this )  }","docstring":"/**\n * Starts this coroutine with the given code [block] and [start] strategy.\n * This function shall be invoked at most once on this coroutine.\n * \n * - [DEFAULT] uses [startCoroutineCancellable].\n * - [ATOMIC] uses [startCoroutine].\n * - [UNDISPATCHED] uses [startCoroutineUndispatched].\n * - [LAZY] does nothing.\n */"}
{"signature":"private fun DefaultKotlinSourceSet . addDependencyForLegacyImport ( libraries : FileCollection )","body":"{  @ Suppress ( \"\" )  val metadataConfigurationName = if ( project . isIntransitiveMetadataConfigurationEnabled ) {  intransitiveMetadataConfigurationName  } else {  implementationMetadataConfigurationName  }  project . dependencies . add ( metadataConfigurationName , libraries )  }","docstring":"/**\n * Legacy resolves [implementationMetadataConfigurationName] and [intransitiveMetadataConfigurationName]\n * to get dependencies for given source set. Therefore, compileDependencyFiles and dependencies in those configurations\n * must be synced.\n */"}
{"signature":"private fun qualifyInternalName ( declaration : IrDeclaration ) : String","body":"{  return getFqName ( declaration ) . asString ( ) + \"\"  }","docstring":"/**\n * Produces the name to be used for non-exported LLVM declarations corresponding to [declaration].\n *\n * Note: since these declarations are going to be private, the name is only required not to clash with any\n * exported declarations.\n */"}
{"signature":"private fun Any . toHtmlLikeString ( ) : String","body":"= toString ( )  . replace ( \"\" , \"\" )  . replace ( \">\" , \"\" )  . replace ( \"\" , \"\" )","docstring":"/**\n * Sanitize string for rendering with HTML-like syntax.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun IntProgression . first ( ) : Int","body":"{  if ( isEmpty ( ) )  throw NoSuchElementException ( \"\" )  return this . first  }","docstring":"/**\n * Returns the first element.\n * \n * @throws NoSuchElementException if the progression is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun LongProgression . first ( ) : Long","body":"{  if ( isEmpty ( ) )  throw NoSuchElementException ( \"\" )  return this . first  }","docstring":"/**\n * Returns the first element.\n * \n * @throws NoSuchElementException if the progression is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun CharProgression . first ( ) : Char","body":"{  if ( isEmpty ( ) )  throw NoSuchElementException ( \"\" )  return this . first  }","docstring":"/**\n * Returns the first element.\n * \n * @throws NoSuchElementException if the progression is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun IntProgression . firstOrNull ( ) : Int ?","body":"{  return if ( isEmpty ( ) ) null else this . first  }","docstring":"/**\n * Returns the first element, or `null` if the progression is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun LongProgression . firstOrNull ( ) : Long ?","body":"{  return if ( isEmpty ( ) ) null else this . first  }","docstring":"/**\n * Returns the first element, or `null` if the progression is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun CharProgression . firstOrNull ( ) : Char ?","body":"{  return if ( isEmpty ( ) ) null else this . first  }","docstring":"/**\n * Returns the first element, or `null` if the progression is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun IntProgression . last ( ) : Int","body":"{  if ( isEmpty ( ) )  throw NoSuchElementException ( \"\" )  return this . last  }","docstring":"/**\n * Returns the last element.\n * \n * @throws NoSuchElementException if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun LongProgression . last ( ) : Long","body":"{  if ( isEmpty ( ) )  throw NoSuchElementException ( \"\" )  return this . last  }","docstring":"/**\n * Returns the last element.\n * \n * @throws NoSuchElementException if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun CharProgression . last ( ) : Char","body":"{  if ( isEmpty ( ) )  throw NoSuchElementException ( \"\" )  return this . last  }","docstring":"/**\n * Returns the last element.\n * \n * @throws NoSuchElementException if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun IntProgression . lastOrNull ( ) : Int ?","body":"{  return if ( isEmpty ( ) ) null else this . last  }","docstring":"/**\n * Returns the last element, or `null` if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun LongProgression . lastOrNull ( ) : Long ?","body":"{  return if ( isEmpty ( ) ) null else this . last  }","docstring":"/**\n * Returns the last element, or `null` if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun CharProgression . lastOrNull ( ) : Char ?","body":"{  return if ( isEmpty ( ) ) null else this . last  }","docstring":"/**\n * Returns the last element, or `null` if the progression is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun IntRange . random ( ) : Int","body":"{  return random ( Random )  }","docstring":"/**\n * Returns a random element from this range.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun LongRange . random ( ) : Long","body":"{  return random ( Random )  }","docstring":"/**\n * Returns a random element from this range.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun CharRange . random ( ) : Char","body":"{  return random ( Random )  }","docstring":"/**\n * Returns a random element from this range.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun IntRange . random ( random : Random ) : Int","body":"{  try {  return random . nextInt ( this )  } catch ( e : IllegalArgumentException ) {  throw NoSuchElementException ( e . message )  }  }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun LongRange . random ( random : Random ) : Long","body":"{  try {  return random . nextLong ( this )  } catch ( e : IllegalArgumentException ) {  throw NoSuchElementException ( e . message )  }  }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun CharRange . random ( random : Random ) : Char","body":"{  try {  return random . nextInt ( first . code , last . code +  ) . toChar ( )  } catch ( e : IllegalArgumentException ) {  throw NoSuchElementException ( e . message )  }  }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness.\n * \n * @throws IllegalArgumentException if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun IntRange . randomOrNull ( ) : Int ?","body":"{  return randomOrNull ( Random )  }","docstring":"/**\n * Returns a random element from this range, or `null` if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun LongRange . randomOrNull ( ) : Long ?","body":"{  return randomOrNull ( Random )  }","docstring":"/**\n * Returns a random element from this range, or `null` if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun CharRange . randomOrNull ( ) : Char ?","body":"{  return randomOrNull ( Random )  }","docstring":"/**\n * Returns a random element from this range, or `null` if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun IntRange . randomOrNull ( random : Random ) : Int ?","body":"{  if ( isEmpty ( ) )  return null  return random . nextInt ( this )  }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness, or `null` if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun LongRange . randomOrNull ( random : Random ) : Long ?","body":"{  if ( isEmpty ( ) )  return null  return random . nextLong ( this )  }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness, or `null` if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun CharRange . randomOrNull ( random : Random ) : Char ?","body":"{  if ( isEmpty ( ) )  return null  return random . nextInt ( first . code , last . code +  ) . toChar ( )  }","docstring":"/**\n * Returns a random element from this range using the specified source of randomness, or `null` if this range is empty.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline operator fun IntRange . contains ( element : Int ? ) : Boolean","body":"{  return element != null && contains ( element )  }","docstring":"/**\n * Returns `true` if this range contains the specified [element].\n * \n * Always returns `false` if the [element] is `null`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline operator fun LongRange . contains ( element : Long ? ) : Boolean","body":"{  return element != null && contains ( element )  }","docstring":"/**\n * Returns `true` if this range contains the specified [element].\n * \n * Always returns `false` if the [element] is `null`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ kotlin . internal . InlineOnly  public inline operator fun CharRange . contains ( element : Char ? ) : Boolean","body":"{  return element != null && contains ( element )  }","docstring":"/**\n * Returns `true` if this range contains the specified [element].\n * \n * Always returns `false` if the [element] is `null`.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Int > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toInt ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Long > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toLong ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Short > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toShort ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Double > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toDouble ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Float > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toFloat ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Int > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toInt ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Long > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toLong ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Short > . contains ( value : Byte ) : Boolean","body":"{  return contains ( value . toShort ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun IntRange . contains ( value : Byte ) : Boolean","body":"{  return ( this as ClosedRange < Int > ) . contains ( value )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun LongRange . contains ( value : Byte ) : Boolean","body":"{  return ( this as ClosedRange < Long > ) . contains ( value )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Int > . contains ( value : Double ) : Boolean","body":"{  return value . toIntExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Long > . contains ( value : Double ) : Boolean","body":"{  return value . toLongExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Byte > . contains ( value : Double ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Short > . contains ( value : Double ) : Boolean","body":"{  return value . toShortExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Float > . contains ( value : Double ) : Boolean","body":"{  return contains ( value . toFloat ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Int > . contains ( value : Float ) : Boolean","body":"{  return value . toIntExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Long > . contains ( value : Float ) : Boolean","body":"{  return value . toLongExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Byte > . contains ( value : Float ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Short > . contains ( value : Float ) : Boolean","body":"{  return value . toShortExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Double > . contains ( value : Float ) : Boolean","body":"{  return contains ( value . toDouble ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Double > . contains ( value : Float ) : Boolean","body":"{  return contains ( value . toDouble ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Long > . contains ( value : Int ) : Boolean","body":"{  return contains ( value . toLong ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Byte > . contains ( value : Int ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Short > . contains ( value : Int ) : Boolean","body":"{  return value . toShortExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Double > . contains ( value : Int ) : Boolean","body":"{  return contains ( value . toDouble ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Float > . contains ( value : Int ) : Boolean","body":"{  return contains ( value . toFloat ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Long > . contains ( value : Int ) : Boolean","body":"{  return contains ( value . toLong ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Byte > . contains ( value : Int ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Short > . contains ( value : Int ) : Boolean","body":"{  return value . toShortExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun LongRange . contains ( value : Int ) : Boolean","body":"{  return ( this as ClosedRange < Long > ) . contains ( value )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Int > . contains ( value : Long ) : Boolean","body":"{  return value . toIntExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Byte > . contains ( value : Long ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Short > . contains ( value : Long ) : Boolean","body":"{  return value . toShortExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Double > . contains ( value : Long ) : Boolean","body":"{  return contains ( value . toDouble ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Float > . contains ( value : Long ) : Boolean","body":"{  return contains ( value . toFloat ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Int > . contains ( value : Long ) : Boolean","body":"{  return value . toIntExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Byte > . contains ( value : Long ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Short > . contains ( value : Long ) : Boolean","body":"{  return value . toShortExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun IntRange . contains ( value : Long ) : Boolean","body":"{  return ( this as ClosedRange < Int > ) . contains ( value )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Int > . contains ( value : Short ) : Boolean","body":"{  return contains ( value . toInt ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Long > . contains ( value : Short ) : Boolean","body":"{  return contains ( value . toLong ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Byte > . contains ( value : Short ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Double > . contains ( value : Short ) : Boolean","body":"{  return contains ( value . toDouble ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ Deprecated ( \"\" )  @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" , hiddenSince = \"\" )  @ kotlin . jvm . JvmName ( \"\" )  public operator fun ClosedRange < Float > . contains ( value : Short ) : Boolean","body":"{  return contains ( value . toFloat ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Int > . contains ( value : Short ) : Boolean","body":"{  return contains ( value . toInt ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Long > . contains ( value : Short ) : Boolean","body":"{  return contains ( value . toLong ( ) )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . jvm . JvmName ( \"\" )  @ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public operator fun OpenEndRange < Byte > . contains ( value : Short ) : Boolean","body":"{  return value . toByteExactOrNull ( ) . let { if ( it != null ) contains ( it ) else false }  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun IntRange . contains ( value : Short ) : Boolean","body":"{  return ( this as ClosedRange < Int > ) . contains ( value )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"@ kotlin . internal . InlineOnly  public inline operator fun LongRange . contains ( value : Short ) : Boolean","body":"{  return ( this as ClosedRange < Long > ) . contains ( value )  }","docstring":"/**\n * Checks if the specified [value] belongs to this range.\n */"}
{"signature":"public infix fun Int . downTo ( to : Byte ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this , to . toInt ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Long . downTo ( to : Byte ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( this , to . toLong ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Byte . downTo ( to : Byte ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this . toInt ( ) , to . toInt ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Short . downTo ( to : Byte ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this . toInt ( ) , to . toInt ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Char . downTo ( to : Char ) : CharProgression","body":"{  return CharProgression . fromClosedRange ( this , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Int . downTo ( to : Int ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Long . downTo ( to : Int ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( this , to . toLong ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Byte . downTo ( to : Int ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this . toInt ( ) , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Short . downTo ( to : Int ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this . toInt ( ) , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Int . downTo ( to : Long ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( this . toLong ( ) , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Long . downTo ( to : Long ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( this , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Byte . downTo ( to : Long ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( this . toLong ( ) , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Short . downTo ( to : Long ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( this . toLong ( ) , to , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Int . downTo ( to : Short ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this , to . toInt ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Long . downTo ( to : Short ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( this , to . toLong ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Byte . downTo ( to : Short ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this . toInt ( ) , to . toInt ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public infix fun Short . downTo ( to : Short ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( this . toInt ( ) , to . toInt ( ) , -  )  }","docstring":"/**\n * Returns a progression from this value down to the specified [to] value with the step -1.\n * \n * The [to] value should be less than or equal to `this` value.\n * If the [to] value is greater than `this` value the returned progression is empty.\n */"}
{"signature":"public fun IntProgression . reversed ( ) : IntProgression","body":"{  return IntProgression . fromClosedRange ( last , first , - step )  }","docstring":"/**\n * Returns a progression that goes over the same range in the opposite direction with the same step.\n */"}
{"signature":"public fun LongProgression . reversed ( ) : LongProgression","body":"{  return LongProgression . fromClosedRange ( last , first , - step )  }","docstring":"/**\n * Returns a progression that goes over the same range in the opposite direction with the same step.\n */"}
{"signature":"public fun CharProgression . reversed ( ) : CharProgression","body":"{  return CharProgression . fromClosedRange ( last , first , - step )  }","docstring":"/**\n * Returns a progression that goes over the same range in the opposite direction with the same step.\n */"}
{"signature":"public infix fun IntProgression . step ( step : Int ) : IntProgression","body":"{  checkStepIsPositive ( step >  , step )  return IntProgression . fromClosedRange ( first , last , if ( this . step >  ) step else - step )  }","docstring":"/**\n * Returns a progression that goes over the same range with the given step.\n * \n * @sample samples.ranges.Ranges.stepInt\n */"}
{"signature":"public infix fun LongProgression . step ( step : Long ) : LongProgression","body":"{  checkStepIsPositive ( step >  , step )  return LongProgression . fromClosedRange ( first , last , if ( this . step >  ) step else - step )  }","docstring":"/**\n * Returns a progression that goes over the same range with the given step.\n * \n * @sample samples.ranges.Ranges.stepLong\n */"}
{"signature":"public infix fun CharProgression . step ( step : Int ) : CharProgression","body":"{  checkStepIsPositive ( step >  , step )  return CharProgression . fromClosedRange ( first , last , if ( this . step >  ) step else - step )  }","docstring":"/**\n * Returns a progression that goes over the same range with the given step.\n * \n * @sample samples.ranges.Ranges.stepChar\n */"}
{"signature":"public infix fun Int . until ( to : Byte ) : IntRange","body":"{  return this .. ( to . toInt ( ) -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Long . until ( to : Byte ) : LongRange","body":"{  return this .. ( to . toLong ( ) -  ) . toLong ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Byte . until ( to : Byte ) : IntRange","body":"{  return this . toInt ( ) .. ( to . toInt ( ) -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Short . until ( to : Byte ) : IntRange","body":"{  return this . toInt ( ) .. ( to . toInt ( ) -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Char . until ( to : Char ) : CharRange","body":"{  if ( to <= '' ) return CharRange . EMPTY  return this .. ( to -  ) . toChar ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Int . until ( to : Int ) : IntRange","body":"{  if ( to <= Int . MIN_VALUE ) return IntRange . EMPTY  return this .. ( to -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Long . until ( to : Int ) : LongRange","body":"{  return this .. ( to . toLong ( ) -  ) . toLong ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Byte . until ( to : Int ) : IntRange","body":"{  if ( to <= Int . MIN_VALUE ) return IntRange . EMPTY  return this . toInt ( ) .. ( to -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Short . until ( to : Int ) : IntRange","body":"{  if ( to <= Int . MIN_VALUE ) return IntRange . EMPTY  return this . toInt ( ) .. ( to -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Int . until ( to : Long ) : LongRange","body":"{  if ( to <= Long . MIN_VALUE ) return LongRange . EMPTY  return this . toLong ( ) .. ( to -  ) . toLong ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Long . until ( to : Long ) : LongRange","body":"{  if ( to <= Long . MIN_VALUE ) return LongRange . EMPTY  return this .. ( to -  ) . toLong ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Byte . until ( to : Long ) : LongRange","body":"{  if ( to <= Long . MIN_VALUE ) return LongRange . EMPTY  return this . toLong ( ) .. ( to -  ) . toLong ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Short . until ( to : Long ) : LongRange","body":"{  if ( to <= Long . MIN_VALUE ) return LongRange . EMPTY  return this . toLong ( ) .. ( to -  ) . toLong ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Int . until ( to : Short ) : IntRange","body":"{  return this .. ( to . toInt ( ) -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Long . until ( to : Short ) : LongRange","body":"{  return this .. ( to . toLong ( ) -  ) . toLong ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Byte . until ( to : Short ) : IntRange","body":"{  return this . toInt ( ) .. ( to . toInt ( ) -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public infix fun Short . until ( to : Short ) : IntRange","body":"{  return this . toInt ( ) .. ( to . toInt ( ) -  ) . toInt ( )  }","docstring":"/**\n * Returns a range from this value up to but excluding the specified [to] value.\n * \n * If the [to] value is less than or equal to `this` value, then the returned range is empty.\n */"}
{"signature":"public fun < T : Comparable < T > > T . coerceAtLeast ( minimumValue : T ) : T","body":"{  return if ( this < minimumValue ) minimumValue else this  }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeastComparable\n */"}
{"signature":"public fun Byte . coerceAtLeast ( minimumValue : Byte ) : Byte","body":"{  return if ( this < minimumValue ) minimumValue else this  }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeast\n */"}
{"signature":"public fun Short . coerceAtLeast ( minimumValue : Short ) : Short","body":"{  return if ( this < minimumValue ) minimumValue else this  }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeast\n */"}
{"signature":"public fun Int . coerceAtLeast ( minimumValue : Int ) : Int","body":"{  return if ( this < minimumValue ) minimumValue else this  }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeast\n */"}
{"signature":"public fun Long . coerceAtLeast ( minimumValue : Long ) : Long","body":"{  return if ( this < minimumValue ) minimumValue else this  }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeast\n */"}
{"signature":"public fun Float . coerceAtLeast ( minimumValue : Float ) : Float","body":"{  return if ( this < minimumValue ) minimumValue else this  }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeast\n */"}
{"signature":"public fun Double . coerceAtLeast ( minimumValue : Double ) : Double","body":"{  return if ( this < minimumValue ) minimumValue else this  }","docstring":"/**\n * Ensures that this value is not less than the specified [minimumValue].\n * \n * @return this value if it's greater than or equal to the [minimumValue] or the [minimumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtLeast\n */"}
{"signature":"public fun < T : Comparable < T > > T . coerceAtMost ( maximumValue : T ) : T","body":"{  return if ( this > maximumValue ) maximumValue else this  }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMostComparable\n */"}
{"signature":"public fun Byte . coerceAtMost ( maximumValue : Byte ) : Byte","body":"{  return if ( this > maximumValue ) maximumValue else this  }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMost\n */"}
{"signature":"public fun Short . coerceAtMost ( maximumValue : Short ) : Short","body":"{  return if ( this > maximumValue ) maximumValue else this  }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMost\n */"}
{"signature":"public fun Int . coerceAtMost ( maximumValue : Int ) : Int","body":"{  return if ( this > maximumValue ) maximumValue else this  }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMost\n */"}
{"signature":"public fun Long . coerceAtMost ( maximumValue : Long ) : Long","body":"{  return if ( this > maximumValue ) maximumValue else this  }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMost\n */"}
{"signature":"public fun Float . coerceAtMost ( maximumValue : Float ) : Float","body":"{  return if ( this > maximumValue ) maximumValue else this  }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMost\n */"}
{"signature":"public fun Double . coerceAtMost ( maximumValue : Double ) : Double","body":"{  return if ( this > maximumValue ) maximumValue else this  }","docstring":"/**\n * Ensures that this value is not greater than the specified [maximumValue].\n * \n * @return this value if it's less than or equal to the [maximumValue] or the [maximumValue] otherwise.\n * \n * @sample samples.comparisons.ComparableOps.coerceAtMost\n */"}
{"signature":"public fun < T : Comparable < T > > T . coerceIn ( minimumValue : T ? , maximumValue : T ? ) : T","body":"{  if ( minimumValue !== null && maximumValue !== null ) {  if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" )  if ( this < minimumValue ) return minimumValue  if ( this > maximumValue ) return maximumValue  }  else {  if ( minimumValue !== null && this < minimumValue ) return minimumValue  if ( maximumValue !== null && this > maximumValue ) return maximumValue  }  return this  }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceInComparable\n */"}
{"signature":"public fun Byte . coerceIn ( minimumValue : Byte , maximumValue : Byte ) : Byte","body":"{  if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" )  if ( this < minimumValue ) return minimumValue  if ( this > maximumValue ) return maximumValue  return this  }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"public fun Short . coerceIn ( minimumValue : Short , maximumValue : Short ) : Short","body":"{  if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" )  if ( this < minimumValue ) return minimumValue  if ( this > maximumValue ) return maximumValue  return this  }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"public fun Int . coerceIn ( minimumValue : Int , maximumValue : Int ) : Int","body":"{  if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" )  if ( this < minimumValue ) return minimumValue  if ( this > maximumValue ) return maximumValue  return this  }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"public fun Long . coerceIn ( minimumValue : Long , maximumValue : Long ) : Long","body":"{  if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" )  if ( this < minimumValue ) return minimumValue  if ( this > maximumValue ) return maximumValue  return this  }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"public fun Float . coerceIn ( minimumValue : Float , maximumValue : Float ) : Float","body":"{  if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" )  if ( this < minimumValue ) return minimumValue  if ( this > maximumValue ) return maximumValue  return this  }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"public fun Double . coerceIn ( minimumValue : Double , maximumValue : Double ) : Double","body":"{  if ( minimumValue > maximumValue ) throw IllegalArgumentException ( \"\" )  if ( this < minimumValue ) return minimumValue  if ( this > maximumValue ) return maximumValue  return this  }","docstring":"/**\n * Ensures that this value lies in the specified range [minimumValue]..[maximumValue].\n * \n * @return this value if it's in the range, or [minimumValue] if this value is less than [minimumValue], or [maximumValue] if this value is greater than [maximumValue].\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun < T : Comparable < T > > T . coerceIn ( range : ClosedFloatingPointRange < T > ) : T","body":"{  if ( range . isEmpty ( ) ) throw IllegalArgumentException ( \"\" )  return when {  range . lessThanOrEquals ( this , range . start ) && ! range . lessThanOrEquals ( range . start , this ) -> range . start  range . lessThanOrEquals ( range . endInclusive , this ) && ! range . lessThanOrEquals ( this , range . endInclusive ) -> range . endInclusive  else -> this  }  }","docstring":"/**\n * Ensures that this value lies in the specified [range].\n * \n * @return this value if it's in the [range], or `range.start` if this value is less than `range.start`, or `range.endInclusive` if this value is greater than `range.endInclusive`.\n * \n * @sample samples.comparisons.ComparableOps.coerceInFloatingPointRange\n */"}
{"signature":"public fun < T : Comparable < T > > T . coerceIn ( range : ClosedRange < T > ) : T","body":"{  if ( range is ClosedFloatingPointRange ) {  return this . coerceIn < T > ( range )  }  if ( range . isEmpty ( ) ) throw IllegalArgumentException ( \"\" )  return when {  this < range . start -> range . start  this > range . endInclusive -> range . endInclusive  else -> this  }  }","docstring":"/**\n * Ensures that this value lies in the specified [range].\n * \n * @return this value if it's in the [range], or `range.start` if this value is less than `range.start`, or `range.endInclusive` if this value is greater than `range.endInclusive`.\n * \n * @sample samples.comparisons.ComparableOps.coerceInComparable\n */"}
{"signature":"public fun Int . coerceIn ( range : ClosedRange < Int > ) : Int","body":"{  if ( range is ClosedFloatingPointRange ) {  return this . coerceIn < Int > ( range )  }  if ( range . isEmpty ( ) ) throw IllegalArgumentException ( \"\" )  return when {  this < range . start -> range . start  this > range . endInclusive -> range . endInclusive  else -> this  }  }","docstring":"/**\n * Ensures that this value lies in the specified [range].\n * \n * @return this value if it's in the [range], or `range.start` if this value is less than `range.start`, or `range.endInclusive` if this value is greater than `range.endInclusive`.\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"public fun Long . coerceIn ( range : ClosedRange < Long > ) : Long","body":"{  if ( range is ClosedFloatingPointRange ) {  return this . coerceIn < Long > ( range )  }  if ( range . isEmpty ( ) ) throw IllegalArgumentException ( \"\" )  return when {  this < range . start -> range . start  this > range . endInclusive -> range . endInclusive  else -> this  }  }","docstring":"/**\n * Ensures that this value lies in the specified [range].\n * \n * @return this value if it's in the [range], or `range.start` if this value is less than `range.start`, or `range.endInclusive` if this value is greater than `range.endInclusive`.\n * \n * @sample samples.comparisons.ComparableOps.coerceIn\n */"}
{"signature":"@ ExperimentalSerializationApi  public fun < T > decodeFromConfig ( deserializer : DeserializationStrategy < T > , config : Config ) : T","body":"=  ConfigReader ( config ) . decodeSerializableValue ( deserializer )","docstring":"/**\n * Decodes the given [config] into a value of type [T] using the given serializer.\n */"}
{"signature":"@ ExperimentalSerializationApi  public fun < T > encodeToConfig ( serializer : SerializationStrategy < T > , value : T ) : Config","body":"{  lateinit var configValue : ConfigValue  val encoder = HoconConfigEncoder ( this ) { configValue = it }  encoder . encodeSerializableValue ( serializer , value )  if ( configValue !is ConfigObject ) {  throw SerializationException ( \"\" + \"\" )  }  return ( configValue as ConfigObject ) . toConfig ( )  }","docstring":"/**\n * Encodes the given [value] into a [Config] using the given [serializer].\n * @throws SerializationException If list or primitive type passed as a [value].\n */"}
{"signature":"@ ExperimentalSerializationApi  public inline fun < reified T > Hocon . decodeFromConfig ( config : Config ) : T","body":"=  decodeFromConfig ( serializersModule . serializer ( ) , config )","docstring":"/**\n * Decodes the given [config] into a value of type [T] using a deserializer retrieved\n * from the reified type parameter.\n */"}
{"signature":"@ ExperimentalSerializationApi  public inline fun < reified T > Hocon . encodeToConfig ( value : T ) : Config","body":"=  encodeToConfig ( serializersModule . serializer ( ) , value )","docstring":"/**\n * Encodes the given [value] of type [T] into a [Config] using a serializer retrieved\n * from the reified type parameter.\n */"}
{"signature":"@ ExperimentalSerializationApi  public fun Hocon ( from : Hocon = Hocon , builderAction : HoconBuilder . ( ) -> Unit ) : Hocon","body":"{  return HoconImpl ( HoconBuilder ( from ) . apply ( builderAction ) )  }","docstring":"/**\n * Creates an instance of [Hocon] configured from the optionally given [Hocon instance][from]\n * and adjusted with [builderAction].\n */"}
{"signature":"public open fun isDispatchNeeded ( context : CoroutineContext ) : Boolean","body":"= true","docstring":"/**\n * Returns `true` if the execution of the coroutine should be performed with [dispatch] method.\n * The default behavior for most dispatchers is to return `true`.\n *\n * If this method returns `false`, the coroutine is resumed immediately in the current thread,\n * potentially forming an event-loop to prevent stack overflows.\n * The event loop is an advanced topic and its implications can be found in [Dispatchers.Unconfined] documentation.\n *\n * The [context] parameter represents the context of the coroutine that is being dispatched,\n * or [EmptyCoroutineContext] if a non-coroutine-specific [Runnable] is dispatched instead.\n *\n * A dispatcher can override this method to provide a performance optimization and avoid paying a cost of an unnecessary dispatch.\n * E.g. [MainCoroutineDispatcher.immediate] checks whether we are already in the required UI thread in this method and avoids\n * an additional dispatch when it is not required.\n *\n * While this approach can be more efficient, it is not chosen by default to provide a consistent dispatching behaviour\n * so that users won't observe unexpected and non-consistent order of events by default.\n *\n * Coroutine builders like [launch][CoroutineScope.launch] and [async][CoroutineScope.async] accept an optional [CoroutineStart]\n * parameter that allows one to optionally choose the [undispatched][CoroutineStart.UNDISPATCHED] behavior to start coroutine immediately,\n * but to be resumed only in the provided dispatcher.\n *\n * This method should generally be exception-safe. An exception thrown from this method\n * may leave the coroutines that use this dispatcher in the inconsistent and hard to debug state.\n *\n * @see dispatch\n * @see Dispatchers.Unconfined\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public open fun limitedParallelism ( parallelism : Int ) : CoroutineDispatcher","body":"{  parallelism . checkParallelism ( )  return LimitedDispatcher ( this , parallelism )  }","docstring":"/**\n * Creates a view of the current dispatcher that limits the parallelism to the given [value][parallelism].\n * The resulting view uses the original dispatcher for execution, but with the guarantee that\n * no more than [parallelism] coroutines are executed at the same time.\n *\n * This method does not impose restrictions on the number of views or the total sum of parallelism values,\n * each view controls its own parallelism independently with the guarantee that the effective parallelism\n * of all views cannot exceed the actual parallelism of the original dispatcher.\n *\n * ### Limitations\n *\n * The default implementation of `limitedParallelism` does not support direct dispatchers,\n * such as executing the given runnable in place during [dispatch] calls.\n * Any dispatcher that may return `false` from [isDispatchNeeded] is considered direct.\n * For direct dispatchers, it is recommended to override this method\n * and provide a domain-specific implementation or to throw an [UnsupportedOperationException].\n *\n * ### Example of usage\n * ```\n * private val backgroundDispatcher = newFixedThreadPoolContext(4, \"App Background\")\n * // At most 2 threads will be processing images as it is really slow and CPU-intensive\n * private val imageProcessingDispatcher = backgroundDispatcher.limitedParallelism(2)\n * // At most 3 threads will be processing JSON to avoid image processing starvation\n * private val jsonProcessingDispatcher = backgroundDispatcher.limitedParallelism(3)\n * // At most 1 thread will be doing IO\n * private val fileWriterDispatcher = backgroundDispatcher.limitedParallelism(1)\n * ```\n * Note how in this example the application has an executor with 4 threads, but the total sum of all limits\n * is 6. Still, at most 4 coroutines can be executed simultaneously as each view limits only its own parallelism.\n *\n * Note that this example was structured in such a way that it illustrates the parallelism guarantees.\n * In practice, it is usually better to use [Dispatchers.IO] or [Dispatchers.Default] instead of creating a\n * `backgroundDispatcher`. It is both possible and advised to call `limitedParallelism` on them.\n */"}
{"signature":"public abstract fun dispatch ( context : CoroutineContext , block : Runnable )","body":"public abstract fun dispatch ( context : CoroutineContext , block : Runnable )","docstring":"/**\n * Requests execution of a runnable [block].\n * The dispatcher guarantees that [block] will eventually execute, typically by dispatching it to a thread pool,\n * using a dedicated thread, or just executing the block in place.\n * The [context] parameter represents the context of the coroutine that is being dispatched,\n * or [EmptyCoroutineContext] if a non-coroutine-specific [Runnable] is dispatched instead.\n * Implementations may use [context] for additional context-specific information,\n * such as priority, whether the dispatched coroutine can be invoked in place,\n * coroutine name, and additional diagnostic elements.\n *\n * This method should guarantee that the given [block] will be eventually invoked,\n * otherwise the system may reach a deadlock state and never leave it.\n * The cancellation mechanism is transparent for [CoroutineDispatcher] and is managed by [block] internals.\n *\n * This method should generally be exception-safe. An exception thrown from this method\n * may leave the coroutines that use this dispatcher in an inconsistent and hard-to-debug state.\n *\n * This method must not immediately call [block]. Doing so may result in `StackOverflowError`\n * when `dispatch` is invoked repeatedly, for example when [yield] is called in a loop.\n * In order to execute a block in place, it is required to return `false` from [isDispatchNeeded]\n * and delegate the `dispatch` implementation to `Dispatchers.Unconfined.dispatch` in such cases.\n * To support this, the coroutines machinery ensures in-place execution and forms an event-loop to\n * avoid unbound recursion.\n *\n * @see isDispatchNeeded\n * @see Dispatchers.Unconfined\n */"}
{"signature":"@ InternalCoroutinesApi  public open fun dispatchYield ( context : CoroutineContext , block : Runnable ) : Unit","body":"= dispatch ( context , block )","docstring":"/**\n * Dispatches execution of a runnable `block` onto another thread in the given `context`\n * with a hint for the dispatcher that the current dispatch is triggered by a [yield] call, so that the execution of this\n * continuation may be delayed in favor of already dispatched coroutines.\n *\n * Though the `yield` marker may be passed as a part of [context], this\n * is a separate method for performance reasons.\n *\n * @suppress **This an internal API and should not be used from general code.**\n */"}
{"signature":"public final override fun < T > interceptContinuation ( continuation : Continuation < T > ) : Continuation < T >","body":"=  DispatchedContinuation ( this , continuation )","docstring":"/**\n * Returns a continuation that wraps the provided [continuation], thus intercepting all resumptions.\n *\n * This method should generally be exception-safe. An exception thrown from this method\n * may leave the coroutines that use this dispatcher in the inconsistent and hard to debug state.\n */"}
{"signature":"@ Suppress ( \"\" )  @ Deprecated ( message = \"\" + \"\" + \"\" , level = DeprecationLevel . ERROR )  public operator fun plus ( other : CoroutineDispatcher ) : CoroutineDispatcher","body":"= other","docstring":"/**\n * @suppress **Error**: Operator '+' on two CoroutineDispatcher objects is meaningless.\n * CoroutineDispatcher is a coroutine context element and `+` is a set-sum operator for coroutine contexts.\n * The dispatcher to the right of `+` just replaces the dispatcher to the left.\n */"}
{"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/** @suppress for nicer debugging */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect inline fun < T > ( suspend ( ) -> T ) . startCoroutineUninterceptedOrReturn ( completion : Continuation < T > ) : Any ?","body":"@ SinceKotlin ( \"\" )  public expect inline fun < T > ( suspend ( ) -> T ) . startCoroutineUninterceptedOrReturn ( completion : Continuation < T > ) : Any ?","docstring":"/**\n * Starts an unintercepted coroutine without a receiver and with result type [T] and executes it until its first suspension.\n * Returns the result of the coroutine or throws its exception if it does not suspend or [COROUTINE_SUSPENDED] if it suspends.\n * In the latter case, the [completion] continuation is invoked when the coroutine completes with a result or an exception.\n *\n * The coroutine is started directly in the invoker's thread without going through the [ContinuationInterceptor] that might\n * be present in the completion's [CoroutineContext]. It is the invoker's responsibility to ensure that a proper invocation\n * context is established.\n *\n * This function is designed to be used from inside of [suspendCoroutineUninterceptedOrReturn] to resume the execution of the suspended\n * coroutine using a reference to the suspending function.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect inline fun < R , T > ( suspend R . ( ) -> T ) . startCoroutineUninterceptedOrReturn ( receiver : R , completion : Continuation < T > ) : Any ?","body":"@ SinceKotlin ( \"\" )  public expect inline fun < R , T > ( suspend R . ( ) -> T ) . startCoroutineUninterceptedOrReturn ( receiver : R , completion : Continuation < T > ) : Any ?","docstring":"/**\n * Starts an unintercepted coroutine with receiver type [R] and result type [T] and executes it until its first suspension.\n * Returns the result of the coroutine or throws its exception if it does not suspend or [COROUTINE_SUSPENDED] if it suspends.\n * In the latter case, the [completion] continuation is invoked when the coroutine completes with a result or an exception.\n *\n * The coroutine is started directly in the invoker's thread without going through the [ContinuationInterceptor] that might\n * be present in the completion's [CoroutineContext]. It is the invoker's responsibility to ensure that a proper invocation\n * context is established.\n *\n * This function is designed to be used from inside of [suspendCoroutineUninterceptedOrReturn] to resume the execution of the suspended\n * coroutine using a reference to the suspending function.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun < T > Continuation < T > . intercepted ( ) : Continuation < T >","body":"@ SinceKotlin ( \"\" )  public expect fun < T > Continuation < T > . intercepted ( ) : Continuation < T >","docstring":"/**\n * Intercepts this continuation with [ContinuationInterceptor].\n *\n * This function shall be used on the immediate result of [createCoroutineUnintercepted] or [suspendCoroutineUninterceptedOrReturn],\n * in which case it checks for [ContinuationInterceptor] in the continuation's [context][Continuation.context],\n * invokes [ContinuationInterceptor.interceptContinuation], caches and returns the result.\n *\n * If this function is invoked on other [Continuation] instances it returns `this` continuation unchanged.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sin ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun sin ( x : Double ) : Double","docstring":"/** Computes the sine of the angle [x] given in radians.\n *\n * Special cases:\n * - `sin(NaN|+Inf|-Inf)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun cos ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun cos ( x : Double ) : Double","docstring":"/** Computes the cosine of the angle [x] given in radians.\n *\n * Special cases:\n * - `cos(NaN|+Inf|-Inf)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun tan ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun tan ( x : Double ) : Double","docstring":"/** Computes the tangent of the angle [x] given in radians.\n *\n * Special cases:\n * - `tan(NaN|+Inf|-Inf)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun asin ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun asin ( x : Double ) : Double","docstring":"/**\n * Computes the arc sine of the value [x];\n * the returned value is an angle in the range from `-PI/2` to `PI/2` radians.\n *\n * Special cases:\n * - `asin(x)` is `NaN`, when `abs(x) > 1` or x is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun acos ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun acos ( x : Double ) : Double","docstring":"/**\n * Computes the arc cosine of the value [x];\n * the returned value is an angle in the range from `0.0` to `PI` radians.\n *\n * Special cases:\n * - `acos(x)` is `NaN`, when `abs(x) > 1` or x is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun atan ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun atan ( x : Double ) : Double","docstring":"/**\n * Computes the arc tangent of the value [x];\n * the returned value is an angle in the range from `-PI/2` to `PI/2` radians.\n *\n * Special cases:\n * - `atan(NaN)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun atan2 ( y : Double , x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun atan2 ( y : Double , x : Double ) : Double","docstring":"/**\n * Returns the angle `theta` of the polar coordinates `(r, theta)` that correspond\n * to the rectangular coordinates `(x, y)` by computing the arc tangent of the value [y] / [x];\n * the returned value is an angle in the range from `-PI` to `PI` radians.\n *\n * Special cases:\n * - `atan2(0.0, 0.0)` is `0.0`\n * - `atan2(0.0, x)` is `0.0` for `x > 0` and `PI` for `x < 0`\n * - `atan2(-0.0, x)` is `-0.0` for 'x > 0` and `-PI` for `x < 0`\n * - `atan2(y, +Inf)` is `0.0` for `0 < y < +Inf` and `-0.0` for '-Inf < y < 0`\n * - `atan2(y, -Inf)` is `PI` for `0 < y < +Inf` and `-PI` for `-Inf < y < 0`\n * - `atan2(y, 0.0)` is `PI/2` for `y > 0` and `-PI/2` for `y < 0`\n * - `atan2(+Inf, x)` is `PI/2` for finite `x`y\n * - `atan2(-Inf, x)` is `-PI/2` for finite `x`\n * - `atan2(NaN, x)` and `atan2(y, NaN)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sinh ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun sinh ( x : Double ) : Double","docstring":"/**\n * Computes the hyperbolic sine of the value [x].\n *\n * Special cases:\n * - `sinh(NaN)` is `NaN`\n * - `sinh(+Inf)` is `+Inf`\n * - `sinh(-Inf)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun cosh ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun cosh ( x : Double ) : Double","docstring":"/**\n * Computes the hyperbolic cosine of the value [x].\n *\n * Special cases:\n * - `cosh(NaN)` is `NaN`\n * - `cosh(+Inf|-Inf)` is `+Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun tanh ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun tanh ( x : Double ) : Double","docstring":"/**\n * Computes the hyperbolic tangent of the value [x].\n *\n * Special cases:\n * - `tanh(NaN)` is `NaN`\n * - `tanh(+Inf)` is `1.0`\n * - `tanh(-Inf)` is `-1.0`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun asinh ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun asinh ( x : Double ) : Double","docstring":"/**\n * Computes the inverse hyperbolic sine of the value [x].\n *\n * The returned value is `y` such that `sinh(y) == x`.\n *\n * Special cases:\n * - `asinh(NaN)` is `NaN`\n * - `asinh(+Inf)` is `+Inf`\n * - `asinh(-Inf)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun acosh ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun acosh ( x : Double ) : Double","docstring":"/**\n * Computes the inverse hyperbolic cosine of the value [x].\n *\n * The returned value is positive `y` such that `cosh(y) == x`.\n *\n * Special cases:\n * - `acosh(NaN)` is `NaN`\n * - `acosh(x)` is `NaN` when `x < 1`\n * - `acosh(+Inf)` is `+Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun atanh ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun atanh ( x : Double ) : Double","docstring":"/**\n * Computes the inverse hyperbolic tangent of the value [x].\n *\n * The returned value is `y` such that `tanh(y) == x`.\n *\n * Special cases:\n * - `tanh(NaN)` is `NaN`\n * - `tanh(x)` is `NaN` when `x > 1` or `x < -1`\n * - `tanh(1.0)` is `+Inf`\n * - `tanh(-1.0)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun hypot ( x : Double , y : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun hypot ( x : Double , y : Double ) : Double","docstring":"/**\n * Computes `sqrt(x^2 + y^2)` without intermediate overflow or underflow.\n *\n * Special cases:\n * - returns `+Inf` if any of arguments is infinite\n * - returns `NaN` if any of arguments is `NaN` and the other is not infinite\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sqrt ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun sqrt ( x : Double ) : Double","docstring":"/**\n * Computes the positive square root of the value [x].\n *\n * Special cases:\n * - `sqrt(x)` is `NaN` when `x < 0` or `x` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun exp ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun exp ( x : Double ) : Double","docstring":"/**\n * Computes Euler's number `e` raised to the power of the value [x].\n *\n * Special cases:\n * - `exp(NaN)` is `NaN`\n * - `exp(+Inf)` is `+Inf`\n * - `exp(-Inf)` is `0.0`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun expm1 ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun expm1 ( x : Double ) : Double","docstring":"/**\n * Computes `exp(x) - 1`.\n *\n * This function can be implemented to produce more precise result for [x] near zero.\n *\n * Special cases:\n * - `expm1(NaN)` is `NaN`\n * - `expm1(+Inf)` is `+Inf`\n * - `expm1(-Inf)` is `-1.0`\n *\n * @see [exp] function.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun log ( x : Double , base : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun log ( x : Double , base : Double ) : Double","docstring":"/**\n * Computes the logarithm of the value [x] to the given [base].\n *\n * Special cases:\n * - `log(x, b)` is `NaN` if either `x` or `b` are `NaN`\n * - `log(x, b)` is `NaN` when `x < 0` or `b <= 0` or `b == 1.0`\n * - `log(+Inf, +Inf)` is `NaN`\n * - `log(+Inf, b)` is `+Inf` for `b > 1` and `-Inf` for `b < 1`\n * - `log(0.0, b)` is `-Inf` for `b > 1` and `+Inf` for `b > 1`\n *\n * See also logarithm functions for common fixed bases: [ln], [log10] and [log2].\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ln ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun ln ( x : Double ) : Double","docstring":"/**\n * Computes the natural logarithm (base `E`) of the value [x].\n *\n * Special cases:\n * - `ln(NaN)` is `NaN`\n * - `ln(x)` is `NaN` when `x < 0.0`\n * - `ln(+Inf)` is `+Inf`\n * - `ln(0.0)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun log10 ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun log10 ( x : Double ) : Double","docstring":"/**\n * Computes the common logarithm (base 10) of the value [x].\n *\n * @see [ln] function for special cases.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun log2 ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun log2 ( x : Double ) : Double","docstring":"/**\n * Computes the binary logarithm (base 2) of the value [x].\n *\n * @see [ln] function for special cases.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ln1p ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun ln1p ( x : Double ) : Double","docstring":"/**\n * Computes `ln(x + 1)`.\n *\n * This function can be implemented to produce more precise result for [x] near zero.\n *\n * Special cases:\n * - `ln1p(NaN)` is `NaN`\n * - `ln1p(x)` is `NaN` where `x < -1.0`\n * - `ln1p(-1.0)` is `-Inf`\n * - `ln1p(+Inf)` is `+Inf`\n *\n * @see [ln] function\n * @see [expm1] function\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ceil ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun ceil ( x : Double ) : Double","docstring":"/**\n * Rounds the given value [x] to an integer towards positive infinity.\n\n * @return the smallest double value that is greater than or equal to the given value [x] and is a mathematical integer.\n *\n * Special cases:\n * - `ceil(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun floor ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun floor ( x : Double ) : Double","docstring":"/**\n * Rounds the given value [x] to an integer towards negative infinity.\n\n * @return the largest double value that is smaller than or equal to the given value [x] and is a mathematical integer.\n *\n * Special cases:\n * - `floor(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun truncate ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun truncate ( x : Double ) : Double","docstring":"/**\n * Rounds the given value [x] to an integer towards zero.\n *\n * @return the value [x] having its fractional part truncated.\n *\n * Special cases:\n * - `truncate(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun round ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun round ( x : Double ) : Double","docstring":"/**\n * Rounds the given value [x] towards the closest integer with ties rounded towards even integer.\n *\n * Special cases:\n * - `round(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun abs ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun abs ( x : Double ) : Double","docstring":"/**\n * Returns the absolute value of the given value [x].\n *\n * Special cases:\n * - `abs(NaN)` is `NaN`\n *\n * @see absoluteValue extension property for [Double]\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sign ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun sign ( x : Double ) : Double","docstring":"/**\n * Returns the sign of the given value [x]:\n * - `-1.0` if the value is negative,\n * - zero if the value is zero,\n * - `1.0` if the value is positive\n *\n * Special case:\n * - `sign(NaN)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Double , b : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Double , b : Double ) : Double","docstring":"/**\n * Returns the smaller of two values.\n *\n * If either value is `NaN`, then the result is `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Double , b : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Double , b : Double ) : Double","docstring":"/**\n * Returns the greater of two values.\n *\n * If either value is `NaN`, then the result is `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public expect fun cbrt ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public expect fun cbrt ( x : Double ) : Double","docstring":"/**\n * Returns the cube root of [x]. For any `x`, `cbrt(-x) == -cbrt(x)`;\n * that is, the cube root of a negative value is the negative of the cube root\n * of that value's magnitude. Special cases:\n *\n * Special cases:\n * - If the argument is `NaN`, then the result is `NaN`.\n * - If the argument is infinite, then the result is an infinity with the same sign as the argument.\n * - If the argument is zero, then the result is a zero with the same sign as the argument.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . pow ( x : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun Double . pow ( x : Double ) : Double","docstring":"/**\n * Raises this value to the power [x].\n *\n * Special cases:\n * - `b.pow(0.0)` is `1.0`\n * - `b.pow(1.0) == b`\n * - `b.pow(NaN)` is `NaN`\n * - `NaN.pow(x)` is `NaN` for `x != 0.0`\n * - `b.pow(Inf)` is `NaN` for `abs(b) == 1.0`\n * - `b.pow(x)` is `NaN` for `b < 0` and `x` is finite and not an integer\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . pow ( n : Int ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun Double . pow ( n : Int ) : Double","docstring":"/**\n * Raises this value to the integer power [n].\n *\n * See the other overload of [pow] for details.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . withSign ( sign : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun Double . withSign ( sign : Double ) : Double","docstring":"/**\n * Returns this value with the sign bit same as of the [sign] value.\n *\n * If [sign] is `NaN` the sign of the result is undefined.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . withSign ( sign : Int ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun Double . withSign ( sign : Int ) : Double","docstring":"/**\n * Returns this value with the sign bit same as of the [sign] value.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . nextUp ( ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun Double . nextUp ( ) : Double","docstring":"/**\n * Returns the [Double] value nearest to this value in direction of positive infinity.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . nextDown ( ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun Double . nextDown ( ) : Double","docstring":"/**\n * Returns the [Double] value nearest to this value in direction of negative infinity.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . nextTowards ( to : Double ) : Double","body":"@ SinceKotlin ( \"\" )  public expect fun Double . nextTowards ( to : Double ) : Double","docstring":"/**\n * Returns the [Double] value nearest to this value in direction from this value towards the value [to].\n *\n * Special cases:\n * - `x.nextTowards(y)` is `NaN` if either `x` or `y` are `NaN`\n * - `x.nextTowards(x) == x`\n *\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . roundToInt ( ) : Int","body":"@ SinceKotlin ( \"\" )  public expect fun Double . roundToInt ( ) : Int","docstring":"/**\n * Rounds this [Double] value to the nearest integer and converts the result to [Int].\n * Ties are rounded towards positive infinity.\n *\n * Special cases:\n * - `x.roundToInt() == Int.MAX_VALUE` when `x > Int.MAX_VALUE`\n * - `x.roundToInt() == Int.MIN_VALUE` when `x < Int.MIN_VALUE`\n *\n * @throws IllegalArgumentException when this value is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Double . roundToLong ( ) : Long","body":"@ SinceKotlin ( \"\" )  public expect fun Double . roundToLong ( ) : Long","docstring":"/**\n * Rounds this [Double] value to the nearest integer and converts the result to [Long].\n * Ties are rounded towards positive infinity.\n *\n * Special cases:\n * - `x.roundToLong() == Long.MAX_VALUE` when `x > Long.MAX_VALUE`\n * - `x.roundToLong() == Long.MIN_VALUE` when `x < Long.MIN_VALUE`\n *\n * @throws IllegalArgumentException when this value is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sin ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun sin ( x : Float ) : Float","docstring":"/** Computes the sine of the angle [x] given in radians.\n *\n * Special cases:\n * - `sin(NaN|+Inf|-Inf)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun cos ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun cos ( x : Float ) : Float","docstring":"/** Computes the cosine of the angle [x] given in radians.\n *\n * Special cases:\n * - `cos(NaN|+Inf|-Inf)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun tan ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun tan ( x : Float ) : Float","docstring":"/** Computes the tangent of the angle [x] given in radians.\n *\n * Special cases:\n * - `tan(NaN|+Inf|-Inf)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun asin ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun asin ( x : Float ) : Float","docstring":"/**\n * Computes the arc sine of the value [x];\n * the returned value is an angle in the range from `-PI/2` to `PI/2` radians.\n *\n * Special cases:\n * - `asin(x)` is `NaN`, when `abs(x) > 1` or x is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun acos ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun acos ( x : Float ) : Float","docstring":"/**\n * Computes the arc cosine of the value [x];\n * the returned value is an angle in the range from `0.0` to `PI` radians.\n *\n * Special cases:\n * - `acos(x)` is `NaN`, when `abs(x) > 1` or x is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun atan ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun atan ( x : Float ) : Float","docstring":"/**\n * Computes the arc tangent of the value [x];\n * the returned value is an angle in the range from `-PI/2` to `PI/2` radians.\n *\n * Special cases:\n * - `atan(NaN)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun atan2 ( y : Float , x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun atan2 ( y : Float , x : Float ) : Float","docstring":"/**\n * Returns the angle `theta` of the polar coordinates `(r, theta)` that correspond\n * to the rectangular coordinates `(x, y)` by computing the arc tangent of the value [y] / [x];\n * the returned value is an angle in the range from `-PI` to `PI` radians.\n *\n * Special cases:\n * - `atan2(0.0, 0.0)` is `0.0`\n * - `atan2(0.0, x)` is `0.0` for `x > 0` and `PI` for `x < 0`\n * - `atan2(-0.0, x)` is `-0.0` for 'x > 0` and `-PI` for `x < 0`\n * - `atan2(y, +Inf)` is `0.0` for `0 < y < +Inf` and `-0.0` for '-Inf < y < 0`\n * - `atan2(y, -Inf)` is `PI` for `0 < y < +Inf` and `-PI` for `-Inf < y < 0`\n * - `atan2(y, 0.0)` is `PI/2` for `y > 0` and `-PI/2` for `y < 0`\n * - `atan2(+Inf, x)` is `PI/2` for finite `x`y\n * - `atan2(-Inf, x)` is `-PI/2` for finite `x`\n * - `atan2(NaN, x)` and `atan2(y, NaN)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sinh ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun sinh ( x : Float ) : Float","docstring":"/**\n * Computes the hyperbolic sine of the value [x].\n *\n * Special cases:\n * - `sinh(NaN)` is `NaN`\n * - `sinh(+Inf)` is `+Inf`\n * - `sinh(-Inf)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun cosh ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun cosh ( x : Float ) : Float","docstring":"/**\n * Computes the hyperbolic cosine of the value [x].\n *\n * Special cases:\n * - `cosh(NaN)` is `NaN`\n * - `cosh(+Inf|-Inf)` is `+Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun tanh ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun tanh ( x : Float ) : Float","docstring":"/**\n * Computes the hyperbolic tangent of the value [x].\n *\n * Special cases:\n * - `tanh(NaN)` is `NaN`\n * - `tanh(+Inf)` is `1.0`\n * - `tanh(-Inf)` is `-1.0`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun asinh ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun asinh ( x : Float ) : Float","docstring":"/**\n * Computes the inverse hyperbolic sine of the value [x].\n *\n * The returned value is `y` such that `sinh(y) == x`.\n *\n * Special cases:\n * - `asinh(NaN)` is `NaN`\n * - `asinh(+Inf)` is `+Inf`\n * - `asinh(-Inf)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun acosh ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun acosh ( x : Float ) : Float","docstring":"/**\n * Computes the inverse hyperbolic cosine of the value [x].\n *\n * The returned value is positive `y` such that `cosh(y) == x`.\n *\n * Special cases:\n * - `acosh(NaN)` is `NaN`\n * - `acosh(x)` is `NaN` when `x < 1`\n * - `acosh(+Inf)` is `+Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun atanh ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun atanh ( x : Float ) : Float","docstring":"/**\n * Computes the inverse hyperbolic tangent of the value [x].\n *\n * The returned value is `y` such that `tanh(y) == x`.\n *\n * Special cases:\n * - `tanh(NaN)` is `NaN`\n * - `tanh(x)` is `NaN` when `x > 1` or `x < -1`\n * - `tanh(1.0)` is `+Inf`\n * - `tanh(-1.0)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun hypot ( x : Float , y : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun hypot ( x : Float , y : Float ) : Float","docstring":"/**\n * Computes `sqrt(x^2 + y^2)` without intermediate overflow or underflow.\n *\n * Special cases:\n * - returns `+Inf` if any of arguments is infinite\n * - returns `NaN` if any of arguments is `NaN` and the other is not infinite\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sqrt ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun sqrt ( x : Float ) : Float","docstring":"/**\n * Computes the positive square root of the value [x].\n *\n * Special cases:\n * - `sqrt(x)` is `NaN` when `x < 0` or `x` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun exp ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun exp ( x : Float ) : Float","docstring":"/**\n * Computes Euler's number `e` raised to the power of the value [x].\n *\n * Special cases:\n * - `exp(NaN)` is `NaN`\n * - `exp(+Inf)` is `+Inf`\n * - `exp(-Inf)` is `0.0`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun expm1 ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun expm1 ( x : Float ) : Float","docstring":"/**\n * Computes `exp(x) - 1`.\n *\n * This function can be implemented to produce more precise result for [x] near zero.\n *\n * Special cases:\n * - `expm1(NaN)` is `NaN`\n * - `expm1(+Inf)` is `+Inf`\n * - `expm1(-Inf)` is `-1.0`\n *\n * @see [exp] function.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun log ( x : Float , base : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun log ( x : Float , base : Float ) : Float","docstring":"/**\n * Computes the logarithm of the value [x] to the given [base].\n *\n * Special cases:\n * - `log(x, b)` is `NaN` if either `x` or `b` are `NaN`\n * - `log(x, b)` is `NaN` when `x < 0` or `b <= 0` or `b == 1.0`\n * - `log(+Inf, +Inf)` is `NaN`\n * - `log(+Inf, b)` is `+Inf` for `b > 1` and `-Inf` for `b < 1`\n * - `log(0.0, b)` is `-Inf` for `b > 1` and `+Inf` for `b > 1`\n *\n * See also logarithm functions for common fixed bases: [ln], [log10] and [log2].\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ln ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun ln ( x : Float ) : Float","docstring":"/**\n * Computes the natural logarithm (base `E`) of the value [x].\n *\n * Special cases:\n * - `ln(NaN)` is `NaN`\n * - `ln(x)` is `NaN` when `x < 0.0`\n * - `ln(+Inf)` is `+Inf`\n * - `ln(0.0)` is `-Inf`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun log10 ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun log10 ( x : Float ) : Float","docstring":"/**\n * Computes the common logarithm (base 10) of the value [x].\n *\n * @see [ln] function for special cases.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun log2 ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun log2 ( x : Float ) : Float","docstring":"/**\n * Computes the binary logarithm (base 2) of the value [x].\n *\n * @see [ln] function for special cases.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ln1p ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun ln1p ( x : Float ) : Float","docstring":"/**\n * Computes `ln(x + 1)`.\n *\n * This function can be implemented to produce more precise result for [x] near zero.\n *\n * Special cases:\n * - `ln1p(NaN)` is `NaN`\n * - `ln1p(x)` is `NaN` where `x < -1.0`\n * - `ln1p(-1.0)` is `-Inf`\n * - `ln1p(+Inf)` is `+Inf`\n *\n * @see [ln] function\n * @see [expm1] function\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun ceil ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun ceil ( x : Float ) : Float","docstring":"/**\n * Rounds the given value [x] to an integer towards positive infinity.\n\n * @return the smallest Float value that is greater than or equal to the given value [x] and is a mathematical integer.\n *\n * Special cases:\n * - `ceil(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun floor ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun floor ( x : Float ) : Float","docstring":"/**\n * Rounds the given value [x] to an integer towards negative infinity.\n\n * @return the largest Float value that is smaller than or equal to the given value [x] and is a mathematical integer.\n *\n * Special cases:\n * - `floor(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun truncate ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun truncate ( x : Float ) : Float","docstring":"/**\n * Rounds the given value [x] to an integer towards zero.\n *\n * @return the value [x] having its fractional part truncated.\n *\n * Special cases:\n * - `truncate(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun round ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun round ( x : Float ) : Float","docstring":"/**\n * Rounds the given value [x] towards the closest integer with ties rounded towards even integer.\n *\n * Special cases:\n * - `round(x)` is `x` where `x` is `NaN` or `+Inf` or `-Inf` or already a mathematical integer.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun abs ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun abs ( x : Float ) : Float","docstring":"/**\n * Returns the absolute value of the given value [x].\n *\n * Special cases:\n * - `abs(NaN)` is `NaN`\n *\n * @see absoluteValue extension property for [Float]\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun sign ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun sign ( x : Float ) : Float","docstring":"/**\n * Returns the sign of the given value [x]:\n * - `-1.0` if the value is negative,\n * - zero if the value is zero,\n * - `1.0` if the value is positive\n *\n * Special case:\n * - `sign(NaN)` is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Float , b : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Float , b : Float ) : Float","docstring":"/**\n * Returns the smaller of two values.\n *\n * If either value is `NaN`, then the result is `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Float , b : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Float , b : Float ) : Float","docstring":"/**\n * Returns the greater of two values.\n *\n * If either value is `NaN`, then the result is `NaN`.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public expect fun cbrt ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  public expect fun cbrt ( x : Float ) : Float","docstring":"/**\n * Returns the cube root of [x]. For any `x`, `cbrt(-x) == -cbrt(x)`;\n * that is, the cube root of a negative value is the negative of the cube root\n * of that value's magnitude. Special cases:\n *\n * Special cases:\n * - If the argument is `NaN`, then the result is `NaN`.\n * - If the argument is infinite, then the result is an infinity with the same sign as the argument.\n * - If the argument is zero, then the result is a zero with the same sign as the argument.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Float . pow ( x : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun Float . pow ( x : Float ) : Float","docstring":"/**\n * Raises this value to the power [x].\n *\n * Special cases:\n * - `b.pow(0.0)` is `1.0`\n * - `b.pow(1.0) == b`\n * - `b.pow(NaN)` is `NaN`\n * - `NaN.pow(x)` is `NaN` for `x != 0.0`\n * - `b.pow(Inf)` is `NaN` for `abs(b) == 1.0`\n * - `b.pow(x)` is `NaN` for `b < 0` and `x` is finite and not an integer\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Float . pow ( n : Int ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun Float . pow ( n : Int ) : Float","docstring":"/**\n * Raises this value to the integer power [n].\n *\n * See the other overload of [pow] for details.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Float . withSign ( sign : Float ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun Float . withSign ( sign : Float ) : Float","docstring":"/**\n * Returns this value with the sign bit same as of the [sign] value.\n *\n * If [sign] is `NaN` the sign of the result is undefined.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Float . withSign ( sign : Int ) : Float","body":"@ SinceKotlin ( \"\" )  public expect fun Float . withSign ( sign : Int ) : Float","docstring":"/**\n * Returns this value with the sign bit same as of the [sign] value.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Float . roundToInt ( ) : Int","body":"@ SinceKotlin ( \"\" )  public expect fun Float . roundToInt ( ) : Int","docstring":"/**\n * Rounds this [Float] value to the nearest integer and converts the result to [Int].\n * Ties are rounded towards positive infinity.\n *\n * Special cases:\n * - `x.roundToInt() == Int.MAX_VALUE` when `x > Int.MAX_VALUE`\n * - `x.roundToInt() == Int.MIN_VALUE` when `x < Int.MIN_VALUE`\n *\n * @throws IllegalArgumentException when this value is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun Float . roundToLong ( ) : Long","body":"@ SinceKotlin ( \"\" )  public expect fun Float . roundToLong ( ) : Long","docstring":"/**\n * Rounds this [Float] value to the nearest integer and converts the result to [Long].\n * Ties are rounded towards positive infinity.\n *\n * Special cases:\n * - `x.roundToLong() == Long.MAX_VALUE` when `x > Long.MAX_VALUE`\n * - `x.roundToLong() == Long.MIN_VALUE` when `x < Long.MIN_VALUE`\n *\n * @throws IllegalArgumentException when this value is `NaN`\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun abs ( n : Int ) : Int","body":"@ SinceKotlin ( \"\" )  public expect fun abs ( n : Int ) : Int","docstring":"/**\n * Returns the absolute value of the given value [n].\n *\n * Special cases:\n * - `abs(Int.MIN_VALUE)` is `Int.MIN_VALUE` due to an overflow\n *\n * @see absoluteValue extension property for [Int]\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Int , b : Int ) : Int","body":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Int , b : Int ) : Int","docstring":"/**\n * Returns the smaller of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Int , b : Int ) : Int","body":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Int , b : Int ) : Int","docstring":"/**\n * Returns the greater of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun abs ( n : Long ) : Long","body":"@ SinceKotlin ( \"\" )  public expect fun abs ( n : Long ) : Long","docstring":"/**\n * Returns the absolute value of the given value [n].\n *\n * Special cases:\n * - `abs(Long.MIN_VALUE)` is `Long.MIN_VALUE` due to an overflow\n *\n * @see absoluteValue extension property for [Long]\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Long , b : Long ) : Long","body":"@ SinceKotlin ( \"\" )  public expect fun min ( a : Long , b : Long ) : Long","docstring":"/**\n * Returns the smaller of two values.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Long , b : Long ) : Long","body":"@ SinceKotlin ( \"\" )  public expect fun max ( a : Long , b : Long ) : Long","docstring":"/**\n * Returns the greater of two values.\n */"}
{"signature":"override fun processSecondPass ( ) : AbstractSet","body":"{  if ( secondPassVisited ) {  if ( fSet . isBackReferenced ) {  @ OptIn ( ExperimentalNativeApi :: class )  assert ( backReferencedSet != null )  return backReferencedSet ! !  }  }  secondPassVisited = true  return processSecondPassInternal ( )  }","docstring":"/**\n * This method is used for traversing nodes after the first stage of compilation.\n */"}
{"signature":"internal fun awaitReusability ( )","body":"{  _reusableCancellableContinuation . loop {  if ( it !== REUSABLE_CLAIMED ) return  }  }","docstring":"/**\n * Awaits until previous call to `suspendCancellableCoroutineReusable` will\n * stop mutating cached instance\n */"}
{"signature":"internal fun tryReleaseClaimedContinuation ( continuation : CancellableContinuation < * > ) : Throwable ?","body":"{  _reusableCancellableContinuation . loop { state ->  when {  state === REUSABLE_CLAIMED -> {  if ( _reusableCancellableContinuation . compareAndSet ( REUSABLE_CLAIMED , continuation ) ) return null  }  state is Throwable -> {  require ( _reusableCancellableContinuation . compareAndSet ( state , null ) )  return state  }  else -> error ( \"\" )  }  }  }","docstring":"/**\n * Checks whether there were any attempts to cancel reusable CC while it was in [REUSABLE_CLAIMED] state\n * and returns cancellation cause if so, `null` otherwise.\n * If continuation was cancelled, it becomes non-reusable.\n *\n * ```\n * suspendCancellableCoroutineReusable { // <- claimed\n * // Any asynchronous cancellation is \"postponed\" while this block\n * // is being executed\n * } // postponed cancellation is checked here in `getResult`\n * ```\n *\n * See [CancellableContinuationImpl.getResult].\n */"}
{"signature":"internal fun postponeCancellation ( cause : Throwable ) : Boolean","body":"{  _reusableCancellableContinuation . loop { state ->  when ( state ) {  REUSABLE_CLAIMED -> {  if ( _reusableCancellableContinuation . compareAndSet ( REUSABLE_CLAIMED , cause ) )  return true  }  is Throwable -> return true  else -> {  if ( _reusableCancellableContinuation . compareAndSet ( state , null ) )  return false  }  }  }  }","docstring":"/**\n * Tries to postpone cancellation if reusable CC is currently in [REUSABLE_CLAIMED] state.\n * Returns `true` if cancellation is (or previously was) postponed, `false` otherwise.\n */"}
{"signature":"@ InternalCoroutinesApi  public fun < T > Continuation < T > . resumeCancellableWith ( result : Result < T > , onCancellation : ( ( cause : Throwable ) -> Unit ) ? = null ) : Unit","body":"= when ( this ) {  is DispatchedContinuation -> resumeCancellableWith ( result , onCancellation )  else -> resumeWith ( result )  }","docstring":"/**\n * It is not inline to save bytecode (it is pretty big and used in many places)\n * and we leave it public so that its name is not mangled in use stack traces if it shows there.\n * It may appear in stack traces when coroutines are started/resumed with unconfined dispatcher.\n * @suppress **This an internal API and should not be used from general code.**\n */"}
{"signature":"private inline fun DispatchedContinuation < * > . executeUnconfined ( contState : Any ? , mode : Int , doYield : Boolean = false , block : ( ) -> Unit ) : Boolean","body":"{  assert { mode != MODE_UNINITIALIZED }  val eventLoop = ThreadLocalEventLoop . eventLoop  if ( doYield && eventLoop . isUnconfinedQueueEmpty ) return false  return if ( eventLoop . isUnconfinedLoopActive ) {  _state = contState  resumeMode = mode  eventLoop . dispatchUnconfined ( this )  true  } else {  runUnconfinedEventLoop ( eventLoop , block = block )  false  }  }","docstring":"/**\n * Executes given [block] as part of current event loop, updating current continuation\n * mode and state if continuation is not resumed immediately.\n * [doYield] indicates whether current continuation is yielding (to provide fast-path if event-loop is empty).\n * Returns `true` if execution of continuation was queued (trampolined) or `false` otherwise.\n */"}
{"signature":"private fun FirSimpleFunction . substituteOrNull ( substitutor : EnhancedForWarningConeSubstitutor , context : CheckerContext , ) : FirSimpleFunction ?","body":"{  symbol . lazyResolveToPhase ( FirResolvePhase . TYPES )  var isEnhanced = false  val newParameterTypes = valueParameters . map { substitutor . substituteOrNull ( it . returnTypeRef . coneType ) ? . also { isEnhanced = true } }  val newContextReceiverTypes = contextReceivers . map { substitutor . substituteOrNull ( it . typeRef . coneType ) ? . also { isEnhanced = true } }  val newReturnType = substitutor . substituteOrNull ( context . returnTypeCalculator . tryCalculateReturnType ( this ) . coneType ) ? . also { isEnhanced = true }  val newExtensionReceiverType =  receiverParameter ? . typeRef ? . coneType ? . let { substitutor . substituteOrNull ( it ) } ? . also { isEnhanced = true }  return runIf ( isEnhanced ) {  FirFakeOverrideGenerator . createCopyForFirFunction ( FirFakeOverrideGenerator . createSymbolForSubstitutionOverride ( symbol ) , this , null , context . session , FirDeclarationOrigin . Enhancement , newDispatchReceiverType = null , newParameterTypes = newParameterTypes , newReturnType = newReturnType , newContextReceiverTypes = newContextReceiverTypes , newReceiverType = newExtensionReceiverType , )  }  }","docstring":"/**\n * @see org.jetbrains.kotlin.fir.scopes.impl.FirClassSubstitutionScope.createSubstitutionOverrideFunction\n * @see org.jetbrains.kotlin.fir.scopes.impl.FirClassSubstitutionScope.createSubstitutedData\n */"}
{"signature":"private fun FirProperty . substituteOrNull ( substitutor : EnhancedForWarningConeSubstitutor , context : CheckerContext , ) : FirProperty ?","body":"{  if ( ! isJavaOrEnhancement ) return null  symbol . lazyResolveToPhase ( FirResolvePhase . TYPES )  var isEnhanced = false  val newContextReceiverTypes = contextReceivers . map { substitutor . substituteOrNull ( it . typeRef . coneType ) ? . also { isEnhanced = true } }  val newReturnType = substitutor . substituteOrNull ( context . returnTypeCalculator . tryCalculateReturnType ( this ) . coneType ) ? . also { isEnhanced = true }  val newExtensionReceiverType =  receiverParameter ? . typeRef ? . coneType ? . let { substitutor . substituteOrNull ( it ) } ? . also { isEnhanced = true }  return runIf ( isEnhanced ) {  FirFakeOverrideGenerator . createCopyForFirProperty ( FirFakeOverrideGenerator . createSymbolForSubstitutionOverride ( symbol ) , this , null , context . session , FirDeclarationOrigin . Enhancement , newDispatchReceiverType = null , newReturnType = newReturnType , newContextReceiverTypes = newContextReceiverTypes , newReceiverType = newExtensionReceiverType , )  }  }","docstring":"/**\n * @see org.jetbrains.kotlin.fir.scopes.impl.FirClassSubstitutionScope.createSubstitutionOverrideProperty\n * @see org.jetbrains.kotlin.fir.scopes.impl.FirClassSubstitutionScope.createSubstitutedData\n */"}
{"signature":"public abstract fun getFileName ( ) : String","body":"public abstract fun getFileName ( ) : String","docstring":"/**\n * The name a Kotlin file which will be generated.\n *\n * Should have the `.kt` extension.\n *\n * It will be used as a Java facade name, e.g., for the file name `myFile.kt`, the `MyFileKt` facade is generated if the file contains some properties or functions.\n *\n * @see KtResolveExtensionFile\n */"}
{"signature":"public abstract fun getFilePackageName ( ) : FqName","body":"public abstract fun getFilePackageName ( ) : FqName","docstring":"/**\n * [FqName] of the package specified in the file\n *\n * The operation might be called regularly, so the [getFilePackageName] should work fast and avoid building the whole file text.\n *\n * It should be equal to the package name specified in the [buildFileText].\n *\n * @see KtResolveExtensionFile\n */"}
{"signature":"public abstract fun getTopLevelClassifierNames ( ) : Set < Name >","body":"public abstract fun getTopLevelClassifierNames ( ) : Set < Name >","docstring":"/**\n * Returns the set of top-level classifier (classes, interfaces, objects, and type-aliases) names in the file.\n *\n * The result may have false-positive entries but cannot have false-negative entries. It should contain all the names in the package but may have some additional names that are not there.\n *\n * @see KtResolveExtensionFile\n */"}
{"signature":"public abstract fun getTopLevelCallableNames ( ) : Set < Name >","body":"public abstract fun getTopLevelCallableNames ( ) : Set < Name >","docstring":"/**\n * Returns the set of top-level callable (functions and properties) names in the file.\n *\n * The result may have false-positive entries but cannot have false-negative entries. It should contain all the names in the package but may have some additional names that are not there.\n *\n * @see KtResolveExtensionFile\n */"}
{"signature":"public abstract fun buildFileText ( ) : String","body":"public abstract fun buildFileText ( ) : String","docstring":"/**\n * Creates the generated Kotlin source file text.\n *\n * The resulted String should be a valid Kotlin code.\n * It should be consistent with other declarations which are present in the [KtResolveExtensionFile], more specifically:\n * 1. [getFilePackageName] should be equal to the file's package name.\n * 2. All classifier names should be contained in the [getTopLevelClassifierNames].\n * 3. All callable names should be contained in the [getTopLevelCallableNames].\n *\n * Additional restrictions on the file text:\n * 1. The File should not contain the `kotlin.jvm.JvmMultifileClass` and `kotlin.jvm.JvmName` annotations on the file level.\n * 2. All declaration types should be specified explicitly.\n *\n * @see KtResolveExtensionFile\n */"}
{"signature":"public abstract fun createNavigationTargetsProvider ( ) : KtResolveExtensionNavigationTargetsProvider","body":"public abstract fun createNavigationTargetsProvider ( ) : KtResolveExtensionNavigationTargetsProvider","docstring":"/**\n * Creates a [KtResolveExtensionNavigationTargetsProvider] for this [KtResolveExtensionFile].\n *\n * @see KtResolveExtensionNavigationTargetsProvider\n * @see KtResolveExtensionFile\n */"}
{"signature":"@ ExperimentalMultikApi  @ JvmName ( \"\" )  public inline fun < reified T : Number > Multik . createAlignedNDArray ( data : List < List < T > > , filling : Double =  ) : D2Array < T >","body":"{  require ( data . isNotEmpty ( ) )  val maxLength = data . maxOf { it . size }  val paddingIdx : T = filling . toPrimitiveType ( )  return mk . d2array ( data . size , maxLength ) { idx ->  val sequenceIdx = idx / maxLength  val elementIdx = idx % maxLength  if ( elementIdx < data [ sequenceIdx ] . size )  data [ sequenceIdx ] [ elementIdx ]  else  paddingIdx  }  }","docstring":"/**\n * Creates [NDArray] of 2nd dims filled with values from [data].\n * Sequences in the batch can have a different number of elements the maximum length will be chosen for each dimension.\n * Smaller sequences will be filled with [filling] to the maximum length.\n */"}
{"signature":"@ ExperimentalMultikApi  @ JvmName ( \"\" )  public inline fun < reified T : Number > Multik . createAlignedNDArray ( data : Array < Array < T > > , filling : Double =  ) : D2Array < T >","body":"= this . createAlignedNDArray ( data . map { it . asList ( ) } , filling )","docstring":"/**\n * Creates [NDArray] of 2nd dims filled with values from [data].\n * Sequences in the batch can have a different number of elements the maximum length will be chosen for each dimension.\n * Smaller sequences will be filled with [filling] to the maximum length.\n */"}
{"signature":"@ ExperimentalMultikApi  @ JvmName ( \"\" )  public inline fun < reified T : Number > Multik . createAlignedNDArray ( data : List < List < List < T > > > , filling : Double =  ) : D3Array < T >","body":"{  require ( data . isNotEmpty ( ) )  val maxLength2Dim = data . maxOf { it . size }  val maxLength3Dim = data . maxOf { seq -> seq . maxOf { it . size } }  val paddingIdx : T = filling . toPrimitiveType ( )  return mk . d3array ( data . size , maxLength2Dim , maxLength3Dim ) { idx ->  val dim1 = idx / ( maxLength2Dim * maxLength3Dim )  val dim2 = ( idx / maxLength3Dim ) % maxLength2Dim  val dim3 = idx % maxLength3Dim  if ( dim2 < data [ dim1 ] . size && dim3 < data [ dim1 ] [ dim2 ] . size ) {  data [ dim1 ] [ dim2 ] [ dim3 ]  } else {  paddingIdx  }  }  }","docstring":"/**\n * Creates [NDArray] of 3rd dims filled with values from `data`.\n * Sequences in the batch can have a different number of elements the maximum length will be chosen for each dimension.\n * Smaller sequences will be filled with [filling] to the maximum length.\n */"}
{"signature":"@ ExperimentalMultikApi  @ JvmName ( \"\" )  public inline fun < reified T : Number > Multik . createAlignedNDArray ( data : Array < Array < Array < T > > > , filling : Double =  ) : D3Array < T >","body":"= this . createAlignedNDArray ( data . map { it2d -> it2d . map { it3d -> it3d . asList ( ) } } , filling )","docstring":"/**\n * Creates [NDArray] of 3rd dims filled with values from `data`.\n * Sequences in the batch can have a different number of elements the maximum length will be chosen for each dimension.\n * Smaller sequences will be filled with [filling] to the maximum length.\n */"}
{"signature":"@ ExperimentalMultikApi  @ JvmName ( \"\" )  public inline fun < reified T : Number > Multik . createAlignedNDArray ( data : List < List < List < List < T > > > > , filling : Double =  ) : D4Array < T >","body":"{  require ( data . isNotEmpty ( ) )  val maxLength2Dim = data . maxOf { it2d -> it2d . size }  val maxLength3Dim = data . maxOf { it2d -> it2d . maxOf { it3d -> it3d . size } }  val maxLength4Dim = data . maxOf { it2d -> it2d . maxOf { it3d -> it3d . maxOf { it4d -> it4d . size } } }  val paddingIdx : T = filling . toPrimitiveType ( )  return this . d4array ( data . size , maxLength2Dim , maxLength3Dim , maxLength4Dim ) { idx ->  val dim1 = idx / ( maxLength2Dim * maxLength3Dim * maxLength4Dim )  val dim2 = ( idx / ( maxLength3Dim * maxLength4Dim ) ) % maxLength2Dim  val dim3 = ( idx / maxLength4Dim ) % maxLength3Dim  val dim4 = idx % maxLength4Dim  if ( dim2 < data [ dim1 ] . size && dim3 < data [ dim1 ] [ dim2 ] . size && dim4 < data [ dim1 ] [ dim2 ] [ dim3 ] . size ) {  data [ dim1 ] [ dim2 ] [ dim3 ] [ dim4 ]  } else {  paddingIdx  }  }  }","docstring":"/**\n * Creates [NDArray] of 3rd dims filled with values from `data`.\n * Sequences in the batch can have a different number of elements the maximum length will be chosen for each dimension.\n * Smaller sequences will be filled with [filling] to the maximum length.\n */"}
{"signature":"@ ExperimentalMultikApi  @ JvmName ( \"\" )  public inline fun < reified T : Number > Multik . createAlignedNDArray ( data : Array < Array < Array < Array < T > > > > , filling : Double =  ) : D4Array < T >","body":"=  this . createAlignedNDArray ( data . map { it2d -> it2d . map { it3d -> it3d . map { it4d -> it4d . asList ( ) } } } , filling )","docstring":"/**\n * Creates [NDArray] of 3rd dims filled with values from `data`.\n * Sequences in the batch can have a different number of elements the maximum length will be chosen for each dimension.\n * Smaller sequences will be filled with [filling] to the maximum length.\n */"}
{"signature":"public fun convert ( output : OrtSession . Result ) : R","body":"public fun convert ( output : OrtSession . Result ) : R","docstring":"/**\n * Converts raw model output to the result.\n */"}
{"signature":"public fun predict ( input : I ) : R","body":"{  val preprocessedInput = preprocessing . apply ( input )  return internalModel . predict ( preprocessedInput ) { convert ( it ) }  }","docstring":"/**\n * Makes prediction on the given [input].\n */"}
{"signature":"abstract fun isImplies ( other : ESEffect ) : Boolean ?","body":"abstract fun isImplies ( other : ESEffect ) : Boolean ?","docstring":"/**\n * Returns:\n * - true, when presence of `this`-effect necessary implies presence of `other`-effect\n * - false, when presence of `this`-effect necessary implies absence of `other`-effect\n * - null, when presence of `this`-effect doesn't implies neither presence nor absence of `other`-effect\n */"}
{"signature":"public fun KtClassLikeSymbol . getSamConstructor ( ) : KtSamConstructorSymbol ?","body":"=  withValidityAssertion { analysisSession . samResolver . getSamConstructor ( this ) }","docstring":"/**\n * Returns [KtSamConstructorSymbol] if the given [KtClassLikeSymbol] is a functional interface type, a.k.a. SAM.\n */"}
{"signature":"fun supertypes ( type : CirClassType ) : Set < CirClassType >","body":"fun supertypes ( type : CirClassType ) : Set < CirClassType >","docstring":"/**\n * Resolves all *declared* supertypes (not their transitive closure)\n */"}
{"signature":"fun setExecutionSourceFrom ( classpath : FileCollection , testClassesDirs : FileCollection )","body":"fun setExecutionSourceFrom ( classpath : FileCollection , testClassesDirs : FileCollection )","docstring":"/**\n * Select the exact [classpath] to run the tests from.\n *\n * Only the classes from [testClasses] will be treated as tests.\n *\n * This overrides other [KotlinExecution.executionSource] selection options.\n */"}
{"signature":"public fun KtType . translateType ( ) : SirType","body":"public fun KtType . translateType ( ) : SirType","docstring":"/**\n * Translates the given [KtType] to [SirType].\n */"}
{"signature":"public fun KtSymbolWithVisibility . sirVisibility ( ) : SirVisibility ?","body":"public fun KtSymbolWithVisibility . sirVisibility ( ) : SirVisibility ?","docstring":"/**\n * Determines visibility of the given [KtSymbolWithVisibility].\n * @return null if symbol should not be exposed to SIR completely.\n */"}
{"signature":"fun ConeClassLikeType . fullyExpandedType ( useSiteSession : FirSession , expandedConeType : ( FirTypeAlias ) -> ConeClassLikeType ? = { alias ->  alias . lazyResolveToPhase ( FirResolvePhase . SUPER_TYPES )  alias . expandedConeType  } , ) : ConeClassLikeType","body":"{  if ( this is ConeClassLikeTypeImpl ) {  val ( cachedSession , cachedExpandedType ) = cachedExpandedType  if ( cachedSession === useSiteSession && cachedExpandedType != null ) {  return cachedExpandedType  }  val computedExpandedType = fullyExpandedTypeNoCache ( useSiteSession , expandedConeType )  this . cachedExpandedType = WeakPair ( useSiteSession , computedExpandedType )  return computedExpandedType  }  return fullyExpandedTypeNoCache ( useSiteSession , expandedConeType )  }","docstring":"/**\n * Compute the recursive type-alias expansion in the given type.\n *\n * A type of an expect class, that is actualized by a typealias will be expanded to the expansion of the typealias,\n * when supplied with the session of actual.\n *\n * See `/docs/fir/k2_kmp.md`\n *\n * @param useSiteSession Session to be used for classifier lookups, see [toSymbol]\n * @return Type, that is expanded to the concrete class type w.r.t to the [useSiteSession]\n */"}
{"signature":"fun ConeKotlinType . fullyExpandedType ( useSiteSession : FirSession ) : ConeKotlinType","body":"= when ( this ) {  is ConeDynamicType -> this  is ConeFlexibleType ->  ConeFlexibleType ( lowerBound . fullyExpandedType ( useSiteSession ) , upperBound . fullyExpandedType ( useSiteSession ) )  is ConeClassLikeType -> fullyExpandedType ( useSiteSession )  else -> this  }","docstring":"/**\n * @see fullyExpandedType\n */"}
{"signature":"fun ConeSimpleKotlinType . fullyExpandedType ( useSiteSession : FirSession ) : ConeSimpleKotlinType","body":"= when ( this ) {  is ConeClassLikeType -> fullyExpandedType ( useSiteSession )  else -> this  }","docstring":"/**\n * @see fullyExpandedType\n */"}
{"signature":"fun FirTypeAlias . fullyExpandedConeType ( useSiteSession : FirSession ) : ConeClassLikeType ?","body":"{  return expandedConeType ? . fullyExpandedType ( useSiteSession )  }","docstring":"/**\n * @see fullyExpandedType\n */"}
{"signature":"fun FirTypeAlias . fullyExpandedClass ( session : FirSession ) : FirClassLikeDeclaration ?","body":"{  return fullyExpandedConeType ( session ) ? . toSymbol ( session ) ? . fir  }","docstring":"/**\n * @see fullyExpandedType\n */"}
{"signature":"@ ExperimentalReflectionOnLambdas  fun < R > Function < R > . reflect ( ) : KFunction < R > ?","body":"{  val annotation = javaClass . getAnnotation ( Metadata :: class . java ) ? : return null  val data = annotation . data1 . takeUnless ( Array < String > :: isEmpty ) ? : return null  val ( nameResolver , proto ) = JvmProtoBufUtil . readFunctionDataFrom ( data , annotation . data2 )  val metadataVersion = JvmMetadataVersion ( annotation . metadataVersion , ( annotation . extraInt and JvmAnnotationNames . METADATA_STRICT_VERSION_SEMANTICS_FLAG ) !=  )  val descriptor = deserializeToDescriptor ( javaClass , proto , nameResolver , TypeTable ( proto . typeTable ) , metadataVersion , MemberDeserializer :: loadFunction )  @ Suppress ( \"\" )  return KFunctionImpl ( EmptyContainerForLocal , descriptor ) as KFunction < R >  }","docstring":"/**\n * This is an experimental API. Given a class for a compiled Kotlin lambda or a function expression,\n * returns a [KFunction] instance providing introspection capabilities for that lambda or function expression and its parameters.\n * Not all features are currently supported, in particular [KCallable.call] and [KCallable.callBy] will fail at the moment.\n */"}
{"signature":"public fun reset ( ) : Unit","body":"= locked ( lock ) {  size_ =   }","docstring":"/**\n * Reset the data buffer, makings its size 0.\n */"}
{"signature":"public fun append ( data : MutableData ) : Unit","body":"= locked ( lock ) {  val toCopy = data . size  val where = resizeDataLocked ( size + toCopy )  data . copyInto ( buffer ,  , toCopy , where )  }","docstring":"/**\n * Appends data to the buffer.\n */"}
{"signature":"public fun append ( data : ByteArray , fromIndex : Int =  , toIndex : Int = data . size ) : Unit","body":"= locked ( lock ) {  if ( fromIndex > toIndex )  throw IndexOutOfBoundsException ( \"\" )  if ( fromIndex == toIndex ) return  val where = resizeDataLocked ( this . size + ( toIndex - fromIndex ) )  data . copyInto ( buffer , where , fromIndex , toIndex )  }","docstring":"/**\n * Appends byte array to the buffer.\n */"}
{"signature":"public fun append ( data : COpaquePointer ? , count : Int ) : Unit","body":"= locked ( lock ) {  if ( data == null || count <=  ) return  val where = resizeDataLocked ( this . size + count )  buffer . usePinned {  it -> CopyMemory ( it . addressOf ( where ) , data , count )  }  }","docstring":"/**\n * Appends C data to the buffer, if `data` is null or `count` is non-positive - return.\n */"}
{"signature":"public fun copyInto ( output : ByteArray , destinationIndex : Int , startIndex : Int , endIndex : Int ) : Unit","body":"= locked ( lock ) {  buffer . copyInto ( output , destinationIndex , startIndex , endIndex )  }","docstring":"/**\n * Copies range of mutable data to the byte array.\n */"}
{"signature":"public operator fun get ( index : Int ) : Byte","body":"= locked ( lock ) {  if ( index >= size )  throw IndexOutOfBoundsException ( \"\" )  buffer [ index ]  }","docstring":"/**\n * Get a byte from the mutable data.\n *\n * @Throws IndexOutOfBoundsException if index is beyond range.\n */"}
{"signature":"public fun < R > withPointerLocked ( block : ( COpaquePointer , dataSize : Int ) -> R ) : R","body":"= locked ( lock ) {  buffer . usePinned {  it -> block ( it . addressOf (  ) , size )  }  }","docstring":"/**\n * Executes provided block under lock with raw pointer to the data stored in the buffer.\n * Block is executed under the spinlock, and must be short.\n */"}
{"signature":"public fun < R > withBufferLocked ( block : ( array : ByteArray , dataSize : Int ) -> R ) : R","body":"= locked ( lock ) {  block ( buffer , size )  }","docstring":"/**\n * Executes provided block under lock with the raw data buffer.\n * Block is executed under the spinlock, and must be short.\n */"}
{"signature":"@ Suppress ( \"\" )  internal fun upperHessenbergFloat ( a : MultiArray < ComplexFloat , D2 > ) : Pair < D2Array < ComplexFloat > , D2Array < ComplexFloat > >","body":"{  val ( n , m ) = a . shape  var id = mk . identity < ComplexFloat > ( n )  var ans = a as D2Array < ComplexFloat >  for ( i in  until n -  ) {  val ( tau , v ) = householderTransformComplexFloat ( ans [ i until n , ( i -  ) until m ] )  var submatrix = ans [ i until n , ( i -  ) until m ]  submatrix = applyHouseholderComplexFloat ( submatrix , tau , v )  for ( i1 in i until n ) {  for ( j1 in i -  until m ) {  ans [ i1 , j1 ] = submatrix [ i1 - i , j1 - ( i -  ) ]  }  }  ans = ans . conjTranspose ( )  submatrix = ans [ i until n ,  until m ]  submatrix = applyHouseholderComplexFloat ( submatrix , tau , v )  for ( i1 in i until n ) {  for ( j1 in  until m ) {  ans [ i1 , j1 ] = submatrix [ i1 - i , j1 ]  }  }  ans = ans . conjTranspose ( )  submatrix = applyHouseholderComplexFloat ( id [ i until id . shape [  ] ,  until id . shape [  ] ] , tau , v )  for ( i1 in i until id . shape [  ] ) {  for ( j1 in  until id . shape [  ] ) {  id [ i1 , j1 ] = submatrix [ i1 - i , j1 ]  }  }  }  id = id . conjTranspose ( )  for ( i in  until n ) {  for ( j in  until i -  ) {  ans [ i , j ] = ComplexFloat . zero  }  }  return Pair ( id , ans )  }","docstring":"/**\n * computes Q, H matrices that\n *\n * a = Q * H * Q.H\n *\n * Q is unitary: Q * Q.H = Id\n *\n * H has all zeros below main subdiagonal:\n *\n * [#, #, #, #]\n *\n * [#, #, #, #]\n *\n * [0, #, #, #]\n *\n * [0, 0, #, #]\n *\n * NOTE: inplace function, change matrix [a]\n */"}
{"signature":"private fun jumpDataFlowFromPostponedLambdas ( symbol : FirFunctionSymbol < * > )","body":"{  val currentLevelExits = postponedLambdaExits . pop ( ) . exits  if ( currentLevelExits . isEmpty ( ) ) return  for ( ( lambdas , exits ) in postponedLambdaExits . all ( ) ) {  if ( symbol in lambdas ) {  exits . addAll ( currentLevelExits )  break  }  }  }","docstring":"/**\n * Pop and add the current level exits (if any) to the exit corresponding with the specified\n * lambda function symbol. This is used when a postponed lambda is present within a return\n * statement for an outer lambda and data-flow information needs to be preserved.\n */"}
{"signature":"private fun FirClass . firstInPlaceInitializer ( ) : FirDeclaration ?","body":"{  return declarations . find {  it is FirControlFlowGraphOwner &&  ( it !is FirConstructor || it . isPrimary ) &&  it . isUsedInControlFlowGraphBuilderForClass  }  }","docstring":"/**\n * The first in-place initializer is either:\n * 1. The primary constructor.\n * 2. The first property or anonymous initializer.\n */"}
{"signature":"fun exitEqualityOperatorCall ( equalityOperatorCall : FirEqualityOperatorCall ) : Pair < CFGNode < * > , EqualityOperatorCallNode >","body":"{  val lhsExitNode = equalityOperatorCallLhsExitNodes . pop ( )  val node = createEqualityOperatorCallNode ( equalityOperatorCall ) . also { addNewSimpleNode ( it ) }  return lhsExitNode to node  }","docstring":"/**\n * Returns a pair of nodes, where the first is the last node of the LHS of the equality operator\n * call, and the second is the exit node of the equality operator call. This allows DFA to\n * determine if an assignment took place within the RHS of the equality operator call.\n */"}
{"signature":"private fun completeFunctionCall ( node : FunctionCallNode ) : Boolean","body":"{  if ( ! node . fir . hasNothingType ) return false  val stub = StubNode ( node . owner , node . level )  val edges = node . followingNodes . map { it to node . edgeTo ( it ) }  CFGNode . removeAllOutgoingEdges ( node )  CFGNode . addEdge ( node , stub , EdgeKind . DeadForward , propagateDeadness = false )  for ( ( to , edge ) in edges ) {  val kind = if ( edge . kind . isBack ) EdgeKind . DeadBackward else EdgeKind . DeadForward  CFGNode . addEdge ( stub , to , kind , propagateDeadness = false , label = edge . label )  to . updateDeadStatus ( )  propagateDeadnessForward ( to )  }  return true  }","docstring":"/**\n * this is a workaround to make function call dead when call is completed _after_ building its node in the graph\n * this happens when completing the last call in try/catch blocks\n * @returns `true` if node actually returned Nothing\n */"}
{"signature":"fun exitCallExplicitReceiver ( )","body":"{  val exitNode = exitFunctionCallArgumentsNodes . topOrNull ( )  exitNode ? . explicitReceiverExitNode = lastNode  }","docstring":"/**\n * Saves the last node as the currents exit function arguments call\n * explicit receiver.\n *\n * If the exit node is null this function does nothing.\n * There is no corresponding enterCall for this function.\n *\n * This is later used to rewind the implicit receiver stack to the point\n * before function arguments have been resolved so that casts within the\n * call arguments do not affect the method resolution.\n */"}
{"signature":"public fun extensionReceiverType ( type : ConeKotlinType )","body":"{  extensionReceiverType { type }  }","docstring":"/**\n * Sets [type] as extension receiver type of the function.\n */"}
{"signature":"public fun extensionReceiverType ( typeProvider : ( List < FirTypeParameter > ) -> ConeKotlinType )","body":"{  require ( extensionReceiverTypeProvider == null ) { \"\" }  extensionReceiverTypeProvider = typeProvider  }","docstring":"/**\n * Sets type, provided by [typeProvider], as extension receiver type of the function.\n *\n * Use this overload when extension receiver type references type parameters of the function.\n */"}
{"signature":"public fun FirExtension . createMemberFunction ( owner : FirClassSymbol < * > , key : GeneratedDeclarationKey , name : Name , returnType : ConeKotlinType , config : SimpleFunctionBuildingContext . ( ) -> Unit = { } ) : FirSimpleFunction","body":"{  return createMemberFunction ( owner , key , name , { returnType } , config )  }","docstring":"/**\n * Creates a member function for [owner] class with specified [returnType].\n *\n * Type and value parameters can be configured with [config] builder.\n */"}
{"signature":"public fun FirExtension . createMemberFunction ( owner : FirClassSymbol < * > , key : GeneratedDeclarationKey , name : Name , returnTypeProvider : ( List < FirTypeParameter > ) -> ConeKotlinType , config : SimpleFunctionBuildingContext . ( ) -> Unit = { } ) : FirSimpleFunction","body":"{  val callableId = CallableId ( owner . classId , name )  return SimpleFunctionBuildingContext ( session , key , owner , callableId , returnTypeProvider ) . apply ( config ) . apply {  status {  isExpect = owner . isExpect  }  } . build ( )  }","docstring":"/**\n * Creates a member function for [owner] class with return type provided by [returnTypeProvider].\n * Use this overload when return type references type parameters of created function.\n *\n * Type and value parameters can be configured with [config] builder.\n */"}
{"signature":"@ ExperimentalTopLevelDeclarationsGenerationApi  public fun FirExtension . createTopLevelFunction ( key : GeneratedDeclarationKey , callableId : CallableId , returnType : ConeKotlinType , config : SimpleFunctionBuildingContext . ( ) -> Unit = { } ) : FirSimpleFunction","body":"{  return createTopLevelFunction ( key , callableId , { returnType } , config )  }","docstring":"/**\n * Creates a top-level function with [callableId] and specified [returnType].\n *\n * Type and value parameters can be configured with [config] builder.\n */"}
{"signature":"@ ExperimentalTopLevelDeclarationsGenerationApi  public fun FirExtension . createTopLevelFunction ( key : GeneratedDeclarationKey , callableId : CallableId , returnTypeProvider : ( List < FirTypeParameter > ) -> ConeKotlinType , config : SimpleFunctionBuildingContext . ( ) -> Unit = { } ) : FirSimpleFunction","body":"{  require ( callableId . classId == null )  return SimpleFunctionBuildingContext ( session , key , owner = null , callableId , returnTypeProvider ) . apply ( config ) . build ( )  }","docstring":"/**\n * Creates a top-level function with [callableId] and return type provided by [returnTypeProvider].\n * Use this overload when return type references type parameters of created function.\n *\n * Type and value parameters can be configured with [config] builder.\n */"}
{"signature":"public fun allocateVectorSchemaRoot ( ) : VectorSchemaRoot","body":"public fun allocateVectorSchemaRoot ( ) : VectorSchemaRoot","docstring":"/**\n * Create Arrow [VectorSchemaRoot] with [dataFrame] content cast to [targetSchema] according to the [mode].\n */"}
{"signature":"public fun writeArrowIPC ( channel : WritableByteChannel )","body":"{  allocateVectorSchemaRoot ( ) . use { vectorSchemaRoot ->  ArrowStreamWriter ( vectorSchemaRoot , null , channel ) . use { writer ->  writer . writeBatch ( )  }  }  }","docstring":"/**\n * Save data to [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format), write to opened [channel].\n */"}
{"signature":"public fun writeArrowIPC ( stream : OutputStream )","body":"{  writeArrowIPC ( Channels . newChannel ( stream ) )  }","docstring":"/**\n * Save data to [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format), write to opened [stream].\n */"}
{"signature":"public fun writeArrowIPC ( file : File , append : Boolean = true )","body":"{  writeArrowIPC ( FileOutputStream ( file , append ) )  }","docstring":"/**\n * Save data to [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format), write to new or existing [file].\n * If file exists, it can be recreated or expanded.\n */"}
{"signature":"public fun saveArrowIPCToByteArray ( ) : ByteArray","body":"{  val stream = ByteArrayOutputStream ( )  writeArrowIPC ( stream )  return stream . toByteArray ( )  }","docstring":"/**\n * Save data to [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format), write to new [ByteArray]\n */"}
{"signature":"public fun writeArrowFeather ( channel : WritableByteChannel )","body":"{  allocateVectorSchemaRoot ( ) . use { vectorSchemaRoot ->  ArrowFileWriter ( vectorSchemaRoot , null , channel ) . use { writer ->  writer . writeBatch ( )  }  }  }","docstring":"/**\n * Save data to [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files), write to opened [channel].\n */"}
{"signature":"public fun writeArrowFeather ( stream : OutputStream )","body":"{  writeArrowFeather ( Channels . newChannel ( stream ) )  }","docstring":"/**\n * Save data to [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files), write to opened [stream].\n */"}
{"signature":"public fun writeArrowFeather ( file : File )","body":"{  writeArrowFeather ( FileOutputStream ( file ) )  }","docstring":"/**\n * Save data to [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files), write to new or existing [file].\n * If file exists, it would be recreated.\n */"}
{"signature":"public fun saveArrowFeatherToByteArray ( ) : ByteArray","body":"{  val stream = ByteArrayOutputStream ( )  writeArrowFeather ( stream )  return stream . toByteArray ( )  }","docstring":"/**\n * Save data to [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files), write to new [ByteArray]\n */"}
{"signature":"@ Test fun testSimpleMatch ( )","body":"{  val regex = Regex ( \"\" )  var testString = \"\"  assertTrue ( regex . matches ( testString ) )  assertTrue ( regex in testString )  assertTrue ( regex . find ( testString ) != null )  testString = \"\"  assertFalse ( regex . matches ( testString ) )  assertFalse ( regex in testString )  assertFalse ( regex . find ( testString ) != null )  assertTrue ( Regex ( \"\" ) . matches ( \"\" ) )  assertFalse ( Regex ( \"\" ) . matches ( \"\" ) )  assertFalse ( Regex ( \"\" ) . matches ( \"\" ) )  assertTrue ( Regex ( \"\" ) . matches ( \"\" ) )  }","docstring":"/**\n * Tests simple pattern compilation and matching methods\n */"}
{"signature":"public fun toHTML ( configuration : DisplayConfiguration = DisplayConfiguration . DEFAULT ) : DataFrameHtmlData","body":"{  return df . toHTML ( getDisplayConfiguration ( configuration ) )  }","docstring":"/**\n * @return DataFrameHtmlData without additional definitions. Can be rendered in Jupyter kernel environments\n */"}
{"signature":"public fun toStandaloneHTML ( configuration : DisplayConfiguration = DisplayConfiguration . DEFAULT ) : DataFrameHtmlData","body":"{  return df . toStandaloneHTML ( getDisplayConfiguration ( configuration ) )  }","docstring":"/**\n * @return DataFrameHtmlData with table script and css definitions. Can be saved as an *.html file and displayed in the browser\n */"}
{"signature":"@ Test  fun testFlowsNotSkippingValues ( )","body":"= scope . launch {  val list = flowOf (  ) . onStart { emit (  ) }  . combine ( flowOf ( \"\" ) ) { int , str -> \"\" }  . toList ( )  assertEquals ( list , listOf ( \"\" , \"\" ) )  } . void ( )","docstring":"/** Tests that the [StandardTestDispatcher] follows an execution order similar to `runBlocking`. */"}
{"signature":"@ Test  fun testLaunchDispatched ( )","body":"= scope . launch {  expect (  )  launch {  expect (  )  }  finish (  )  } . void ( )","docstring":"/** Tests that each [launch] gets dispatched. */"}
{"signature":"@ Test  fun testYield ( )","body":"= scope . launch {  expect (  )  scope . launch {  expect (  )  yield ( )  expect (  )  }  scope . launch {  expect (  )  yield ( )  finish (  )  }  expect (  )  yield ( )  expect (  )  } . void ( )","docstring":"/** Tests that dispatching is done in a predictable order and [yield] puts this task at the end of the queue. */"}
{"signature":"@ Test  fun testSchedulerReuse ( )","body":"{  val dispatcher1 = StandardTestDispatcher ( )  Dispatchers . setMain ( dispatcher1 )  try {  val dispatcher2 = StandardTestDispatcher ( )  assertSame ( dispatcher1 . scheduler , dispatcher2 . scheduler )  } finally {  Dispatchers . resetMain ( )  }  }","docstring":"/** Tests that the [TestCoroutineScheduler] used for [Dispatchers.Main] gets used by default. */"}
{"signature":"@ Test  fun testClassVersionsInJavaLangOfJdk11 ( )","body":"{  val configuration = CompilerConfiguration ( )  val jdkHome = JvmEnvironmentConfigurator . getJdkHome ( TestJdkKind . FULL_JDK_11 )  requireNotNull ( jdkHome )  configuration . put ( JVMConfigurationKeys . JDK_HOME , jdkHome )  val environment =  KotlinCoreEnvironment . getOrCreateApplicationEnvironmentForTests ( this . testRootDisposable , configuration )  val jrt = environment . jrtFileSystem ? : error ( \"\" )  val root = jrt . findFileByPath ( \"\" )  requireNotNull ( root )  val children = root . children . filter { it . extension == \"\" }  assert ( children . isNotEmpty ( ) )  children . forEach { file ->  checkClassVersion ( Opcodes . V11 , file )  }  }","docstring":"/**\n * The test ensures that Thread class always contains version from JDK_11, when such javaHome is used\n * Regardless of compiler runtime JDK\n */"}
{"signature":"@ SlicedGeneratedTest ( allTools = true )  fun BuildConfigurator . testPackageInTheMiddle ( )","body":"{  addProjectWithKover {  sourcesFrom ( \"\" )  kover {  reports {  filters {  excludes {  packages ( \"\" )  }  }  }  }  }  run ( \"\" ) {  xmlReport {  classCounter ( \"\" ) . assertAbsent ( )  classCounter ( \"\" ) . assertCovered ( )  }  }  }","docstring":"/**\n * Check that when excluding packages, the excluding occurs starting from the root package,\n * and there is no search for any middle occurrence of the specified string.\n *\n * See https://github.com/Kotlin/kotlinx-kover/issues/543\n */"}
{"signature":"fun main ( )","body":"{  val modelHub =  ONNXModelHub ( cacheDirectory = File ( \"\" ) )  val model = ONNXModels . ObjectDetection . SSD . pretrainedModel ( modelHub )  model . printSummary ( )  model . use { detectionModel ->  println ( detectionModel )  val file = getFileFromResource ( \"\" )  val image = ImageConverter . toBufferedImage ( file )  val detectedObjects = detectionModel . detectObjects ( image , topK =  )  detectedObjects . forEach {  println ( \"\" )  }  val displayedImage = pipeline < BufferedImage > ( )  . resize { outputWidth =  ; outputHeight = ( (  / image . width ) * image . height ) . toInt ( ) }  . apply ( image )  showFrame ( \"\" , createDetectedObjectsPanel ( displayedImage , detectedObjects ) )  }  }","docstring":"/**\n * This examples demonstrates the light-weight inference API with [SSDObjectDetectionModel] on SSD model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts rectangles for the detected objects on a few images located in resources.\n * - The detected rectangles related to the objects are drawn on the images used for prediction.\n */"}
{"signature":"protected open fun loadVariables ( variableNames : Collection < String > , getData : ( String , Shape ) -> Any )","body":"{  for ( variableName in variableNames ) {  val variableOperation = tfGraph . operation ( variableName )  check ( variableOperation != null ) { \"\" }  val variableShape = variableOperation . output < Float > (  ) . shape ( )  val data = getData ( variableName , variableShape )  assignVariable ( variableName , variableShape , data )  }  }","docstring":"/**\n * Loads variable data for variable names in the provided collection using a provided function.\n * @param [variableNames] Variable names to load.\n * @param [getData] Function that returns variable data by variable name and shape.\n */"}
{"signature":"protected fun isOptimizerVariable ( variableName : String ) : Boolean","body":"= variableName . startsWith ( \"\" )","docstring":"/** Check that the variable with the name [variableName] is an optimizer variable**/"}
{"signature":"protected fun loadVariablesFromTxt ( pathToModelDirectory : String , loadOptimizerState : Boolean )","body":"{  loadVariablesFromTxt ( pathToModelDirectory ) { variableName ->  loadOptimizerState || ! isOptimizerVariable ( variableName )  }  }","docstring":"/**\n * Loads variable data from .txt files.\n *\n * @param [pathToModelDirectory] Path to directory with TensorFlow graph and variable data.\n * @param [loadOptimizerState] Loads optimizer internal variables data, if true.\n */"}
{"signature":"protected fun loadVariablesFromTxt ( pathToModelDirectory : String , predicate : ( String ) -> Boolean )","body":"{  val variableNamesFile = File ( \"\" )  if ( ! variableNamesFile . exists ( ) ) throw FileNotFoundException ( \"\" + \"\" )  val variableNamesToLoad = variableNamesFile . readLines ( ) . filter ( predicate )  loadVariables ( variableNamesToLoad ) { variableName , variableShape ->  val file = File ( \"\" )  if ( ! file . exists ( ) ) throw FileNotFoundException ( \"\" + \"\" )  Scanner ( file . inputStream ( ) ) . use { scanner ->  scanner . useLocale ( Locale . US )  scanner . createFloatArray ( variableShape )  }  }  }","docstring":"/**\n * Loads variable data from .txt files for variables matching the provided predicate.\n *\n * @param [pathToModelDirectory] Path to directory with TensorFlow graph and variable data.\n * @param [predicate] Predicate for matching variable names for loading.\n */"}
{"signature":"protected fun assignVariable ( variableName : String , variableShape : Shape , data : Any )","body":"{  val initializerName = defaultInitializerOpName ( variableName )  val assignOpName = defaultAssignOpName ( variableName )  val initOp = tfGraph . operation ( initializerName )  check ( initOp != null ) {  \"\" +  \"\"  }  val assignOp = tfGraph . operation ( assignOpName )  check ( assignOp != null ) { \"\" }  populateVariable ( assignOpName , initializerName , data )  logger . debug { \"\" }  logger . debug { \"\" }  logger . debug { \"\" }  }","docstring":"/**\n * Assigns variable data from multidimensional array.\n *\n * @param [variableName] Name of variable to load state for.\n * @param [variableShape] Shape of the variable.\n * @param [data] Variable data.\n */"}
{"signature":"override fun close ( )","body":"{  session . close ( )  tfGraph . close ( )  }","docstring":"/** Closes internal resources: session and tfGraph. */"}
{"signature":"override fun close ( )","body":"{  tensors . forEach {  try {  it . close ( )  } finally {  }  }  }","docstring":"/** Closes internal resources: session and tfGraph. */"}
{"signature":"operator fun get ( project : Project ) : List < T >","body":"operator fun get ( project : Project ) : List < T >","docstring":"/**\n * @return all currently registered extension points.\n * The returned list is *not* live and just represents the current snapshot.\n */"}
{"signature":"fun register ( project : Project , extension : T )","body":"fun register ( project : Project , extension : T )","docstring":"/**\n * @param project The current [project] to register an extension. The extension will only be visible to this particular [project]\n * @param extension The implementation of the extension to register. If registered twice, it will be returned twice when\n * the extensions are queried (no de-duplication)\n */"}
{"signature":"public fun OrtSession . Result . getFloatArrayWithShape ( index : Int ) : Pair < FloatArray , LongArray >","body":"{  return get ( index ) . getFloatArrayWithShape ( )  }","docstring":"/**\n * Returns the output at [index] as a [FloatArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getFloatArray ( index : Int ) : FloatArray","body":"{  return getFloatArrayWithShape ( index ) . first  }","docstring":"/**\n * Returns the output at [index] as a [FloatArray].\n */"}
{"signature":"public fun OrtSession . Result . getFloatArrayWithShape ( name : String ) : Pair < FloatArray , LongArray >","body":"{  return get ( name ) . get ( ) . getFloatArrayWithShape ( )  }","docstring":"/**\n * Returns the output by [name] as a [FloatArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getFloatArray ( name : String ) : FloatArray","body":"{  return getFloatArrayWithShape ( name ) . first  }","docstring":"/**\n * Returns the output by [name] as a [FloatArray].\n */"}
{"signature":"public fun OrtSession . Result . getDoubleArrayWithShape ( index : Int ) : Pair < DoubleArray , LongArray >","body":"{  return get ( index ) . getDoubleArrayWithShape ( )  }","docstring":"/**\n * Returns the output at [index] as a [DoubleArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getDoubleArray ( index : Int ) : DoubleArray","body":"{  return getDoubleArrayWithShape ( index ) . first  }","docstring":"/**\n * Returns the output at [index] as a [DoubleArray].\n */"}
{"signature":"public fun OrtSession . Result . getDoubleArrayWithShape ( name : String ) : Pair < DoubleArray , LongArray >","body":"{  return get ( name ) . get ( ) . getDoubleArrayWithShape ( )  }","docstring":"/**\n * Returns the output by [name] as a [DoubleArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getDoubleArray ( name : String ) : DoubleArray","body":"{  return getDoubleArrayWithShape ( name ) . first  }","docstring":"/**\n * Returns the output by [name] as a [DoubleArray].\n */"}
{"signature":"public fun OrtSession . Result . getLongArrayWithShape ( index : Int ) : Pair < LongArray , LongArray >","body":"{  return get ( index ) . getLongArrayWithShape ( )  }","docstring":"/**\n * Returns the output at [index] as a [LongArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getLongArray ( index : Int ) : LongArray","body":"{  return getLongArrayWithShape ( index ) . first  }","docstring":"/**\n * Returns the output at [index] as a [LongArray].\n */"}
{"signature":"public fun OrtSession . Result . getLongArrayWithShape ( name : String ) : Pair < LongArray , LongArray >","body":"{  return get ( name ) . get ( ) . getLongArrayWithShape ( )  }","docstring":"/**\n * Returns the output by [name] as a [LongArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getLongArray ( name : String ) : LongArray","body":"{  return getLongArrayWithShape ( name ) . first  }","docstring":"/**\n * Returns the output by [name] as a [FloatArray].\n */"}
{"signature":"public fun OrtSession . Result . getIntArrayWithShape ( index : Int ) : Pair < IntArray , LongArray >","body":"{  return get ( index ) . getIntArrayWithShape ( )  }","docstring":"/**\n * Returns the output at [index] as an [IntArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getIntArray ( index : Int ) : IntArray","body":"{  return getIntArrayWithShape ( index ) . first  }","docstring":"/**\n * Returns the output at [index] as an [IntArray].\n */"}
{"signature":"public fun OrtSession . Result . getIntArrayWithShape ( name : String ) : Pair < IntArray , LongArray >","body":"{  return get ( name ) . get ( ) . getIntArrayWithShape ( )  }","docstring":"/**\n * Returns the output by [name] as an [IntArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getIntArray ( name : String ) : IntArray","body":"{  return getIntArrayWithShape ( name ) . first  }","docstring":"/**\n * Returns the output by [name] as an [IntArray].\n */"}
{"signature":"public fun OrtSession . Result . getShortArrayWithShape ( index : Int ) : Pair < ShortArray , LongArray >","body":"{  return get ( index ) . getShortArrayWithShape ( )  }","docstring":"/**\n * Returns the output at [index] as a [ShortArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getShortArray ( index : Int ) : ShortArray","body":"{  return getShortArrayWithShape ( index ) . first  }","docstring":"/**\n * Returns the output at [index] as a [ShortArray].\n */"}
{"signature":"public fun OrtSession . Result . getShortArrayWithShape ( name : String ) : Pair < ShortArray , LongArray >","body":"{  return get ( name ) . get ( ) . getShortArrayWithShape ( )  }","docstring":"/**\n * Returns the output by [name] as a [ShortArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getShortArray ( name : String ) : ShortArray","body":"{  return getShortArrayWithShape ( name ) . first  }","docstring":"/**\n * Returns the output by [name] as a [ShortArray].\n */"}
{"signature":"public fun OrtSession . Result . getByteArrayWithShape ( index : Int ) : Pair < ByteArray , LongArray >","body":"{  return get ( index ) . getByteArrayWithShape ( )  }","docstring":"/**\n * Returns the output at [index] as a [ByteArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getByteArray ( index : Int ) : ByteArray","body":"{  return getByteArrayWithShape ( index ) . first  }","docstring":"/**\n * Returns the output at [index] as a [ByteArray].\n */"}
{"signature":"public fun OrtSession . Result . getByteArrayWithShape ( name : String ) : Pair < ByteArray , LongArray >","body":"{  return get ( name ) . get ( ) . getByteArrayWithShape ( )  }","docstring":"/**\n * Returns the output by [name] as a [ByteArray] with its shape.\n */"}
{"signature":"public fun OrtSession . Result . getByteArray ( name : String ) : ByteArray","body":"{  return getByteArrayWithShape ( name ) . first  }","docstring":"/**\n * Returns the output by [name] as a [ByteArray].\n */"}
{"signature":"public fun OrtSession . Result . get2DFloatArray ( name : String ) : Array < FloatArray >","body":"{  return get ( name ) . get ( ) . get2DFloatArray ( )  }","docstring":"/**\n * Returns the output by [name] as an Array. This operation could be slow for high dimensional tensors,\n * in which case [getFloatArray] should be used.\n */"}
{"signature":"public fun OrtSession . Result . get2DFloatArray ( index : Int ) : Array < FloatArray >","body":"{  return get ( index ) . get2DFloatArray ( )  }","docstring":"/**\n * Returns the output at [index] as an Array. This operation could be slow for high dimensional tensors,\n * in which case [getFloatArray] should be used.\n */"}
{"signature":"public fun OrtSession . Result . getValues ( ) : Map < String , Any >","body":"= associate { it . key to it . value . value }","docstring":"/**\n * Returns all values from this [OrtSession.Result]. This operation could be slow for high dimensional tensors,\n * in which case functions that return one dimensional array such as [getFloatArray] or [getLongArray] should be used.\n * @see OnnxValue.getValue\n */"}
{"signature":"internal fun throwIfOutputNotSupported ( valueInfo : ValueInfo , valueName : String , method : String , type : OnnxJavaType ? = null )","body":"{  val typeString = type ? . toString ( ) ? . let { \"\" } ? : \"\"  require ( valueInfo !is MapInfo ) { \"\" }  require ( valueInfo !is SequenceInfo ) { \"\" }  if ( type != null ) {  require ( valueInfo is TensorInfo && valueInfo . type == type ) { \"\" }  }  }","docstring":"/**\n * Checks if [valueInfo] corresponds to a Tensor of the specified [type].\n * If it does not satisfy the requirements, exception with a message containing [valueName] and calling [method] name is thrown.\n */"}
{"signature":"fun JsNode . any ( predicate : ( JsNode ) -> Boolean ) : Boolean","body":"{  val visitor = object : RecursiveJsVisitor ( ) {  var matched : Boolean = false  override fun visitElement ( node : JsNode ) {  matched = matched || predicate ( node )  if ( ! matched ) {  super . visitElement ( node )  }  }  }  visitor . accept ( this )  return visitor . matched  }","docstring":"/**\n * Tests, if any node containing in receiver's AST matches, [predicate].\n */"}
{"signature":"override fun interruptExecutions ( )","body":"{  logger . info ( \"\" )  if ( executionInProgress . get ( ) ) {  val execution = executorThread  val executionName = execution . name  logger . info ( \"\" )  execution . interrupt ( )  logger . info ( \"\" )  Thread . sleep (  )  if ( execution . name == executionName ) {  try {  @ Suppress ( \"\" )  execution . stop ( )  logger . info ( \"\" )  } catch ( e : UnsupportedOperationException ) {  logger . warn ( \"\" , e , )  }  }  }  }","docstring":"/**\n * We cannot use [Thread.interrupt] here because we have no way\n * to control the code user executes. [Thread.interrupt] will do nothing for\n * the simple calculation (like `while (true) 1`). Consider replacing with\n * something smarter in the future.\n */"}
{"signature":"public fun build ( tf : Ops ) : Placeholder < Float >","body":"{  input = tf . withName ( DATA_PLACEHOLDER ) . placeholder ( getDType ( ) , Placeholder . shape ( Shape . make ( -  , * packedDims ) ) )  return input  }","docstring":"/**\n * Extend this function to define placeholder in layer.\n *\n * NOTE: Called instead of [Layer.build].\n *\n * @param [tf] TensorFlow graph API for building operations.\n */"}
{"signature":"@ JvmStatic  fun mapClass ( classId : String ) : String","body":"{  return map [ classId ] ? : \"\"  }","docstring":"/**\n * @param classId the name of the class in the format: \"org/foo/bar/Test.Inner\"\n */"}
{"signature":"private fun collectDesignationPath ( firFile : FirFile , containerClassId : ClassId ? , expectedDeclarationAcceptor : ( FirDeclaration ) -> Boolean , ) : FirDesignation ?","body":"{  if ( containerClassId != null ) {  requireWithAttachment ( ! containerClassId . isLocal , { \"\" } ) {  withEntry ( \"\" , containerClassId ) { it . asString ( ) }  }  requireWithAttachment ( firFile . packageFqName == containerClassId . packageFqName , { \"\" } ) {  withEntry ( \"\" , firFile . packageFqName ) { it . asString ( ) }  withEntry ( \"\" , containerClassId . packageFqName ) { it . asString ( ) }  }  }  val classIdPathSegment = containerClassId ? . relativeClassName ? . pathSegments ( ) . orEmpty ( )  val path = ArrayList < FirDeclaration > ( classIdPathSegment . size +  )  var result : FirDeclaration ? = null  fun find ( declarations : Iterable < FirDeclaration > , classIdPathIndex : Int ) : Boolean {  val currentClassSegment = classIdPathSegment . getOrNull ( classIdPathIndex )  for ( subDeclaration in declarations ) {  when {  currentClassSegment == null && expectedDeclarationAcceptor ( subDeclaration ) -> {  result = subDeclaration  return true  }  subDeclaration is FirScript -> {  path += subDeclaration  val scriptParameters = subDeclaration . parameters  if ( find ( scriptParameters , classIdPathIndex ) ) {  return true  }  val scriptDeclarations = subDeclaration . declarations  if ( find ( scriptDeclarations , classIdPathIndex ) ) {  return true  }  path . removeLast ( )  continue  }  subDeclaration is FirCodeFragment -> {  val codeFragmentDeclarations = subDeclaration . block . statements . asSequence ( ) . filterIsInstance < FirDeclaration > ( )  if ( find ( codeFragmentDeclarations . asIterable ( ) , classIdPathIndex ) ) {  return true  }  continue  }  subDeclaration is FirRegularClass && currentClassSegment == subDeclaration . symbol . name -> {  path += subDeclaration  if ( find ( subDeclaration . declarations , classIdPathIndex +  ) ) {  return true  }  path . removeLast ( )  }  }  }  return false  }  path += firFile  find ( firFile . declarations , classIdPathIndex =  )  if ( result == null ) {  return null  }  @ Suppress ( \"\" )  return FirDesignation ( path = patchDesignationPathIfNeeded ( result ! ! , path ) . ifEmpty { emptyList ( ) } , target = result ! ! , )  }","docstring":"/**\n * @return [FirDesignation] where [FirDesignation.target] is [FirDeclaration]\n *\n * @see declarationTarget\n */"}
{"signature":"private fun Project . findPropertySafe ( propertyName : String ) : Any ?","body":"=  try {  findProperty ( propertyName )  } catch ( ex : Exception ) {  logger . warn ( \"\" , ex )  null  }","docstring":"/**\n * In case [Project.findProperty] can throw exception, this version catch it and return null\n */"}
{"signature":"infix fun Tuple1 < * > . zip ( other : EmptyTuple ) : EmptyTuple","body":"= EmptyTuple","docstring":"/**\n * This file provides zip-functions to all Tuple variants.\n * Given two tuples, `t(a1, ..., an) zip t(a1, ..., an)`, returns a tuple\n * `t(t(a1, b1), ..., t(an, bn))`. If the two tuples have different sizes,\n * the extra elements of the larger tuple will be disregarded.\n * The result is typed as `TupleX, ..., Tuple2>`.\n */"}
{"signature":"public fun < T > type ( column : ColumnReference < T > , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , LineType > . ( ) -> Unit = { } ) : NonPositionalMapping < T , LineType >","body":"{  return addNonPositionalMapping < T , LineType > ( LINE_TYPE , column . name ( ) , LetsPlotNonPositionalMappingParametersCategorical < T , LineType > ( ) . apply ( parameters ) )  }","docstring":"/**\n * Maps the `type` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the type.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun < T > type ( column : KProperty < T > , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , LineType > . ( ) -> Unit = { } ) : NonPositionalMapping < T , LineType >","body":"{  return addNonPositionalMapping < T , LineType > ( LINE_TYPE , column . name , LetsPlotNonPositionalMappingParametersCategorical < T , LineType > ( ) . apply ( parameters ) )  }","docstring":"/**\n * Maps the `type` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the type.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun type ( column : String , parameters : LetsPlotNonPositionalMappingParametersCategorical < Any ? , LineType > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , LineType >","body":"{  return addNonPositionalMapping ( LINE_TYPE , column , LetsPlotNonPositionalMappingParametersCategorical < Any ? , LineType > ( ) . apply ( parameters ) )  }","docstring":"/**\n * Maps the `type` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the type.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun < T > type ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , LineType > . ( ) -> Unit = { } ) : NonPositionalMapping < T , LineType >","body":"{  return addNonPositionalMapping ( LINE_TYPE , values . toList ( ) , name , LetsPlotNonPositionalMappingParametersCategorical < T , LineType > ( ) . apply ( parameters ) )  }","docstring":"/**\n * Maps the `type` aesthetic to iterable of values.\n *\n * @param values the iterable containing the categorical values.\n * @param name optional name for this aesthetic mapping.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun < T > type ( values : DataColumn < T > , parameters : LetsPlotNonPositionalMappingParametersCategorical < T , LineType > . ( ) -> Unit = { } ) : NonPositionalMapping < T , LineType >","body":"{  return addNonPositionalMapping ( LINE_TYPE , values , LetsPlotNonPositionalMappingParametersCategorical < T , LineType > ( ) . apply ( parameters ) )  }","docstring":"/**\n * Maps the `type` aesthetic to a data column.\n *\n * @param values the data column to map to the type.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"@ Test  fun `test - launching after Lifecycle finished - will execute code right away` ( )","body":"{  project . evaluate ( )  val actionAInvocations = AtomicInteger (  )  val actionBInvocations = AtomicInteger (  )  project . launch actionB @ {  project . launch actionA @ {  assertEquals (  , actionBInvocations . get ( ) )  assertEquals (  , actionAInvocations . incrementAndGet ( ) )  }  assertEquals (  , actionAInvocations . get ( ) )  assertEquals (  , actionBInvocations . incrementAndGet ( ) )  }  assertEquals (  , actionAInvocations . get ( ) )  assertEquals (  , actionBInvocations . get ( ) )  }","docstring":"/**\n * This requirement is important to safely support project.future { }.getOrThrow() patterns (when the lifecycle is finished),\n */"}
{"signature":"@ Test  fun `Java primitive annotations work` ( )","body":"{  testInline ( \"\"\"\"\"\" . trimMargin ( ) , javaConfiguration ) {  documentablesMergingStage = { module ->  val type = module . packages . single ( ) . functions . single ( ) . type as GenericTypeConstructor  assertEquals ( Annotations . Annotation ( DRI ( \"\" , \"\" ) , emptyMap ( ) ) , type . extra [ Annotations ] ? . directAnnotations ? . values ? . single ( ) ? . single ( ) )  assertEquals ( \"\" , type . dri . toString ( ) )  }  }  }","docstring":"/**\n * Kotlin Int becomes java int. Java int cannot be annotated in source, but Kotlin Int can be.\n * This is paired with KotlinAsJavaPluginTest.`Java primitive annotations work`()\n */"}
{"signature":"@ Deprecated ( \"\" )  fun source ( sourceSet : KotlinSourceSet )","body":"@ Deprecated ( \"\" )  fun source ( sourceSet : KotlinSourceSet )","docstring":"/**\n * Will add a [KotlinSourceSet] directly into this compilation.\n * This method is deprecated and targets Kotlin 2.1 for its removal.\n * After Kotlin 2.1 there will be exactly one SourceSet associated with a given Kotlin Compilation.\n *\n * In order to include other sources into the compilation, please build a hierarchy of Source Sets instead.\n * See: [KotlinSourceSet.dependsOn] or [KotlinTargetHierarchyDsl].\n * This approach is most applicable if\n * - The sources can be shared for multiple compilations\n * - The sources shall be analyzed in a different context than [defaultSourceSet]\n * - The project uses multiplatform and sources shall provide expects\n *\n *\n * Alternatively, when just including source files from another directory,\n * the [SourceDirectorySet] from the [defaultSourceSet] can be used.\n * This approach is most applicable if\n * - sources are not intended to be shared across multiple compilations\n * - sources shall be analyzed in the same context as other sources in the [defaultSourceSet]\n *\n * #### Example 1: Create a new 'utils' source set and make it available to the 'main' compilation:\n * ```kotlin\n * kotlin {\n * val compilation = target.compilations.getByName(\"main\")\n * val utilsSourceSet = sourceSets.create(\"utils\")\n * compilation.defaultSourceSet.dependsOn(utilsSourceSet)\n * }\n * ```\n *\n * #### Example 2: Add 'src/utils/kotlin' to the main SourceSet\n * ```kotlin\n * kotlin {\n * val compilation = target.compilations.getByName(\"main\")\n * compilation.defaultSourceSet.kotlin.srcDir(\"src/utils/kotlin\")\n * }\n * ```\n * Further details:\n * https://kotl.in/compilation-source-deprecation\n */"}
{"signature":"protected abstract fun configure ( model : Model < Element > )","body":"protected abstract fun configure ( model : Model < Element > )","docstring":"/**\n * A customization point to fine-tune existing implementation classes or add new ones.\n *\n * Override this method and use [noImpl] or [impl] in it to configure implementations of tree nodes.\n */"}
{"signature":"protected abstract fun configureAllImplementations ( model : Model < Element > )","body":"protected abstract fun configureAllImplementations ( model : Model < Element > )","docstring":"/**\n * A customization point for batch-applying rules to existing implementations.\n *\n * Override this method and use [configureFieldInAllImplementations] to configure fields that are common to multiple implementation\n * classes.\n */"}
{"signature":"protected fun noImpl ( element : Element )","body":"{  element . doesNotNeedImplementation = true  }","docstring":"/**\n * Disables generating any implementation classes for [element].\n */"}
{"signature":"protected fun impl ( element : Element , name : String ? = null , config : ImplementationContext . ( ) -> Unit = { } ) : Implementation","body":"{  val implementation = element . implementations . firstOrNull { it . name == name }  ? : createImplementation ( element , name )  val context = ImplementationContext ( implementation )  context . apply ( config )  elementsWithImpl += element  return implementation  }","docstring":"/**\n * Provides a way to fine-tune a single implementation class for [element].\n *\n * @param element The element whose implementation you want to configure.\n * @param name The name of the implementation class, or `null` if you want to configure the default implementation class for this\n * element. If an implementation with this name already exists, it will be used, otherwise a new implementation will be created.\n * @param config The configuration block. See [ImplementationContext]'s documentation for description of its DSL methods.\n * @return The configured implementation.\n */"}
{"signature":"protected fun allImplOf ( element : Element , config : ElementContext . ( ) -> Unit )","body":"{  val context = ElementContext ( element )  context . apply ( config )  }","docstring":"/**\n * Provides a way to fine-tune all implementations of classes deriving from [element].\n */"}
{"signature":"private fun inheritImplementationFieldSpecifications ( elements : List < Element > )","body":"{  for ( element in elements ) {  for ( implementation in element . implementations ) {  for ( field in implementation . allFields ) {  if ( field . implementationDefaultStrategy == null ) {  for ( ancestor in element . elementAncestorsAndSelfBreadthFirst ( ) ) {  val inheritedDefaults = ancestor . elementParents  . mapNotNull { it . element . getOrNull ( field . name ) }  . mapNotNull { it . implementationDefaultStrategy }  if ( inheritedDefaults . isNotEmpty ( ) ) {  field . implementationDefaultStrategy = inheritedDefaults . singleOrNull ( )  ? : error ( \"\" )  break  }  }  if ( field . implementationDefaultStrategy == null ) {  field . implementationDefaultStrategy = AbstractField . ImplementationDefaultStrategy . Required  }  }  }  }  }  }","docstring":"/**\n * Apply the configuration done in [allImplOf] to all actual implementation classes, choosing the\n * most specific configuration for a given implementation, or applies default value if no\n * customized configuration is found.\n */"}
{"signature":"protected fun configureFieldInAllImplementations ( fieldName : String ? , implementationPredicate : ( Implementation ) -> Boolean = { true } , fieldPredicate : ( ImplementationField ) -> Boolean = { true } , config : ImplementationContext . ( field : String ) -> Unit , )","body":"{  for ( element in elementsWithImpl ) {  for ( implementation in element . implementations ) {  if ( ! implementationPredicate ( implementation ) ) continue  if ( fieldName != null && ! implementation . allFields . any { it . name == fieldName } ) continue  val fields = if ( fieldName != null ) {  listOf ( implementation [ fieldName ] )  } else {  implementation . allFields  }  for ( field in fields . filter ( fieldPredicate ) ) {  ImplementationContext ( implementation ) . config ( field . name )  }  }  }  }","docstring":"/**\n * Allows to batch-apply [config] to certain fields in _all_ the implementations that satisfy the given\n * [implementationPredicate].\n *\n * @param fieldName The name of the field to configure across all `Impl` classes, or `null` if [config] should be applied to all fields.\n * @param implementationPredicate Only implementations satisfying this predicate will be used in this configuration.\n * @param fieldPredicate Only fields satisfying this predicate will be configured\n * @param config The configuration block. Accepts the field name as an argument.\n * See [ImplementationContext]'s documentation for description of its DSL methods.\n */"}
{"signature":"protected fun configureAllImplementations ( implementationPredicate : ( Implementation ) -> Boolean = { true } , config : ImplementationContext . ( ) -> Unit , )","body":"{  for ( element in elementsWithImpl ) {  for ( implementation in element . implementations ) {  if ( ! implementationPredicate ( implementation ) ) continue  ImplementationContext ( implementation ) . config ( )  }  }  }","docstring":"/**\n * Allows to batch-apply [config] to _all_ the implementations that satisfy the given\n * [implementationPredicate].\n *\n * @param implementationPredicate Only implementations satisfying this predicate will be used in this configuration.\n * @param config The configuration block. Accepts the field name as an argument.\n * See [ImplementationContext]'s documentation for description of its DSL methods.\n */"}
{"signature":"fun isMutable ( vararg fields : String )","body":"{  fields . forEach {  val field = fieldContainer [ it ]  field . isMutable = true  }  }","docstring":"/**\n * Makes the specified fields in the implementation class mutable\n * (even if they were not configured as mutable in the element configurator).\n */"}
{"signature":"fun isLateinit ( vararg fields : String )","body":"{  fields . forEach {  val field = fieldContainer [ it ]  field . implementationDefaultStrategy = AbstractField . ImplementationDefaultStrategy . Lateinit  }  }","docstring":"/**\n * Makes the specified fields in the implementation class `lateinit`\n * (even if they were not configured as `lateinit` in the element configurator).\n */"}
{"signature":"fun default ( field : String , value : String , withGetter : Boolean = false )","body":"{  default ( field ) {  this . value = value  this . withGetter = withGetter  }  }","docstring":"/**\n * Specifies the default value of [field] in this implementation class. The default value can be arbitrary code.\n *\n * Use [additionalImports] if the default value uses types/functions that are not otherwise imported.\n */"}
{"signature":"fun defaultTrue ( vararg fields : String , withGetter : Boolean = false )","body":"{  for ( field in fields ) {  default ( field ) {  value = \"\"  this . withGetter = withGetter  }  }  }","docstring":"/**\n * Specifies that the default value of each field of [fields] in this implementation class should be `true`.\n *\n * If [withGetter] is `true`, the fields will be generated as getter-only computed properties with their getter returning `true`,\n * otherwise, as stored properties initialized to `true`.\n */"}
{"signature":"fun defaultFalse ( vararg fields : String , withGetter : Boolean = false )","body":"{  for ( field in fields ) {  default ( field ) {  value = \"\"  this . withGetter = withGetter  }  }  }","docstring":"/**\n * Specifies that the default value of each field of [fields] in this implementation class should be `false`.\n *\n * If [withGetter] is `true`, the fields will be generated as getter-only computed properties with their getter returning `false`,\n * otherwise, as stored properties initialized to `false`.\n */"}
{"signature":"fun defaultNull ( vararg fields : String , withGetter : Boolean = false )","body":"{  for ( field in fields ) {  default ( field ) {  value = \"\"  this . withGetter = withGetter  }  require ( fieldContainer [ field ] . nullable ) {  \"\"  }  }  }","docstring":"/**\n * Specifies that the default value of each field of [fields] in this implementation class should be `null`.\n *\n * If [withGetter] is `true`, the fields will be generated as getter-only computed properties with their getter returning `null`,\n * otherwise, as stored properties initialized to `null`.\n */"}
{"signature":"fun defaultEmptyList ( vararg fields : String , withGetter : Boolean = false )","body":"{  for ( field in fields ) {  require ( fieldContainer [ field ] . origin is ListField ) {  \"\"  }  default ( field ) {  value = \"\"  this . withGetter = withGetter  }  }  }","docstring":"/**\n * Specifies that the default value of each field of [fields] in this implementation class should be [emptyList].\n *\n * @param withGetter If `true`, the field will be generated as a computed property instead of stored one.\n */"}
{"signature":"fun default ( field : String , init : DefaultValueContext . ( ) -> Unit )","body":"{  DefaultValueContext ( fieldContainer [ field ] ) . apply ( init ) . applyConfiguration ( )  }","docstring":"/**\n * Allows to configure the default value of [field] in this implementation class.\n *\n * See the [DefaultValueContext] documentation for description of its DSL methods.\n */"}
{"signature":"fun delegateFields ( fields : List < String > , delegate : String )","body":"{  for ( field in fields ) {  default ( field ) {  this . delegate = delegate  }  }  }","docstring":"/**\n * Specifies that for each field in the [fields] list its getter should be delegated to the [delegate]'s property of the same name.\n *\n * For example, `delegateFields(listOf(\"foo\", \"bar\"), \"myDelegate\")` will result in generating the following properties in\n * the implementation class (provided that there are fields with names \"foo\" and \"bar\" in this implementation):\n * ```kotlin\n * val foo: Foo\n * get() = myDelegate.foo\n *\n * val bar: Bar\n * get() = myDelegate.bar\n * ```\n */"}
{"signature":"fun optInToInternals ( )","body":"{  implementation . requiresOptIn = true  }","docstring":"/**\n * Call this function if you want this implementation class to be marked with an [OptIn] annotation.\n *\n * This is necessary if some code inside the implementation class requires that [OptIn] annotation.\n */"}
{"signature":"fun publicImplementation ( )","body":"{  implementation . isPublic = true  }","docstring":"/**\n * By default, all implementation classes are generated with `internal` visibility.\n *\n * This method allows to forcibly make this implementation `public`.\n */"}
{"signature":"fun additionalImports ( vararg importables : Importable )","body":"{  implementation . additionalImports . addAll ( importables )  }","docstring":"/**\n * Types/functions that you want to additionally import in the file with the implementation class.\n *\n * This is useful if, for example, default values of fields reference classes or functions from other packages.\n *\n * Note that classes referenced in field types will be imported automatically.\n */"}
{"signature":"public fun KtCallableSymbol . getAllOverriddenSymbols ( ) : List < KtCallableSymbol >","body":"=  withValidityAssertion { analysisSession . symbolDeclarationOverridesProvider . getAllOverriddenSymbols ( this ) }","docstring":"/**\n * Return a list of **all** explicitly declared symbols that are overridden by symbol\n *\n * E.g., if we have `A.foo` overrides `B.foo` overrides `C.foo`, all two super declarations `B.foo`, `C.foo` will be returned\n *\n * Unwraps substituted overridden symbols\n * (see [INTERSECTION_OVERRIDE][org.jetbrains.kotlin.analysis.api.symbols.KtSymbolOrigin.INTERSECTION_OVERRIDE] and [SUBSTITUTION_OVERRIDE][org.jetbrains.kotlin.analysis.api.symbols.KtSymbolOrigin.SUBSTITUTION_OVERRIDE]),\n * so such fake declaration won't be returned.\n *\n * @see getDirectlyOverriddenSymbols\n */"}
{"signature":"public fun KtCallableSymbol . getDirectlyOverriddenSymbols ( ) : List < KtCallableSymbol >","body":"=  withValidityAssertion { analysisSession . symbolDeclarationOverridesProvider . getDirectlyOverriddenSymbols ( this ) }","docstring":"/**\n * Return a list of explicitly declared symbols which are **directly** overridden by symbol\n **\n * E.g., if we have `A.foo` overrides `B.foo` overrides `C.foo`, only declarations directly overridden `B.foo` will be returned\n *\n * Unwraps substituted overridden symbols\n * (see [INTERSECTION_OVERRIDE][org.jetbrains.kotlin.analysis.api.symbols.KtSymbolOrigin.INTERSECTION_OVERRIDE] and [SUBSTITUTION_OVERRIDE][org.jetbrains.kotlin.analysis.api.symbols.KtSymbolOrigin.SUBSTITUTION_OVERRIDE]),\n * so such fake declaration won't be returned.\n *\n * @see getAllOverriddenSymbols\n */"}
{"signature":"public fun KtClassOrObjectSymbol . isSubClassOf ( superClass : KtClassOrObjectSymbol ) : Boolean","body":"=  withValidityAssertion { analysisSession . symbolDeclarationOverridesProvider . isSubClassOf ( this , superClass ) }","docstring":"/**\n * Checks if [this] class has [superClass] as its superclass somewhere in the inheritance hierarchy.\n *\n * N.B. The class is not considered to be a subclass of itself, so `myClass.isSubClassOf(myClass)` is always `false`.\n */"}
{"signature":"public fun KtClassOrObjectSymbol . isDirectSubClassOf ( superClass : KtClassOrObjectSymbol ) : Boolean","body":"=  withValidityAssertion { analysisSession . symbolDeclarationOverridesProvider . isDirectSubClassOf ( this , superClass ) }","docstring":"/**\n * Checks if [this] class has [superClass] listed as its direct superclass.\n *\n * N.B. The class is not considered to be a direct subclass of itself, so `myClass.isDirectSubClassOf(myClass)` is always `false`.\n */"}
{"signature":"internal fun Project . transformMetadataLibrariesForIde ( resolution : MetadataDependencyResolution . ChooseVisibleSourceSets ) : Map < String , Iterable < File > >","body":"{  return when ( val metadataProvider = resolution . metadataProvider ) {  is ProjectMetadataProvider -> resolution . visibleSourceSetNamesExcludingDependsOn . associateWith { visibleSourceSetName ->  metadataProvider . getSourceSetCompiledMetadata ( visibleSourceSetName ) ? : emptyList ( )  }  is ArtifactMetadataProvider -> transformMetadataLibrariesForIde ( kotlinTransformedMetadataLibraryDirectoryForIde , resolution , metadataProvider )  }  }","docstring":"/**\n * Returns a map from 'visibleSourceSetName' to the transformed metadata libraries.\n * The map is necessary to support [MetadataDependencyTransformation]'s shape, which\n * is used in import and therefore hard to change.\n *\n * This function will also support project to project dependencies and just returns the compiled output FileCollections to the metadata.\n */"}
{"signature":"internal fun ObjectFactory . transformMetadataLibrariesForBuild ( resolution : MetadataDependencyResolution . ChooseVisibleSourceSets , outputDirectory : File , materializeFiles : Boolean ) : Iterable < File >","body":"{  return when ( resolution . metadataProvider ) {  is ProjectMetadataProvider -> fileCollection ( ) . from ( resolution . visibleSourceSetNamesExcludingDependsOn . map { visibleSourceSetName ->  resolution . metadataProvider . getSourceSetCompiledMetadata ( visibleSourceSetName )  } )  is ArtifactMetadataProvider -> transformMetadataLibrariesForBuild ( resolution , outputDirectory , materializeFiles , resolution . metadataProvider )  }  }","docstring":"/**\n * Will transform the [CompositeMetadataArtifact] extracting the visible source sets specified in the [resolution]\n * @param materializeFiles: If true, the klib files will actually be created and extracted\n *\n * In case the [resolution] points to a project dependency, then the output file collections will be returned.\n */"}
{"signature":"public fun < C > valueCol ( valueCol : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"= valueCol . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColReferenceDocs] {@set [CommonValueColDocs.ReceiverArg]}\n */"}
{"signature":"public fun < C > SingleColumn < DataRow < * > > . valueCol ( valueCol : ColumnAccessor < C > ) : SingleColumn < C >","body":"=  this . ensureIsColumnGroup ( ) . transformSingle {  val child = it . getCol ( valueCol )  ? : throw IllegalStateException ( \"\" )  child . data . ensureIsValueColumn ( )  listOf ( child )  } . singleImpl ( )","docstring":"/**\n * @include [ValueColReferenceDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > AnyColumnGroupAccessor . valueCol ( valueCol : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"=  this . ensureIsColumnGroup ( ) . valueColumn < C > ( valueCol . path ( ) ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColReferenceDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > String . valueCol ( valueCol : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( valueCol . path ( ) ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColReferenceDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n */"}
{"signature":"public fun < C > KProperty < * > . valueCol ( valueCol : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( valueCol . path ( ) ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColReferenceDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n */"}
{"signature":"public fun < C > ColumnPath . valueCol ( valueCol : ColumnAccessor < C > ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( valueCol . path ( ) ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColReferenceDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun valueCol ( name : String ) : ColumnAccessor < * >","body":"= valueColumn < Any ? > ( name ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg]}\n */"}
{"signature":"public fun < C > valueCol ( name : String ) : ColumnAccessor < C >","body":"= valueColumn < C > ( name ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg]}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun SingleColumn < DataRow < * > > . valueCol ( name : String ) : SingleColumn < * >","body":"=  valueCol < Any ? > ( name )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > SingleColumn < DataRow < * > > . valueCol ( name : String ) : SingleColumn < C >","body":"=  this . ensureIsColumnGroup ( ) . transformSingle {  val child = it . getCol ( name ) ? . cast < C > ( )  ? : throw IllegalStateException ( \"\" )  child . data . ensureIsValueColumn ( )  listOf ( child )  } . singleImpl ( )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun AnyColumnGroupAccessor . valueCol ( name : String ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( name )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > AnyColumnGroupAccessor . valueCol ( name : String ) : ColumnAccessor < C >","body":"=  this . ensureIsColumnGroup ( ) . valueColumn < C > ( name ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun String . valueCol ( name : String ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( name )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n */"}
{"signature":"public fun < C > String . valueCol ( name : String ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( name ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun KProperty < * > . valueCol ( name : String ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( name )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n */"}
{"signature":"public fun < C > KProperty < * > . valueCol ( name : String ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( name ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun ColumnPath . valueCol ( name : String ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( name )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"}
{"signature":"public fun < C > ColumnPath . valueCol ( name : String ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( name ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColNameDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun valueCol ( path : ColumnPath ) : ColumnAccessor < * >","body":"= valueColumn < Any ? > ( path ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg]}\n */"}
{"signature":"public fun < C > valueCol ( path : ColumnPath ) : ColumnAccessor < C >","body":"= valueColumn < C > ( path ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg]}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun SingleColumn < DataRow < * > > . valueCol ( path : ColumnPath ) : SingleColumn < * >","body":"=  valueCol < Any ? > ( path )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > SingleColumn < DataRow < * > > . valueCol ( path : ColumnPath ) : SingleColumn < C >","body":"=  this . ensureIsColumnGroup ( ) . transformSingle {  val child = it . getCol ( path ) ? . cast < C > ( )  ? : throw IllegalStateException ( \"\" )  child . data . ensureIsValueColumn ( )  listOf ( child )  } . singleImpl ( )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun AnyColumnGroupAccessor . valueCol ( path : ColumnPath ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( path )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > AnyColumnGroupAccessor . valueCol ( path : ColumnPath ) : ColumnAccessor < C >","body":"=  this . ensureIsColumnGroup ( ) . valueColumn < C > ( path ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun String . valueCol ( path : ColumnPath ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( path )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n */"}
{"signature":"public fun < C > String . valueCol ( path : ColumnPath ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( path ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun KProperty < * > . valueCol ( path : ColumnPath ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( path )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n */"}
{"signature":"public fun < C > KProperty < * > . valueCol ( path : ColumnPath ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( path ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun ColumnPath . valueCol ( path : ColumnPath ) : ColumnAccessor < * >","body":"=  valueCol < Any ? > ( path )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"}
{"signature":"public fun < C > ColumnPath . valueCol ( path : ColumnPath ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn < C > ( path ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColPathDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"public fun < C > valueCol ( property : KProperty < C > ) : SingleColumn < C >","body":"= valueColumn ( property ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColKPropertyDocs] {@set [CommonValueColDocs.ReceiverArg]}\n */"}
{"signature":"public fun < C > SingleColumn < DataRow < * > > . valueCol ( property : KProperty < C > ) : SingleColumn < C >","body":"=  valueCol < C > ( property . name )","docstring":"/**\n * @include [ValueColKPropertyDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > AnyColumnGroupAccessor . valueCol ( property : KProperty < C > ) : ColumnAccessor < C >","body":"=  this . ensureIsColumnGroup ( ) . valueColumn ( property ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColKPropertyDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > String . valueCol ( property : KProperty < C > ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn ( property ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColKPropertyDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n */"}
{"signature":"public fun < C > KProperty < * > . valueCol ( property : KProperty < C > ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn ( property ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColKPropertyDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n */"}
{"signature":"public fun < C > ColumnPath . valueCol ( property : KProperty < C > ) : ColumnAccessor < C >","body":"=  columnGroup ( this ) . ensureIsColumnGroup ( ) . valueColumn ( property ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColKPropertyDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"}
{"signature":"public fun < C > ColumnSet < C > . valueCol ( index : Int ) : SingleColumn < C >","body":"= getAt ( index ) . ensureIsValueColumn ( )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] `[colsOf][ColumnsSelectionDsl.colsOf]`<`[Int][Int]`>().}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n * {@set [CommonValueColDocs.ExampleArg] {@include [CommonValueColDocs.SingleExample]}}\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun ColumnsSelectionDsl < * > . valueCol ( index : Int ) : SingleColumn < * >","body":"=  valueCol < Any ? > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg]}\n */"}
{"signature":"public fun < C > ColumnsSelectionDsl < * > . valueCol ( index : Int ) : SingleColumn < C >","body":"=  asSingleColumn ( ) . valueCol < C > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg]}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun SingleColumn < DataRow < * > > . valueCol ( index : Int ) : SingleColumn < * >","body":"=  valueCol < Any ? > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n */"}
{"signature":"public fun < C > SingleColumn < DataRow < * > > . valueCol ( index : Int ) : SingleColumn < C >","body":"=  this . ensureIsColumnGroup ( )  . allColumnsInternal ( )  . getAt ( index )  . ensureIsValueColumn ( )  . cast ( )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun String . valueCol ( index : Int ) : SingleColumn < * >","body":"=  valueCol < Any ? > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n */"}
{"signature":"public fun < C > String . valueCol ( index : Int ) : SingleColumn < C >","body":"=  columnGroup ( this ) . valueCol < C > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun KProperty < * > . valueCol ( index : Int ) : SingleColumn < * >","body":"=  valueCol < Any ? > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n */"}
{"signature":"public fun < C > KProperty < * > . valueCol ( index : Int ) : SingleColumn < C >","body":"=  columnGroup ( this ) . valueCol < C > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"@ Suppress ( \"\" )  @ JvmName ( \"\" )  public fun ColumnPath . valueCol ( index : Int ) : SingleColumn < * >","body":"=  valueCol < Any ? > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"}
{"signature":"public fun < C > ColumnPath . valueCol ( index : Int ) : SingleColumn < C >","body":"=  columnGroup ( this ) . valueCol < C > ( index )","docstring":"/**\n * @include [ValueColIndexDocs] {@set [CommonValueColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonValueColDocs.ValueColumnTypeParam]\n */"}
{"signature":"internal fun < C > SingleColumn < C > . ensureIsValueColumn ( ) : SingleColumn < C >","body":"=  onResolve { col : ColumnWithPath < * > ? ->  require ( col ? . isValueColumn ( ) != false ) {  \"\"  }  }","docstring":"/**\n * Checks the validity of this [SingleColumn],\n * by adding a check to see it's a [ValueColumn] (so, a [SingleColumn]<*>)\n * and throwing an [IllegalArgumentException] if it's not.\n */"}
{"signature":"internal fun < C > ColumnAccessor < C > . ensureIsValueColumn ( ) : ColumnAccessor < C >","body":"=  onResolve { col : ColumnWithPath < * > ? ->  require ( col ? . isValueColumn ( ) != false ) {  \"\"  }  }","docstring":"/** @include [SingleColumn.ensureIsValueColumn] */"}
{"signature":"inline fun TypeSystemInferenceExtensionContext . isProperTypeForFixation ( type : KotlinTypeMarker , notFixedTypeVariables : Set < TypeConstructorMarker > , isProper : ( KotlinTypeMarker ) -> Boolean ) : Boolean","body":"{  if ( type . typeConstructor ( ) in notFixedTypeVariables ) return false  return isProper ( type ) && extractProjectionsForAllCapturedTypes ( type ) . all ( isProper )  }","docstring":"/**\n * Returns `false` for fixed type variables types even if `isProper(type) == true`\n * Thus allowing only non-TVs types to be used for fixation on top level.\n * While this limitation is important, it doesn't really limit final results because when we have a constraint like T <: E or E <: T\n * and we're going to fix T into E, we assume that if E has some other constraints, they are being incorporated to T, so we would choose\n * them instead of E itself.\n */"}
{"signature":"fun sortClassMembers ( classNode : ClassNode )","body":"{  classNode . fields . sortWith ( compareBy ( { it . name } , { it . desc } ) )  classNode . methods . sortWith ( compareBy ( { it . name } , { it . desc } ) )  }","docstring":"/**\n * Sorts fields and methods in the given class.\n *\n * This is useful when we want to ensure a change in the order of the fields and methods doesn't impact the snapshot (i.e., if their\n * order has changed in the `.class` file, it shouldn't require recompilation of the other source files).\n */"}
{"signature":"fun PsiElement . isOptInAllowed ( annotationFqName : FqName , languageVersionSettings : LanguageVersionSettings , bindingContext : BindingContext ) : Boolean","body":"= isOptInAllowed ( annotationFqName , languageVersionSettings , bindingContext , subclassesOnly = false )","docstring":"/**\n * Checks whether there's an element lexically above in the tree, annotated with `@OptIn(X::class)`, or a declaration\n * annotated with `@X` where [annotationFqName] is the FQ name of X.\n *\n * This implementation also was rewritten for K2 use in intellij repository.\n * See `org.jetbrains.kotlin.idea.base.fir.codeInsight.FirOptInUsageCheckerKt#isOptInAllowed`.\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public suspend inline fun whileSelect ( crossinline builder : SelectBuilder < Boolean > . ( ) -> Unit )","body":"{  while ( select ( builder ) ) { }  }","docstring":"/**\n * Loops while [select] expression returns `true`.\n *\n * The statement of the form:\n *\n * ```\n * whileSelect {\n * /*body*/\n * }\n * ```\n *\n * is a shortcut for:\n *\n * ```\n * while(select {\n * /*body*/\n * }) {}\n *\n * **Note: This is an experimental api.** It may be replaced with a higher-performance DSL for selection from loops.\n */"}
{"signature":"fun klibFile ( file : Any )","body":"{ klibFiles . add ( project . files ( file ) ) }","docstring":"/** Absolute path */"}
{"signature":"fun klib ( lib : KonanLibrary )","body":"= klibInternal ( lib , false )","docstring":"/** Direct link to a config */"}
{"signature":"fun klib ( lib : KonanInteropLibrary )","body":"= klibInternal ( lib , false )","docstring":"/** Direct link to a config */"}
{"signature":"fun artifact ( libraryProject : Project , name : String , friend : Boolean )","body":"{  project . evaluationDependsOn ( libraryProject )  klibInternal ( libraryProject . konanArtifactsContainer . getByName ( name ) , friend )  }","docstring":"/** Artifact in the specified project by name */"}
{"signature":"fun artifact ( name : String , friend : Boolean )","body":"= artifact ( project , name , friend )","docstring":"/** Artifact in the current project by name */"}
{"signature":"fun artifact ( artifact : KonanLibrary )","body":"= klib ( artifact )","docstring":"/** Artifact by direct link */"}
{"signature":"fun artifact ( artifact : KonanInteropLibrary )","body":"= klib ( artifact )","docstring":"/** Direct link to a config */"}
{"signature":"fun allLibrariesFrom ( vararg libraryProjects : Project )","body":"= allArtifactsFromInternal ( libraryProjects ) {  it is KonanLibrary || it is KonanInteropLibrary  }","docstring":"/** All libraries (both interop and non-interop ones) from the projects by direct references */"}
{"signature":"fun allInteropLibrariesFrom ( vararg libraryProjects : Project )","body":"= allArtifactsFromInternal ( libraryProjects ) {  it is KonanInteropLibrary  }","docstring":"/** All interop libraries from the projects by direct references */"}
{"signature":"protected open fun makeIncrementalCompilationFeatures ( ) : IncrementalCompilationFeatures","body":"{  return IncrementalCompilationFeatures ( preciseCompilationResultsBackup = preciseCompilationResultsBackup . get ( ) , keepIncrementalCompilationCachesInMemory = keepIncrementalCompilationCachesInMemory . get ( ) , enableUnsafeIncrementalCompilationForMultiplatform = enableUnsafeIncrementalCompilationForMultiplatform . get ( ) , )  }","docstring":"/**\n * Entry point for getting IC feature toggles in Gradle. Child classes should override it\n * if they have a platform-specific Input.\n */"}
{"signature":"internal abstract fun callCompilerAsync ( args : T , inputChanges : InputChanges , taskOutputsBackup : TaskOutputsBackup ?  )","body":"internal abstract fun callCompilerAsync ( args : T , inputChanges : InputChanges , taskOutputsBackup : TaskOutputsBackup ?  )","docstring":"/**\n * Compiler might be executed asynchronously. Do not do anything requiring end of compilation after this function is called.\n * @see [GradleKotlinCompilerWork]\n */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun Node . clear ( )","body":"{  while ( hasChildNodes ( ) ) {  removeChild ( firstChild ! ! )  }  }","docstring":"/** Removes all the children from this node. */"}
{"signature":"@ SinceKotlin ( \"\" )  public fun Element . appendText ( text : String ) : Element","body":"{  appendChild ( ownerDocument ! ! . createTextNode ( text ) )  return this  }","docstring":"/**\n * Creates text node and append it to the element.\n *\n * @return this element\n */"}
{"signature":"internal fun Project . dokkaBuild ( configure : DokkaBuildProperties . ( ) -> Unit )","body":"=  extensions . configure ( configure )","docstring":"/**\n * Configures the [dokkaBuild][dokkabuild.DokkaBuildProperties] extension.\n */"}
{"signature":"internal fun collectKotlinSupertypesWithKind ( documentable : Iterable < Documentable > , sourceSet : DokkaConfiguration . DokkaSourceSet ) : Map < DRI , SuperclassesWithKind >","body":"{  val typeTranslator = TypeTranslator ( sourceSet , AnnotationTranslator ( ) )  val hierarchy = mutableMapOf < DRI , SuperclassesWithKind > ( )  analyze ( kotlinAnalysis . getModule ( sourceSet ) ) {  documentable . filterIsInstance < DClasslike > ( ) . forEach {  val source = it . sources [ sourceSet ]  if ( source is KtPsiDocumentableSource ) {  ( source . psi as? KtClassOrObject ) ? . let { psi ->  val type = psi . getNamedClassOrObjectSymbol ( ) ? . buildSelfClassType ( ) ? : return@analyze  collectSupertypesWithKindFromKtType ( typeTranslator , with ( typeTranslator ) {  toTypeConstructorWithKindFrom ( type )  } to type , hierarchy )  }  }  }  }  return hierarchy  }","docstring":"/**\n * Currently, it works only for Symbols\n */"}
{"signature":"private fun String . cleanContentPreservingLinesLayout ( start : Int =  , end : Int = this . length )","body":"= subSequence ( start , end )  . map { if ( it == '' || it == '' ) it else '' }","docstring":"/**\n * Replaces every character with ' ' except end of line\n */"}
{"signature":"fun File . toScriptSource ( ) : SourceCode","body":"= FileScriptSource ( this )","docstring":"/**\n * Converts the file into the SourceCode\n */"}
{"signature":"fun String . toScriptSource ( name : String ? = null ) : SourceCode","body":"= StringScriptSource ( this , name )","docstring":"/**\n * Converts the String into the SourceCode\n */"}
{"signature":"public fun < I > Operation < I , FloatData > . normalize ( block : Normalizing . ( ) -> Unit ) : Operation < I , FloatData >","body":"{  return PreprocessingPipeline ( this , Normalizing ( ) . apply ( block ) )  }","docstring":"/** Applies [Normalizing] preprocessor to the tensor to normalize it with given mean and std values. */"}
{"signature":"public fun < I > Operation < I , FloatData > . rescale ( block : Rescaling . ( ) -> Unit ) : Operation < I , FloatData >","body":"{  return PreprocessingPipeline ( this , Rescaling ( ) . apply ( block ) )  }","docstring":"/** Applies [Rescaling] preprocessor to the tensor to scale each value by a given coefficient. */"}
{"signature":"@ PublishedApi  internal actual fun < T : Throwable > checkResultIsFailure ( exceptionClass : KClass < T > , message : String ? , blockResult : Result < Unit > ) : T","body":"{  blockResult . fold ( onSuccess = {  val msg = messagePrefix ( message )  asserter . fail ( msg + \"\" )  } , onFailure = { e ->  if ( exceptionClass . java . isInstance ( e ) ) {  @ Suppress ( \"\" )  return e as T  }  asserter . fail ( messagePrefix ( message ) + \"\" , e )  } )  }","docstring":"/** Asserts that a [blockResult] is a failure with the specific exception type being thrown. */"}
{"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN )  @ JvmName ( \"\" )  public fun assertFailsNoInline ( block : ( ) -> Unit ) : Throwable","body":"= assertFails ( block )","docstring":"/** @suppress */"}
{"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN )  @ JvmName ( \"\" )  public fun assertFailsNoInline ( message : String ? , block : ( ) -> Unit ) : Throwable","body":"= assertFails ( message , block )","docstring":"/** @suppress */"}
{"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN )  @ JvmName ( \"\" )  public fun < T : Throwable > assertFailsWithNoInline ( exceptionClass : KClass < T > , block : ( ) -> Unit ) : T","body":"= assertFailsWith ( exceptionClass , block )","docstring":"/** @suppress */"}
{"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN )  @ JvmName ( \"\" )  public fun < T : Throwable > assertFailsWithNoInline ( exceptionClass : KClass < T > , message : String ? , block : ( ) -> Unit ) : T","body":"=  assertFailsWith ( exceptionClass , message , block )","docstring":"/** @suppress */"}
{"signature":"@ Suppress ( \"\" , \"\" )  @ InlineOnly  public actual inline fun todo ( @ Suppress ( \"\" ) block : ( ) -> Unit )","body":"{  println ( \"\" + currentStackTrace ( ) [  ] )  }","docstring":"/**\n * Takes the given [block] of test code and _doesn't_ execute it.\n *\n * This keeps the code under test referenced, but doesn't actually test it until it is implemented.\n */"}
{"signature":"@ Suppress ( \"\" , \"\" )  @ InlineOnly  public inline fun currentStackTrace ( ) : Array < StackTraceElement >","body":"= @ Suppress ( \"\" ) ( java . lang . Exception ( ) as java . lang . Throwable ) . stackTrace","docstring":"/**\n * Returns an array of stack trace elements, each representing one stack frame.\n * The first element of the array (assuming the array is not empty) represents the top of the\n * stack, which is the place where [currentStackTrace] function was called from.\n */"}
{"signature":"internal actual fun AssertionErrorWithCause ( message : String ? , cause : Throwable ? ) : AssertionError","body":"{  val assertionError = if ( message == null ) AssertionError ( ) else AssertionError ( message )  assertionError . initCause ( cause )  return assertionError  }","docstring":"/** Platform-specific construction of AssertionError with cause */"}
{"signature":"fun registerReplacement ( original : IrValueDeclaration , replacement : IrValueDeclaration )","body":"{  oldValueSymbol2NewValueSymbol [ original . symbol ] = replacement . symbol  }","docstring":"/**\n * Registers one-to-one replacement\n */"}
{"signature":"fun registerReplacement ( original : IrValueDeclaration , replacement : ValueDeclarationMfvcNodeInstance )","body":"{  oldSymbol2MfvcNodeInstance [ original . symbol ] = replacement  }","docstring":"/**\n * Registers replacement of a simple expression with flattened MFVC instance\n */"}
{"signature":"private fun IrBlockBuilder . makeFlattenedExpressionsWithGivenSafety ( node : MfvcNode , safe : Boolean , expression : IrExpression )","body":"= if ( safe ) {  val ( forVariables , rest ) = splitExpressions ( flattenExpression ( expression ) )  val variables = when ( node ) {  is LeafMfvcNode -> forVariables . map { expr -> irTemporary ( expr ) }  is MfvcNodeWithSubnodes -> forVariables . zip ( node . leaves ) { expr , leaf ->  irTemporary ( expr , nameHint = leaf . fullFieldName . asString ( ) )  }  }  variables . map { irGet ( it ) } + rest  } else {  flattenExpression ( expression )  }","docstring":"/**\n * @param safe whether protect from partial (because of a potential exception) initialization or not\n */"}
{"signature":"private fun IrBuilderWithScope . removeExtraSetVariablesFromExpressionList ( block : IrContainerExpression , variables : List < IrVariable > ) : List < IrExpression >","body":"{  val forbiddenVariables = mutableSetOf < IrVariable > ( )  val variablesSet = variables . toSet ( )  val standaloneExpressions = mutableListOf < IrExpression > ( )  val resultVariables = variables . toMutableList ( )  fun recur ( block : IrContainerExpression ) : Boolean {  while ( block . statements . isNotEmpty ( ) && resultVariables . isNotEmpty ( ) ) {  val statement = block . statements . last ( )  when {  statement is IrContainerExpression -> if ( recur ( statement ) ) {  if ( statement . statements . isEmpty ( ) ) {  block . statements . removeLast ( )  }  return true  } else {  require ( statement . statements . isEmpty ( ) || resultVariables . isEmpty ( ) ) { \"\" }  if ( statement . statements . isEmpty ( ) ) {  block . statements . removeLast ( )  }  }  statement !is IrSetValue -> return true  statement . symbol . owner != resultVariables . last ( ) -> return true  statement . symbol . owner in forbiddenVariables -> return true  else -> {  standaloneExpressions . add ( statement . value )  resultVariables . removeLast ( )  block . statements . removeLast ( )  statement . value . acceptVoid ( object : IrElementVisitorVoid {  override fun visitElement ( element : IrElement ) {  element . acceptChildrenVoid ( this )  }  override fun visitValueAccess ( expression : IrValueAccessExpression ) {  val valueDeclaration = expression . symbol . owner  if ( valueDeclaration is IrVariable && valueDeclaration in variablesSet ) {  forbiddenVariables . add ( valueDeclaration )  }  super . visitValueAccess ( expression )  }  } )  }  }  }  return false  }  recur ( block )  return resultVariables . map { irGet ( it ) } + standaloneExpressions . asReversed ( )  }","docstring":"/**\n * Inlines initialization of variables when possible and returns their values\n *\n * Example:\n * Before:\n * val a = 2\n * val b = 3\n * val c = b + 1\n * [a, b, c]\n *\n * After:\n * val a = 2\n * val b = 3\n * [a, b, b + 1]\n */"}
{"signature":"fun IrBlockBuilder . flattenExpression ( expression : IrExpression ) : List < IrExpression >","body":"{  if ( ! expression . type . needsMfvcFlattening ( ) ) {  return listOf ( expression . transform ( this @ JvmMultiFieldValueClassLowering , null ) )  }  val rootMfvcNode = replacements . getRootMfvcNode ( expression . type . erasedUpperBound )  val typeArguments = makeTypeArgumentsFromType ( expression . type as IrSimpleType )  val variables = rootMfvcNode . leaves . map {  savableStandaloneVariable ( type = it . type . substitute ( typeArguments ) , origin = IrDeclarationOrigin . IR_TEMPORARY_VARIABLE , saveVariable = :: variablesSaver , isVar = false , )  }  val instance = ValueDeclarationMfvcNodeInstance ( rootMfvcNode , typeArguments , variables )  val block = irBlock {  flattenExpressionTo ( expression , instance )  }  val expressions = removeExtraSetVariablesFromExpressionList ( block , variables )  if ( block . statements . isNotEmpty ( ) ) {  + block . unwrapBlock ( )  }  return expressions  }","docstring":"/**\n * Takes not transformed expression and returns its flattened transformed representation (expressions)\n */"}
{"signature":"private fun IrBlockBuilder . flattenExpressionTo ( expression : IrExpression , instance : MfvcNodeInstance )","body":"{  val rootNode = replacements . getRootMfvcNodeOrNull ( if ( expression is IrConstructorCall ) expression . symbol . owner . constructedClass else expression . type . erasedUpperBound )  val type = if ( expression is IrConstructorCall ) expression . symbol . owner . constructedClass . defaultType else expression . type  if ( type == context . irBuiltIns . nothingType ) {  return flattenExpressionTo ( irImplicitCast ( expression , instance . type ) , instance )  }  val lowering = this@JvmMultiFieldValueClassLowering  if ( rootNode == null || ! type . needsMfvcFlattening ( ) || instance . size ==  ) {  require ( instance . size ==  ) { \"\" }  instance . addSetterStatements ( this , listOf ( expression . transform ( lowering , null ) ) )  return  }  require ( rootNode . leavesCount == instance . size ) {  \"\"  }  if ( expression is IrWhen ) {  for ( branch in expression . branches ) {  branch . condition = branch . condition . transform ( lowering , null )  branch . result = irBlock {  flattenExpressionTo ( branch . result , instance )  } . unwrapBlock ( )  }  + expression  return  }  if ( expression is IrTry ) {  expression . tryResult = irBlock { flattenExpressionTo ( expression . tryResult , instance ) } . unwrapBlock ( )  expression . catches . replaceAll { irCatch ( it . catchParameter , irBlock { flattenExpressionTo ( it . result , instance ) } . unwrapBlock ( ) ) }  expression . finallyExpression = expression . finallyExpression ? . transform ( lowering , null )  + expression  return  }  if ( expression is IrConstructorCall ) {  val constructor = expression . symbol . owner  if ( constructor . isPrimary && constructor . constructedClass . isMultiFieldValueClass && constructor . origin != JvmLoweredDeclarationOrigin . STATIC_MULTI_FIELD_VALUE_CLASS_CONSTRUCTOR ) {  val oldArguments = List ( expression . valueArgumentsCount ) {  expression . getValueArgument ( it )  ? : error ( \"\" )  }  require ( rootNode . subnodes . size == oldArguments . size ) {  \"\"  }  for ( ( subnode , argument ) in rootNode . subnodes zip oldArguments ) {  flattenExpressionTo ( argument , instance [ subnode . name ] ! ! )  }  + irCall ( rootNode . primaryConstructorImpl . let { rootNode . throwWhenNotExternalIsNull ( it ) ; it } ) . apply {  copyTypeArgumentsFrom ( expression )  val flattenedGetterExpressions =  instance . makeFlattenedGetterExpressions ( this @ flattenExpressionTo , irCurrentClass , :: registerPossibleExtraBoxUsage )  for ( ( index , leafExpression ) in flattenedGetterExpressions . withIndex ( ) ) {  putValueArgument ( index , leafExpression )  }  }  return  }  }  val nullableTransformedExpression = expression . transform ( this @ JvmMultiFieldValueClassLowering , null )  val transformedExpression = castExpressionToNotNullTypeIfNeeded ( nullableTransformedExpression , instance . type )  val addedSettersToFlattened = valueDeclarationsRemapper . handleFlattenedGetterExpressions ( this , transformedExpression ) {  require ( it . size == instance . size ) { \"\" }  instance . makeSetterExpressions ( this , it )  }  if ( addedSettersToFlattened != null ) {  + addedSettersToFlattened  return  }  val expressionInstance = rootNode . createInstanceFromBox ( this , transformedExpression , AccessType . ChooseEffective , :: variablesSaver , )  require ( expressionInstance . size == instance . size ) { \"\" }  instance . addSetterStatements ( this , expressionInstance . makeFlattenedGetterExpressions ( this , irCurrentClass , :: registerPossibleExtraBoxUsage ) )  }","docstring":"/**\n * Takes not transformed expression and initialized given MfvcNodeInstance with transformed version of it\n */"}
{"signature":"private fun IrBody . removeAllExtraBoxes ( )","body":"{  accept ( object : IrElementVisitor < Unit , Boolean > {  override fun visitElement ( element : IrElement , data : Boolean ) {  element . acceptChildren ( this , true )  }  override fun visitTypeOperator ( expression : IrTypeOperatorCall , data : Boolean ) {  expression . acceptChildren ( this , data )  }  private tailrec fun getFunctionCallOrNull ( statement : IrStatement ) : IrCall ? = when ( statement ) {  is IrTypeOperatorCall -> getFunctionCallOrNull ( statement . argument )  is IrCall -> statement  else -> null  }  override fun visitFunction ( declaration : IrFunction , data : Boolean ) = Unit  override fun visitClass ( declaration : IrClass , data : Boolean ) = Unit  override fun visitContainerExpression ( expression : IrContainerExpression , data : Boolean ) {  handleStatementContainer ( expression , data )  }  override fun visitWhen ( expression : IrWhen , data : Boolean ) {  expression . acceptChildren ( this , data )  }  override fun visitCatch ( aCatch : IrCatch , data : Boolean ) {  aCatch . acceptChildren ( this , data )  }  override fun visitTry ( aTry : IrTry , data : Boolean ) {  aTry . tryResult . accept ( this , data )  aTry . catches . forEach { it . accept ( this , data ) }  aTry . finallyExpression ? . accept ( this , false )  }  override fun visitBranch ( branch : IrBranch , data : Boolean ) {  branch . condition . accept ( this , true )  branch . result . accept ( this , data )  }  override fun visitBlockBody ( body : IrBlockBody , data : Boolean ) {  handleStatementContainer ( body , data )  }  private fun handleStatementContainer ( expression : IrStatementContainer , resultIsUsed : Boolean ) {  for ( statement in expression . statements . subListWithoutLast (  ) ) {  statement . accept ( this , false )  }  expression . statements . lastOrNull ( ) ? . accept ( this , resultIsUsed )  val statementsToRemove = mutableSetOf < IrStatement > ( )  for ( statement in expression . statements . subListWithoutLast ( if ( resultIsUsed )  else  ) ) {  val call = getFunctionCallOrNull ( statement ) ? : continue  val node = replacements . getRootMfvcNodeOrNull ( call . type . erasedUpperBound ) ? : continue  if ( node . boxMethod == call . symbol . owner && List ( call . valueArgumentsCount ) { call . getValueArgument ( it ) } . all { it . isRepeatableGetter ( ) } ) {  statementsToRemove . add ( statement )  }  }  expression . statements . removeIf { it in statementsToRemove }  }  } , false )  }","docstring":"/**\n * Removes boxing when the result is not used\n */"}
{"signature":"private fun findNearestBlocksForVariables ( variables : Set < IrVariable > , body : BlockOrBody ) : Map < IrVariable , BlockOrBody ? >","body":"{  if ( variables . isEmpty ( ) ) return mapOf ( )  val variableUsages = mutableMapOf < BlockOrBody , MutableSet < IrVariable > > ( )  val childrenBlocks = mutableMapOf < BlockOrBody , MutableList < BlockOrBody > > ( )  body . element . acceptVoid ( object : IrElementVisitorVoid {  private val stack = mutableListOf < BlockOrBody > ( )  override fun visitElement ( element : IrElement ) {  element . acceptChildren ( this , null )  }  override fun visitBody ( body : IrBody ) {  currentStackElement ( ) ? . let { childrenBlocks . getOrPut ( it ) { mutableListOf ( ) } . add ( BlockOrBody . Body ( body ) ) }  stack . add ( BlockOrBody . Body ( body ) )  super . visitBody ( body )  require ( stack . removeLast ( ) == BlockOrBody . Body ( body ) ) { \"\" }  }  override fun visitBlock ( expression : IrBlock ) {  if ( expression is IrInlinedFunctionBlock ) {  return super . visitBlock ( expression )  }  currentStackElement ( ) ? . let { childrenBlocks . getOrPut ( it ) { mutableListOf ( ) } . add ( Block ( expression ) ) }  stack . add ( Block ( expression ) )  super . visitBlock ( expression )  require ( stack . removeLast ( ) == Block ( expression ) ) { \"\" }  }  private fun currentStackElement ( ) = stack . lastOrNull ( )  override fun visitValueAccess ( expression : IrValueAccessExpression ) {  val valueDeclaration = expression . symbol . owner  if ( valueDeclaration is IrVariable && valueDeclaration in variables ) {  variableUsages . getOrPut ( currentStackElement ( ) ! ! ) { mutableSetOf ( ) } . add ( valueDeclaration )  }  super . visitValueAccess ( expression )  }  } )  fun dfs ( currentBlock : BlockOrBody , variable : IrVariable ) : BlockOrBody ? {  if ( variable in ( variableUsages [ currentBlock ] ? : listOf ( ) ) ) return currentBlock  val childrenResult = childrenBlocks [ currentBlock ] ? . mapNotNull { dfs ( it , variable ) } ? : listOf ( )  return when ( childrenResult . size ) {   -> return null   -> return childrenResult . single ( )  else -> currentBlock  }  }  return variables . associateWith { dfs ( body , it ) }  }","docstring":"/**\n * Finds the most narrow block or body which contains all usages of each of the given variables\n */"}
{"signature":"private fun BlockOrBody . makeBodyWithAddedVariables ( context : JvmBackendContext , variables : Set < IrVariable > , symbol : IrSymbol ) : IrElement","body":"{  if ( variables . isEmpty ( ) ) return element  extractVariablesSettersToOuterPossibleBlock ( variables )  val nearestBlocks = findNearestBlocksForVariables ( variables , this )  val containingVariables : Map < BlockOrBody , List < IrVariable > > = nearestBlocks . entries  . mapNotNull { ( k , v ) -> if ( v != null ) k to v else null }  . groupBy ( { ( _ , v ) -> v } , { ( k , _ ) -> k } )  return element . transform ( object : IrElementTransformerVoid ( ) {  private fun getFirstInnerStatement ( statement : IrStatement ) : IrStatement ? =  if ( statement is IrStatementContainer ) statement . statements . first ( ) . let ( :: getFirstInnerStatement ) else statement  private fun removeFirstInnerStatement ( statement : IrStatement ) : IrStatement ? {  if ( statement !is IrStatementContainer ) return null  val innerResult = removeFirstInnerStatement ( statement . statements [  ] )  return when {  innerResult != null -> statement . also { statement . statements [  ] = innerResult }  statement . statements . size >  -> statement . also { statement . statements . removeAt (  ) }  else -> null  }  }  private fun IrStatement . removeInnerEmptyBlocks ( ) {  if ( this !is IrContainerExpression || statements . isEmpty ( ) ) return  val emptyBlocks = statements . mapNotNull {  it . removeInnerEmptyBlocks ( )  if ( it is IrContainerExpression && it . statements . isEmpty ( ) ) it else null  }  statements . removeAll ( emptyBlocks )  }  private fun replaceSetVariableWithInitialization ( variables : List < IrVariable > , container : IrStatementContainer ) {  require ( variables . all { it . initializer == null } ) { \"\" }  val variableFirstUsage = variables . associateWith { v -> container . statements . firstOrNull { it . containsUsagesOf ( setOf ( v ) ) } }  val variableDeclarationPerStatement = variableFirstUsage . entries  . mapNotNull { ( variable , firstUsage ) -> if ( firstUsage == null ) null else firstUsage to variable }  . groupBy ( { ( k , _ ) -> k } , { ( _ , v ) -> v } )  if ( variableDeclarationPerStatement . isEmpty ( ) ) return  val newStatements = buildList {  for ( statement in container . statements ) {  statement . removeInnerEmptyBlocks ( )  if ( statement is IrContainerExpression && statement . statements . isEmpty ( ) ) continue  val varsBefore = variableDeclarationPerStatement [ statement ]  if ( varsBefore != null ) {  addAll ( varsBefore )  val innerStatement = getFirstInnerStatement ( statement )  if ( innerStatement is IrSetValue ) {  val assignedVariable = innerStatement . symbol . owner  if ( assignedVariable is IrVariable && assignedVariable in varsBefore && assignedVariable . initializer == null ) {  assignedVariable . initializer = innerStatement . value  addIfNotNull ( removeFirstInnerStatement ( statement ) )  continue  }  }  }  add ( statement )  }  }  container . statements . replaceAll ( newStatements )  }  override fun visitBlock ( expression : IrBlock ) : IrExpression {  containingVariables [ Block ( expression ) ] ? . let {  expression . transformChildrenVoid ( )  replaceSetVariableWithInitialization ( it , expression )  return expression  }  return super . visitBlock ( expression )  }  override fun visitBlockBody ( body : IrBlockBody ) : IrBody {  containingVariables [ BlockOrBody . Body ( body ) ] ? . let {  body . transformChildrenVoid ( )  replaceSetVariableWithInitialization ( it , body )  return body  }  return super . visitBlockBody ( body )  }  override fun visitExpressionBody ( body : IrExpressionBody ) : IrBody {  val lowering = this  containingVariables [ BlockOrBody . Body ( body ) ] ? . takeIf { it . isNotEmpty ( ) } ? . let { bodyVars ->  return with ( context . createJvmIrBuilder ( symbol ) ) {  val blockBody = irBlock { + body . expression . transform ( lowering , null ) }  replaceSetVariableWithInitialization ( bodyVars , blockBody )  irExprBody ( blockBody )  }  }  return super . visitExpressionBody ( body )  }  } , null )  }","docstring":"/**\n * Adds declarations of the variables to the most narrow possible block or body.\n * It adds them before the first usage within the block and inlines initialization of them when possible.\n */"}
{"signature":"public fun < I > Operation < I , FloatData > . transpose ( sharpBlock : Transpose . ( ) -> Unit ) : Operation < I , FloatData >","body":"{  return PreprocessingPipeline ( this , Transpose ( ) . apply ( sharpBlock ) )  }","docstring":"/**\n * The DSL extension function for [Transpose] operation.\n */"}
{"signature":"internal expect fun < T > commonThreadLocal ( name : Symbol ) : CommonThreadLocal < T >","body":"internal expect fun < T > commonThreadLocal ( name : Symbol ) : CommonThreadLocal < T >","docstring":"/**\n * Create a thread-local storage for an object of type [T].\n *\n * If two different thread-local objects share the same [name], they will not necessarily share the same value,\n * but they may.\n * Therefore, use a unique [name] for each thread-local object.\n */"}
{"signature":"override fun matches ( startIndex : Int , testString : CharSequence , matchResult : MatchResultImpl ) : Int","body":"{  val start = matchResult . getConsumed ( groupIndex )  matchResult . setConsumed ( groupIndex , startIndex )  children . forEach {  val shift = it . matches ( startIndex , testString , matchResult )  if ( shift >=  ) {  return next . matches ( ( fSet as AtomicFSet ) . index , testString , matchResult )  }  }  matchResult . setConsumed ( groupIndex , start )  return -   }","docstring":"/** Returns startIndex+shift, the next position to match */"}
{"signature":"fun HTMLTag . unsafe ( block : Unsafe . ( ) -> Unit ) : Unit","body":"= consumer . onTagContentUnsafe ( block )","docstring":"/***\n * unsafe allows writing strings directly into the HTML DOM without any escaping.\n * In general, setting HTML without escaping is risky because it is easy to expose your users to a cross-site scripting (XSS) attack.\n * Consider using the builder DSL instead, or ensure that you are escaping the HTML properly.\n */"}
{"signature":"inline fun KtSourceElement . forEachChildOfType ( types : Set < IElementType > , depth : Int = -  , reverse : Boolean = false , processChild : ( KtSourceElement ) -> Unit , )","body":"= when ( this ) {  is KtPsiSourceElement -> psi . forEachChildOfType ( types , depth , reverse ) {  processChild ( it . toKtPsiSourceElement ( ) )  }  is KtLightSourceElement -> lighterASTNode . forEachChildOfType ( types , depth , reverse , treeStructure ) {  processChild ( it . toKtLightSourceElement ( treeStructure ) )  }  }","docstring":"/**\n * Iterates recursively over all children up to the given depth.\n * `processChild` is invoked for each child having a type in the `types` set.\n */"}
{"signature":"inline fun PsiElement . forEachChildOfType ( types : Set < IElementType > , depth : Int = -  , reverse : Boolean = false , processChild : ( PsiElement ) -> Unit , )","body":"= forEachChildOfType ( this , types , depth , reverse , getElementType = { it . node . elementType } , getChildren = { it . allChildren . toList ( ) } , processChild , )","docstring":"/**\n * See [KtSourceElement.forEachChildOfType]\n */"}
{"signature":"inline fun LighterASTNode . forEachChildOfType ( types : Set < IElementType > , depth : Int = -  , reverse : Boolean = false , treeStructure : FlyweightCapableTreeStructure < LighterASTNode > , processChild : ( LighterASTNode ) -> Unit , )","body":"= forEachChildOfType ( this , types , depth , reverse , getElementType = { it . tokenType } , getChildren = { it . getChildren ( treeStructure ) } , processChild , )","docstring":"/**\n * See [KtSourceElement.forEachChildOfType]\n */"}
{"signature":"internal fun KtLightSourceElement . buildChildSourceElement ( childNode : LighterASTNode ) : KtLightSourceElement","body":"{  val offsetDelta = startOffset - lighterASTNode . startOffset  return childNode . toKtLightSourceElement ( treeStructure , startOffset = childNode . startOffset + offsetDelta , endOffset = childNode . endOffset + offsetDelta )  }","docstring":"/**\n * Keeps 'padding' of parent node in child node\n */"}
{"signature":"fun FirImport . getSourceForImportSegment ( indexFromLast : Int ) : KtSourceElement ?","body":"{  var segmentSource : KtSourceElement = source ? : return null  repeat ( indexFromLast +  ) {  segmentSource = segmentSource . getChild ( IMPORT_PARENT_TOKEN_TYPES , depth =  ) ? : return null  }  return segmentSource . takeIf { it . elementType == KtNodeTypes . REFERENCE_EXPRESSION }  ? : segmentSource . getChild ( KtNodeTypes . REFERENCE_EXPRESSION , depth =  , reverse = true )  }","docstring":"/**\n * Returns a source element for the import segment that is [indexFromLast]th from last.\n */"}
{"signature":"fun FirImport . getLastImportedFqNameSegmentSource ( ) : KtSourceElement ?","body":"=  source ? . getChild ( KtNodeTypes . REFERENCE_EXPRESSION , reverse = true )","docstring":"/**\n * Looks for the source element of the last segment\n * of `importedFqName`.\n */"}
{"signature":"fun xceptionPrediction ( )","body":"{  runImageRecognitionPrediction ( modelType = TFModels . CV . Xception ( ) )  }","docstring":"/**\n * This example demonstrates the inference concept on Xception model:\n * - Model configuration, model weights and labels are obtained from [TFModelHub].\n * - Weights are loaded from .h5 file, configuration is loaded from .json file.\n * - Model predicts on a few images located in resources.\n * - Special preprocessing (used in Xception during training on ImageNet dataset) is applied to each image before prediction.\n *\n * NOTE: Input resolution is 299*299\n */"}
{"signature":"fun main ( ) : Unit","body":"= xceptionPrediction ( )","docstring":"/** */"}
{"signature":"fun cleanUp ( value : V ? )","body":"fun cleanUp ( value : V ? )","docstring":"/**\n * Cleans up after [value] has been removed from the cache or garbage-collected.\n *\n * [value] is non-null if it was removed from the cache and is still referable, or `null` if it has already been garbage-collected.\n */"}
{"signature":"operator fun get ( key : K ) : V ?","body":"= backingMap [ key ] ? . get ( )","docstring":"/**\n * Returns a value for the given [key] if it exists in the map. **Must be called in a read action.**\n */"}
{"signature":"fun computeIfAbsent ( key : K , computeValue : ( K ) -> V ) : V","body":"{  get ( key ) ? . let { return it }  return compute ( key ) { _ , currentValue -> currentValue ? : computeValue ( key ) }  ? : error ( \"\" )  }","docstring":"/**\n * If [key] is currently absent, attempts to add a value computed by [computeValue] to the cache. [computeValue] is invoked exactly once\n * if [key] is present, and otherwise never. **Must be called in a read action.**\n *\n * [computeValue] should not modify the cache during computation.\n *\n * @return The already present or newly computed value associated with [key].\n */"}
{"signature":"fun compute ( key : K , computeValue : ( K , V ? ) -> V ? ) : V ?","body":"{  var newValue : V ? = null  var removedRef : SoftReferenceWithCleanup < K , V > ? = null  val newRef = backingMap . compute ( key ) { _ , currentRef ->  val currentValue = currentRef ? . get ( )  newValue = computeValue ( key , currentValue )  when {  newValue == null -> {  removedRef = currentRef  null  }  newValue === currentValue -> currentRef  else -> {  removedRef = currentRef  createSoftReference ( key , newValue ! ! )  }  }  }  removedRef ? . performCleanup ( )  processQueue ( )  require ( newRef ? . get ( ) === newValue ) {  \"\"  }  return newValue  }","docstring":"/**\n * Replaces the current value at [key] with a new value computed by [computeValue]. [computeValue] is invoked exactly once. **Must be\n * called in a read action.**\n *\n * If the cache already contains a value `v` at [key], cleanup will be performed on it, *unless* the result of the computation is\n * referentially equal to `v`. This behavior enables computation functions to decide to retain an existing value, without triggering\n * cleanup.\n *\n * [computeValue] should not modify the cache during computation.\n *\n * @return The computed value now associated with [key].\n */"}
{"signature":"fun put ( key : K , value : V ) : V ?","body":"{  var oldValue : V ? = null  var removedRef : SoftReferenceWithCleanup < K , V > ? = null  backingMap . compute ( key ) { _ , currentRef ->  val currentValue = currentRef ? . get ( )  oldValue = currentValue  if ( value === currentValue ) {  return@compute currentRef  }  removedRef = currentRef  createSoftReference ( key , value )  }  removedRef ? . performCleanup ( )  processQueue ( )  return oldValue  }","docstring":"/**\n * Adds or replaces [value] to/in the cache at the given [key]. **Must be called in a read action.**\n *\n * As replacement constitutes removal, cleanup will be performed on the replaced value. When the existing value and the new value are\n * the same (referentially equal), cleanup will not be performed, because the existing value effectively wasn't removed from the cache.\n *\n * @return The old value that has been replaced, if any.\n */"}
{"signature":"fun remove ( key : K ) : V ?","body":"{  val ref = backingMap . remove ( key )  ref ? . performCleanup ( )  processQueue ( )  return ref ? . get ( )  }","docstring":"/**\n * Removes the value associated with [key] from the cache, performs cleanup on it, and returns it if it exists. **Must be called in a\n * read action.**\n */"}
{"signature":"fun clear ( )","body":"{  ApplicationManager . getApplication ( ) . assertWriteAccessAllowed ( )  backingMap . values . forEach { it . performCleanup ( ) }  backingMap . clear ( )  processQueue ( )  }","docstring":"/**\n * Removes all values from the cache and performs cleanup on them. **Must be called in a *write* action.**\n *\n * The write action requirement is due to the complexity associated with atomically clearing a concurrent cache while also performing\n * cleanup on exactly the cleared values. Because this cache implementation is used by components which operate in read and write\n * actions, requiring a write action is more economical than synchronizing on some cache-wide lock.\n */"}
{"signature":"fun isEmpty ( ) : Boolean","body":"{  processQueue ( )  return backingMap . isEmpty ( )  }","docstring":"/**\n * Returns whether the cache is empty. **Must be called in a read action.**\n */"}
{"signature":"private fun TestProject . assertConsecutiveBuildsProduceSameBinaries ( )","body":"{  fun File . relativeToProject ( ) = this . relativeTo ( projectPath . toFile ( ) )  fun Diff . reportString ( ) : String = when ( this ) {  is Diff . DifferentContent -> \"\"  is Diff . MissingFile -> \"\"  is Diff . TypeMismatch -> \"\"  }  buildGradleKts . appendText ( \"\"\"\"\"\" . trimIndent ( ) )  build ( \"\" )  build ( \"\" , \"\" ) {  tasks . forEach { task ->  assertTrue ( task . outcome in setOf ( TaskOutcome . SUCCESS , TaskOutcome . SKIPPED , TaskOutcome . NO_SOURCE ) , \"\" )  }  }  val repo1 = projectPath . resolve ( \"\" ) . toFile ( )  val repo2 = projectPath . resolve ( \"\" ) . toFile ( )  val diffs = diff ( repo1 , repo2 ) . filter { diff -> \"\" !in diff . fileName }  if ( diffs . isNotEmpty ( ) ) {  fail ( buildString {  appendLine ( \"\" )  diffs . forEach { diff ->  appendLine ( diff . reportString ( ) )  }  } )  }  }","docstring":"/**\n * This will test if building a project consecutively will result in the same binaries.\n * This method will inject code into the build.gradle.kts file to perform the following:\n *\n * - publish the project into a local repository (repo1)\n * - publish the project into a local repository (repo2) (whilst --rerun-tasks guarantees everything is re-built)\n * - Run the 'diff' tool to ensure that the published artifacts are equal in repo1 & repo2\n */"}
{"signature":"fun findMetadata ( classId : ClassId ) : InputStream ?","body":"fun findMetadata ( classId : ClassId ) : InputStream ?","docstring":"/**\n * @return an [InputStream] which should be used to load the .kotlin_metadata file for class with the given [classId].\n * [classId] identifies either a real top level class, or a package part (e.g. it can be \"foo/bar/_1Kt\")\n */"}
{"signature":"fun hasMetadataPackage ( fqName : FqName ) : Boolean","body":"fun hasMetadataPackage ( fqName : FqName ) : Boolean","docstring":"/**\n * @return `true` iff this finder is able to locate the package with the given [fqName], containing .kotlin_metadata files.\n * Note that returning `true` makes [MetadataPackageFragmentProvider] construct the package fragment for the package,\n * and that fact can alter the qualified name expression resolution in the compiler front-end\n */"}
{"signature":"fun findBuiltInsData ( packageFqName : FqName ) : InputStream ?","body":"fun findBuiltInsData ( packageFqName : FqName ) : InputStream ?","docstring":"/**\n * @return an [InputStream] which should be used to load the .kotlin_builtins file for package with the given [packageFqName].\n */"}
{"signature":"internal fun KtUserType . classId ( ) : ClassId","body":"{  val packageFragments = mutableListOf < String > ( )  val classFragments = mutableListOf < String > ( )  fun collectFragments ( type : KtUserType ) {  val userType = type . getStubOrPsiChild ( KtStubElementTypes . USER_TYPE )  if ( userType != null ) {  collectFragments ( userType )  }  val referenceExpression = type . referenceExpression as? KtNameReferenceExpression  if ( referenceExpression != null ) {  val referencedName = referenceExpression . getReferencedName ( )  val stub = referenceExpression . stub ? : loadStubByElement ( referenceExpression )  if ( stub is KotlinNameReferenceExpressionStubImpl && stub . isClassRef ) {  classFragments . add ( referencedName )  } else {  packageFragments . add ( referencedName )  }  }  }  collectFragments ( this )  return ClassId ( FqName . fromSegments ( packageFragments ) , FqName . fromSegments ( classFragments ) , isLocal = false )  }","docstring":"/**\n * Retrieves classId from [KtUserType] for compiled code only.\n *\n * It relies on [org.jetbrains.kotlin.psi.stubs.impl.KotlinNameReferenceExpressionStubImpl.isClassRef],\n * which is set during cls analysis only.\n */"}
{"signature":"fun tmpdir ( ) : String ?","body":"fun tmpdir ( ) : String ?","docstring":"/**\n * See https://nodejs.org/api/os.html#ostmpdir\n */"}
{"signature":"fun platform ( ) : String","body":"fun platform ( ) : String","docstring":"/**\n * See https://nodejs.org/api/os.html#osplatform\n */"}
{"signature":"public fun serialNameForJson ( descriptor : SerialDescriptor , elementIndex : Int , serialName : String ) : String","body":"public fun serialNameForJson ( descriptor : SerialDescriptor , elementIndex : Int , serialName : String ) : String","docstring":"/**\n * Accepts an original [serialName] (defined by property name in the class or [SerialName] annotation) and returns\n * a transformed serial name which should be used for serialization and deserialization.\n *\n * Besides string manipulation operations, it is also possible to implement transformations that depend on the [descriptor]\n * and its element (defined by [elementIndex]) currently being serialized.\n * It is guaranteed that `descriptor.getElementName(elementIndex) == serialName`.\n * For example, one can choose different transformations depending on [SerialInfo]\n * annotations (see [SerialDescriptor.getElementAnnotations]) or element optionality (see [SerialDescriptor.isElementOptional]).\n *\n * Note that invocations of this function are cached for performance reasons.\n * Caching strategy is an implementation detail and should not be assumed as a part of the public API contract, as it may be changed in future releases.\n * Therefore, it is essential for this function to be pure: it should not have any side effects, and it should\n * return the same String for a given [descriptor], [elementIndex], and [serialName], regardless of the number of invocations.\n */"}
{"signature":"fun main ( )","body":"{  val preprocessing = pipeline < BufferedImage > ( )  . crop {  left =   right =   top =   bottom =   }  . rotate {  degrees =   }  . resize {  outputHeight = IMAGE_SIZE . toInt ( )  outputWidth = IMAGE_SIZE . toInt ( )  interpolation = InterpolationType . NEAREST  }  . convert { colorMode = ColorMode . BGR }  . toFloatArray { }  . rescale {  scalingCoefficient =   }  val ( cifarImagesArchive , cifarLabelsArchive ) = cifar10Paths ( )  val y = extractCifar10LabelsAnsSort ( cifarLabelsArchive )  val dataset = OnFlyImageDataset . create ( File ( cifarImagesArchive ) , y , preprocessing )  val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO )  vgg11 . use {  it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY )  it . logSummary ( )  val start = System . currentTimeMillis ( )  it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE )  println ( \"\" )  it . save ( File ( PATH_TO_MODEL ) , writingMode = WritingMode . OVERRIDE )  val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  }  }","docstring":"/**\n * This example shows how to do image classification from scratch using [vgg11] model, without leveraging pre-trained weights.\n * We demonstrate the workflow on the Cifar'10 classification dataset.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n *\n * It includes:\n * - dataset loading from S3\n * - preprocessing DSL declaration\n * - [OnFlyImageDataset] dataset creation\n * - dataset splitting\n * - model compilation\n * - model training\n * - model export\n * - model evaluation\n */"}
{"signature":"private fun findReceiverFirExpression ( receiverExpression : KtExpression ) : FirExpression ?","body":"{  if ( receiverExpression is KtStatementExpression ) {  return null  }  val parentCall = receiverExpression . getQualifiedExpressionForReceiver ( )  if ( parentCall !is KtSafeQualifiedExpression ) {  return receiverExpression . getOrBuildFirOfType < FirExpression > ( firResolveSession )  }  val firSafeCall = parentCall . getOrBuildFirOfType < FirSafeCallExpression > ( firResolveSession )  return firSafeCall . checkedSubjectRef . value  }","docstring":"/**\n * Returns a [FirExpression] matching the given PSI [receiverExpression].\n *\n * @param receiverExpression a qualified expression receiver (e.g., `foo` in `foo?.bar()`, or in `foo.bar`).\n *\n * The function unwraps certain receiver expressions. For instance, for safe calls direct counterpart to a [KtSafeQualifiedExpression]\n * is (FirCheckedSafeCallSubject)[org.jetbrains.kotlin.fir.expressions.FirCheckedSafeCallSubject] which requires additional unwrapping\n * to be used for call resolution.\n */"}
{"signature":"internal fun < T : Any > registerEvent ( dispatcher : TestDispatcher , timeDeltaMillis : Long , marker : T , context : CoroutineContext , isCancelled : ( T ) -> Boolean ) : DisposableHandle","body":"{  require ( timeDeltaMillis >=  ) { \"\" }  checkSchedulerInContext ( this , context )  val count = count . getAndIncrement ( )  val isForeground = context [ BackgroundWork ] === null  return synchronized ( lock ) {  val time = addClamping ( currentTime , timeDeltaMillis )  val event = TestDispatchEvent ( dispatcher , count , time , marker as Any , isForeground ) { isCancelled ( marker ) }  events . addLast ( event )  sendDispatchEvent ( context )  DisposableHandle {  synchronized ( lock ) {  events . remove ( event )  }  }  }  }","docstring":"/**\n * Registers a request for the scheduler to notify [dispatcher] at a virtual moment [timeDeltaMillis] milliseconds\n * later via [TestDispatcher.processEvent], which will be called with the provided [marker] object.\n *\n * Returns the handler which can be used to cancel the registration.\n */"}
{"signature":"internal fun tryRunNextTaskUnless ( condition : ( ) -> Boolean ) : Boolean","body":"{  val event = synchronized ( lock ) {  if ( condition ( ) ) return false  val event = events . removeFirstOrNull ( ) ? : return false  if ( currentTime > event . time )  currentTimeAheadOfEvents ( )  currentTime = event . time  event  }  event . dispatcher . processEvent ( event . marker )  return true  }","docstring":"/**\n * Runs the next enqueued task, advancing the virtual time to the time of its scheduled awakening,\n * unless [condition] holds.\n */"}
{"signature":"public fun advanceUntilIdle ( ) : Unit","body":"= advanceUntilIdleOr { events . none ( TestDispatchEvent < * > :: isForeground ) }","docstring":"/**\n * Runs the enqueued tasks in the specified order, advancing the virtual time as needed until there are no more\n * tasks associated with the dispatchers linked to this scheduler.\n *\n * A breaking change from `TestCoroutineDispatcher.advanceTimeBy` is that it no longer returns the total number of\n * milliseconds by which the execution of this method has advanced the virtual time. If you want to recreate that\n * functionality, query [currentTime] before and after the execution to achieve the same result.\n */"}
{"signature":"internal fun advanceUntilIdleOr ( condition : ( ) -> Boolean )","body":"{  while ( true ) {  if ( ! tryRunNextTaskUnless ( condition ) )  return  }  }","docstring":"/**\n * [condition]: guaranteed to be invoked under the lock.\n */"}
{"signature":"public fun runCurrent ( )","body":"{  val timeMark = synchronized ( lock ) { currentTime }  while ( true ) {  val event = synchronized ( lock ) {  events . removeFirstIf { it . time <= timeMark } ? : return  }  event . dispatcher . processEvent ( event . marker )  }  }","docstring":"/**\n * Runs the tasks that are scheduled to execute at this moment of virtual time.\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public fun advanceTimeBy ( delayTimeMillis : Long ) : Unit","body":"= advanceTimeBy ( delayTimeMillis . milliseconds )","docstring":"/**\n * Moves the virtual clock of this dispatcher forward by [the specified amount][delayTimeMillis], running the\n * scheduled tasks in the meantime.\n *\n * Breaking changes from [TestCoroutineDispatcher.advanceTimeBy]:\n * - Intentionally doesn't return a `Long` value, as its use cases are unclear. We may restore it in the future;\n * please describe your use cases at [the issue tracker](https://github.com/Kotlin/kotlinx.coroutines/issues/).\n * For now, it's possible to query [currentTime] before and after execution of this method, to the same effect.\n * - It doesn't run the tasks that are scheduled at exactly [currentTime] + [delayTimeMillis]. For example,\n * advancing the time by one millisecond used to run the tasks at the current millisecond *and* the next\n * millisecond, but now will stop just before executing any task starting at the next millisecond.\n * - Overflowing the target time used to lead to nothing being done, but will now run the tasks scheduled at up to\n * (but not including) [Long.MAX_VALUE].\n *\n * @throws IllegalArgumentException if passed a negative [delay][delayTimeMillis].\n */"}
{"signature":"public fun advanceTimeBy ( delayTime : Duration )","body":"{  require ( ! delayTime . isNegative ( ) ) { \"\" }  val startingTime = currentTime  val targetTime = addClamping ( startingTime , delayTime . inWholeMilliseconds )  while ( true ) {  val event = synchronized ( lock ) {  val timeMark = currentTime  val event = events . removeFirstIf { targetTime > it . time }  when {  event == null -> {  currentTime = targetTime  return  }  timeMark > event . time -> currentTimeAheadOfEvents ( )  else -> {  currentTime = event . time  event  }  }  }  event . dispatcher . processEvent ( event . marker )  }  }","docstring":"/**\n * Moves the virtual clock of this dispatcher forward by [the specified amount][delayTime], running the\n * scheduled tasks in the meantime.\n *\n * @throws IllegalArgumentException if passed a negative [delay][delayTime].\n */"}
{"signature":"internal fun isIdle ( strict : Boolean = true ) : Boolean","body":"=  synchronized ( lock ) {  if ( strict ) events . isEmpty else events . none { ! it . isCancelled ( ) }  }","docstring":"/**\n * Checks that the only tasks remaining in the scheduler are cancelled.\n */"}
{"signature":"internal fun sendDispatchEvent ( context : CoroutineContext )","body":"{  dispatchEvents . trySend ( Unit )  if ( context [ BackgroundWork ] !== BackgroundWork )  dispatchEventsForeground . trySend ( Unit )  }","docstring":"/**\n * Notifies this scheduler about a dispatch event.\n *\n * [context] is the context in which the task will be dispatched.\n */"}
{"signature":"internal suspend fun receiveDispatchEvent ( )","body":"= dispatchEvents . receive ( )","docstring":"/**\n * Waits for a notification about a dispatch event.\n */"}
{"signature":"public fun < R > Sequence < * > . filterIsInstance ( klass : Class < R > ) : Sequence < R >","body":"{  @ Suppress ( \"\" )  return filter { klass . isInstance ( it ) } as Sequence < R >  }","docstring":"/**\n * Returns a sequence containing all elements that are instances of specified class.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstanceJVM\n */"}
{"signature":"public fun < C : MutableCollection < in R > , R > Sequence < * > . filterIsInstanceTo ( destination : C , klass : Class < R > ) : C","body":"{  @ Suppress ( \"\" )  for ( element in this ) if ( klass . isInstance ( element ) ) destination . add ( element as R )  return destination  }","docstring":"/**\n * Appends all elements that are instances of specified class to the given [destination].\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstanceToJVM\n */"}
{"signature":"public fun < T : Comparable < T > > Sequence < T > . toSortedSet ( ) : java . util . SortedSet < T >","body":"{  return toCollection ( java . util . TreeSet < T > ( ) )  }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n *\n * The operation is _terminal_.\n */"}
{"signature":"public fun < T > Sequence < T > . toSortedSet ( comparator : Comparator < in T > ) : java . util . SortedSet < T >","body":"{  return toCollection ( java . util . TreeSet < T > ( comparator ) )  }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n * \n * Elements in the set returned are sorted according to the given [comparator].\n *\n * The operation is _terminal_.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class )  @ OverloadResolutionByLambdaReturnType  @ kotlin . jvm . JvmName ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun < T > Sequence < T > . sumOf ( selector : ( T ) -> java . math . BigDecimal ) : java . math . BigDecimal","body":"{  var sum : java . math . BigDecimal =  . toBigDecimal ( )  for ( element in this ) {  sum += selector ( element )  }  return sum  }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the sequence.\n *\n * The operation is _terminal_.\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class )  @ OverloadResolutionByLambdaReturnType  @ kotlin . jvm . JvmName ( \"\" )  @ kotlin . internal . InlineOnly  public inline fun < T > Sequence < T > . sumOf ( selector : ( T ) -> java . math . BigInteger ) : java . math . BigInteger","body":"{  var sum : java . math . BigInteger =  . toBigInteger ( )  for ( element in this ) {  sum += selector ( element )  }  return sum  }","docstring":"/**\n * Returns the sum of all values produced by [selector] function applied to each element in the sequence.\n *\n * The operation is _terminal_.\n */"}
{"signature":"fun g ( )","body":"{  }","docstring":"/**\n * [X.YY.ZZ]\n */"}
{"signature":"private fun resolveSupertypesTree ( values : List < Supertypes > ) : List < SupertypesTree >","body":"{  return values . mapIndexed { index : Int , supertypes : Supertypes ->  val classifierIndex = classifiers . classifierIndices [ index ]  val resolver = SimpleCirSupertypesResolver ( classifiers . classifierIndices [ index ] , classifiers . commonDependencies )  val nodes = supertypes . filterIsInstance < CirClassType > ( ) . map { type -> createTypeNode ( classifierIndex , resolver , type ) }  SupertypesTree ( nodes )  }  }","docstring":"/**\n * For every supertype listed in [values] a full [SupertypesTree] will be resolved.\n * This tree represents the supertype-hierarchy:\n *\n * ```\n * interface A\n * interface B: A\n * interface C: B, A\n * ```\n *\n * will become a tree like\n * ```\n * C\n * |\\\n * | \\\n * B A\n * |\n * A\n *\n * ```\n *\n */"}
{"signature":"private fun buildSupertypesGroups ( trees : List < SupertypesTree > ) : List < SupertypesGroup >","body":"{  val groups = mutableListOf < SupertypesGroup > ( )  var allowClassTypes = true  trees . flatMap { tree -> tree . allNodes } . forEach { node ->  if ( node . isConsumed ) return@forEach  val candidateGroup = buildTypeGroup ( trees , node . type . classifierId ) ? : return@forEach  if ( containsAnyClassKind ( candidateGroup ) ) {  if ( ! allowClassTypes ) return@forEach  allowClassTypes = false  }  assignGroupToNodes ( candidateGroup )  groups . add ( candidateGroup )  }  return groups  }","docstring":"/**\n * Builds [SupertypesGroup] (a group representing one type for every platform) that will be enqueued for type commonization.\n * To find out which types shall be grouped this implementation will go through every single node in all trees (BFS!)\n * If a certain type can be found on all other platforms, then a group is build.\n * This types and all transitively \"covered\" supertypes will be marked as 'consumed' and therefore will be 'effectively removed'\n * from the tree.\n *\n * This grouping implementation will also be very careful about *not* grouping two groups that could effectively\n * represent a 'ClassKind' (to avoid commonizing with two abstract class supertypes)\n */"}
{"signature":"@ Suppress ( \"\" )  public fun < C > ColumnSet < C ? > . withoutNulls ( ) : ColumnSet < C & Any >","body":"=  transform { cols -> cols . filter { ! it . hasNulls ( ) } } as ColumnSet < C & Any >","docstring":"/**\n * @include [CommonWithoutNullsDocs]\n * @set [CommonWithoutNullsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[withoutNulls][ColumnSet.withoutNulls]`() }`\n */"}
{"signature":"public fun ColumnsSelectionDsl < * > . withoutNulls ( ) : ColumnSet < Any >","body":"=  asSingleColumn ( ) . colsWithoutNulls ( )","docstring":"/**\n * @include [CommonWithoutNullsDocs]\n * @set [CommonWithoutNullsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[withoutNulls][ColumnsSelectionDsl.colsWithoutNulls]`() }`\n */"}
{"signature":"public fun SingleColumn < DataRow < * > > . colsWithoutNulls ( ) : ColumnSet < Any >","body":"=  ensureIsColumnGroup ( ) . allColumnsInternal ( ) . withoutNulls ( )","docstring":"/**\n * @include [CommonWithoutNullsDocs]\n * @set [CommonWithoutNullsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[colsWithoutNulls][SingleColumn.colsWithoutNulls]`() }`\n */"}
{"signature":"public fun String . colsWithoutNulls ( ) : ColumnSet < Any >","body":"=  columnGroup ( this ) . colsWithoutNulls ( )","docstring":"/**\n * @include [CommonWithoutNullsDocs]\n * @set [CommonWithoutNullsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[colsWithoutNulls][String.colsWithoutNulls]`() }`\n */"}
{"signature":"public fun KProperty < * > . colsWithoutNulls ( ) : ColumnSet < Any >","body":"=  columnGroup ( this ) . colsWithoutNulls ( )","docstring":"/**\n * @include [CommonWithoutNullsDocs]\n * @set [CommonWithoutNullsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[colsWithoutNulls][KProperty.colsWithoutNulls]`() }`\n */"}
{"signature":"public fun ColumnPath . colsWithoutNulls ( ) : ColumnSet < Any >","body":"=  columnGroup ( this ) . colsWithoutNulls ( )","docstring":"/**\n * @include [CommonWithoutNullsDocs]\n * @set [CommonWithoutNullsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColGroup\"].`[colsWithoutNulls][ColumnPath.colsWithoutNulls]`() }`\n */"}
{"signature":"override fun fullyExpandedType ( type : KtType ) : KtType","body":"= type","docstring":"/** Expanded by default */"}
{"signature":"fun testDaemonExecutionViaIntermediateProcess ( )","body":"{  val clientAliveFile = FileUtil . createTempFile ( \"\" , \"\" )  val daemonOptions = makeTestDaemonOptions ( getTestName ( true ) )  val jar = testTempDir . absolutePath + File . separator + \"\"  val args = listOf ( File ( File ( System . getProperty ( \"\" ) , \"\" ) , \"\" ) . absolutePath , \"\" , \"\" , \"\" , daemonClientClassPath . joinToString ( File . pathSeparator ) { it . absolutePath } , KotlinCompilerClient :: class . qualifiedName ! ! ) +  daemonOptions . mappers . flatMap { it . toArgs ( COMPILE_DAEMON_CMDLINE_OPTIONS_PREFIX ) } +  compilerId . mappers . flatMap { it . toArgs ( COMPILE_DAEMON_CMDLINE_OPTIONS_PREFIX ) } +  File ( getHelloAppBaseDir ( ) , \"\" ) . absolutePath +  \"\" + jar  try {  var resOutput : String ? = null  var resCode : Int ? = null  val runnerProcess = ProcessBuilder ( args ) . redirectErrorStream ( true ) . start ( )  thread {  resOutput = runnerProcess . inputStream . reader ( ) . readText ( )  }  val waitThread = thread {  resCode = runnerProcess . waitFor ( )  }  waitThread . join ( TIMEOUT_DAEMON_RUNNER_EXIT_MS )  assertFalse ( \"\" , waitThread . isAlive )  assertEquals ( \"\" ,  , resCode )  }  finally {  if ( clientAliveFile . exists ( ) )  clientAliveFile . delete ( )  }  }","docstring":"/** Testing that running daemon in the child process doesn't block on s child process.waitFor()\n * that may happen on windows if simple processBuilder.start is used due to handles inheritance:\n * - process A starts process B using ProcessBuilder and waits for it using process.waitFor()\n * - process B starts daemon and exits\n * - due to default behavior of CreateProcess on windows, the handles of process B are inherited by the daemon\n * (in particular handles of stdin/out/err) and therefore these handles remain open while daemon is running\n * - (seems) due to the way how waiting for process is implemented, waitFor() hangs until daemon is killed\n * This seems a known problem, e.g. gradle uses a library with native code that prevents io handles inheritance when launching it's daemon\n * (the same solution is used in kotlin daemon client - see next commit)\n */"}
{"signature":"fun irisClassification ( )","body":"{  data . shuffle ( )  val dataset = OnHeapDataset . create ( extractX ( ) , extractY ( ) )  val ( train , test ) = dataset . split (  )  model . use {  it . compile ( optimizer = SGD ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY )  it . logSummary ( )  it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE )  val accuracy = model . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  }  }","docstring":"/**\n * This example shows how to do classification from scratch, starting from static Iris dataset, using simple Dense-based [model].\n *\n * It includes:\n * - dataset creation\n * - dataset splitting\n * - model compilation\n * - model training\n * - model evaluation\n */"}
{"signature":"fun main ( ) : Unit","body":"= irisClassification ( )","docstring":"/** */"}
{"signature":"override fun dispatch ( context : CoroutineContext , block : Runnable ) : Unit","body":"= SwingUtilities . invokeLater ( block )","docstring":"/** @suppress */"}
{"signature":"override fun scheduleResumeAfterDelay ( timeMillis : Long , continuation : CancellableContinuation < Unit > )","body":"{  val timer = schedule ( timeMillis ) {  with ( continuation ) { resumeUndispatched ( Unit ) }  }  continuation . invokeOnCancellation { timer . stop ( ) }  }","docstring":"/** @suppress */"}
{"signature":"override fun invokeOnTimeout ( timeMillis : Long , block : Runnable , context : CoroutineContext ) : DisposableHandle","body":"{  val timer = schedule ( timeMillis ) {  block . run ( )  }  return DisposableHandle { timer . stop ( ) }  }","docstring":"/** @suppress */"}
{"signature":"private fun isCastToAForwardDeclaration ( forwardDeclarationType : KotlinType ) : Boolean","body":"{  val forwardDeclarationClassDescriptor = forwardDeclarationType . constructor . declarationDescriptor  if ( forwardDeclarationClassDescriptor !is ClassDescriptor ) return false  return forwardDeclarationClassDescriptor . getForwardDeclarationKindOrNull ( ) != null  }","docstring":"/**\n * Here, we only check that we are casting to a forward declaration to suppress a CAST_NEVER_SUCCEEDS warning. The cast is further\n * checked in NativeForwardDeclarationRttiChecker.\n */"}
{"signature":"internal fun encodeDuration ( value : Duration ) : String","body":"= value . toComponents { seconds , nanoseconds ->  when {  nanoseconds ==  -> {  if ( seconds %  ==  ) {  if ( seconds %  ==  ) {  if ( seconds %  ==  ) {  \"\"  } else {  \"\"  }  } else {  \"\"  }  } else {  \"\"  }  }  nanoseconds %  ==  -> \"\"  nanoseconds %  ==  -> \"\"  else -> \"\"  }  }","docstring":"/**\n * Encode [Duration] objects using time unit short names: d, h, m, s, ms, us, ns.\n * Example:\n * 120.seconds -> 2 m;\n * 121.seconds -> 121 s;\n * 120.minutes -> 2 h;\n * 122.minutes -> 122 m;\n * 24.hours -> 1 d.\n * Encoding uses the largest time unit.\n * All restrictions on the maximum and minimum duration are specified in [Duration].\n * @return encoded value\n */"}
{"signature":"@ SuppressAnimalSniffer  internal fun Config . decodeJavaDuration ( path : String ) : JDuration","body":"= try {  getDuration ( path )  } catch ( e : ConfigException ) {  throw SerializationException ( \"\" , e )  }","docstring":"/**\n * Decode [JDuration] from [Config].\n * See https://github.com/lightbend/config/blob/main/HOCON.md#duration-format\n *\n * @param path in config\n */"}
{"signature":"fun getArchiveTaskOrNull ( kotlinCompilation : KotlinCompilation < * > ) : TaskProvider < out AbstractArchiveTask > ?","body":"fun getArchiveTaskOrNull ( kotlinCompilation : KotlinCompilation < * > ) : TaskProvider < out AbstractArchiveTask > ?","docstring":"/**\n * Returns archive task associated with [kotlinCompilation] instance.\n *\n * This method searches via Identity class (Project path, target and compilation names) of Compilations not by reference.\n * So it is safe to pass decorated or wrapped instances.\n */"}
{"signature":"private fun Iterable < Pair < String , String > > . aligned ( ) : List < String >","body":"{  val maxPrefixLength = maxOf { it . first . length }  return map { ( prefix , suffix ) -> prefix . padEnd ( maxPrefixLength ) + suffix }  }","docstring":"/**\n * For each pair in the list, pads its first element with a number of spaces and concatenates it with the second element in such a way\n * that the second elements of each pair are vertically aligned in concatenated strings.\n *\n * In other words, transforms this list:\n *\n * ```kotlin\n * listOf(\n * Pair(\"Capacity: \", \"normal\"),\n * Pair(\"Usability: \", \"very good\"),\n * Pair(\"Magic: \", \"minimal\"),\n * )\n * ```\n *\n * to this:\n *\n * ```kotlin\n * listOf(\n * \"Capacity: normal\",\n * \"Usability: very good\",\n * \"Magic: minimal\",\n * )\n * ```\n */"}
{"signature":"private fun parseSingleCheckBlock ( trimmedCheckLine : String , lineIterator : Iterator < String > ) : Pair < String ? , CheckBlock >","body":"{  assert ( trimmedCheckLine . startsWith ( CHECK_MARKER ) )  val colonIndex = trimmedCheckLine . indexOf ( '' )  if ( colonIndex <  ) {  error ( \"\" )  }  val backends = trimmedCheckLine  . substring ( CHECK_MARKER . length , colonIndex )  . splitToSequence ( whitespaceRegex )  . filter { it . isNotEmpty ( ) }  . map { enumValueOf < TargetBackend > ( it ) }  . toList ( )  val expectations = mutableListOf < String > ( )  for ( line in lineIterator ) {  val trimmed = line . trim ( )  if ( trimmed . startsWith ( CHECK_MARKER ) ) {  return trimmed to CheckBlock ( backends , expectations )  }  if ( trimmed . startsWith ( \"\" ) ) {  expectations . add ( trimmed )  } else {  break  }  }  return null to CheckBlock ( backends , expectations )  }","docstring":"/**\n * Parses a single check block.\n *\n * The valid `// CHECK` block is multiline string that starts with the `// CHECK` comment optionally followed by a whitespace-separated list\n * of [TargetBackend] names, and ending with a colon. After that, an arbitrary number of single-line comments may follow. The `// CHECK` block\n * ends with the first non-comment line.\n *\n * For example, this text\n * ```kotlin\n * // CHECK JS_IR NATIVE:\n * // Mangled name: #test(){}\n * // Public signature: /test|6620506149988718649[0]\n * // Public signature debug description: test(){}\n * fun test(): Int\n * ```\n * will be parsed into:\n * ```kotlin\n * CheckBlock(\n * backends = listOf(TargetBackend.JS_IR, TargetBackend.NATIVE),\n * expectations = listOf(\n * \"// Mangled name: #test(){}\",\n * \"// Public signature: /test|6620506149988718649[0]\",\n * \"// Public signature debug description: test(){}\",\n * )\n * )\n * ```\n *\n * @param trimmedCheckLine The line that starts with `// CHECK *:`\n * @param lineIterator The iterator over lines in the expectation file.\n * @return The line representing the beginning of the next `// CHECK` block (if there is one), and the parsed `// CHECK` block.\n */"}
{"signature":"internal fun isCaseMissedByK1Intersector ( a : TypeInfo , b : TypeInfo )","body":"=  a . canHaveSubtypesAccordingToK1 && b . canHaveSubtypesAccordingToK1","docstring":"/**\n * Unfortunately, intersections in K1 are not\n * smart enough: K1 doesn't say that the\n * intersection is empty if all the input\n * types \"can have subtypes\". For example,\n * K1 thinks that type parameters always\n * allow subtypes, so it won't report\n * empty intersections for them regardless\n * the bounds.\n *\n * See: [org.jetbrains.kotlin.types.TypeIntersector.intersectTypes]\n */"}
{"signature":"internal fun isCaseMissedByAdditionalK1IncompatibleEnumsCheck ( a : ConeKotlinType , b : ConeKotlinType , session : FirSession ) : Boolean","body":"{  return when {  ! a . isEnum ( session ) && ! b . isEnum ( session ) -> true  a . isNullable && b . isNullable -> true  a . isNothingOrNullableNothing || b . isNothingOrNullableNothing -> true  else -> ! a . isClass ( session ) || ! b . isClass ( session )  }  }","docstring":"/**\n * This function simply replicates `if` with\n * early returns from the corresponding function\n * in K1.\n *\n * See: [org.jetbrains.kotlin.types.isIncompatibleEnums]\n */"}
{"signature":"public fun decodeJsonElement ( ) : JsonElement","body":"public fun decodeJsonElement ( ) : JsonElement","docstring":"/**\n * Decodes the next element in the current input as [JsonElement].\n * The type of the decoded element depends on the current state of the input and, when received\n * by [serializer][KSerializer] in its [KSerializer.serialize] method, the type of the token directly matches\n * the [kind][SerialDescriptor.kind].\n *\n * This method is allowed to invoke only as the part of the whole deserialization process of the class,\n * calling this method after invoking [beginStructure] or any `decode*` method will lead to unspecified behaviour.\n * For example:\n * ```\n * class Holder(val value: Int, val list: List())\n *\n * // Holder deserialize method\n * fun deserialize(decoder: Decoder): Holder {\n * // Completely okay, the whole Holder object is read\n * val jsonObject = (decoder as JsonDecoder).decodeJsonElement()\n * // ...\n * }\n *\n * // Incorrect Holder deserialize method\n * fun deserialize(decoder: Decoder): Holder {\n * // decode \"value\" key unconditionally\n * decoder.decodeElementIndex(descriptor)\n * val value = decode.decodeInt()\n * // Incorrect, decoder is already in an intermediate state after decodeInt\n * val json = (decoder as JsonDecoder).decodeJsonElement()\n * // ...\n * }\n * ```\n */"}
{"signature":"private fun ContentPage . displayableName ( ) : String","body":"=  if ( this is WithDocumentables && documentables . all { it is DFunction } ) {  \"\"  } else {  name  }","docstring":"/**\n * Parenthesis is applied in 1 case:\n * - page only contains functions (therefore documentable from this page is [DFunction])\n */"}
{"signature":"fun buildSession ( environment : OrtEnvironment , options : SessionOptions ) : OrtSession","body":"fun buildSession ( environment : OrtEnvironment , options : SessionOptions ) : OrtSession","docstring":"/**\n * Method for building an [OrtSession] from the model source.\n */"}
{"signature":"public override fun initializeWith ( vararg executionProviders : ExecutionProvider )","body":"{  val uniqueProviders = collectProviders ( executionProviders )  if ( :: executionProvidersInUse . isInitialized && uniqueProviders == executionProvidersInUse ) {  return  }  if ( :: session . isInitialized ) {  session . close ( )  }  session = modelSource . buildSession ( env , buildSessionOptions ( uniqueProviders ) )  executionProvidersInUse = uniqueProviders  inputInfo = session . inputInfo  outputInfo = session . outputInfo  }","docstring":"/**\n * Initializes the model, if it's not initialized, or re-initializes it, depending on the execution providers.\n *\n * By default, the model is initialized with CPU execution provider with BFCArena memory allocator.\n * This method allows to set the execution provider to use.\n * If the model is already initialized, internal session will be closed and new one will be created.\n * If [executionProvidersInUse] is the same as the one passed, nothing will happen.\n * If execution provider is not supported, an exception will be thrown.\n * If empty list is passed, the model will be initialized with CPU execution provider.\n *\n * @param executionProviders list of execution providers to use.\n */"}
{"signature":"public fun predictRaw ( inputData : FloatData ) : Map < String , Any >","body":"{  return predict ( inputData ) { it . getValues ( ) }  }","docstring":"/**\n * Returns list of multidimensional arrays with data from model outputs.\n *\n * NOTE: This operation can be quite slow for high dimensional tensors,\n * use [predict] with custom output processing for better performance.\n */"}
{"signature":"public override fun < R > predict ( inputData : FloatData , extractResult : ( OrtSession . Result ) -> R ) : R","body":"{  return predict ( mapOf ( inputInfo . getName (  ) to inputData ) , extractResult )  }","docstring":"/**\n * Runs prediction on a given [inputData] and calls [extractResult] function to process output.\n * For models with multiple inputs, [inputData] is passed as a first input.\n * @see OrtSessionResultConverter\n */"}
{"signature":"public fun < R > predict ( inputs : Map < String , FloatData > , extractResult : ( OrtSession . Result ) -> R ) : R","body":"{  return predict ( inputs , outputInfo . keys . toList ( ) , extractResult )  }","docstring":"/**\n * Runs prediction on a given [inputs] and calls [extractResult] function to process output.\n * @see OrtSessionResultConverter\n */"}
{"signature":"override fun close ( )","body":"{  if ( :: session . isInitialized ) {  session . close ( )  }  env . close ( )  }","docstring":"/** Releases the ONNXRuntime - related resources. */"}
{"signature":"public fun load ( pathToModel : String , vararg executionProviders : ExecutionProvider = arrayOf ( CPU ( true ) ) ) : OnnxInferenceModel","body":"{  val model = OnnxInferenceModel ( pathToModel )  model . initializeWith ( * executionProviders )  return model  }","docstring":"/**\n * Loads model from serialized ONNX file.\n */"}
{"signature":"public fun load ( modelBytes : ByteArray , vararg executionProviders : ExecutionProvider = arrayOf ( CPU ( true ) ) ) : OnnxInferenceModel","body":"{  val model = OnnxInferenceModel ( modelBytes )  model . initializeWith ( * executionProviders )  return model  }","docstring":"/**\n * Loads model from a byte array representing an ONNX model.\n */"}
{"signature":"public fun captureOutput ( name : String , stdoutEnabled : Boolean = STDOUT_ENABLED_DEFAULT , main : ( out : PrintStream ) -> Unit ) : List < String >","body":"{  val oldOut = System . out  val oldErr = System . err  val logOut = if ( stdoutEnabled ) oldOut else NullOut  val bytesOut = ByteArrayOutputStream ( )  val tee = TeeOutput ( bytesOut , logOut )  val ps = PrintStream ( tee )  logOut . println ( \"\" )  System . setErr ( ps )  System . setOut ( ps )  val bytes : ByteArray  try {  try {  main ( logOut )  } catch ( e : Throwable ) {  System . err . print ( \"\" )  e . printStackTrace ( )  }  bytes = bytesOut . toByteArray ( )  if ( tee . flushLine ( ) ) logOut . println ( )  logOut . println ( \"\" )  } finally {  System . setOut ( oldOut )  System . setErr ( oldErr )  }  return ByteArrayInputStream ( bytes ) . bufferedReader ( ) . readLines ( )  }","docstring":"/**\n * Captures stdout and stderr of the specified block of code.\n *\n * The [name] is used to display which test is being run.\n * When [stdoutEnabled] is true, then everything is displayed to stdout when then code runs, too.\n */"}
{"signature":"public fun List < String > . verifyOutputLines ( vararg expected : String )","body":"{  val expectedLines = expected . toList ( )  if ( this != expectedLines ) {  val diff = computeLinesDiff ( expectedLines , this )  throw Exception ( \"\" )  }  }","docstring":"/**\n * Verifies that this lines captured by [captureOutput] are the same as [expected] one\n * and throws exception with the difference if not.\n */"}
{"signature":"public fun List < String > . verifyOutputLinesStart ( vararg expected : String )","body":"{  val expectedLines = expected . toList ( )  val prefix = subList (  , minOf ( size , expected . size ) )  if ( prefix != expectedLines ) {  val diff = computeLinesDiff ( expectedLines , this )  throw Exception ( \"\" )  }  }","docstring":"/**\n * Verifies that this lines captured by [captureOutput] start with the same list as [expected] one\n * and throws exception if not. Additional lines in the output are ignored. This is useful for\n * testing that the exception with the appropriate message was thrown\n */"}
{"signature":"fun FirSession . doUnify ( originalTypeProjection : ConeTypeProjection , typeWithParametersProjection : ConeTypeProjection , targetTypeParameters : Set < FirTypeParameterSymbol > , result : MutableMap < FirTypeParameterSymbol , ConeTypeProjection > , ) : Boolean","body":"{  val originalType = originalTypeProjection . type ? . lowerBoundIfFlexible ( ) ? . fullyExpandedType ( this )  val typeWithParameters = typeWithParametersProjection . type ? . lowerBoundIfFlexible ( ) ? . fullyExpandedType ( this )  if ( typeWithParameters is ConeErrorType ) {  return true  }  if ( originalType is ConeIntersectionType ) {  val intersectionResult = mutableMapOf < FirTypeParameterSymbol , ConeTypeProjection > ( )  for ( intersectedType in originalType . intersectedTypes ) {  val localResult = mutableMapOf < FirTypeParameterSymbol , ConeTypeProjection > ( )  if ( ! doUnify ( intersectedType , typeWithParametersProjection , targetTypeParameters , localResult ) ) return false  for ( ( typeParameter , typeProjection ) in localResult ) {  val existingTypeProjection = intersectionResult [ typeParameter ]  if ( existingTypeProjection == null || ( typeProjection is KotlinTypeMarker && existingTypeProjection is KotlinTypeMarker && AbstractTypeChecker . isSubtypeOf ( typeContext , typeProjection , existingTypeProjection ) ) ) {  intersectionResult [ typeParameter ] = typeProjection  }  }  }  for ( ( key , value ) in intersectionResult ) {  result [ key ] = value  }  return true  }  if ( originalTypeProjection . kind == typeWithParametersProjection . kind && originalTypeProjection . kind != ProjectionKind . INVARIANT && originalTypeProjection . kind != ProjectionKind . STAR ) {  return doUnify ( originalType ! ! , typeWithParameters ! ! , targetTypeParameters , result )  }  if ( originalType ? . nullability == ConeNullability . NULLABLE && typeWithParameters ? . nullability == ConeNullability . NULLABLE ) {  return doUnify ( originalTypeProjection . removeQuestionMark ( typeContext ) , typeWithParametersProjection . removeQuestionMark ( typeContext ) , targetTypeParameters , result , )  }  if ( originalTypeProjection . kind != typeWithParametersProjection . kind && typeWithParametersProjection . kind != ProjectionKind . INVARIANT ) {  return true  }  if ( typeWithParameters is ConeDefinitelyNotNullType ) {  return doUnify ( originalTypeProjection , typeWithParametersProjection . replaceType ( typeWithParameters . original ) , targetTypeParameters , result , )  }  if ( originalTypeProjection !is ConeStarProjection && originalType ? . nullability != ConeNullability . NULLABLE && typeWithParameters ? . nullability == ConeNullability . NULLABLE ) {  return true  }  val typeParameter = ( typeWithParameters as? ConeTypeParameterType ) ? . lookupTag ? . typeParameterSymbol  if ( typeParameter != null && typeParameter in targetTypeParameters ) {  if ( typeParameter in result && result [ typeParameter ] != originalTypeProjection ) return false  result [ typeParameter ] = originalTypeProjection  return true  }  if ( originalType ? . nullability ? . isNullable != typeWithParameters ? . nullability ? . isNullable ) return true  if ( originalTypeProjection . kind != typeWithParametersProjection . kind ) return true  if ( ( originalType as? ConeLookupTagBasedType ) ? . lookupTag != ( typeWithParameters as? ConeLookupTagBasedType ) ? . lookupTag ) return true  if ( originalType == null || typeWithParameters == null ) return true  if ( originalType . typeArguments . size != typeWithParameters . typeArguments . size ) {  return true  }  if ( originalType . typeArguments . isEmpty ( ) ) {  return true  }  for ( ( originalTypeArgument , typeWithParametersArgument ) in originalType . typeArguments . zip ( typeWithParameters . typeArguments ) ) {  if ( ! doUnify ( originalTypeArgument , typeWithParametersArgument , targetTypeParameters , result ) ) return false  }  return true  }","docstring":"/**\n * @return false does only mean that there were conflicted values for some type parameter. In all other cases, it returns true.\n * \"fail\" result in the comments below means that we can't infer anything meaningful in that branch of unification.\n * See more at org.jetbrains.kotlin.types.TypeUnifier.doUnify.\n * NB: \"Failed@ result of UnificationResultImpl is effectively unused in production.\n */"}
{"signature":"public fun serializer ( type : Type ) : KSerializer < Any >","body":"= EmptySerializersModule ( ) . serializer ( type )","docstring":"/**\n * Reflectively retrieves a serializer for the given [type].\n *\n * This overload is intended to be used as an interoperability layer for JVM-centric libraries,\n * that operate with Java's type tokens and cannot use Kotlin's [KType] or [typeOf].\n * For application-level serialization, it is recommended to use `serializer()` or `serializer(KType)` instead as it is aware of\n * Kotlin-specific type information, such as nullability, sealed classes and object singletons.\n *\n * Note that because [Type] does not contain any information about nullability, all created serializers\n * work only with non-nullable data.\n *\n * Not all [Type] implementations are supported.\n * [type] must be an instance of [Class], [GenericArrayType], [ParameterizedType] or [WildcardType].\n *\n * @throws SerializationException if serializer cannot be created (provided [type] or its type argument is not serializable).\n * @throws IllegalArgumentException if an unsupported subclass of [Type] is provided.\n */"}
{"signature":"public fun serializerOrNull ( type : Type ) : KSerializer < Any > ?","body":"= EmptySerializersModule ( ) . serializerOrNull ( type )","docstring":"/**\n * Reflectively retrieves a serializer for the given [type].\n *\n * This overload is intended to be used as an interoperability layer for JVM-centric libraries,\n * that operate with Java's type tokens and cannot use Kotlin's [KType] or [typeOf].\n * For application-level serialization, it is recommended to use `serializer()` or `serializer(KType)` instead as it is aware of\n * Kotlin-specific type information, such as nullability, sealed classes and object singletons.\n *\n * Note that because [Type] does not contain any information about nullability, all created serializers\n * work only with non-nullable data.\n *\n * Not all [Type] implementations are supported.\n * [type] must be an instance of [Class], [GenericArrayType], [ParameterizedType] or [WildcardType].\n *\n * @return [KSerializer] for given [type] or `null` if serializer cannot be created (given [type] or its type argument is not serializable).\n * @throws IllegalArgumentException if an unsupported subclass of [Type] is provided.\n */"}
{"signature":"public fun SerializersModule . serializer ( type : Type ) : KSerializer < Any >","body":"=  serializerByJavaTypeImpl ( type , failOnMissingTypeArgSerializer = true )  ? : type . prettyClass ( ) . serializerNotRegistered ( )","docstring":"/**\n * Retrieves a serializer for the given [type] using\n * reflective construction and [contextual][SerializersModule.getContextual] lookup as a fallback for non-serializable types.\n *\n * This overload is intended to be used as an interoperability layer for JVM-centric libraries,\n * that operate with Java's type tokens and cannot use Kotlin's [KType] or [typeOf].\n * For application-level serialization, it is recommended to use `serializer()` or `serializer(KType)` instead as it is aware of\n * Kotlin-specific type information, such as nullability, sealed classes and object singletons.\n *\n * Note that because [Type] does not contain any information about nullability, all created serializers\n * work only with non-nullable data.\n *\n * Not all [Type] implementations are supported.\n * [type] must be an instance of [Class], [GenericArrayType], [ParameterizedType] or [WildcardType].\n *\n * @throws SerializationException if serializer cannot be created (provided [type] or its type argument is not serializable).\n * @throws IllegalArgumentException if an unsupported subclass of [Type] is provided.\n */"}
{"signature":"public fun SerializersModule . serializerOrNull ( type : Type ) : KSerializer < Any > ?","body":"=  serializerByJavaTypeImpl ( type , failOnMissingTypeArgSerializer = false )","docstring":"/**\n * Retrieves a serializer for the given [type] using\n * reflective construction and [contextual][SerializersModule.getContextual] lookup as a fallback for non-serializable types.\n *\n * This overload is intended to be used as an interoperability layer for JVM-centric libraries,\n * that operate with Java's type tokens and cannot use Kotlin's [KType] or [typeOf].\n * For application-level serialization, it is recommended to use `serializer()` or `serializer(KType)` instead as it is aware of\n * Kotlin-specific type information, such as nullability, sealed classes and object singletons.\n *\n * Note that because [Type] does not contain any information about nullability, all created serializers\n * work only with non-nullable data.\n *\n * Not all [Type] implementations are supported.\n * [type] must be an instance of [Class], [GenericArrayType], [ParameterizedType] or [WildcardType].\n *\n * @return [KSerializer] for given [type] or `null` if serializer cannot be created (given [type] or its type argument is not serializable).\n * @throws IllegalArgumentException if an unsupported subclass of [Type] is provided.\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public fun Dispatchers . setMain ( dispatcher : CoroutineDispatcher )","body":"{  require ( dispatcher !is TestMainDispatcher ) { \"\" }  getTestMainDispatcher ( ) . setDispatcher ( dispatcher )  }","docstring":"/**\n * Sets the given [dispatcher] as an underlying dispatcher of [Dispatchers.Main].\n * All subsequent usages of [Dispatchers.Main] will use the given [dispatcher] under the hood.\n *\n * Using [TestDispatcher] as an argument has special behavior: subsequently-called [runTest], as well as\n * [TestScope] and test dispatcher constructors, will use the [TestCoroutineScheduler] of the provided dispatcher.\n *\n * It is unsafe to call this method if alive coroutines launched in [Dispatchers.Main] exist.\n */"}
{"signature":"@ ExperimentalCoroutinesApi  public fun Dispatchers . resetMain ( )","body":"{  getTestMainDispatcher ( ) . resetDispatcher ( )  }","docstring":"/**\n * Resets state of the [Dispatchers.Main] to the original main dispatcher.\n *\n * For example, in Android, the Main thread dispatcher will be set as [Dispatchers.Main].\n * This method undoes a dependency injection performed for tests, and so should be used in tear down (`@After`) methods.\n *\n * It is unsafe to call this method if alive coroutines launched in [Dispatchers.Main] exist.\n */"}
{"signature":"fun assertFileExists ( file : Path , )","body":"{  assert ( Files . exists ( file ) ) {  \"\"  }  assert ( Files . isRegularFile ( file ) ) {  \"\"  }  }","docstring":"/**\n * Asserts file under [file] path exists and is a regular file.\n */"}
{"signature":"fun GradleProject . assertFileInProjectExists ( pathToFile : String , )","body":"{  assertFileExists ( projectPath . resolve ( pathToFile ) )  }","docstring":"/**\n * Asserts file under [pathToFile] relative to the test project exists and is a regular file.\n */"}
{"signature":"fun GradleProject . assertFileInProjectNotExists ( pathToFile : String , )","body":"{  assertFileNotExists ( projectPath . resolve ( pathToFile ) )  }","docstring":"/**\n * Asserts file under [pathToFile] relative to the test project does not exist.\n */"}
{"signature":"fun assertSymlinkExists ( path : Path , )","body":"{  assert ( Files . exists ( path ) ) {  \"\"  }  assert ( Files . isSymbolicLink ( path ) ) {  \"\"  }  }","docstring":"/**\n * Asserts symlink under [path] exists and is a symlink\n */"}
{"signature":"fun TestProject . assertSymlinkInProjectExists ( pathToFile : String , )","body":"{  assertSymlinkExists ( projectPath . resolve ( pathToFile ) )  }","docstring":"/**\n * Asserts symlink under [pathToFile] relative to the test project exists and is a symlink.\n */"}
{"signature":"fun GradleProject . assertDirectoryInProjectExists ( pathToDir : String , )","body":"= assertDirectoryExists ( projectPath . resolve ( pathToDir ) )","docstring":"/**\n * Asserts directory under [pathToDir] relative to the test project exists and is a directory.\n */"}
{"signature":"fun assertDirectoryExists ( dirPath : Path , message : String ? = null , )","body":"= assertDirectoriesExist ( dirPath , message = message )","docstring":"/**\n * Asserts directory under [dirPath] exists and is a directory.\n */"}
{"signature":"fun GradleProject . assertFileInProjectContains ( pathToFile : String , vararg expectedText : String , )","body":"{  assertFileContains ( projectPath . resolve ( pathToFile ) , * expectedText )  }","docstring":"/**\n * Asserts file under [pathToFile] relative to the test project exists and contains all the lines from [expectedText]\n */"}
{"signature":"fun GradleProject . assertFileInProjectDoesNotContain ( pathToFile : String , vararg unexpectedText : String , )","body":"{  assertFileDoesNotContain ( projectPath . resolve ( pathToFile ) , * unexpectedText )  }","docstring":"/**\n * Asserts file under [pathToFile] relative to the test project exists and does not contain any line from [unexpectedText]\n */"}
{"signature":"fun assertFileContains ( file : Path , vararg expectedText : String , ) : String","body":"{  return assertFilesCombinedContains ( listOf ( file ) , * expectedText )  }","docstring":"/**\n * Asserts file under [file] exists and contains all the lines from [expectedText]\n *\n * @return the content of the [file]\n */"}
{"signature":"fun assertFilesCombinedContains ( files : List < Path > , vararg expectedText : String , ) : String","body":"{  files . forEach { assertFileExists ( it ) }  val text = files . joinToString ( separator = \"\" ) {  it . readText ( )  }  val textNotInTheFile = expectedText . filterNot { text . contains ( it ) }  assert ( textNotInTheFile . isEmpty ( ) ) {  \"\"\"\"\"\" . trimMargin ( )  }  return text  }","docstring":"/**\n * Asserts files together contains all the lines from [expectedText]\n */"}
{"signature":"fun assertFileDoesNotContain ( file : Path , vararg unexpectedText : String , )","body":"{  assertFileExists ( file )  val text = file . readText ( )  val textInTheFile = unexpectedText . filter { text . contains ( it ) }  assert ( textInTheFile . isEmpty ( ) ) {  \"\"\"\"\"\" . trimMargin ( )  }  }","docstring":"/**\n * Asserts file under [file] exists and does not contain any line from [unexpectedText]\n */"}
{"signature":"fun assertFilesContentEquals ( expected : Path , actual : Path )","body":"{  assertFileExists ( expected )  assertFileExists ( actual )  assertContentEquals ( expected . readLines ( ) . asSequence ( ) , actual . readLines ( ) . asSequence ( ) , \"\" )  }","docstring":"/**\n * Asserts that the content of two files is equal.\n * @param expected The path to the expected file.\n * @param actual The path to the actual file.\n * @throws AssertionError if the contents of the two files are not equal.\n */"}
{"signature":"fun invoke ( phaseConfig : PhaseConfigurationService , phaserState : PhaserState < Input > , context : Context , input : Input ) : Output","body":"fun invoke ( phaseConfig : PhaseConfigurationService , phaserState : PhaserState < Input > , context : Context , input : Input ) : Output","docstring":"/**\n * Executes this compiler phase. It accepts some parameter of type [Input] and transforms it into [Output].\n *\n * @param phaseConfig Controls which parts of the compilation pipeline are enabled and how the compiler should validate their invariants.\n * @param phaserState The global context.\n * @param context The local context in which the compiler stores all the necessary information for the given phase.\n */"}
{"signature":"fun IdeaModule . excludeGeneratedGradleDsl ( layout : ProjectLayout )","body":"{  val generatedSrcDirs = listOf ( \"\" , \"\" , \"\" , )  excludeDirs . addAll ( layout . projectDirectory . asFile . walk ( ) . filter { it . isDirectory && it . parentFile . name in generatedSrcDirs } . flatMap { file ->  file . walk ( ) . maxDepth (  ) . filter { it . isDirectory } . toList ( )  } )  }","docstring":"/** exclude generated Gradle code, so it doesn't clog up search results */"}
{"signature":"fun Project . initIdeProjectLogo ( svgLogoPath : String )","body":"{  val logoSvg = rootProject . layout . projectDirectory . file ( svgLogoPath )  val ideaDir = rootProject . layout . projectDirectory . dir ( \"\" )  if ( logoSvg . asFile . exists ( ) && ideaDir . asFile . exists ( ) && ! ideaDir . file ( \"\" ) . asFile . exists ( ) && ! ideaDir . file ( \"\" ) . asFile . exists ( ) ) {  copy {  from ( logoSvg ) { rename { \"\" } }  into ( ideaDir )  }  }  }","docstring":"/** Sets a logo for project IDEs */"}
{"signature":"fun generatePrimaryConstructorOverloadsIfNeeded ( constructorDescriptor : ConstructorDescriptor , classBuilder : ClassBuilder , memberCodegen : MemberCodegen < * > , contextKind : OwnerKind , classOrObject : KtPureClassOrObject )","body":"{  val element = classOrObject . primaryConstructor ? : classOrObject  if ( ! generateOverloadsIfNeeded ( element , constructorDescriptor , constructorDescriptor , contextKind , classBuilder , memberCodegen ) && isEmptyConstructorNeeded ( constructorDescriptor , classOrObject ) ) {  generateOverloadWithSubstitutedParameters ( constructorDescriptor , constructorDescriptor , classBuilder , memberCodegen , element , contextKind , constructorDescriptor . countDefaultParameters ( ) )  }  }","docstring":"/**\n * If all of the parameters of the specified constructor declare default values,\n * generates a no-argument constructor that passes default values for all arguments.\n */"}
{"signature":"fun generateOverloadsIfNeeded ( methodElement : KtPureElement ? , functionDescriptor : FunctionDescriptor , delegateFunctionDescriptor : FunctionDescriptor , contextKind : OwnerKind , classBuilder : ClassBuilder , memberCodegen : MemberCodegen < * > ) : Boolean","body":"{  if ( functionDescriptor . findJvmOverloadsAnnotation ( ) == null ) return false  for ( i in  .. functionDescriptor . countDefaultParameters ( ) ) {  generateOverloadWithSubstitutedParameters ( functionDescriptor , delegateFunctionDescriptor , classBuilder , memberCodegen , methodElement , contextKind , i )  }  return true  }","docstring":"/**\n * If the function is annotated with [kotlin.jvm.JvmOverloads], generates Java methods that\n * have the default parameter values substituted. If a method has N parameters and M of which\n * have default values, M overloads are generated: the first one takes N-1 parameters (all but\n * the last one that takes a default value), the second takes N-2 parameters, and so on.\n *\n * @param functionDescriptor the method for which the overloads are generated\n * @param delegateFunctionDescriptor the method descriptor for the implementation that we need to call\n * (same as [functionDescriptor] in all cases except for companion object methods annotated with @JvmStatic,\n * where [functionDescriptor] is the static method in the main class and [delegateFunctionDescriptor] is the\n * implementation in the companion object class)\n * @return true if the overloads annotation was found on the element, false otherwise\n */"}
{"signature":"private fun generateOverloadWithSubstitutedParameters ( functionDescriptor : FunctionDescriptor , delegateFunctionDescriptor : FunctionDescriptor , classBuilder : ClassBuilder , memberCodegen : MemberCodegen < * > , methodElement : KtPureElement ? , contextKind : OwnerKind , substituteCount : Int )","body":"{  val typeMapper = state . typeMapper  val isStatic = DescriptorAsmUtil . isStaticMethod ( contextKind , functionDescriptor )  val baseMethodFlags = DescriptorAsmUtil . getCommonCallableFlags ( functionDescriptor , state ) and Opcodes . ACC_VARARGS . inv ( )  val remainingParameters = getRemainingParameters ( functionDescriptor . original , substituteCount )  val remainingParametersDeclarations =  remainingParameters . map { DescriptorToSourceUtils . descriptorToDeclaration ( it ) as? KtParameter }  val generateAsFinal =  ( functionDescriptor . modality == Modality . FINAL || state . languageVersionSettings . supportsFeature ( LanguageFeature . GenerateJvmOverloadsAsFinal ) ) &&  ! isJvmInterface ( functionDescriptor . containingDeclaration )  val flags =  baseMethodFlags or  ( if ( isStatic ) Opcodes . ACC_STATIC else  ) or  ( if ( generateAsFinal && functionDescriptor !is ConstructorDescriptor ) Opcodes . ACC_FINAL else  ) or  ( if ( remainingParameters . lastOrNull ( ) ? . varargElementType != null ) Opcodes . ACC_VARARGS else  )  val signature = typeMapper . mapSignatureWithCustomParameters ( functionDescriptor , contextKind , remainingParameters , false )  val mv = classBuilder . newMethod ( JvmDeclarationOrigin ( JvmDeclarationOriginKind . JVM_OVERLOADS , methodElement ? . psiOrParent , functionDescriptor , remainingParametersDeclarations ) , flags , signature . asmMethod . name , signature . asmMethod . descriptor , signature . genericsSignature , FunctionCodegen . getThrownExceptions ( functionDescriptor , typeMapper ) )  val skipNullabilityAnnotations = flags and Opcodes . ACC_PRIVATE !=  || flags and Opcodes . ACC_SYNTHETIC !=   AnnotationCodegen . forMethod ( mv , memberCodegen , state , skipNullabilityAnnotations )  . genAnnotations ( functionDescriptor , signature . returnType , functionDescriptor . returnType )  if ( state . classBuilderMode == ClassBuilderMode . KAPT3 ) {  mv . visitAnnotation ( ANNOTATION_TYPE_DESCRIPTOR_FOR_JVM_OVERLOADS_GENERATED_METHODS , false )  }  FunctionCodegen . generateParameterAnnotations ( functionDescriptor , mv , signature , remainingParameters , memberCodegen , state , skipNullabilityAnnotations )  if ( ! state . classBuilderMode . generateBodies ) {  FunctionCodegen . generateLocalVariablesForParameters ( mv , signature , functionDescriptor , null , Label ( ) , Label ( ) , remainingParameters , isStatic , state )  mv . visitEnd ( )  return  }  val frameMap = FrameMap ( )  val v = InstructionAdapter ( mv )  mv . visitCode ( )  val methodBegin = Label ( )  mv . visitLabel ( methodBegin )  val methodOwner = typeMapper . mapToCallableMethod ( delegateFunctionDescriptor , false ) . owner  if ( ! isStatic ) {  val thisIndex = frameMap . enterTemp ( AsmTypes . OBJECT_TYPE )  v . load ( thisIndex , methodOwner )  if ( functionDescriptor is ConstructorDescriptor ) {  val closure = state . bindingContext . get ( CodegenBinding . CLOSURE , functionDescriptor . constructedClass )  val captureThis = getDispatchReceiverParameterForConstructorCall ( functionDescriptor , closure )  if ( captureThis != null ) {  val outerIndex = frameMap . enterTemp ( AsmTypes . OBJECT_TYPE )  v . load ( outerIndex , typeMapper . mapType ( captureThis ) )  }  }  } else {  val delegateOwner = delegateFunctionDescriptor . containingDeclaration  if ( delegateOwner is ClassDescriptor && delegateOwner . isCompanionObject ) {  val singletonValue = StackValue . singleton ( delegateOwner , typeMapper )  singletonValue . put ( singletonValue . type , singletonValue . kotlinType , v )  }  }  val receiver = functionDescriptor . extensionReceiverParameter  if ( receiver != null ) {  val receiverKotlinType = receiver . returnType  val receiverType = typeMapper . mapType ( receiver )  val receiverIndex = frameMap . enter ( receiver , receiverType )  StackValue . local ( receiverIndex , receiverType , receiverKotlinType ) . put ( receiverType , receiverKotlinType , v )  }  for ( parameter in remainingParameters ) {  frameMap . enter ( parameter , typeMapper . mapType ( parameter ) )  }  val args = DefaultCallArgs ( functionDescriptor . valueParameters . size )  for ( parameterDescriptor in functionDescriptor . valueParameters ) {  val paramKotlinType = parameterDescriptor . type  val paramType = typeMapper . mapType ( paramKotlinType )  if ( parameterDescriptor in remainingParameters ) {  val index = frameMap . getIndex ( parameterDescriptor )  StackValue . local ( index , paramType , paramKotlinType ) . put ( paramType , paramKotlinType , v )  } else {  AsmUtil . pushDefaultValueOnStack ( paramType , v )  args . mark ( parameterDescriptor . index )  }  }  for ( mask in args . toInts ( ) ) {  v . iconst ( mask )  }  v . aconst ( null )  val defaultMethod = typeMapper . mapDefaultMethod ( delegateFunctionDescriptor , contextKind )  if ( functionDescriptor is ConstructorDescriptor && ! functionDescriptor . containingDeclaration . isInlineClass ( ) ) {  v . invokespecial ( methodOwner . internalName , defaultMethod . name , defaultMethod . descriptor , false )  } else {  v . invokestatic ( methodOwner . internalName , defaultMethod . name , defaultMethod . descriptor , false )  }  v . areturn ( signature . returnType )  val methodEnd = Label ( )  mv . visitLabel ( methodEnd )  val thisType = functionDescriptor . dispatchReceiverParameter ? . type ? . asmType ( typeMapper )  FunctionCodegen . generateLocalVariablesForParameters ( mv , signature , functionDescriptor , thisType , methodBegin , methodEnd , remainingParameters , isStatic , state )  FunctionCodegen . endVisit ( mv , null , methodElement )  }","docstring":"/**\n * Generates an overload for [functionDescriptor] that substitutes default values for the last\n * [substituteCount] parameters that have default values.\n *\n * @param functionDescriptor the method for which the overloads are generated\n * @param delegateFunctionDescriptor the method descriptor for the implementation that we need to call\n * (same as [functionDescriptor] in all cases except for companion object methods annotated with @JvmStatic,\n * where [functionDescriptor] is the static method in the main class and [delegateFunctionDescriptor] is the\n * implementation in the companion object class)\n * @param methodElement the PSI element for the method implementation (used in diagnostic messages only)\n */"}
{"signature":"@ JvmOverloads  fun Project . kotlinTest ( suffix : String ? = null , classifier : String ? = null ) : Any","body":"{  return if ( kotlinBuildProperties . isInJpsBuildIdeaSync ) {  kotlinDep ( listOfNotNull ( \"\" , suffix ? . lowercase ( ) ) . joinToString ( \"\" ) , bootstrapKotlinVersion , classifier )  } else {  val elementsType = when ( classifier ) {  null -> \"\"  \"\" -> \"\"  else -> error ( \"\" )  }  val configuration = when ( suffix ? . lowercase ( ) ) {  null -> classifier ? . let { \"\" }  \"\" -> \"\"  \"\" -> \"\"  \"\" -> \"\"  \"\" -> \"\"  else -> error ( \"\" )  }  dependencies . project ( \"\" , configuration )  }  }","docstring":"/**\n * Use this function to declare a dependency on kotlin-test project artifacts.\n *\n * It creates either a project dependency or a binary dependency on bootstrap artifacts when JPS build is imported.\n *\n * @param suffix Supported suffixes are:\n * - `null` for the default project dependency, variant is resolved by attributes\n * - `junit`, `junit5`, `testng` - jvm variants with annotation typealiases for different test frameworks,\n * - `js` - js variant with assertions and annotations\n * @param classifier Supported classifiers are: `null` for the runtime artifact, `sources` for the sources jar artifact\n */"}
{"signature":"fun additionalTrainingAndFreezing ( )","body":"{  val ( train , test ) = fashionMnist ( )  val jsonConfigFile = getJSONConfigFile ( )  val model = Sequential . loadModelConfiguration ( jsonConfigFile )  model . use {  it . layers . filterIsInstance < Conv2D > ( ) . forEach ( Layer :: freeze )  it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY )  it . logSummary ( )  val hdfFile = getWeightsFile ( )  it . loadWeights ( hdfFile )  val accuracyBefore = it . evaluate ( dataset = test , batchSize =  ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  it . fit ( dataset = train , validationRate =  , epochs =  , trainBatchSize =  , validationBatchSize =  , )  val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize =  ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  }  }","docstring":"/**\n * This example demonstrates the transfer learning concept:\n * - Weights are loaded from .h5 file, configuration is loaded from .json file.\n * - Conv2D layer is added to the new Neural Network, its weights are frozen, Dense layers are added too and its weights are not frozen, and can be changed during the training.\n * - No new layers are added.\n *\n * NOTE: Model and weights are resources in `examples` module.\n */"}
{"signature":"fun main ( ) : Unit","body":"= additionalTrainingAndFreezing ( )","docstring":"/** */"}
{"signature":"fun withFile ( firFile : FirFile , action : ( ) -> Unit ) : Unit","body":"= action ( )","docstring":"/**\n * Access to [FirFile] declaration will be performed inside [action].\n */"}
{"signature":"fun withRegularClass ( firClass : FirRegularClass , action : ( ) -> Unit ) : Unit","body":"= action ( )","docstring":"/**\n * Access to elements inside [FirRegularClass] will be performed inside [action].\n * Will be called for each nested [FirRegularClass] on the path.\n */"}
{"signature":"fun withScript ( firScript : FirScript , action : ( ) -> Unit ) : Unit","body":"= action ( )","docstring":"/**\n * Access to elements inside [FirScript] will be performed inside [action].\n */"}
{"signature":"fun performAction ( element : FirElementWithResolveState )","body":"fun performAction ( element : FirElementWithResolveState )","docstring":"/**\n * This method will be performed on some target element depends on [LLFirResolveTarget] implementation.\n */"}
{"signature":"@ Suppress ( \"\" )  internal fun String . splitQuotedArgs ( ) : List < String >","body":"=  Regex ( \"\"\"\"\"\" ) . findAll ( this ) . map {  it . value . replace ( \"\" , \"\" )  } . toList ( )","docstring":"/**\n * Splits a string using a whitespace characters as delimiters.\n * Ignores whitespaces in quotes and drops quotes, e.g. a string\n * `foo \"bar baz\" qux=\"quux\"` will be split into [\"foo\", \"bar baz\", \"qux=quux\"].\n */"}
{"signature":"fun KotlinNativeArtifactConfig . withPodspec ( configure : KotlinArtifactsPodspecExtension . ( ) -> Unit )","body":"{  val extension = cast < ExtensionAware > ( ) . kotlinArtifactsPodspecExtension  checkNotNull ( extension ) { \"\" }  extension . configure ( )  }","docstring":"/**\n * Extends a KotlinArtifact with a corresponding Podspec\n *\n * Only needed in *.kts build files. In Groovy you can use the same syntax but without explicit extension import\n */"}
{"signature":"fun getSession ( module : KtModule ) : LLFirSession","body":"{  return getSession ( module , preferBinary = true )  }","docstring":"/**\n * Returns an [LLFirSession] for the [module].\n * For a binary module, the resulting session will be a binary (non-resolvable) one.\n */"}
{"signature":"fun getResolvableSession ( module : KtModule ) : LLFirResolvableModuleSession","body":"{  return getSession ( module , preferBinary = false ) as LLFirResolvableModuleSession  }","docstring":"/**\n * Returns an analyzable [LLFirSession] for the module.\n * For a binary module, the resulting session will still be a resolvable one.\n *\n * Note: prefer using [getSession] unless you need to perform resolution actively.\n * Resolvable sessions for libraries are much less performant.\n */"}
{"signature":"public fun RegExp . reset ( )","body":"{  lastIndex =   }","docstring":"/**\n * Resets the regular expression so that subsequent [RegExp.test] and [RegExp.exec] calls will match starting with the beginning of the input string.\n */"}
{"signature":"public inline operator fun RegExpMatch . get ( index : Int ) : String ?","body":"= asDynamic ( ) [ index ]","docstring":"/**\n * Returns the entire text matched by [RegExp.exec] if the [index] parameter is 0, or the text matched by the capturing parenthesis\n * at the given index.\n */"}
{"signature":"public inline fun RegExpMatch . asArray ( ) : Array < out String ? >","body":"= unsafeCast < Array < out String ? > > ( )","docstring":"/**\n * Converts the result of [RegExp.exec] to an array where the first element contains the entire matched text and each subsequent\n * element is the text matched by each capturing parenthesis.\n */"}
{"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) )  @ DeprecatedSinceKotlin ( warningSince = \"\" )  @ Suppress ( \"\" )  @ ExperimentalStdlibApi  @ ExportForCompiler  @ OptIn ( ExperimentalNativeApi :: class , ObsoleteWorkersApi :: class )  public fun < T > createCleaner ( argument : T , block : ( T ) -> Unit ) : Cleaner","body":"=  kotlin . native . ref . createCleanerImpl ( argument , block ) as Cleaner","docstring":"/**\n * Creates an object with a cleanup associated.\n *\n * After the resulting object (\"cleaner\") gets deallocated by memory manager,\n * [block] is eventually called once with [argument].\n *\n * Example of usage:\n * ```\n * class ResourceWrapper {\n * private val resource = Resource()\n *\n * private val cleaner = createCleaner(resource) { it.dispose() }\n * }\n * ```\n *\n * When `ResourceWrapper` becomes unused and gets deallocated, its `cleaner`\n * is also deallocated, and the resource is disposed later.\n *\n * It is not specified which thread runs [block], as well as whether two or more\n * blocks from different cleaners can be run in parallel.\n *\n * Note: if [argument] refers (directly or indirectly) the cleaner, then both\n * might leak, and the [block] will not be called in this case.\n * For example, the code below has a leak:\n * ```\n * class LeakingResourceWrapper {\n * private val resource = Resource()\n * private val cleaner = createCleaner(this) { it.resource.dispose() }\n * }\n * ```\n * In this case cleaner's argument (`LeakingResourceWrapper`) can't be deallocated\n * until cleaner's block is executed, which can happen only strictly after\n * the cleaner is deallocated, which can't happen until `LeakingResourceWrapper`\n * is deallocated. So the requirements on object deallocations are contradictory\n * in this case, which can't be handled gracefully. The cleaner's block\n * is not executed then, and cleaner and its argument might leak\n * (depending on the implementation).\n *\n * [block] should not use `@ThreadLocal` globals, because it may\n * be executed on a different thread.\n *\n * If [block] throws an exception, the behavior is unspecified.\n *\n * Cleaners should not be kept in globals, because if cleaner is not deallocated\n * before exiting main(), it'll never get executed.\n * Use `Platform.isCleanersLeakCheckerActive` to warn about unexecuted cleaners.\n *\n * If cleaners are not GC'd before main() exits, then it's not guaranteed that\n * they will be run. Moreover, it depends on `Platform.isCleanersLeakCheckerActive`.\n * With the checker enabled, cleaners will be run (and therefore not reported as\n * unexecuted cleaners); with the checker disabled - they might not get run.\n *\n * @param argument must be shareable\n * @param block must not capture anything\n */"}
{"signature":"@ InternalForKotlinNative  @ OptIn ( kotlin . native . runtime . NativeRuntimeApi :: class , ObsoleteWorkersApi :: class )  public fun performGCOnCleanerWorker ( ) : Unit","body":"=  getCleanerWorker ( ) . execute ( TransferMode . SAFE , { } ) {  GC . collect ( )  } . result","docstring":"/**\n * Perform GC on a worker that executes Cleaner blocks.\n */"}
{"signature":"@ InternalForKotlinNative  @ OptIn ( ObsoleteWorkersApi :: class )  public fun waitCleanerWorker ( ) : Unit","body":"=  getCleanerWorker ( ) . execute ( TransferMode . SAFE , { } ) {  Unit  } . result","docstring":"/**\n * Wait for a worker that executes Cleaner blocks to complete its scheduled tasks.\n */"}
{"signature":"@ Suppress ( \"\" )  inline fun < reified T : Parcelable > parcelableCreator ( ) : Parcelable . Creator < T >","body":"=  T :: class . java . getDeclaredField ( \"\" ) . get ( null ) as? Parcelable . Creator < T >  ? : throw IllegalArgumentException ( \"\" )","docstring":"/**\n * Read the CREATOR field of the given [Parcelable] class. Calls to this function with\n * a concrete class will be optimized to a direct field access.\n */"}
{"signature":"@ Throws ( IOException :: class )  public fun detectObjects ( imageFile : File , topK : Int =  ) : List < DetectedObject >","body":"{  return detectObjects ( ImageConverter . toBufferedImage ( imageFile ) , topK )  }","docstring":"/**\n * Returns the detected object for the given image file sorted by the score.\n *\n * NOTE: this method includes the EfficientDet - related preprocessing.\n *\n * @param [imageFile] File, should be an image.\n * @param [topK] The number of the detected objects with the highest score to be returned.\n * @return List of [DetectedObject] sorted by score.\n */"}
{"signature":"fun lenetMnistWithCustomCallback ( )","body":"{  val ( train , test ) = mnist ( )  model . use {  it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY )  println ( it . kGraph )  it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE , callback = FitCallback ( ) )  val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE , callback = EvaluationCallback ( ) ) . metrics [ Metrics . ACCURACY ]  println ( \"\" )  val predictions = it . predictSoftly ( dataset = test , batchSize = TEST_BATCH_SIZE , callback = PredictCallback ( ) )  println ( \"\" )  }  }","docstring":"/**\n * This example shows how to do image classification from scratch using [model], without leveraging pre-trained weights or a pre-made model.\n * We demonstrate the workflow on the Mnist classification dataset.\n *\n * It includes:\n * - dataset loading from S3\n * - callback definitions\n * - TensorFlow graph printing\n * - model training with custom callback\n * - model evaluation with custom callback\n * - model prediction with custom callback\n */"}
{"signature":"fun main ( ) : Unit","body":"= lenetMnistWithCustomCallback ( )","docstring":"/** */"}
{"signature":"fun getTypeAsList ( nullableArray : kotlin . Boolean , typeFqName : kotlin . String ) : FieldType . ValueFieldType","body":"=  FieldType . ValueFieldType ( typeFqName = \"\" , )","docstring":"/** used for list of primitives (read as List) */"}
{"signature":"fun getTypeAsFrame ( nullable : kotlin . Boolean , markerName : kotlin . String ) : FieldType . FrameFieldType","body":"=  FieldType . FrameFieldType ( markerName = markerName . let { if ( nullable ) it . toNullable ( ) else it } , nullable = false , )","docstring":"/** used for list of objects (read as DataFrame) */"}
{"signature":"fun getTypeAsFrameList ( nullable : kotlin . Boolean , nullableArray : kotlin . Boolean , markerName : kotlin . String , ) : FieldType . ValueFieldType","body":"=  FieldType . ValueFieldType ( typeFqName = \"\" , )","docstring":"/** used for list of AdditionalProperty objects (read as List>) */"}
{"signature":"public fun < T > label ( column : ColumnReference < T > , ) : NonPositionalMapping < T , String >","body":"{  return addNonPositionalMapping < T , String > ( LABEL , column . name ( ) , null )  }","docstring":"/**\n * Maps the `label` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the color.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun < T > label ( column : KProperty < T > , ) : NonPositionalMapping < T , String >","body":"{  return addNonPositionalMapping < T , String > ( LABEL , column . name , null )  }","docstring":"/**\n * Maps the `label` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the color.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun label ( column : String , ) : NonPositionalMapping < Any ? , String >","body":"{  return addNonPositionalMapping < Any ? , String > ( LABEL , column , null )  }","docstring":"/**\n * Maps the `label` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the color.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun < T > label ( values : Iterable < T > , name : String ? = null , ) : NonPositionalMapping < T , String >","body":"{  return addNonPositionalMapping < T , String > ( LABEL , values . toList ( ) , name , null )  }","docstring":"/**\n * Maps the `label` aesthetic to iterable of values.\n *\n * @param values the iterable containing the values.\n * @param name optional name for this aesthetic mapping.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"public fun < T > label ( values : DataColumn < T > , ) : NonPositionalMapping < T , String >","body":"{  return addNonPositionalMapping < T , String > ( LABEL , values , null )  }","docstring":"/**\n * Maps the `label` aesthetic to a data column.\n *\n * @param values the data column to map to the color.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"}
{"signature":"private fun BaseKotlinScope . createProjectHierarchyWithPluginOnSub1 ( )","body":"{  settingsGradleKts {  resolve ( \"\" )  }  buildGradleKts {  resolve ( \"\" )  }  dir ( \"\" ) {  buildGradleKts {  resolve ( \"\" )  }  dir ( \"\" ) {  buildGradleKts {  resolve ( \"\" )  }  }  dir ( \"\" ) {  buildGradleKts {  resolve ( \"\" )  }  }  }  dir ( \"\" ) {  buildGradleKts {  resolve ( \"\" )  }  }  }","docstring":"/**\n * Sets up a project hierarchy like this:\n * ```\n * build.gradle.kts (without the plugin)\n * settings.gradle.kts (including refs to 4 subprojects)\n * sub1/\n * build.gradle.kts (with the plugin)\n * subsub1/build.gradle.kts\n * subsub2/build.gradle.kts\n * sub2/build.gradle.kts\n * ```\n */"}
{"signature":"public fun < T > use ( block : SampleAnalysisEnvironment . ( ) -> T ) : T","body":"public fun < T > use ( block : SampleAnalysisEnvironment . ( ) -> T ) : T","docstring":"/**\n * Creates and configures the sample analysis environment for a limited-time use.\n *\n * Configuring sample analysis environment is a rather expensive operation that takes up additional\n * resources since Dokka needs to configure and analyze source roots additional to the main ones.\n * It's best to limit the scope of use and the lifetime of the created environment\n * so that the resources could be freed as soon as possible.\n *\n * No specific cleanup is required by the caller - everything is taken care of automatically\n * as soon as you exit the [block] block.\n *\n * Usage example:\n * ```kotlin\n * // create a short-lived environment and resolve all the needed samples\n * val sample = sampleAnalysisEnvironmentCreator.use {\n * resolveSample(sampleSourceSet, \"org.jetbrains.dokka.sample.functionName\")\n * }\n * // process the samples\n * // ...\n * ```\n */"}
{"signature":"fun decodeCDPResponse ( message : String , serializerForMessageId : ( Int ) -> CDPMethodCallEncodingInfo ) : CDPResponse","body":"{  val jsonElement = json . parseToJsonElement ( message )  return when ( val id = jsonElement . jsonObject [ \"\" ] ? . jsonPrimitive ? . int ) {  null -> CDPResponse . Event ( decodeCDPEvent ( jsonElement ) )  else -> {  val serializer = when ( val encodingInfo = serializerForMessageId ( id ) ) {  is CDPMethodCallEncodingInfoImpl -> encodingInfo . serializer  is CDPMethodCallEncodingInfoPlainText -> null  }  val result = jsonElement . jsonObject [ \"\" ]  val error = jsonElement . jsonObject [ \"\" ]  if ( result != null ) {  CDPResponse . MethodInvocationResult ( id , serializer ? . let { json . decodeFromJsonElement ( it , result ) } ? : CDPMethodInvocationResultPlainText ( result . toString ( ) ) )  } else if ( error != null ) {  CDPResponse . Error ( id , json . decodeFromJsonElement ( error ) )  } else {  error ( \"\" )  }  }  }  }","docstring":"/**\n * Decodes an instance of [CDPResponse] from JSON-encoded [message].\n *\n * [serializerForMessageId] is used for retrieving additional information about how to decode the response for the given message id.\n */"}
{"signature":"private inline fun < reified Response : CDPMethodInvocationResult , reified Params : CDPRequestParams > encodeCDPMethodCall ( messageId : Int , methodName : String , params : Params ?  ) : Pair < String , CDPMethodCallEncodingInfo >","body":"{  val request = CDPRequest ( messageId , methodName , params )  return json . encodeToString ( request ) to  CDPMethodCallEncodingInfoImpl ( json . serializersModule . serializer < Response > ( ) )  }","docstring":"/**\n * Returns the JSON message for invoking the method, as well as the information about how to decode its result.\n */"}
{"signature":"suspend fun genericEvaluateRequest ( encodeMethodCallWithMessageId : ( Int ) -> Pair < String , CDPMethodCallEncodingInfo > ) : CDPMethodInvocationResult","body":"suspend fun genericEvaluateRequest ( encodeMethodCallWithMessageId : ( Int ) -> Pair < String , CDPMethodCallEncodingInfo > ) : CDPMethodInvocationResult","docstring":"/**\n * @param encodeMethodCallWithMessageId passed a message id, expected to return the JSON-encoded CDP message\n * and some information about how to decode the response.\n */"}
{"signature":"suspend fun enable ( )","body":"{  requestEvaluator . evaluateRequest < CDPMethodInvocationResultUnit > { messageId ->  encodeCDPMethodCall < CDPMethodInvocationResultUnit , CDPRequestParamsUnit > ( messageId , \"\" , null )  }  }","docstring":"/**\n * Enables reporting of execution contexts creation by means of [Runtime.Event.ExecutionContextCreated] event.\n * When the reporting gets enabled the event will be sent immediately for each existing execution context.\n *\n * See [Runtime.enable](https://chromedevtools.github.io/devtools-protocol/tot/Runtime/#method-enable)\n */"}
{"signature":"suspend fun runIfWaitingForDebugger ( )","body":"{  requestEvaluator . evaluateRequest < CDPMethodInvocationResultUnit > { messageId ->  encodeCDPMethodCall < CDPMethodInvocationResultUnit , CDPRequestParamsUnit > ( messageId , \"\" , null )  }  }","docstring":"/**\n * Tells inspected instance to run if it was waiting for debugger to attach.\n *\n * See [Runtime.runIfWaitingForDebugger](https://chromedevtools.github.io/devtools-protocol/tot/Runtime/#method-runIfWaitingForDebugger)\n */"}
{"signature":"suspend fun evaluate ( expression : String , contextId : ExecutionContextId ? = null )","body":"=  requestEvaluator . evaluateRequest < EvaluationResult > { messageId ->  encodeCDPMethodCall < EvaluationResult , EvaluateRequestParams > ( messageId , \"\" , EvaluateRequestParams ( expression , contextId ) )  }","docstring":"/**\n * Evaluates expression on global object.\n *\n * See [Runtime.evaluate](https://chromedevtools.github.io/devtools-protocol/tot/Runtime/#method-evaluate)\n *\n * @param expression Expression to evaluate.\n * @param contextId Specifies in which execution context to perform evaluation.\n * If the parameter is omitted the evaluation will be performed in the context of the inspected page.\n */"}
{"signature":"suspend fun enable ( )","body":"{  requestEvaluator . evaluateRequest < CDPMethodInvocationResultUnit > { messageId ->  encodeCDPMethodCall < CDPMethodInvocationResultUnit , CDPRequestParamsUnit > ( messageId , \"\" , null )  }  }","docstring":"/**\n * Enables reporting of execution contexts creation by means of [Runtime.Event.ExecutionContextCreated] event.\n * When the reporting gets enabled the event will be sent immediately for each existing execution context.\n *\n * See [Runtime.enable](https://chromedevtools.github.io/devtools-protocol/tot/Runtime/#method-enable)\n */"}
{"signature":"suspend fun resume ( )","body":"{  requestEvaluator . evaluateRequest < CDPMethodInvocationResultUnit > { messageId ->  encodeCDPMethodCall < CDPMethodInvocationResultUnit , ResumeRequestParams > ( messageId , \"\" , null )  }  }","docstring":"/**\n * Resumes JavaScript execution.\n *\n * See [Debugger.resume](https://chromedevtools.github.io/devtools-protocol/tot/Debugger/#method-resume)\n */"}
{"signature":"suspend fun setBreakpointByUrl ( lineNumber : Int , url : String , scriptHash : String ? = null , columnNumber : Int ? = null , condition : String ? = null )","body":"= requestEvaluator . evaluateRequest < SetBreakpointByUrlResult > { messageId ->  encodeCDPMethodCall < SetBreakpointByUrlResult , SetBreakpointByUrlRequestParams > ( messageId , \"\" , SetBreakpointByUrlRequestParams ( lineNumber , url , scriptHash , columnNumber , condition ) )  }","docstring":"/**\n * Sets JavaScript breakpoint at given location specified either by URL or URL regex.\n * Once this command is issued, all existing parsed scripts will have breakpoints resolved and returned in\n * [SetBreakpointByUrlResult.locations] property.\n * Further matching script parsing will result in subsequent [Debugger.Event.BreakpointResolved] events issued.\n *\n * See [Debugger.setBreakpointByUrl](https://chromedevtools.github.io/devtools-protocol/tot/Debugger/#method-setBreakpointByUrl)\n *\n * @param lineNumber Line number to set breakpoint at.\n * @param url URL of the resources to set breakpoint on.\n * @param scriptHash Script hash of the resources to set breakpoint on.\n * @param columnNumber Offset in the line to set breakpoint at.\n * @param condition Expression to use as a breakpoint condition.\n * When specified, debugger will only stop on the breakpoint if this expression evaluates to true.\n */"}
{"signature":"suspend fun setBreakpoint ( scriptId : Runtime . ScriptId , lineNumber : Int , columnNumber : Int ? = null , condition : String ? = null )","body":"= requestEvaluator . evaluateRequest < SetBreakpointResult > { messageId ->  encodeCDPMethodCall < SetBreakpointResult , SetBreakpointRequestParams > ( messageId , \"\" , SetBreakpointRequestParams ( Location ( scriptId , lineNumber , columnNumber ) , condition ) )  }","docstring":"/**\n * Sets JavaScript breakpoint at a given location.\n *\n * See [Debugger.setBreakpoint](https://chromedevtools.github.io/devtools-protocol/tot/Debugger/#method-setBreakpoint)\n *\n * @param scriptId Script identifier as reported in the [Debugger.Event.ScriptParsed].\n * @param lineNumber Line number in the script (0-based).\n * @param columnNumber Column number in the script (0-based).\n * @param condition Expression to use as a breakpoint condition.\n * When specified, debugger will only stop on the breakpoint if this expression evaluates to true.\n */"}
{"signature":"suspend fun setSkipAllPauses ( skip : Boolean )","body":"{  requestEvaluator . evaluateRequest < CDPMethodInvocationResultUnit > { messageId ->  encodeCDPMethodCall < CDPMethodInvocationResultUnit , SetSkipAllPausesRequestParams > ( messageId , \"\" , SetSkipAllPausesRequestParams ( skip ) )  }  }","docstring":"/**\n * Makes page not interrupt on any pauses (breakpoint, exception, dom exception etc).\n *\n * See [Debugger.setSkipAllPauses](https://chromedevtools.github.io/devtools-protocol/tot/Debugger/#method-setSkipAllPauses)\n *\n * @param skip New value for skip pauses state.\n */"}
{"signature":"suspend fun stepInto ( )","body":"{  requestEvaluator . evaluateRequest < CDPMethodInvocationResultUnit > { messageId ->  encodeCDPMethodCall < CDPMethodInvocationResultUnit , CDPRequestParamsUnit > ( messageId , \"\" , null )  }  }","docstring":"/**\n * Steps into the function call.\n *\n * See [Debugger.stepInto](https://chromedevtools.github.io/devtools-protocol/tot/Debugger/#method-stepInto)\n */"}
{"signature":"suspend fun evaluateOnCallFrame ( callFrameId : CallFrameId , expression : String , returnByValue : Boolean ? = null , )","body":"= requestEvaluator . evaluateRequest < Runtime . EvaluationResult > { messageId ->  encodeCDPMethodCall < Runtime . EvaluationResult , EvaluateOnCallFrameRequestParams > ( messageId , \"\" , EvaluateOnCallFrameRequestParams ( callFrameId , expression , returnByValue ) )  }","docstring":"/**\n * Evaluates expression on a given call frame.\n *\n * See [Debugger.evaluateOnCallFrame](https://chromedevtools.github.io/devtools-protocol/tot/Debugger/#method-evaluateOnCallFrame)\n *\n * @param callFrameId Call frame identifier to evaluate on.\n * @param expression Expression to evaluate.\n * @param returnByValue Whether the result is expected to be a JSON object that should be sent by value.\n */"}
{"signature":"@ BetaInteropApi  public fun getOriginalKotlinClass ( objCClass : ObjCClass ) : KClass < * > ?","body":"{  val typeInfo = getTypeInfoForClass ( objCClass . objcPtr ( ) )  if ( typeInfo . isNull ( ) ) return null  return KClassImpl < Any > ( typeInfo )  }","docstring":"/**\n * If [objCClass] is a class generated to Objective-C header for Kotlin class,\n * returns [KClass] for that original Kotlin class.\n *\n * Otherwise returns `null`.\n */"}
{"signature":"@ BetaInteropApi  public fun getOriginalKotlinClass ( objCProtocol : ObjCProtocol ) : KClass < * > ?","body":"{  val typeInfo = getTypeInfoForProtocol ( objCProtocol . objcPtr ( ) )  if ( typeInfo . isNull ( ) ) return null  return KClassImpl < Any > ( typeInfo )  }","docstring":"/**\n * If [objCProtocol] is a protocol generated to Objective-C header for Kotlin class,\n * returns [KClass] for that original Kotlin class.\n *\n * Otherwise returns `null`.\n */"}
{"signature":"public fun format ( columnSeparator : String = \"\" , lineSeparatorSymbol : Char = '' , thickLineSeparatorSymbol : Char = '' ) : List < String >","body":"public fun format ( columnSeparator : String = \"\" , lineSeparatorSymbol : Char = '' , thickLineSeparatorSymbol : Char = '' ) : List < String >","docstring":"/**\n * Formats model summary to an array of strings.\n * Rows should form a table with a clean and readable structure.\n *\n * @param [columnSeparator] text chunk that will be used as column separator for the output table\n * @param [lineSeparatorSymbol] character that will be used to produce a string to separate rows of the output table\n * @param [thickLineSeparatorSymbol] character that will be used to produce\n * a string to separate blocks of the output table\n *\n * @return formatted model summary\n */"}
{"signature":"public inline fun EChartsLayout . legend ( crossinline block : Legend . ( ) -> Unit )","body":"{  this . legend = Legend ( ) . apply ( block )  }","docstring":"/**\n * Shows name, symbol and color of different layers.\n *\n * - [type][Legend.type] - [type][LegendType] of legend. `plain` is default.\n * - [left][Legend.left] - distance between a legend component and the left side of the container. `auto` by default.\n * - [top][Legend.top] - distance between a legend component and the top side of the container. `auto` by default.\n * - [right][Legend.right] - distance between a legend component and the right side of the container. `auto` by default.\n * - [bottom][Legend.bottom] - distance between a legend component and the bottom side of the container. `auto` by default.\n * - [width][Legend.width] - width of a legend component. `auto` by default.\n * - [height][Legend.height] - height of a legend component. `auto` by default.\n * - [orient][Legend.orient] - the layout [orientation][Orient] of legend. `horizontal` by default.\n * - [formatter][Legend.formatter] - formatter is used to format label of legend.\n *\n * ```kotlin\n * plot(mapOf()) {\n * layout {\n * legend {\n * type = LegendType.PLAIN\n * left = 10.pct\n * top = 60.px\n * right = 10.pct\n * bottom = 60.px\n * width = 300.px\n * height = 10.pct\n * orient = Orient.VERTICAL\n * formatter = \"Legend {name}\"\n * }\n * }\n * }\n * ```\n *\n * @see org.jetbrains.kotlinx.kandy.echarts.layers.layout\n * @see SizeUnit\n * @see LegendType\n * @see Orient\n */"}
{"signature":"fun ssdMobile ( )","body":"{  val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) )  val modelType = ONNXModels . ObjectDetection . SSDMobileNetV1  val model = modelHub . loadModel ( modelType )  model . printSummary ( )  model . use {  println ( it )  val fileDataLoader = pipeline < BufferedImage > ( )  . resize {  outputHeight =   outputWidth =   }  . convert { colorMode = ColorMode . BGR }  . toFloatArray { }  . call ( modelType . preprocessor )  . fileLoader ( )  for ( i in  ..  ) {  val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) )  val yhat = it . predictRaw ( inputData )  println ( yhat . values . toTypedArray ( ) . contentDeepToString ( ) )  }  }  }","docstring":"/**\n * This examples demonstrates the inference concept on SSD model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n * - Special preprocessing is applied to each image before prediction.\n */"}
{"signature":"fun main ( ) : Unit","body":"= ssdMobile ( )","docstring":"/** */"}
{"signature":"@ Language ( \"\" )  fun createSettingsXml ( ) : String","body":"{  val devMavenRepositories : List < Path > by systemProperty { repos ->  repos . split ( \"\" ) . map { Paths . get ( it ) }  }  val pluginRepos = devMavenRepositories  . withIndex ( )  . joinToString ( \"\" ) { ( i , repoPath ) ->  \"\"\"\"\"\" . trimMargin ( )  }  return \"\"\"\"\"\" . trimMargin ( )  }","docstring":"/** Create `settings.xml` file contents, with the custom dev Maven repos. */"}
{"signature":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  @ kotlin . internal . InlineOnly  public inline fun Char ( code : Int ) : Char","body":"{  if ( code < Char . MIN_VALUE . code || code > Char . MAX_VALUE . code ) {  throw IllegalArgumentException ( \"\" )  }  return code . toChar ( )  }","docstring":"/**\n * Creates a Char with the specified [code], or throws an exception if the [code] is out of `Char.MIN_VALUE.code..Char.MAX_VALUE.code`.\n *\n * If the program that calls this function is written in a way that only valid [code] is passed as the argument,\n * using the overload that takes a [UShort] argument is preferable (`Char(intValue.toUShort())`).\n * That overload doesn't check validity of the argument, and may improve program performance when the function is called routinely inside a loop.\n *\n * @sample samples.text.Chars.charFromCode\n */"}
{"signature":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  @ Suppress ( \"\" )  public expect fun Char ( code : UShort ) : Char","body":"@ SinceKotlin ( \"\" )  @ WasExperimental ( ExperimentalStdlibApi :: class )  @ Suppress ( \"\" )  public expect fun Char ( code : UShort ) : Char","docstring":"/**\n * Creates a Char with the specified [code].\n *\n * @sample samples.text.Chars.charFromCode\n */"}
{"signature":"internal fun < T > KotlinGradlePluginExtensionPoint ( ) : KotlinGradlePluginExtensionPoint < T >","body":"{  @ OptIn ( UnsafeApi :: class )  return KotlinGradlePluginExtensionPointInternal ( )  }","docstring":"/**\n * Creates a new [KotlinGradlePluginExtensionPoint]\n * See [KotlinGradlePluginExtensionPoint] documentation for the intended usage!\n */"}
{"signature":"public fun createExtensionCandidateChecker ( originalFile : KtFile , nameExpression : KtSimpleNameExpression , explicitReceiver : KtExpression ?  ) : KtCompletionExtensionCandidateChecker","body":"{  return analysisSession . completionCandidateChecker . createExtensionCandidateChecker ( originalFile , nameExpression , explicitReceiver )  }","docstring":"/**\n * Returns an extension applicability checker for the given context [nameExpression].\n * The function is meant to only be used for providing auto-completion for Kotlin in IntelliJ IDEA.\n *\n * The returned checker does not cache the results for individual callable candidates.\n *\n * @param originalFile The file being edited.\n * @param nameExpression The expression under the caret in an in-memory copy of [originalFile]\n * with a dummy identifier inserted. Also see `CompletionUtilCore.DUMMY_IDENTIFIER` in IntelliJ IDEA.\n * @param explicitReceiver A receiver expression, if available (also from the in-memory copy of [originalFile]).\n */"}
{"signature":"public suspend fun acquire ( )","body":"public suspend fun acquire ( )","docstring":"/**\n * Acquires a permit from this semaphore, suspending until one is available.\n * All suspending acquirers are processed in first-in-first-out (FIFO) order.\n *\n * This suspending function is cancellable: if the [Job] of the current coroutine is cancelled while this\n * suspending function is waiting, this function immediately resumes with [CancellationException].\n * There is a **prompt cancellation guarantee**: even if this function is ready to return the result, but was cancelled\n * while suspended, [CancellationException] will be thrown. See [suspendCancellableCoroutine] for low-level details.\n * This function releases the semaphore if it was already acquired by this function before the [CancellationException]\n * was thrown.\n *\n * Note that this function does not check for cancellation when it does not suspend.\n * Use [CoroutineScope.isActive] or [CoroutineScope.ensureActive] to periodically\n * check for cancellation in tight loops if needed.\n *\n * Use [tryAcquire] to try to acquire a permit of this semaphore without suspension.\n */"}
{"signature":"public fun tryAcquire ( ) : Boolean","body":"public fun tryAcquire ( ) : Boolean","docstring":"/**\n * Tries to acquire a permit from this semaphore without suspension.\n *\n * @return `true` if a permit was acquired, `false` otherwise.\n */"}
{"signature":"public fun release ( )","body":"public fun release ( )","docstring":"/**\n * Releases a permit, returning it into this semaphore. Resumes the first\n * suspending acquirer if there is one at the point of invocation.\n * Throws [IllegalStateException] if the number of [release] invocations is greater than the number of preceding [acquire].\n */"}
{"signature":"@ Suppress ( \"\" )  public fun Semaphore ( permits : Int , acquiredPermits : Int =  ) : Semaphore","body":"= SemaphoreImpl ( permits , acquiredPermits )","docstring":"/**\n * Creates new [Semaphore] instance.\n * @param permits the number of permits available in this semaphore.\n * @param acquiredPermits the number of already acquired permits,\n * should be between `0` and `permits` (inclusively).\n */"}
{"signature":"@ OptIn ( ExperimentalContracts :: class )  public suspend inline fun < T > Semaphore . withPermit ( action : ( ) -> T ) : T","body":"{  contract {  callsInPlace ( action , InvocationKind . EXACTLY_ONCE )  }  acquire ( )  return try {  action ( )  } finally {  release ( )  }  }","docstring":"/**\n * Executes the given [action], acquiring a permit from this semaphore at the beginning\n * and releasing it after the [action] is completed.\n *\n * @return the return value of the [action].\n */"}
{"signature":"private fun decPermits ( ) : Int","body":"{  while ( true ) {  val p = _availablePermits . getAndDecrement ( )  if ( p > permits ) continue  return p  }  }","docstring":"/**\n * Decrements the number of available permits\n * and ensures that it is not greater than [permits]\n * at the point of decrement. The last may happen\n * due to an incorrect `release()` call without\n * a preceding `acquire()`.\n */"}
{"signature":"private fun coerceAvailablePermitsAtMaximum ( )","body":"{  while ( true ) {  val cur = _availablePermits . value  if ( cur <= permits ) break  if ( _availablePermits . compareAndSet ( cur , permits ) ) break  }  }","docstring":"/**\n * Changes the number of available permits to\n * [permits] if it became greater due to an\n * incorrect [release] call.\n */"}
{"signature":"private fun addAcquireToQueue ( waiter : Waiter ) : Boolean","body":"{  val curTail = this . tail . value  val enqIdx = enqIdx . getAndIncrement ( )  val createNewSegment = :: createSegment  val segment = this . tail . findSegmentAndMoveForward ( id = enqIdx / SEGMENT_SIZE , startFrom = curTail , createNewSegment = createNewSegment ) . segment  val i = ( enqIdx % SEGMENT_SIZE ) . toInt ( )  if ( segment . cas ( i , null , waiter ) ) {  waiter . invokeOnCancellation ( segment , i )  return true  }  if ( segment . cas ( i , PERMIT , TAKEN ) ) {  when ( waiter ) {  is CancellableContinuation < * > -> {  waiter as CancellableContinuation < Unit >  waiter . resume ( Unit , onCancellationRelease )  }  is SelectInstance < * > -> {  waiter . selectInRegistrationPhase ( Unit )  }  else -> error ( \"\" )  }  return true  }  assert { segment . get ( i ) === BROKEN }  return false  }","docstring":"/**\n * Returns `false` if the received permit cannot be used and the calling operation should restart.\n */"}
{"signature":"abstract fun asReversed ( ) : HeaderInfo ?","body":"abstract fun asReversed ( ) : HeaderInfo ?","docstring":"/**\n * Returns a copy of this [HeaderInfo] with the values reversed.\n * I.e., first and last are swapped, step is negated.\n * Returns null if the iterable cannot be iterated in reverse.\n */"}
{"signature":"fun matchIterable ( expression : E ) : Boolean","body":"fun matchIterable ( expression : E ) : Boolean","docstring":"/** Returns true if the handler can build a [HeaderInfo] from the iterable expression. */"}
{"signature":"fun matchIteratorCall ( call : IrCall ) : Boolean","body":"= true","docstring":"/**\n * Matches the `iterator()` call that produced the iterable; if the call matches (or the matcher is null),\n * the handler can build a [HeaderInfo] from the iterable.\n */"}
{"signature":"fun build ( expression : E , data : D , scopeOwner : IrSymbol ) : HeaderInfo ?","body":"fun build ( expression : E , data : D , scopeOwner : IrSymbol ) : HeaderInfo ?","docstring":"/** Builds a [HeaderInfo] from the expression. */"}
{"signature":"override fun visitCall ( expression : IrCall , data : IrCall ? ) : HeaderInfo ?","body":"{  val callHeaderInfo = callHandlers . firstNotNullOfOrNull { it . handle ( expression , data , null , scopeOwnerSymbol ( ) ) }  if ( callHeaderInfo != null )  return callHeaderInfo  val progressionType = ProgressionType . fromIrType ( expression . type , symbols , allowUnsignedBounds )  val progressionHeaderInfo =  progressionType ? . run { progressionHandlers . firstNotNullOfOrNull { it . handle ( expression , data , this , scopeOwnerSymbol ( ) ) } }  return progressionHeaderInfo ? : super . visitCall ( expression , data )  }","docstring":"/** Builds a [HeaderInfo] for iterable expressions that are calls (e.g., `.reversed()`, `.indices`. */"}
{"signature":"override fun visitExpression ( expression : IrExpression , data : IrCall ? ) : HeaderInfo ?","body":"{  return expressionHandlers . firstNotNullOfOrNull { it . handle ( expression , data , null , scopeOwnerSymbol ( ) ) }  ? : super . visitExpression ( expression , data )  }","docstring":"/** Builds a [HeaderInfo] for iterable expressions not handled in [visitCall]. */"}
{"signature":"@ Deprecated ( \"\" )  fun GradleRunner . withEnvironment ( build : MutableMap < String , String ? > . ( ) -> Unit ) : GradleRunner","body":"{  val env = environment ? : mutableMapOf ( )  env . build ( )  return withEnvironment ( env )  }","docstring":"/** Edit environment variables in the Gradle Runner */"}
{"signature":"fun GradleRunner . addArguments ( vararg arguments : String ) : GradleRunner","body":"=  withArguments ( this @ addArguments . arguments + arguments )","docstring":"/**\n * Helper function to _append_ [arguments] to any existing\n * [GradleRunner arguments][GradleRunner.getArguments].\n */"}
{"signature":"internal fun < T : Task , R : Any > TaskCollection < T > . implementing ( kclass : KClass < R > ) : TaskCollection < T >","body":"=  @ Suppress ( \"\" )  withType ( kclass . java as Class < T > )","docstring":"/**\n * Filters a [TaskCollection] by type that is not a subtype of [Task] (for use with interfaces)\n *\n * TODO properly express within the type system? The result should be a TaskCollection\n */"}
{"signature":"@ Test  fun `test Android compilations visible in whenEvaluated` ( )","body":"{  project . applyGradleBuiltInPlugins ( )  val kotlin = project . applyMultiplatformPlugin ( )  var triggered = false  project . whenEvaluated {  val androidCompilations = kotlin . targets . getByName ( \"\" ) . compilations  assertTrue { androidCompilations . isNotEmpty ( ) }  assertFalse ( triggered , \"\" )  triggered = true  }  project . applyAndroidLibraryPlugin ( )  kotlin . androidTarget ( )  project . evaluate ( )  assertTrue { triggered }  }","docstring":"/**\n * Check that the `whenEvaluated` actions that are scheduled before the Android plugin is applied get triggered only after the actions\n * done in the Android plugin's afterEvaluate phase\n */"}
{"signature":"override fun invokeOnTimeout ( timeMillis : Long , block : Runnable , context : CoroutineContext ) : DisposableHandle","body":"=  scheduleInvokeOnTimeout ( timeMillis , block )","docstring":"/**\n * All event loops are using DefaultExecutor#invokeOnTimeout to avoid livelock on\n * ```\n * runBlocking(eventLoop) { withTimeout { while(isActive) { ... } } }\n * ```\n *\n * Livelock is possible only if `runBlocking` is called on internal default executed (which is used by default [delay]),\n * but it's not exposed as public API.\n */"}
{"signature":"public fun LayerPlotContext . facetGridX ( x : ColumnReference < * > , scalesSharing : ScalesSharing ? = null , order : OrderDirection = OrderDirection . ASCENDING , format : String ? = null )","body":"{  @ Suppress ( \"\" )  val xColName = datasetHandler . takeColumn ( x . name ( ) )  plotFeatures [ FacetGridFeature . FEATURE_NAME ] =  FacetGridFeature ( xColName , null , scalesSharing , order , OrderDirection . ASCENDING , format , null )  }","docstring":"/**\n * Splits data by a variable across X.\n * For each data subset creates a plot panel and lays out panels as grid.\n *\n * @param x Variable which defines columns of the facet grid.\n * @param scalesSharing Specifies whether scales are shared across all facets.\n * @param order Specifies the ordering direction of columns\n * @param format Specifies the format pattern for displaying faceting values in columns.\n *\n * Format pattern in the format parameters can be just a number format (like \"d\") or\n * a string template where a number format is surrounded by curly braces: \"{d} cylinders\".\n * Note: the \"$\" must be escaped as \"\\$\"\n *\n * Examples:\n * \".2f\" -> \"12.45\"\n * \"Score: {.2f}\" -> \"Score: 12.45\"\n * \"'Score: {}' \"-> \"Score: 12.454789\"\n */"}
{"signature":"public fun LayerPlotContext . facetGridY ( y : ColumnReference < * > , scalesSharing : ScalesSharing ? = null , order : OrderDirection = OrderDirection . ASCENDING , format : String ? = null )","body":"{  @ Suppress ( \"\" )  val yColName = datasetHandler . takeColumn ( y . name ( ) )  plotFeatures [ FacetGridFeature . FEATURE_NAME ] =  FacetGridFeature ( null , yColName , scalesSharing , OrderDirection . ASCENDING , order , null , format )  }","docstring":"/**\n * Splits data by a variable across Y.\n * For each data subset creates a plot panel and lays out panels as grid.\n *\n * @param y variable which defines rows of the facet grid.\n * @param scalesSharing specifies whether scales are shared across all facets.\n * @param order specifies the ordering direction of rows\n * @param format specifies the format pattern for displaying faceting values in rows.\n *\n * Format pattern in the format parameters can be just a number format (like \"d\") or\n * a string template where the number format is surrounded by curly braces: \"{d} cylinders\".\n * Note: the \"$\" must be escaped as \"\\$\"\n *\n * Examples:\n * \".2f\" -> \"12.45\"\n * \"Score: {.2f}\" -> \"Score: 12.45\"\n * \"'Score: {}' \"-> \"Score: 12.454789\"\n */"}
{"signature":"@ Suppress ( \"\" )  public fun LayerPlotContext . facetGrid ( x : ColumnReference < * > , y : ColumnReference < * > , scalesSharing : ScalesSharing ? = null , xOrder : OrderDirection = OrderDirection . ASCENDING , yOrder : OrderDirection = OrderDirection . ASCENDING , xFormat : String ? = null , yFormat : String ? = null )","body":"{  val xColName = datasetHandler . takeColumn ( x . name ( ) )  val yColName = datasetHandler . takeColumn ( y . name ( ) )  plotFeatures [ FacetGridFeature . FEATURE_NAME ] =  FacetGridFeature ( xColName , yColName , scalesSharing , xOrder , yOrder , xFormat , yFormat )  }","docstring":"/**\n * Splits data by two faceting variables across X and Y.\n * For each data subset creates a plot panel and lays out panels as grid.\n * The grid columns are defined by X faceting variable, and rows are defined by Y faceting variable.\n *\n * @param x variable which defines columns of the facet grid.\n * @param y variable which defines rows of the facet grid.\n * @param scalesSharing specifies whether scales are shared across all facets.\n * @param xOrder specifies the ordering direction of columns\n * @param yOrder specifies the ordering direction of rows\n * @param xFormat specifies the format pattern for displaying faceting values in columns.\n * @param yFormat specifies the format pattern for displaying faceting values in rows.\n *\n * Format pattern in the xFormat/yFormat parameters can be just a number format (like \"d\") or\n * a string template where the number format is surrounded by curly braces: \"{d} cylinders\".\n * Note: the \"$\" must be escaped as \"\\$\"\n *\n * Examples:\n * \".2f\" -> \"12.45\"\n * \"Score: {.2f}\" -> \"Score: 12.45\"\n * \"'Score: {}' \"-> \"Score: 12.454789\"\n */"}
{"signature":"public fun LayerPlotContext . facetWrap ( nCol : Int ? = null , nRow : Int ? = null , scalesSharing : ScalesSharing = ScalesSharing . FIXED , direction : Direction = Direction . HORIZONTAL , block : FacetWrapContext . ( ) -> Unit )","body":"{  @ Suppress ( \"\" )  plotFeatures [ FacetWrapFeature . FEATURE_NAME ] =  FacetWrapContext ( ) . apply ( block ) . toFeature ( datasetHandler , nCol , nRow , scalesSharing , direction )  }","docstring":"/**\n * Splits data by one or more faceting variables.\n * For each data subset creates a plot panel and lays out panels according to the `\n * nCol`, `nRow` and `direction` settings.\n *\n * Opens a [FacetWrapContext]. [FacetWrapContext.facets] is defined in this context. This method adds\n * a new facet to a given variable.\n *\n * ```\n * facetWrap(nRow = 3, scalesSharing = ScalesSharing.FREE_X) {\n * facet(col1)\n * facet(col2, OrderDirection.DESCENDING)\n * facet(col3, format = {.2f})\n * }\n * ```\n *\n * @param nCol number of columns.\n * @param nRow number of rows.\n * @param scalesSharing specifies whether scales are shared across all facets.\n * @param direction direction of the facet.\n */"}
{"signature":"abstract fun produceAdditionalFiles ( globalDirectives : RegisteredDirectives , module : TestModule ) : List < TestFile >","body":"abstract fun produceAdditionalFiles ( globalDirectives : RegisteredDirectives , module : TestModule ) : List < TestFile >","docstring":"/**\n * Note that you can not use [testServices.moduleStructure] here because it's not initialized yet\n */"}
{"signature":"internal fun SymbolTable . referenceUndiscoveredExpectSymbols ( files : Collection < KtFile > , bindingContext : BindingContext )","body":"{  val visitor = UndiscoveredExpectVisitor ( this , bindingContext )  files . forEach ( visitor :: visitKtFile )  }","docstring":"/**\n * [referenceUndiscoveredExpectSymbols] ensures that `actual` symbols declared in any of the given [files] have an associated `expect`\n * symbol in the symbol table. During lowering, an `expect` symbol may be referenced from an `actual` symbol via _descriptors_, so unbound\n * symbols may occur if the `expect` symbol isn't otherwise included in the symbol table and stubbed before lowering.\n *\n * Undiscovered `expect` symbols are not normally an issue when the source code containing the `expect` declarations is contained in the\n * files to compile, but in cases such as the IDE bytecode tool window, such a source file won't be included in [files].\n */"}
{"signature":"actual fun inv ( n : Int , mat : FloatArray , lda : Int ) : Int","body":"= mat . usePinned {  inverse_matrix_float ( n , it . addressOf (  ) , lda )  }","docstring":"/**\n * @param n number of rows and columns of the matrix [mat]\n * @param mat square matrix\n * @param lda first dimension of the matrix [mat]\n * @return int:\n * = 0 - successful exit\n * < 0 - if number = -i, the i-th argument had an illegal value\n * > 0 if number = i, U(i,i) is exactly zero; the matrix is singular and its inverse could not be computed.\n */"}
{"signature":"actual fun solve ( n : Int , nrhs : Int , a : FloatArray , lda : Int , b : FloatArray , ldb : Int ) : Int","body":"= b . usePinned {  solve_linear_system_float ( n , nrhs , a . toCValues ( ) , lda , it . addressOf (  ) , ldb )  }","docstring":"/**\n * @param n\n * @param nrhs\n * @param a\n * @param lda\n * @param b\n * @param ldb\n * @return\n */"}
{"signature":"actual fun dotMM ( transA : Boolean , offsetA : Int , a : FloatArray , m : Int , k : Int , lda : Int , transB : Boolean , offsetB : Int , b : FloatArray , n : Int , ldb : Int , c : FloatArray )","body":"= c . usePinned {  matrix_dot_float ( transA , offsetA , a . toCValues ( ) , lda , m , n , k , transB , offsetB , b . toCValues ( ) , ldb , it . addressOf (  ) )  }","docstring":"/**\n * @param transA transposed matrix [a]\n * @param offsetA offset of the matrix [a]\n * @param a first matrix\n * @param m number of rows of the matrix [a] and of the matrix [c]\n * @param k number of columns of the matrix [a] and number of rows of the matrix [b]\n * @param lda first dimension of the matrix [a]\n * @param transB transposed matrix [b]\n * @param offsetB offset of the matrix [b]\n * @param b second matrix\n * @param n number of columns of the matrix [b] and of the matrix [c]\n * @param ldb first dimension of the matrix [b]\n * @param c matrix of result\n */"}
{"signature":"actual fun dotMV ( transA : Boolean , offsetA : Int , a : FloatArray , m : Int , n : Int , lda : Int , offsetX : Int , x : FloatArray , incX : Int , y : FloatArray )","body":"{  val aPin = a . pin ( )  val xPin = x . pin ( )  y . usePinned {  matrix_dot_vector_float ( transA , offsetA , aPin . addressOf (  ) , lda , m , n , offsetX , xPin . addressOf (  ) , incX , it . addressOf (  ) )  }  aPin . unpin ( )  xPin . unpin ( )  }","docstring":"/**\n * @param transA transposed matrix [a]\n * @param offsetA offset of the matrix [a]\n * @param a first matrix\n * @param m number of rows of the matrix [a]\n * @param n number of columns of the matrix [a]\n * @param lda first dimension of the matrix [a]\n * @param x vector\n * @param y vector\n */"}
{"signature":"actual fun dotVV ( n : Int , offsetX : Int , x : FloatArray , incX : Int , offsetY : Int , y : FloatArray , incY : Int ) : Float","body":"=  vector_dot_float ( n , offsetX , x . toCValues ( ) , incX , offsetY , y . toCValues ( ) , incY )","docstring":"/**\n * @param n size of vectors\n * @param x first vector\n * @param incX stride of the vector [x]\n * @param y second vector\n * @param incY stride of the vector [y]\n */"}
{"signature":"inline fun collectSessionsAndPublishInvalidationEvent ( action : ( ) -> Unit )","body":"{  require ( invalidatedModules == null ) {  \"\"  }  invalidatedModules = mutableSetOf ( )  try {  action ( )  if ( invalidatedModules ? . isNotEmpty ( ) == true ) {  project . analysisMessageBus  . syncPublisher ( LLFirSessionInvalidationTopics . SESSION_INVALIDATION )  . afterInvalidation ( invalidatedModules ! ! )  }  } finally {  invalidatedModules = null  }  }","docstring":"/**\n * Invokes [action] and collects all sessions which were invalidated during its execution. At the end, publishes a session invalidation\n * event if at least one session was invalidated.\n *\n * Invalidated sessions are tracked via [collectSession].\n *\n * Must be called in a write action.\n */"}